| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
| decision_tree.cc | 37 case TreeNode::kLeaf: {
40 case TreeNode::kDenseFloatBinarySplit: {
48 case TreeNode::kSparseFloatBinarySplitDefaultLeft: {
64 case TreeNode::kSparseFloatBinarySplitDefaultRight: {
79 case TreeNode::kCategoricalIdBinarySplit: {
88 case TreeNode::kCategoricalIdSetMembershipBinarySplit: {
103 case TreeNode::NODE_NOT_SET: {
114 TreeNode* parent_node) {
118 case TreeNode::kLeaf: {
123 case TreeNode::kDenseFloatBinarySplit:
[all...] |
| decision_tree.h | 39 TreeNode* parent_node);
42 static std::vector<int32> GetChildren(const TreeNode& node);
|
| decision_tree_test.cc | 66 void TestLinkChildrenBinary(TreeNode* node, SplitType* split) {
81 void TestGetChildren(const TreeNode& node,
301 TreeNode node;
313 TreeNode node;
321 TreeNode node;
330 TreeNode node;
339 TreeNode node;
348 TreeNode node;
356 TreeNode node;
362 TreeNode node
[all...] |
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/stats/ |
| feature-split-candidate.h | 36 const boosted_trees::trees::TreeNode& node,
47 boosted_trees::trees::TreeNode tree_node;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Object/ |
| WindowsResource.h | 112 class TreeNode;
116 const TreeNode &getTree() const { return Root; }
122 class TreeNode {
125 using Children = std::map<T, std::unique_ptr<TreeNode>>;
146 static std::unique_ptr<TreeNode> createStringNode();
147 static std::unique_ptr<TreeNode> createIDNode();
148 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
152 explicit TreeNode(bool IsStringNode);
153 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
158 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Object/ |
| WindowsResource.h | 112 class TreeNode;
116 const TreeNode &getTree() const { return Root; }
122 class TreeNode {
125 using Children = std::map<T, std::unique_ptr<TreeNode>>;
146 static std::unique_ptr<TreeNode> createStringNode();
147 static std::unique_ptr<TreeNode> createIDNode();
148 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
152 explicit TreeNode(bool IsStringNode);
153 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
158 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Object/ |
| WindowsResource.h | 112 class TreeNode;
116 const TreeNode &getTree() const { return Root; }
122 class TreeNode {
125 using Children = std::map<T, std::unique_ptr<TreeNode>>;
146 static std::unique_ptr<TreeNode> createStringNode();
147 static std::unique_ptr<TreeNode> createIDNode();
148 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
152 explicit TreeNode(bool IsStringNode);
153 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
158 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Object/ |
| WindowsResource.h | 112 class TreeNode;
116 const TreeNode &getTree() const { return Root; }
122 class TreeNode {
125 using Children = std::map<T, std::unique_ptr<TreeNode>>;
146 static std::unique_ptr<TreeNode> createStringNode();
147 static std::unique_ptr<TreeNode> createIDNode();
148 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
152 explicit TreeNode(bool IsStringNode);
153 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
158 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| FolderSelectorAdapter.java | 155 private static class TreeNode implements Comparable<TreeNode> {
157 final public PriorityQueue<TreeNode> mChildren = new PriorityQueue<TreeNode>();
160 TreeNode(FolderRow wrappedObject) {
164 void addChild(final TreeNode child) {
168 TreeNode pollChild() {
173 public int compareTo(TreeNode o) {
185 * When the first part of this algorithm completes, we want to have a tree of TreeNode objects
188 * First we check the nodeMap to see if we've already pre-created (see below) a TreeNode fo
[all...] |
| /system/timezone/tzlookup_generator/src/main/java/com/android/libcore/timezone/tzlookup/zonetree/ |
| TreeNode.java | 25 * @param <V> the type of the TreeNode subclass
27 abstract class TreeNode<V extends TreeNode<V>> {
33 public TreeNode(String id) {
50 /** For use by {@link #addChild(TreeNode)} and {@link #removeChild(TreeNode)} only. */
111 * A visitor of {@link TreeNode}.
114 public interface Visitor<N extends TreeNode<N>> {
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/testutil/ |
| random_tree_gen.cc | 27 using tensorflow::boosted_trees::trees::TreeNode;
41 DenseFloatBinarySplit* GetSplit(TreeNode* node) {
43 case TreeNode::kSparseFloatBinarySplitDefaultLeft:
46 case TreeNode::kSparseFloatBinarySplitDefaultRight:
49 case TreeNode::kDenseFloatBinarySplit:
92 if (node.node_case() == TreeNode::kLeaf) {
110 TreeNode* node = ret.add_nodes();
114 TreeNode* left = ret.add_nodes();
117 TreeNode* right = ret.add_nodes();
152 for (TreeNode& node : *(tree->mutable_nodes()))
[all...] |
| random_tree_gen.h | 65 void GenerateSplit(boosted_trees::trees::TreeNode* node, int left_id,
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Object/ |
| WindowsResource.h | 151 class TreeNode;
155 const TreeNode &getTree() const { return Root; }
161 class TreeNode {
164 using Children = std::map<T, std::unique_ptr<TreeNode>>;
185 static std::unique_ptr<TreeNode> createStringNode();
186 static std::unique_ptr<TreeNode> createIDNode();
187 static std::unique_ptr<TreeNode> createDataNode(uint16_t MajorVersion,
191 explicit TreeNode(bool IsStringNode);
192 TreeNode(uint16_t MajorVersion, uint16_t MinorVersion,
197 TreeNode &addTypeNode(const ResourceEntryRef &Entry, bool &IsNewTypeString)
[all...] |
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| decision-tree-resource.cc | 22 using decision_trees::TreeNode;
36 const TreeNode& current = tree.nodes(current_id);
56 TreeNode* node = tree->mutable_nodes(node_id);
61 TreeNode* new_left = tree->add_nodes();
68 TreeNode* new_right = tree->add_nodes();
|
| decision-tree-resource.h | 52 decision_trees::TreeNode* get_mutable_tree_node(int32 id) {
62 // Return the TreeNode for the leaf that the example ends up at according
|
| decision_node_evaluator.h | 95 const decision_trees::TreeNode& node);
|
| /libcore/ojluni/src/main/java/java/util/ |
| HashMap.java | 149 * relay to TreeNode methods when applicable (simply by checking
202 * (method TreeNode.root()).
276 * TreeNode subclass, and in LinkedHashMap for its Entry subclass.)
574 if (first instanceof TreeNode)
575 return ((TreeNode<K,V>)first).getTreeNode(hash, key);
636 else if (p instanceof TreeNode)
637 e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
712 else if (e instanceof TreeNode)
713 ((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
759 TreeNode<K,V> hd = null, tl = null
[all...] |
| /external/python/cpython3/Lib/idlelib/idle_test/ |
| test_tree.py | 31 node = tree.TreeNode(sc.canvas, None, item)
|
