4 writes to GtChild
Microsoft.ML.FastTree (4)
TreeEnsemble\InternalRegressionTree.cs (4)
93GtChild = new int[maxLeaves - 1]; 105GtChild = buffer.ToIntArray(ref position); 207GtChild = gtChild; 276GtChild = reader.ReadIntArray();
43 references to GtChild
Microsoft.ML.FastTree (43)
FastTree.cs (4)
3076nodesFalseNodeIds.Add(tree.GtChild[nodeIndex] < 0 ? ~tree.GtChild[nodeIndex] + tree.NumNodes : tree.GtChild[nodeIndex]); 3286public int[] GtChild => _regTree.GtChild;
RegressionTree.cs (1)
163_gtChild = ImmutableArray.Create(_tree.GtChild, 0, _tree.NumNodes);
TreeEnsemble\InternalRegressionTree.cs (38)
373writer.WriteIntArray(GtChild); 443checker(GtChild != null && GtChild.Length == numMaxNodes, "bad gtchild"); 512GtChild.SizeInBytes() + 532GtChild.ToByteArray(buffer, ref position); 567GtChild[node] != tree.GtChild[node] || 576GtChild[node], 577tree.GtChild[node], 639return GtChild[node]; 753node = GtChild[node]; 772node = GtChild[node]; 863newNode = GtChild[node]; 877node = GtChild[node]; 896newNode = GtChild[node]; 909node = GtChild[node]; 953newNode = GtChild[node]; 973node = GtChild[node]; 987return GetNodesLeaves(LteChild[node]).Concat(GetNodesLeaves(GtChild[node])); 1031parent = Array.FindIndex(GtChild, x => x == ~leaf); 1033GtChild[parent] = indexOfNewNonLeaf; 1060GtChild[indexOfNewNonLeaf] = ~NumLeaves; 1221int gtChildCorrected = GtChild[n]; 1322int gtChildCorrected = GtChild[n]; 1471int parentOfGtChild1 = Array.IndexOf(GtChild, pos1); 1473int parentOfGtChild2 = Array.IndexOf(GtChild, pos2); 1478GtChild[parentOfGtChild1] = pos2; 1482GtChild[parentOfGtChild2] = pos1; 1485int gtChild1 = GtChild[pos1]; 1490GtChild[pos1] = GtChild[pos2]; 1495GtChild[pos2] = gtChild1; 1504PathToLeaf(GtChild[0], leafIndex, path); 1521if (PathToLeaf(GtChild[currentNodeIndex], leafIndex, path)) 1567newNode = GtChild[node]; 1584otherWay = GtChild[node]; 1605otherWay = GtChild[node]; 1611node = GtChild[node];