Home
last modified time | relevance | path

Searched refs:traversal (Results 1 – 25 of 219) sorted by relevance

123456789

/external/toolchain-utils/binary_search_tool/full_bisect_test/
Dgood-output.txt1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
Dbad-output-1.txt1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
Dbad-output-3.txt1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
Dbad-output-2.txt1 pre-order traversal, with recursion:
4 pre-order traversal, without recursion:
7 in-order traversal, with recursion:
10 in-order traversal, without recursion:
Dpreorder_norecurse.c.bad26 printf ("pre-order traversal, without recursion: \n");
Dpreorder_norecurse.c.good28 printf ("pre-order traversal, without recursion: \n");
/external/autotest/client/site_tests/security_NosymfollowMountOption/
Dcontrol.baseline9 traversal should be blocked on the given filesystem. For user-supplied
11 block symlink traversal to prevent CrOS code (e.g. the Files app) from being
14 of the mount command to ensure the kernel does not allow symlink traversal on
21 Ensure the blocking of symlink traversal on a per-filesystem basis works as
25 This autotest ensures that symlink traversal is blocked on filesystems that
/external/python/cpython2/Doc/library/
Ddbhash.rst83 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.
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/
DNode.java729 private Iterator<Node> treeIterator(TreeTraversal traversal) { in treeIterator() argument
730 switch (traversal) { in treeIterator()
746 private Iterable<Node> treeIterable(TreeTraversal traversal) { in treeIterable() argument
747 return () -> treeIterator(traversal); in treeIterable()
753 public Stream<Node> stream(TreeTraversal traversal) { in stream() argument
754 …return StreamSupport.stream(Spliterators.spliteratorUnknownSize(treeIterator(traversal), NONNULL |… in stream()
768 public void walk(TreeTraversal traversal, Consumer<Node> consumer) { in walk() argument
770 for (Node node : treeIterable(traversal)) { in walk()
819 … public <T> Optional<T> findFirst(TreeTraversal traversal, Function<Node, Optional<T>> consumer) { in findFirst() argument
820 for (Node node : treeIterable(traversal)) { in findFirst()
/external/eigen/test/
Dvectorization_logic.cpp30 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/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DDTMNodeIterator.java29 import org.w3c.dom.traversal.NodeFilter;
59 public class DTMNodeIterator implements org.w3c.dom.traversal.NodeIterator
/external/mdnsresponder/mDNSCore/
DuDNS.c554 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/guava/guava-tests/benchmark/com/google/common/collect/
DBinaryTreeTraverserBenchmark.java150 @Param Traversal traversal; field in BinaryTreeTraverserBenchmark
157 this.view = traversal.view(topology.createTree(size, rng).get(), VIEWER); in setUp()
161 int traversal(int reps) { in traversal() method in BinaryTreeTraverserBenchmark
/external/guava/android/guava-tests/benchmark/com/google/common/collect/
DBinaryTreeTraverserBenchmark.java150 @Param Traversal traversal; field in BinaryTreeTraverserBenchmark
157 this.view = traversal.view(topology.createTree(size, rng).get(), VIEWER); in setUp()
161 int traversal(int reps) { in traversal() method in BinaryTreeTraverserBenchmark
/external/libchrome/base/files/
Dfile_util_posix.cc141 bool AdvanceEnumeratorWithStat(FileEnumerator* traversal, in AdvanceEnumeratorWithStat() argument
146 *out_next_path = traversal->Next(); in AdvanceEnumeratorWithStat()
150 *out_next_stat = traversal->GetInfo().stat(); in AdvanceEnumeratorWithStat()
213 FileEnumerator traversal(from_path, recursive, traverse_type); in DoCopyDirectory() local
315 } while (AdvanceEnumeratorWithStat(&traversal, &current, &from_stat)); in DoCopyDirectory()
365 FileEnumerator traversal(path, true, in DeleteFile() local
368 for (FilePath current = traversal.Next(); !current.empty(); in DeleteFile()
369 current = traversal.Next()) { in DeleteFile()
370 if (traversal.GetInfo().IsDirectory()) in DeleteFile()
/external/chromium-trace/catapult/systrace/systrace/test_data/
Ddecompressed_atrace_data.txt38 <...>-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/apache-xml/src/main/java/org/apache/xpath/objects/
DXObjectFactory.java150 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/dtc/libfdt/
DTODO1 - Tree traversal functions
/external/rust/crates/bindgen/src/ir/
Dmod.rs22 pub mod traversal; module
/external/apache-xml/src/main/java/org/apache/xpath/axes/
DContextNodeList.java24 import org.w3c.dom.traversal.NodeIterator;
/external/tensorflow/tensorflow/core/grappler/utils/
DBUILD118 name = "traversal",
119 srcs = ["traversal.cc"],
120 hdrs = ["traversal.h"],
134 ":traversal",
/external/llvm-project/llvm/test/Transforms/StructurizeCFG/workarounds/
Dneeds-unified-loop-exits.ll4 ; The structurizer uses an RPO traversal over a region, along with a
15 ; any confusion in the hacked RPO traversal.
19 ; the incorrect traversal, B1 dominates all the blocks in the
95 ; traversal, H2 dominates H3 in the structurized program, and the
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
DTransformState.java30 import org.w3c.dom.traversal.NodeIterator;
/external/apache-xml/src/main/java/org/apache/xalan/extensions/
DExpressionContext.java27 import org.w3c.dom.traversal.NodeIterator;
/external/caliper/caliper/src/main/java/com/google/caliper/memory/
DObjectExplorer.java106 ObjectVisitor.Traversal traversal = visitor.visit(chain); in exploreObject() local
107 switch (traversal) { in exploreObject()

123456789