37CountBins = cbin; 115CountBins = cbin; 191CountBins = cbin;

38if (Utils.Size(_path) < CountBins + 1) 40_path = new int[CountBins + 1]; 79if (CountValues <= CountBins) 89Contracts.Assert(_path[CountBins] == CountValues); 90bounds = new Single[CountBins]; 116if (Utils.Size(_path) < CountBins + 1) 118_path = new int[CountBins + 1]; 157if (CountValues <= CountBins) 167Contracts.Assert(_path[CountBins] == CountValues); 168bounds = new Double[CountBins]; 204Contracts.Assert(path[CountBins] == CountValues); 331Contracts.Assert(CountValues > CountBins); 333Contracts.Assert(path.Length >= CountBins + 1); 341_meanBinSize = (float)_accum[CountValues] / CountBins; 360for (int i = 1; i < CountBins; i++) 370_path[CountBins] = CountValues; 372Array.Sort(_path, 0, CountBins + 1); 374Contracts.Assert(_path[CountBins] == CountValues); 466var pegs = new Peg[CountBins + 1]; 468for (int i = 1; i < CountBins; i++) 500if (peg.Index < CountBins - 1) 568Contracts.Assert(CountBins >= 2); 569Contracts.Assert(CountValues > CountBins); 571Contracts.Assert(path.Length >= CountBins + 1); 581_cskip = CountValues - CountBins; 583int height = CountBins - 1; 694_path[CountBins] = CountValues; 695Contracts.Assert(height == CountBins - 1); 730Contracts.Assert(0 <= row && row < CountBins - 1); 737int cbin = CountBins - row - 1;