/external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
decision_tree.h | 29 // Traverse given an instance, a sub-root and its set of features 32 static int Traverse(const DecisionTreeConfig& config, int32 sub_root_id,
|
decision_tree_test.cc | 97 EXPECT_EQ(-1, DecisionTree::Traverse(tree_config, 0, example)); 104 EXPECT_EQ(0, DecisionTree::Traverse(tree_config, 0, example)); 111 EXPECT_EQ(-1, DecisionTree::Traverse(tree_config, 10, example)); 128 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); 131 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); 152 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); 155 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); 173 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); 176 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); 198 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)) [all...] |
decision_tree.cc | 25 int DecisionTree::Traverse(const DecisionTreeConfig& config, 31 // Traverse tree starting at the provided sub-root.
|
/external/pdfium/xfa/fxfa/parser/ |
cxfa_traverse.cpp | 26 constexpr wchar_t kName[] = L"traverse"; 35 XFA_Element::Traverse,
|
cxfa_node_statics.cpp | 492 {0x7ffb51cc /* traverse */, XFA_Element::Traverse}, [all...] |
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/partitioners/ |
example_partitioner.cc | 41 example_partition = boosted_trees::trees::DecisionTree::Traverse( 73 uint32 partition = boosted_trees::trees::DecisionTree::Traverse(
|
/external/syzkaller/vendor/github.com/ianlancetaylor/demangle/ |
ast.go | 19 // Traverse each element of an AST. If the function returns 21 Traverse(func(AST) bool) 116 func (n *Name) Traverse(fn func(AST) bool) { 161 func (t *Typed) Traverse(fn func(AST) bool) { 163 t.Name.Traverse(fn) 164 t.Type.Traverse(fn) 219 func (q *Qualified) Traverse(fn func(AST) bool) { 221 q.Scope.Traverse(fn) 222 q.Name.Traverse(fn) 305 func (t *Template) Traverse(fn func(AST) bool) [all...] |
demangle.go | [all...] |
/external/v8/tools/clang/plugins/ |
FindBadConstructsAction.cpp | 24 visitor_.Traverse(context);
|
FindBadConstructsConsumer.h | 49 void Traverse(clang::ASTContext& context);
|
FindBadConstructsConsumer.cpp | 217 void FindBadConstructsConsumer::Traverse(ASTContext& context) { [all...] |
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/models/ |
multiple_additive_trees.cc | 54 const int leaf_idx = trees::DecisionTree::Traverse(tree, 0, example);
|
/external/clang/include/clang/AST/ |
RecursiveASTVisitor.h | 79 /// 1. traverse the AST (i.e. go to each node); 101 /// These three method groups are tiered (Traverse* > WalkUpFrom* > 102 /// Visit*). A method (e.g. Traverse*) may call methods from the same 103 /// tier (e.g. other Traverse*) or one tier lower (e.g. WalkUpFrom*). 118 /// template pattern) and override any of the Traverse*, WalkUpFrom*, 122 /// users may override Traverse* and WalkUpFrom* to implement custom 165 /// \brief Return whether this visitor should traverse post-order. 169 /// dispatching to Traverse*() based on the argument's dynamic type. 188 /// Traverse*Type() based on the argument's getTypeClass() property. 195 /// Traverse*TypeLoc() based on the argument type's getTypeClass() property [all...] |
/external/clang/include/clang/ASTMatchers/ |
ASTMatchersInternal.h | 833 /// \brief Interface that allows matchers to traverse the AST. 856 /// Will traverse any child nodes. 858 /// Will not traverse implicit casts and parentheses. [all...] |
/external/pdfium/xfa/fxfa/ |
cxfa_ffpageview.cpp | 317 pTraversal->GetChild<CXFA_Traverse>(0, XFA_Element::Traverse, false);
|
fxfa_basic.h | 791 Traverse,
|
/external/clang/lib/AST/ |
ExprConstant.cpp | [all...] |
/build/make/tools/droiddoc/templates-ndk/assets/js/ |
docs.js | 790 // Traverse up the tree and expand all parent nav-sections [all...] |
/external/doclava/res/assets/templates-sdk/assets/js/ |
docs.js | 365 // Traverse up the tree and expand all parent nav-sections [all...] |