4 writes to LeafValues
Microsoft.ML.FastTree (4)
TreeEnsemble\InternalRegressionTree.cs (4)
94LeafValues = new double[maxLeaves]; 125LeafValues = buffer.ToDoubleArray(ref position); 208LeafValues = leafValues; 307LeafValues = reader.ReadDoubleArray();
33 references to LeafValues
Microsoft.ML.FastTree (33)
FastTree.cs (1)
3102classWeights.Add(tree.LeafValues[leafIndex]);
RegressionTree.cs (1)
168_leafValues = ImmutableArray.Create(_tree.LeafValues, 0, _tree.NumLeaves);
TreeEnsemble\InternalQuantileRegressionTree.cs (1)
127leafSamples[i][j] = LeafValues[i];
TreeEnsemble\InternalRegressionTree.cs (28)
406writer.WriteDoubleArray(LeafValues); 503checker(LeafValues != null && LeafValues.Length == numMaxLeaves, "bad leaf value length"); 523LeafValues.SizeInBytes(); 553LeafValues.ToByteArray(buffer, ref position); 558if (LeafValues.Length != tree.LeafValues.Length) 563for (int node = 0; node < LeafValues.Length; ++node) 565if (node < LeafValues.Length - 1 && 589LeafValues[node] += tree.LeafValues[node]; 613public int MaxNumLeaves => LeafValues.Length; 664return LeafValues[leaf]; 669LeafValues[leaf] = newValue; 675for (int node = 0; node < LeafValues.Length; ++node) 676LeafValues[node] += value; 684for (int i = 0; i < LeafValues.Length; ++i) 686LeafValues[i] *= scalar; 692LeafValues[leafIndex] += delta; 731return LeafValues[leaf]; 736LeafValues[leaf] = value; 1058_previousLeafValue[indexOfNewNonLeaf] = LeafValues[leaf]; 1059LeafValues[leaf] = lteValue; 1061LeafValues[NumLeaves] = gtValue; 1226sbOutput.Append(LeafValues[n].ToString() + "\t"); 1232sbOutput.Append(LeafValues[numNonLeaves].ToString()); 1331output.AppendFormat("\nNodeType:{0}=Value\nNodeValue:{0}={1}\n", numNonLeaves + n, LeafValues[n]); 1349return LeafValues[~node];
TreeEnsemble\TreeEnsembleCombiner.cs (2)
75tNew.SetOutput(i, tNew.LeafValues[i] * paramA); 97t.SetOutput(i, t.LeafValues[i] * scale);