2 writes to _dense
Microsoft.ML.FastTree (2)
FastTree.cs (2)
2381
_dense
= new List<double>();
2424
_dense
= null;
27 references to _dense
Microsoft.ML.FastTree (27)
FastTree.cs (27)
2394
while (
_dense
.Count < index)
2395
_dense
.Add(default(double));
2397
_dense
.Add(value);
2418
for (int i = 0; i <
_dense
.Count; i++)
2420
if (
_dense
[i] != 0)
2421
_sparse.Add(new KeyValuePair<int, double>(i,
_dense
[i]));
2445
Contracts.Assert(
_dense
.Count <= length);
2446
return
_dense
.Count(v => v > gtValue) + (0 > gtValue ? length -
_dense
.Count : 0);
2493
Contracts.Assert(
_dense
.Count <= lim);
2494
for (int i = 0; i <
_dense
.Count; ++i)
2496
if (
_dense
[i] > gtValue)
2503
for (int i =
_dense
.Count; i < lim; ++i)
2515
Contracts.Assert(
_dense
.Count <= length);
2521
if (
_dense
.Count < length)
2523
_dense
.CopyTo(editor.Values);
2524
editor.Values.Slice(
_dense
.Count, length -
_dense
.Count).Clear();
2527
_dense
.CopyTo(editor.Values, length);
2563
Contracts.Assert(
_dense
.Count <= length);
2601
Contracts.AssertValue(
_dense
);
2602
Contracts.Assert(
_dense
.Count <= length);
2603
for (int i = 0; i <
_dense
.Count; ++i)
2605
int binned = Algorithms.FindFirstGE(binUpperBounds,
_dense
[i]);
2611
for (int i =
_dense
.Count; i < length; ++i)
2655
return rowIndex < values.
_dense
.Count ? values.
_dense
[rowIndex] : 0;