All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.tensorflow.framework.TreeMetadataOrBuilder Maven / Gradle / Ivy

The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: tensorflow/core/kernels/boosted_trees/boosted_trees.proto

package org.tensorflow.framework;

public interface TreeMetadataOrBuilder extends
    // @@protoc_insertion_point(interface_extends:tensorflow.boosted_trees.TreeMetadata)
    com.google.protobuf.MessageOrBuilder {

  /**
   * 
   * Number of layers grown for this tree.
   * 
* * int32 num_layers_grown = 2; */ int getNumLayersGrown(); /** *
   * Whether the tree is finalized in that no more layers can be grown.
   * 
* * bool is_finalized = 3; */ boolean getIsFinalized(); /** *
   * If tree was finalized and post pruning happened, it is possible that cache
   * still refers to some nodes that were deleted or that the node ids changed
   * (e.g. node id 5 became node id 2 due to pruning of the other branch).
   * The mapping below allows us to understand where the old ids now map to and
   * how the values should be adjusted due to post-pruning.
   * The size of the list should be equal to the number of nodes in the tree
   * before post-pruning happened.
   * If the node was pruned, it will have new_node_id equal to the id of a node
   * that this node was collapsed into. For a node that didn't get pruned, it is
   * possible that its id still changed, so new_node_id will have the
   * corresponding id in the pruned tree.
   * If post-pruning didn't happen, or it did and it had no effect (e.g. no
   * nodes got pruned), this list will be empty.
   * 
* * repeated .tensorflow.boosted_trees.TreeMetadata.PostPruneNodeUpdate post_pruned_nodes_meta = 4; */ java.util.List getPostPrunedNodesMetaList(); /** *
   * If tree was finalized and post pruning happened, it is possible that cache
   * still refers to some nodes that were deleted or that the node ids changed
   * (e.g. node id 5 became node id 2 due to pruning of the other branch).
   * The mapping below allows us to understand where the old ids now map to and
   * how the values should be adjusted due to post-pruning.
   * The size of the list should be equal to the number of nodes in the tree
   * before post-pruning happened.
   * If the node was pruned, it will have new_node_id equal to the id of a node
   * that this node was collapsed into. For a node that didn't get pruned, it is
   * possible that its id still changed, so new_node_id will have the
   * corresponding id in the pruned tree.
   * If post-pruning didn't happen, or it did and it had no effect (e.g. no
   * nodes got pruned), this list will be empty.
   * 
* * repeated .tensorflow.boosted_trees.TreeMetadata.PostPruneNodeUpdate post_pruned_nodes_meta = 4; */ org.tensorflow.framework.TreeMetadata.PostPruneNodeUpdate getPostPrunedNodesMeta(int index); /** *
   * If tree was finalized and post pruning happened, it is possible that cache
   * still refers to some nodes that were deleted or that the node ids changed
   * (e.g. node id 5 became node id 2 due to pruning of the other branch).
   * The mapping below allows us to understand where the old ids now map to and
   * how the values should be adjusted due to post-pruning.
   * The size of the list should be equal to the number of nodes in the tree
   * before post-pruning happened.
   * If the node was pruned, it will have new_node_id equal to the id of a node
   * that this node was collapsed into. For a node that didn't get pruned, it is
   * possible that its id still changed, so new_node_id will have the
   * corresponding id in the pruned tree.
   * If post-pruning didn't happen, or it did and it had no effect (e.g. no
   * nodes got pruned), this list will be empty.
   * 
* * repeated .tensorflow.boosted_trees.TreeMetadata.PostPruneNodeUpdate post_pruned_nodes_meta = 4; */ int getPostPrunedNodesMetaCount(); /** *
   * If tree was finalized and post pruning happened, it is possible that cache
   * still refers to some nodes that were deleted or that the node ids changed
   * (e.g. node id 5 became node id 2 due to pruning of the other branch).
   * The mapping below allows us to understand where the old ids now map to and
   * how the values should be adjusted due to post-pruning.
   * The size of the list should be equal to the number of nodes in the tree
   * before post-pruning happened.
   * If the node was pruned, it will have new_node_id equal to the id of a node
   * that this node was collapsed into. For a node that didn't get pruned, it is
   * possible that its id still changed, so new_node_id will have the
   * corresponding id in the pruned tree.
   * If post-pruning didn't happen, or it did and it had no effect (e.g. no
   * nodes got pruned), this list will be empty.
   * 
* * repeated .tensorflow.boosted_trees.TreeMetadata.PostPruneNodeUpdate post_pruned_nodes_meta = 4; */ java.util.List getPostPrunedNodesMetaOrBuilderList(); /** *
   * If tree was finalized and post pruning happened, it is possible that cache
   * still refers to some nodes that were deleted or that the node ids changed
   * (e.g. node id 5 became node id 2 due to pruning of the other branch).
   * The mapping below allows us to understand where the old ids now map to and
   * how the values should be adjusted due to post-pruning.
   * The size of the list should be equal to the number of nodes in the tree
   * before post-pruning happened.
   * If the node was pruned, it will have new_node_id equal to the id of a node
   * that this node was collapsed into. For a node that didn't get pruned, it is
   * possible that its id still changed, so new_node_id will have the
   * corresponding id in the pruned tree.
   * If post-pruning didn't happen, or it did and it had no effect (e.g. no
   * nodes got pruned), this list will be empty.
   * 
* * repeated .tensorflow.boosted_trees.TreeMetadata.PostPruneNodeUpdate post_pruned_nodes_meta = 4; */ org.tensorflow.framework.TreeMetadata.PostPruneNodeUpdateOrBuilder getPostPrunedNodesMetaOrBuilder( int index); }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy