TH1K

class TH1K : public TH1, public TArrayF

    private:

      void Sort()

    public:

                       TH1K()
                       TH1K(const char* name, const char* title, Int_t nbinsx, Double_t xlow, Double_t xup, Int_t k = 0)
                       TH1K(const TH1K&)
               virtual ~TH1K()
        static TClass* Class()
         virtual Int_t Fill(Double_t x)
         virtual Int_t Fill(Double_t x, Double_t w)
         virtual Int_t Fill(const char* name, Double_t w)
      virtual Double_t GetBinContent(Int_t bin) const
      virtual Double_t GetBinContent(Int_t bin, Int_t) const
      virtual Double_t GetBinContent(Int_t bin, Int_t, Int_t) const
      virtual Double_t GetBinError(Int_t bin) const
      virtual Double_t GetBinError(Int_t bin, Int_t) const
      virtual Double_t GetBinError(Int_t bin, Int_t, Int_t) const
       virtual TClass* IsA() const
          virtual void Reset(Option_t* option = "")
          virtual void SavePrimitive(ostream& out, Option_t* option = "")
                  void SetKOrd(Int_t k)
          virtual void ShowMembers(TMemberInspector& insp, char* parent)
          virtual void Streamer(TBuffer& b)
                  void StreamerNVirtual(TBuffer& b)

Data Members

    protected:

      Int_t fReady  !
      Int_t fNIn    
      Int_t fKOrd   !
      Int_t fKCur   !

______________________________________________________________________________
 The TH1K Class

  TH1K class supports the nearest K Neighbours method,
       widely used in cluster analysis.
       This method is especially useful for small statistics.

       In this method :
         DensityOfProbability ~ 1/DistanceToNearestKthNeighbour

      Ctr TH1K::TH1K(name,title,nbins,xlow,xup,K=0)
      differs from TH1F only by "K"
      K - is the order of K Neighbours method, usually >=3
      K = 0, means default, where K is selected by TH1K in such a way
             that DistanceToNearestKthNeighbour > BinWidth and K >=3

  This class has been implemented by Victor Perevoztchikov <perev@bnl.gov>

 Constructor.

 Create a 1-Dim histogram with fix bins of type float
 (see TH1K::TH1 for explanation of parameters)

 Destructor.

 Increment bin with abscissa X by 1.

 if x is less than the low-edge of the first bin, the Underflow bin is incremented
 if x is greater than the upper edge of last bin, the Overflow bin is incremented

 If the storage of the sum of squares of weights has been triggered,
 via the function Sumw2, then the sum of the squares of weights is incremented
 by 1 in the bin corresponding to x.

 Return content of global bin number bin.

 Return content of global bin error.

 Reset.

 Save primitive as a C++ statement(s) on output stream out
 Note the following restrictions in the code generated:
  - variable bin size not implemented
  - Objects in list of functions not saved (fits)
  - Contours not saved

 Sort.