Home
last modified time | relevance | path

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

12345

/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.
Dgdbm.rst87 :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/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.java166 Traversal traversal; field in BinaryTreeTraverserBenchmark
176 this.view = traversal.view( in setUp()
181 @Benchmark int traversal(int reps) { in traversal() method in BinaryTreeTraverserBenchmark
/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/libchrome/base/files/
Dfile_util_posix.cc221 FileEnumerator traversal(path, true, in DeleteFile() local
224 for (FilePath current = traversal.Next(); success && !current.empty(); in DeleteFile()
225 current = traversal.Next()) { in DeleteFile()
226 if (traversal.GetInfo().IsDirectory()) in DeleteFile()
288 FileEnumerator traversal(from_path, recursive, traverse_type); in CopyDirectory() local
345 current = traversal.Next(); in CopyDirectory()
347 from_stat = traversal.GetInfo().stat(); in CopyDirectory()
/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()
DXNodeSetForDOM.java29 import org.w3c.dom.traversal.NodeIterator;
/external/dtc/libfdt/
DTODO1 - Tree traversal functions
/external/apache-xml/src/main/java/org/apache/xpath/axes/
DContextNodeList.java24 import org.w3c.dom.traversal.NodeIterator;
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
DTransformState.java30 import org.w3c.dom.traversal.NodeIterator;
DXalanTransformState.java31 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()
/external/apache-xml/src/main/java/org/apache/xalan/extensions/
DExpressionContext.java27 import org.w3c.dom.traversal.NodeIterator;
/external/clang/test/Analysis/
Dretain-release-cache-out.m4 // checkers, testing that the traversal order in the CFG does not affect the
/external/llvm/test/Transforms/StructurizeCFG/
Dpost-order-traversal-bug.ll3 ; The structurize cfg pass used to do a post-order traversal to generate a list
6 ; The fix for this was to do a reverse post-order traversal which is what the
/external/llvm/test/Bitcode/
Dmdnodes-distinct-nodes-break-cycles.ll7 ; entry point is !2, a naive post-order traversal would give !3, !1, !2; but
/external/iptables/extensions/
Dlibipt_REJECT.man4 so it is a terminating TARGET, ending rule traversal.
Dlibipt_ULOG.man8 Like LOG, this is a "non-terminating target", i.e. rule traversal
Dlibip6t_REJECT.man4 so it is a terminating TARGET, ending rule traversal.
/external/swiftshader/third_party/LLVM/test/CodeGen/ARM/
D2011-04-27-IfCvtBug.ll6 ; traversal of all BBs work just fine.
/external/apache-xml/src/main/java/org/apache/xpath/
DXPathAPI.java32 import org.w3c.dom.traversal.NodeIterator;
/external/llvm/test/CodeGen/ARM/
D2011-04-27-IfCvtBug.ll6 ; traversal of all BBs work just fine.

12345