Package rdkit :: Package ML :: Package Data :: Module cQuantize
[hide private]
[frames] | no frames]

Module cQuantize

Functions [hide private]
 
_FindStartPoints(...)
 
_RecurseOnBounds(vals, cuts, which, starts, results, nPossibleRes, varTable=None)
Primarily intended for internal use
Variables [hide private]
  __package__ = None
hash(x)
Function Details [hide private]

_RecurseOnBounds(vals, cuts, which, starts, results, nPossibleRes, varTable=None)

 
Primarily intended for internal use

Recursively finds the best quantization boundaries

**Arguments**

  - vals: a 1D Numeric array with the values of the variables,
    this should be sorted

  - cuts: a list with the indices of the quantization bounds
    (indices are into _starts_ )

  - which: an integer indicating which bound is being adjusted here
    (and index into _cuts_ )

  - starts: a list of potential starting points for quantization bounds

  - results: a 1D Numeric array of integer result codes

  - nPossibleRes: an integer with the number of possible result codes

**Returns**

  - a 2-tuple containing:

    1) the best information gain found so far

    2) a list of the quantization bound indices ( _cuts_ for the best case)

**Notes**

 - this is not even remotely efficient, which is why a C replacement
   was written