| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
| D | decision_tree_test.cc | 97 EXPECT_EQ(-1, DecisionTree::Traverse(tree_config, 0, example)); in TEST_F()
104 EXPECT_EQ(0, DecisionTree::Traverse(tree_config, 0, example)); in TEST_F()
111 EXPECT_EQ(-1, DecisionTree::Traverse(tree_config, 10, example)); in TEST_F()
128 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); in TEST_F()
131 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); in TEST_F()
152 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); in TEST_F()
155 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); in TEST_F()
173 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); in TEST_F()
176 EXPECT_EQ(1, DecisionTree::Traverse(tree_config, 0, *++example_it)); in TEST_F()
198 EXPECT_EQ(2, DecisionTree::Traverse(tree_config, 0, *example_it)); in TEST_F()
[all …]
|
| D | decision_tree.h | 32 static int Traverse(const DecisionTreeConfig& config, int32 sub_root_id,
|
| D | decision_tree.cc | 25 int DecisionTree::Traverse(const DecisionTreeConfig& config, in Traverse() function in tensorflow::boosted_trees::trees::DecisionTree
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/learner/common/partitioners/ |
| D | example_partitioner.cc | 41 example_partition = boosted_trees::trees::DecisionTree::Traverse( in UpdatePartitions()
73 uint32 partition = boosted_trees::trees::DecisionTree::Traverse( in PartitionExamples()
|
| /external/clang/include/clang/AST/ |
| D | RecursiveASTVisitor.h | 313 &RecursiveASTVisitor::Traverse##NAME), \
314 decltype(&Derived::Traverse##NAME)>::value \
317 decltype(&RecursiveASTVisitor::Traverse##NAME), \
318 decltype(&Derived::Traverse##NAME)>::value, \
320 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
321 : getDerived().Traverse##NAME(static_cast<CLASS *>(VAR)))
336 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr);
410 #define TYPE(CLASS, BASE) bool Traverse##CLASS##Type(CLASS##Type *T);
431 #define TYPELOC(CLASS, BASE) bool Traverse##CLASS##TypeLoc(CLASS##TypeLoc TL);
464 #define DECL(CLASS, BASE) bool Traverse##CLASS##Decl(CLASS##Decl *D);
[all …]
|
| /external/pdfium/xfa/fxfa/parser/ |
| D | cxfa_traverse.cpp | 35 XFA_Element::Traverse, in CXFA_Traverse()
|
| D | cxfa_node_statics.cpp | 492 {0x7ffb51cc /* traverse */, XFA_Element::Traverse},
1424 case XFA_Element::Traverse: in Create()
2673 case XFA_Element::Traverse: in ElementToName()
|
| /external/v8/tools/clang/plugins/ |
| D | FindBadConstructsAction.cpp | 24 visitor_.Traverse(context); in HandleTranslationUnit()
|
| D | FindBadConstructsConsumer.h | 49 void Traverse(clang::ASTContext& context);
|
| D | FindBadConstructsConsumer.cpp | 180 void FindBadConstructsConsumer::Traverse(ASTContext& context) { in Traverse() function in chrome_checker::FindBadConstructsConsumer
|
| /external/flatbuffers/docs/source/ |
| D | Benchmarks.md | 26 | Decode + Traverse + Dealloc (1 million times, seconds) | 0.08 | 302 …
27 | Decode / Traverse / Dealloc (breakdown) | 0 / 0.08 / 0 | 220 / 0.15 / 81 …
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/lib/models/ |
| D | multiple_additive_trees.cc | 48 const int leaf_idx = trees::DecisionTree::Traverse(tree, 0, example); in Predict()
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchersInternal.h | 892 TraversalKind Traverse, in matchesChildOf() argument
902 Matcher, Builder, Traverse, Bind); in matchesChildOf()
942 TraversalKind Traverse,
|
| /external/pdfium/xfa/fxfa/ |
| D | cxfa_ffpageview.cpp | 317 pTraversal->GetChild<CXFA_Traverse>(0, XFA_Element::Traverse, false); in GetTraverseWidget()
|
| D | fxfa_basic.h | 791 Traverse, enumerator
|
| /external/swiftshader/third_party/llvm-subzero/lib/Support/Windows/ |
| D | Path.inc | 96 // Traverse the requested path, canonicalizing . and .. as we go (because
|
| /external/llvm/lib/Support/Windows/ |
| D | Path.inc | 96 // Traverse the requested path, canonicalizing . and .. as we go (because
|
| /external/tensorflow/tensorflow/ |
| D | tensorflow.bzl | 1190 # Traverse the dependency graph along the "deps" attribute of the
|
| /external/clang/lib/AST/ |
| D | ExprConstant.cpp | 7214 bool Traverse(const BinaryOperator *E) { in Traverse() function in __anona0fd4bf91811::DataRecursiveIntBinOpEvaluator
7489 return DataRecursiveIntBinOpEvaluator(*this, Result).Traverse(E); in VisitBinaryOperator()
|
| /external/v8/ |
| D | ChangeLog | 28892 Traverse a few stack frames when recording profiler samples to
|