class TTableSorter: public TNamed

 default ctor for RootCint dictionary

 TTableSorter ctor sorts the input table along its column defined with colName

    - colName    - may be followed by the square brackets with integer number inside,
                   if that columm is an array (for example "phys[3]").
                   NO expression inside of [], only a single integer number allowed !
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 TTableSorter ctor sorts the input table along its column defined with colName

    - colName    - may be followed by the square brackets with integer number inside,
                   if that columm is an array (for example "phys[3]").
                   NO expression inside of [], only a single integer number allowed !
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 TTableSorter ctor sorts the input table according the function "search"

    - search     - the function to compare the "key" and the table rows during sorting
                   typedef Int_t (*SEARCHMETHOD) (const void *, const void **);

    - compare    - the function to compare two table rows during searching
                   typedef Int_t (*COMPAREMETHOD)(const void **, const void **);

    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table
  Note:  This is a base class. If one fears it is not safe
  -----  to allow "void *" one may potect the end-user code
         providing a derived class with the appropriated type
         of the parameters.

 TTableSorter ctor sorts the input table according the function "search"

    - search     - the function to compare the "key" and the table rows during sorting
                   typedef Int_t (*SEARCHMETHOD) (const void *, const void **);

    - compare    - the function to compare two table rows during searching
                   typedef Int_t (*COMPAREMETHOD)(const void **, const void **);

    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table
  Note:  This is a base class. If one fears it is not safe
  -----  to allow "void *" one may potect the end-user code
         providing a derived class with the appropriated type
         of the parameters.

 BuildSorter backs TTableSorter ctor

    - colName    - may be followed by the square brackets with integer number inside,
                   if that columm is an array (for example "phys[3]").
                   NO expression inside of [], only a single integer number allowed !
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 TTableSorter ctor sort the input "simpleArray"

    - arraySize  - the size of the full array
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 TTableSorter ctor sort the input "simpleArray"

    - arraySize  - the size of the full array
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 TTableSorter ctor sort the input "simpleArray"

    - arraySize  - the sie of the full array
    - firstRow   - the first table row to sort from (=0 by default)
    - numberRows - the number of the table rows to sort (=0 by default)
                   = 0 means sort all rows from the "firstRow" by the end of table

 Set some common parameteres for the "simple" arrays

to be documented

to be documented

 returns the original index of the row by its sorted index

  CountKey counts the number of rows with the key value equal "key"

  key      - it is a POINTER to the key value
  fistIndx - the first index within sorted array to star search
              = 0 by default
  bSearch  = kTRUE - binary search (by default) is used otherwise linear one

 Counts the number of different key values

 File the array of the pointers and check whether
 the original table has been sorted to avoid an extra job.

 Return: kTRUE  - the table has been sorted
         kFALSE - otherwise

 Looks for the first index of the "key"
 within SORTED table AFTER sorting

 Returns: = -1 if the "key" was not found

 Note: This method has no sense for
 ====  the float and double key

       To get the index within the original
       unsorted table the GetIndex() method
       may be used like this:
       GetIndex(FindFirstKey(key))

to be documented

to be documented

to be documented

to be documented

 Select search function at once

 Call the standard C run-time library "qsort" function

  LearnTable() allows the TTableSorter to learn the structure of the
  tables used to fill the ntuple.
  table     - the name of the table
  buildTree - if kTRUE, then add TBranches to the TTree for each table
              column (default=kFALSE)