| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
| D | decision_tree.cc | 38 case TreeNode::kLeaf: { in Traverse()
41 case TreeNode::kDenseFloatBinarySplit: { in Traverse()
49 case TreeNode::kSparseFloatBinarySplitDefaultLeft: { in Traverse()
65 case TreeNode::kSparseFloatBinarySplitDefaultRight: { in Traverse()
80 case TreeNode::kCategoricalIdBinarySplit: { in Traverse()
90 case TreeNode::kCategoricalIdSetMembershipBinarySplit: { in Traverse()
105 case TreeNode::kObliviousDenseFloatBinarySplit: { in Traverse()
115 case TreeNode::kObliviousCategoricalIdBinarySplit: { in Traverse()
128 case TreeNode::NODE_NOT_SET: { in Traverse()
139 TreeNode* parent_node) { in LinkChildren()
[all …]
|
| D | decision_tree_test.cc | 66 void TestLinkChildrenBinary(TreeNode* node, SplitType* split) { in TestLinkChildrenBinary()
81 void TestGetChildren(const TreeNode& node, in TestGetChildren()
301 TreeNode node; in TEST_F()
313 TreeNode node; in TEST_F()
321 TreeNode node; in TEST_F()
330 TreeNode node; in TEST_F()
339 TreeNode node; in TEST_F()
348 TreeNode node; in TEST_F()
356 TreeNode node; in TEST_F()
362 TreeNode node; in TEST_F()
[all …]
|
| D | decision_tree.h | 39 TreeNode* parent_node);
42 static std::vector<int32> GetChildren(const TreeNode& node);
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/ |
| D | random_tree_gen.cc | 27 using tensorflow::boosted_trees::trees::TreeNode;
41 DenseFloatBinarySplit* GetSplit(TreeNode* node) { in GetSplit()
43 case TreeNode::kSparseFloatBinarySplitDefaultLeft: in GetSplit()
46 case TreeNode::kSparseFloatBinarySplitDefaultRight: in GetSplit()
49 case TreeNode::kDenseFloatBinarySplit: in GetSplit()
92 if (node.node_case() == TreeNode::kLeaf) { in Generate()
110 TreeNode* node = ret.add_nodes(); in Generate()
114 TreeNode* left = ret.add_nodes(); in Generate()
117 TreeNode* right = ret.add_nodes(); in Generate()
152 for (TreeNode& node : *(tree->mutable_nodes())) { in ShiftNodeIndex()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Object/ |
| D | WindowsResource.cpp | 39 uint32_t WindowsResourceParser::TreeNode::StringCount = 0;
40 uint32_t WindowsResourceParser::TreeNode::DataCount = 0;
175 void WindowsResourceParser::TreeNode::addEntry(const ResourceEntryRef &Entry, in addEntry()
178 TreeNode &TypeNode = addTypeNode(Entry, IsNewTypeString); in addEntry()
179 TreeNode &NameNode = TypeNode.addNameNode(Entry, IsNewNameString); in addEntry()
183 WindowsResourceParser::TreeNode::TreeNode(bool IsStringNode) { in TreeNode() function in llvm::object::WindowsResourceParser::TreeNode
188 WindowsResourceParser::TreeNode::TreeNode(uint16_t MajorVersion, in TreeNode() function in llvm::object::WindowsResourceParser::TreeNode
196 std::unique_ptr<WindowsResourceParser::TreeNode>
197 WindowsResourceParser::TreeNode::createStringNode() { in createStringNode()
198 return std::unique_ptr<TreeNode>(new TreeNode(true)); in createStringNode()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Object/ |
| D | WindowsResource.h | 150 class TreeNode;
154 const TreeNode &getTree() const { return Root; } in getTree()
160 class TreeNode {
163 using Children = std::map<T, std::unique_ptr<TreeNode>>;
184 static std::unique_ptr<TreeNode> createStringNode();
185 static std::unique_ptr<TreeNode> createIDNode();
186 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
190 explicit TreeNode(bool IsStringNode);
191 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
196 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString);
[all …]
|
| /external/swiftshader/third_party/LLVM/test/TableGen/ |
| D | TreeNames.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| D | Tree.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/TableGen/ |
| D | TreeNames.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| D | Tree.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| /external/llvm/test/TableGen/ |
| D | TreeNames.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| D | Tree.td | 5 class TreeNode;
8 def set : TreeNode;
9 def plus : TreeNode;
10 def imm : TreeNode;
|
| /external/nanopb-c/tests/cyclic_messages/ |
| D | cyclic.proto | 7 message TreeNode message
10 optional TreeNode left = 2;
11 optional TreeNode right = 3;
25 optional TreeNode treeValue = 5;
|
| D | cyclic_callback.options | 1 TreeNode.left type:FT_CALLBACK
2 TreeNode.right type:FT_CALLBACK
|
| /external/grpc-grpc/third_party/nanopb/tests/cyclic_messages/ |
| D | cyclic.proto | 7 message TreeNode message
10 optional TreeNode left = 2;
11 optional TreeNode right = 3;
25 optional TreeNode treeValue = 5;
|
| D | cyclic_callback.options | 1 TreeNode.left type:FT_CALLBACK
2 TreeNode.right type:FT_CALLBACK
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| D | decision-tree-resource.cc | 22 using decision_trees::TreeNode;
36 const TreeNode& current = tree.nodes(current_id); in TraverseTree()
56 TreeNode* node = tree->mutable_nodes(node_id); in SplitNode()
61 TreeNode* new_left = tree->add_nodes(); in SplitNode()
68 TreeNode* new_right = tree->add_nodes(); in SplitNode()
|
| /external/opencensus-java/contrib/zpages/src/main/java/io/opencensus/contrib/zpages/ |
| D | StatszZPageHandler.java | 88 private final TreeNode root = new TreeNode();
172 TreeNode current = findNode(path); in emitHtmlBody()
186 Set<View> views, TreeNode root, Map<String, Measure> measures, Set<View> cachedViews) { in groupViewsByDirectoriesAndGetMeasures()
194 TreeNode node = root; in groupViewsByDirectoriesAndGetMeasures()
205 node.children.putIfAbsent(dir, new TreeNode()); in groupViewsByDirectoriesAndGetMeasures()
208 node.children.putIfAbsent(dir, new TreeNode(view.getName())); in groupViewsByDirectoriesAndGetMeasures()
219 /*@Nullable*/ TreeNode currentNode, in emitDirectoryTable()
234 for (Entry<String, TreeNode> entry : currentNode.children.entrySet()) { in emitDirectoryTable()
235 TreeNode child = entry.getValue(); in emitDirectoryTable()
259 private /*@Nullable*/ TreeNode findNode(/*@Nullable*/ String path) { in findNode()
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
| D | training_ops.cc | 35 using boosted_trees::trees::TreeNode;
67 TreeNode::NODE_NOT_SET)) { in UpdateBestSplit()
125 const std::vector<TreeNode>& nodes) { in IsTerminalSplitNode()
128 CHECK(child_node.node_case() != TreeNode::NODE_NOT_SET); in IsTerminalSplitNode()
129 if (child_node.node_case() != TreeNode::kLeaf) { in IsTerminalSplitNode()
137 void RecursivePruneTree(const size_t node_id, std::vector<TreeNode>* nodes) { in RecursivePruneTree()
139 TreeNode& tree_node = (*nodes)[node_id]; in RecursivePruneTree()
140 CHECK(tree_node.node_case() != TreeNode::NODE_NOT_SET); in RecursivePruneTree()
141 if (tree_node.node_case() == TreeNode::kLeaf) { in RecursivePruneTree()
277 CHECK_EQ(tree_config->nodes(0).node_case(), TreeNode::kLeaf); in RetrieveBias()
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/stats/ |
| D | feature-split-candidate.h | 36 const boosted_trees::trees::TreeNode& node, in FeatureSplitCandidate()
47 boosted_trees::trees::TreeNode tree_node;
|
| /external/python/cpython3/Lib/idlelib/idle_test/ |
| D | test_stackviewer.py | 8 from idlelib.tree import TreeNode, ScrolledCanvas
43 isi(stackviewer.node, TreeNode)
|
| D | test_pathbrowser.py | 15 from idlelib.tree import TreeNode
39 self.assertIsInstance(pb.node, TreeNode)
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/proto/ |
| D | split_info.proto | 12 tensorflow.boosted_trees.trees.TreeNode split_node = 1;
22 tensorflow.boosted_trees.trees.TreeNode split_node = 1;
|
| /external/python/cpython3/Lib/idlelib/ |
| D | browser.py | 18 from idlelib.tree import TreeNode, TreeItem, ScrolledCanvas
119 self.node = node = TreeNode(sc.canvas, None, item)
237 class Nested_in_func(TreeNode):
|
| /external/python/cpython2/Lib/idlelib/ |
| D | ObjectBrowser.py | 14 from idlelib.TreeWidget import TreeItem, TreeNode, ScrolledCanvas
150 node = TreeNode(sc.canvas, None, item)
|