1 write to Count
Microsoft.ML.FastTree (1)
Dataset\FeatureFlock.cs (1)
992Count = count;
39 references to Count
Microsoft.ML.FastTree (39)
Dataset\Dataset.cs (7)
60_flockToFirstFeature[i] = _flockToFirstFeature[i - 1] + _flocks[i - 1].Count; 64int numFeatures = _flockToFirstFeature[_flockToFirstFeature.Length - 1] + lastFlock.Count; 65Contracts.Assert(numFeatures == _flocks.Sum(f => f.Count)); 70int lim = min + _flocks[flock].Count; 92Contracts.Assert(0 <= subfeature && subfeature < _flocks[flock].Count); 972for (int i = 0; i < flock.Count; ++i) 983Enumerable.Range(_dataset._flockToFirstFeature[f], _dataset._flocks[f].Count).Any(i => active[i]) ==
Dataset\FeatureFlock.cs (20)
112Contracts.Assert(active == null || (0 <= featureOffset && featureOffset <= Utils.Size(active) - Flock.Count)); 113Contracts.Assert(_active.Length == Flock.Count); 198int featureLim = featureMin + learner.TrainData.Flocks[flock].Count; 202Contracts.Assert(0 <= subfeature && subfeature < Flock.Count); 336int featureLim = featureMin + learner.TrainData.Flocks[flock].Count; 401Contracts.Assert(0 <= subfeature && subfeature < Flock.Count); 516int featureLim = featureMin + learner.TrainData.Flocks[flock].Count; 545Contracts.Assert(0 <= subfeature && subfeature < Flock.Count); 712int featureLim = featureMin + learner.TrainData.Flocks[flock].Count; 741Contracts.Assert(0 <= subfeature && subfeature < Flock.Count); 964/// flock, from 0 up to but not including <see cref="FeatureFlockBase.Count"/>. Now, 1018Contracts.Assert(0 <= featureIndex && featureIndex < Count); 1066Contracts.Assert(0 <= feature && feature < flockIndexer.Flock.Count); 1188Contracts.Assert(0 <= featureIndex && featureIndex < Count); 1194Contracts.Assert(0 <= featureIndex && featureIndex < Count); 1200Contracts.Assert(0 <= featureIndex && featureIndex < Count); 1234: base(flock.Count) 1238Hist = new FeatureHistogram(_flock.Bins, _flock.HotFeatureStarts[_flock.Count], hasWeights); 1251Contracts.Assert(active == null || (0 <= featureOffset && featureOffset <= Utils.Size(active) - Flock.Count)); 1259for (int i = 0; i < _flock.Count; ++i)
Dataset\NHotFeatureFlock.cs (1)
67Contracts.Assert(0 <= featureIndex && featureIndex < _flock.Count);
Dataset\OneHotFeatureFlock.cs (2)
31Contracts.Assert(0 <= featureIndex && featureIndex < Count); 91Contracts.Assert(0 <= featureIndex && featureIndex < _flock.Count);
Dataset\SingletonFeatureFlock.cs (2)
113: base(flock.Count) 130Contracts.Assert(active == null || (0 <= featureOffset && featureOffset <= Utils.Size(active) - Flock.Count));
FastTree.cs (5)
2044Contracts.Assert(flock.Count > 0); 2045Contracts.Assert(iFeature + flock.Count <= FeatureMap.Length); 2047int lim = iFeature + flock.Count == FeatureMap.Length 2049: FeatureMap[iFeature + flock.Count]; 2052iFeature += flock.Count;
Training\TreeLearners\LeastSquaresRegressionTreeLearner.cs (2)
508int featureLim = featureMin + TrainData.Flocks[flock].Count; 662int featureLim = featureMin + TrainData.Flocks[flock].Count;