5 writes to CategoricalSplit
Microsoft.ML.FastTree (5)
TreeEnsemble\InternalRegressionTree.cs (5)
86CategoricalSplit = new bool[maxLeaves - 1]; 108CategoricalSplit = categoricalSplitAsBytes.Select(b => b > 0).ToArray(); 221CategoricalSplit = categoricalSplit; 282CategoricalSplit = GetCategoricalSplitFromIndices(categoricalNodeIndices); 298CategoricalSplit = new bool[NumNodes];
26 references to CategoricalSplit
Microsoft.ML.FastTree (26)
FastTree.cs (1)
3312if (_regTree.CategoricalSplit[nodeId])
RegressionTree.cs (1)
167_categoricalSplitFlags = ImmutableArray.Create(_tree.CategoricalSplit, 0, _tree.NumNodes);
TreeEnsemble\InternalRegressionTree.cs (24)
109if (CategoricalSplit.Any(b => b)) 289Contracts.Assert(CategoricalSplit[index]); 376Contracts.Assert(CategoricalSplit != null); 377Contracts.Assert(CategoricalSplit.Length >= NumNodes); 382if (CategoricalSplit[index]) 446checker(CategoricalSplit != null && 447(CategoricalSplit.Length == numMaxNodes || CategoricalSplit.Length == NumNodes), "bad categorical split length"); 449if (CategoricalSplit.Any(x => x)) 464for (int index = 0; index < CategoricalSplit.Length; index++) 466if (CategoricalSplit[index]) 517CategoricalSplit.Length * sizeof(bool) + 534CategoricalSplit.Length.ToByteArray(buffer, ref position); 535foreach (var split in CategoricalSplit) 853if (CategoricalSplit[node]) 886if (CategoricalSplit[node]) 935if (CategoricalSplit[node]) 1053CategoricalSplit[indexOfNewNonLeaf] = categoricalSplit; 1096if (CategoricalSplit[n] == false) 1113if (CategoricalSplit[n] == false) 1138if (CategoricalSplit[n]) 1197if (CategoricalSplit[n]) 1259if (!CategoricalSplit[i]) 1546if (CategoricalSplit[node])