4 writes to LteChild
Microsoft.ML.FastTree (4)
TreeEnsemble\InternalRegressionTree.cs (4)
92
LteChild
= new int[maxLeaves - 1];
104
LteChild
= buffer.ToIntArray(ref position);
206
LteChild
= lteChild;
275
LteChild
= reader.ReadIntArray();
49 references to LteChild
Microsoft.ML.FastTree (49)
FastTree.cs (4)
3075
nodesTrueNodeIds.Add(tree.
LteChild
[nodeIndex] < 0 ? ~tree.
LteChild
[nodeIndex] + tree.NumNodes : tree.
LteChild
[nodeIndex]);
3288
public int[] LteChild => _regTree.
LteChild
;
RegressionTree.cs (1)
162
_lteChild = ImmutableArray.Create(_tree.
LteChild
, 0, _tree.NumNodes);
TreeEnsemble\InternalRegressionTree.cs (44)
372
writer.WriteIntArray(
LteChild
);
438
int numMaxNodes = Utils.Size(
LteChild
);
444
checker(
LteChild
!= null &&
LteChild
.Length == numMaxNodes, "bad ltechild");
511
LteChild
.SizeInBytes() +
531
LteChild
.ToByteArray(buffer, ref position);
566
(
LteChild
[node] != tree.
LteChild
[node] ||
574
LteChild
[node],
575
tree.
LteChild
[node],
618
public int MaxNumNodes =>
LteChild
.Length;
634
return
LteChild
[node];
702
if (
LteChild
[0] == 0)
715
if (
LteChild
[0] == 0)
723
if (
LteChild
[0] == 0)
751
node =
LteChild
[node];
770
node =
LteChild
[node];
857
int newNode =
LteChild
[node];
875
node =
LteChild
[node];
890
int newNode =
LteChild
[node];
907
node =
LteChild
[node];
941
int newNode =
LteChild
[node];
971
node =
LteChild
[node];
987
return GetNodesLeaves(
LteChild
[node]).Concat(GetNodesLeaves(GtChild[node]));
1026
int parent = Array.FindIndex(
LteChild
, x => x == ~leaf);
1028
LteChild
[parent] = indexOfNewNonLeaf;
1057
LteChild
[indexOfNewNonLeaf] = ~leaf;
1216
int lteChildCorrected =
LteChild
[n];
1319
int lteChildCorrected =
LteChild
[n];
1470
int parentOfLteChild1 = Array.IndexOf(
LteChild
, pos1);
1472
int parentOfLteChild2 = Array.IndexOf(
LteChild
, pos2);
1476
LteChild
[parentOfLteChild1] = pos2;
1480
LteChild
[parentOfLteChild2] = pos1;
1484
int lteChild1 =
LteChild
[pos1];
1489
LteChild
[pos1] =
LteChild
[pos2];
1494
LteChild
[pos2] = lteChild1;
1503
if (!PathToLeaf(
LteChild
[0], leafIndex, path))
1519
if (PathToLeaf(
LteChild
[currentNodeIndex], leafIndex, path))
1530
if (
LteChild
[0] == 0)
1568
otherWay =
LteChild
[node];
1583
newNode =
LteChild
[node];
1606
node =
LteChild
[node];
1610
otherWay =
LteChild
[node];