5 instantiations of SegmentIntArray
Microsoft.ML.FastTree (5)
Dataset\IntArray.cs (2)
120return new SegmentIntArray(length, values); 182return new SegmentIntArray(buffer, ref position);
Dataset\SegmentIntArray.cs (3)
308return new SegmentIntArray(a.Length, a.Select(i => ind[i])); 321return new SegmentIntArray(itemIndices.Length, itemIndices.Select(i => indexer[i])); 419return new SegmentIntArray(st, sl, data, len);
14 references to SegmentIntArray
Microsoft.ML.FastTree (7)
Dataset\IntArray.cs (3)
331int bits = SegmentIntArray.BitsForValue((uint)maxval); 334SegmentIntArray.SegmentFindOptimalPath.Value(workarray, Length, 371bins = SegmentIntArray.FromWorkArray(workarray, Length, segBits, segTransitions);
Dataset\SegmentIntArray.cs (4)
100var b = FromWorkArray(vals, vals.Length, bits, transitions); 326private readonly SegmentIntArray _array; 334public SegmentIntArrayIndexer(SegmentIntArray array) 377public static SegmentIntArray FromWorkArray(uint[] workArray, int len, long bits, int transitions)
Microsoft.ML.Tests (7)
FastTreeSumupParityTests.cs (7)
106var arr = CreateManagedSegment(values); 254private static SegmentIntArray CreateManagedSegment(int[] values) 264int maxBits = SegmentIntArray.BitsForValue(max); 265SegmentIntArray.ManagedSegmentFindOptimalPath(work, work.Length, maxBits, out long bits, out int transitions); 266return SegmentIntArray.FromWorkArray(work, work.Length, bits, transitions); 347case SegmentIntArray a: a.SumupManaged(input, histogram); break; 358if (arr is SegmentIntArray seg)