| /external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| D | bad-output-1.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| D | bad-output-2.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| D | bad-output-3.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| D | good-output.txt | 1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
|
| D | preorder_norecurse.c.bad | 26 printf ("pre-order traversal, without recursion: \n");
|
| D | preorder_norecurse.c.good | 28 printf ("pre-order traversal, without recursion: \n");
|
| D | inorder_norecurse.c.bad | 38 printf ("in-order traversal, without recursion: \n");
|
| D | inorder_norecurse.c.good | 38 printf ("in-order traversal, without recursion: \n");
|
| /external/python/cpython2/Doc/library/ |
| D | dbhash.rst | 83 method and the :meth:`!next` method. The traversal is ordered by the databases
90 Return the last key/value pair in a database traversal. This may be used to
91 begin a reverse-order traversal; see :meth:`previous`.
96 Returns the key next key/value pair in a database traversal. The following code
107 Returns the previous key/value pair in a forward-traversal of the database. In
109 traversal.
|
| D | gdbm.rst | 87 :meth:`nextkey` method. The traversal is ordered by ``gdbm``'s internal hash
94 Returns the key that follows *key* in the traversal. The following code prints
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/ |
| D | Node.java | 697 private Iterator<Node> treeIterator(TreeTraversal traversal) { in treeIterator() argument
698 switch(traversal) { in treeIterator()
714 private Iterable<Node> treeIterable(TreeTraversal traversal) { in treeIterable() argument
715 return () -> treeIterator(traversal); in treeIterable()
721 public Stream<Node> stream(TreeTraversal traversal) { in stream() argument
722 …return StreamSupport.stream(Spliterators.spliteratorUnknownSize(treeIterator(traversal), NONNULL |… in stream()
736 public void walk(TreeTraversal traversal, Consumer<Node> consumer) { in walk() argument
738 for (Node node : treeIterable(traversal)) { in walk()
787 … public <T> Optional<T> findFirst(TreeTraversal traversal, Function<Node, Optional<T>> consumer) { in findFirst() argument
788 for (Node node : treeIterable(traversal)) { in findFirst()
|
| /external/eigen/test/ |
| D | vectorization_logic.cpp | 30 bool test_assign(const Dst&, const Src&, int traversal, int unrolling) in test_assign() argument
33 bool res = traits::Traversal==traversal; in test_assign()
45 std::cerr << " Expected Traversal == " << demangle_traversal(traversal) in test_assign()
54 bool test_assign(int traversal, int unrolling) in test_assign() argument
57 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_assign()
65 std::cerr << " Expected Traversal == " << demangle_traversal(traversal) in test_assign()
74 bool test_redux(const Xpr&, int traversal, int unrolling) in test_redux() argument
79 bool res = traits::Traversal==traversal && traits::Unrolling==unrolling; in test_redux()
86 std::cerr << " Expected Traversal == " << demangle_traversal(traversal) in test_redux()
|
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | BUILD | 104 name = "traversal",
105 srcs = ["traversal.cc"],
106 hdrs = ["traversal.h"],
121 ":traversal",
|
| /external/mdnsresponder/mDNSCore/ |
| D | uDNS.c | 554 mDNSexport mStatus mDNS_StartNATOperation_internal(mDNS *const m, NATTraversalInfo *traversal) in mDNS_StartNATOperation_internal() argument
558 …mDNS_StartNATOperation_internal %p Protocol %d IntPort %d RequestedPort %d NATLease %d", traversal, in mDNS_StartNATOperation_internal()
559 …traversal->Protocol, mDNSVal16(traversal->IntPort), mDNSVal16(traversal->RequestedPort), traversal… in mDNS_StartNATOperation_internal()
564 if (traversal == *n) in mDNS_StartNATOperation_internal()
567 traversal, traversal->Protocol, mDNSVal16(traversal->IntPort), traversal->NATLease); in mDNS_StartNATOperation_internal()
573 …if (traversal->Protocol && traversal->Protocol == (*n)->Protocol && mDNSSameIPPort(traversal->IntP… in mDNS_StartNATOperation_internal()
574 !mDNSSameIPPort(traversal->IntPort, SSHPort)) in mDNS_StartNATOperation_internal()
577 traversal, traversal->Protocol, mDNSVal16(traversal->IntPort), traversal->NATLease, in mDNS_StartNATOperation_internal()
582 traversal->next = mDNSNULL; in mDNS_StartNATOperation_internal()
583 traversal->ExpiryTime = 0; in mDNS_StartNATOperation_internal()
[all …]
|
| /external/chromium-trace/catapult/systrace/systrace/test_data/ |
| D | decompressed_atrace_data.txt | 38 <...>-18926 (-----) [004] ...1 683202.134018: tracing_mark_write: B|18926|traversal
95 <...>-18926 (-----) [004] ...1 683202.149537: tracing_mark_write: B|18926|traversal
139 <...>-18926 (-----) [004] ...1 683202.167501: tracing_mark_write: B|18926|traversal
214 <...>-18926 (-----) [005] ...1 683202.180178: tracing_mark_write: B|18926|traversal
289 <...>-18926 (-----) [004] ...1 683202.196732: tracing_mark_write: B|18926|traversal
371 <...>-18926 (-----) [004] ...1 683202.213221: tracing_mark_write: B|18926|traversal
449 <...>-18926 (-----) [004] ...1 683202.230773: tracing_mark_write: B|18926|traversal
525 <...>-18926 (-----) [005] ...1 683202.246894: tracing_mark_write: B|18926|traversal
601 <...>-18926 (-----) [005] ...1 683202.263323: tracing_mark_write: B|18926|traversal
677 <...>-18926 (-----) [005] ...1 683202.280659: tracing_mark_write: B|18926|traversal
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | BinaryTreeTraverserBenchmark.java | 166 Traversal traversal; field in BinaryTreeTraverserBenchmark
176 this.view = traversal.view( in setUp()
181 @Benchmark int traversal(int reps) { in traversal() method in BinaryTreeTraverserBenchmark
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMNodeIterator.java | 29 import org.w3c.dom.traversal.NodeFilter;
59 public class DTMNodeIterator implements org.w3c.dom.traversal.NodeIterator
|
| /external/libchrome/base/files/ |
| D | file_util_posix.cc | 234 FileEnumerator traversal(path, true, in DeleteFile() local
237 for (FilePath current = traversal.Next(); success && !current.empty(); in DeleteFile()
238 current = traversal.Next()) { in DeleteFile()
239 if (traversal.GetInfo().IsDirectory()) in DeleteFile()
298 FileEnumerator traversal(from_path, recursive, traverse_type); in CopyDirectory() local
355 current = traversal.Next(); in CopyDirectory()
357 from_stat = traversal.GetInfo().stat(); in CopyDirectory()
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| D | XObjectFactory.java | 150 else if (val instanceof org.w3c.dom.traversal.NodeIterator) in create()
152 result = new XNodeSetForDOM((org.w3c.dom.traversal.NodeIterator)val, xctxt); in create()
|
| /external/annotation-tools/annotation-file-utilities/ |
| D | design.tex | 36 \item[Inefficient traversal.] The search strategy is
37 generate-and-test: it chooses an AST node in a preorder traversal and
46 the traversal a single pass over the annotations, with limited
165 during (a single) scene traversal; let the scene traversal rather than
166 an AST traversal be the outer loop. Advantages: since insertion is
220 The main loop of the program thus will become a pre-order traversal of
222 traversal will explore corresponding parts of the AST. In other words:
308 The \texttt{AAST}'s pretty-printer will perform an in-order traversal
|
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| D | ObjectExplorer.java | 106 ObjectVisitor.Traversal traversal = visitor.visit(chain); in exploreObject() local
107 switch (traversal) { in exploreObject()
|
| /external/dtc/libfdt/ |
| D | TODO | 1 - Tree traversal functions
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| D | ContextNodeList.java | 24 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | TransformState.java | 30 import org.w3c.dom.traversal.NodeIterator;
|
| /external/apache-xml/src/main/java/org/apache/xalan/extensions/ |
| D | ExpressionContext.java | 27 import org.w3c.dom.traversal.NodeIterator;
|