Home
last modified time | relevance | path

Searched refs:traversed (Results 1 – 25 of 54) sorted by relevance

123

/third_party/openssl/util/
Dopenssl-update-copyright32 files or directories. (Directories are traversed recursively.)
/third_party/flutter/flutter/examples/catalog/lib/
Dcustom_a11y_traversal.dart9 /// column of rows but, in accessibility mode, are traversed in a custom order.
229 // An ordinal of "0.0" means that it will be traversed before column 1.
274 // an ordinal of "5.0" means that it will be traversed after column 4.
311 widgets are traversed in a custom order from one column to the next, starting
/third_party/grpc/examples/protos/
Droute_guide.proto44 // Accepts a stream of Points on a route being traversed, returning a
50 // Accepts a stream of RouteNotes sent while a route is being traversed,
/third_party/boost/libs/iterator/doc/
Dfilter_iterator_abstract.rst14 sequence to be traversed.
/third_party/node/deps/npm/node_modules/har-validator/node_modules/json-schema-traverse/
DREADME.md48 … traversing child elements, and `post` will be called after all child elements have been traversed.
/third_party/boost/libs/mpl/doc/src/refmanual/
DAssociativeSequence.rst13 order in which sequence elements are traversed during iteration is left
/third_party/boost/libs/graph_parallel/doc/
Dbetweenness_centrality.rst198 the ``outgoing`` map is constructed it is traversed in dependency
201 DAG is again traversed in dependency order from the source to
Dtsin_depth_first_visit.rst116 keep track of the next edge that should be traversed from each
/third_party/boost/libs/phoenix/doc/inside/
Dactions.qbk37 how the Phoenix AST will be traversed.
/third_party/boost/libs/geometry/doc/index/rtree/
Dintroduction.qbk29 …s better and produces less overlapping nodes. In the searching process less nodes must be traversed
/third_party/boost/libs/algorithm/doc/
Dis_palindrome.qbk13 …returns true if the sequence is a palindrome; i.e, it is identical when traversed either backwards…
/third_party/flutter/flutter/examples/flutter_gallery/test/
Dlive_smoketest.dart43 // There are 3 places where the Gallery demos are traversed.
Dsmoke_test.dart21 // There are 3 places where the Gallery demos are traversed.
/third_party/python/Doc/c-api/
Drefcounting.rst110 count of an object that might be traversed during garbage collection.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/TableGen/
DAutomaton.td53 // sequence of states traversed to accept that input.
/third_party/python/Doc/library/
Dxml.dom.pulldom.rst69 is implicitly traversed and the desired elements are found regardless of their
/third_party/flutter/flutter/packages/flutter/lib/src/widgets/
Dfocus_manager.dart142 /// sub-trees of nodes that can be traversed as a group. Within a scope, the
146 /// The focus node hierarchy can be traversed using the [parent], [children],
385 /// not traversed, allowing them to receive key events as part of the focus
386 /// chain, but not be traversed to via focus traversal.
408 /// allows the node to be focused, just not traversed to via the
461 /// An iterator over the children that are allowed to be traversed by the
874 /// of nodes that can be traversed as a group. Within a scope, the most recent
/third_party/boost/libs/iterator/doc/quickbook/
Dfilter_iterator.qbk12 sequence to be traversed.
/third_party/flutter/flutter/examples/flutter_gallery/test_driver/
Dtransitions_perf_test.dart38 // There are 3 places where the Gallery demos are traversed.
/third_party/flatbuffers/docs/source/
DWhitePaper.md43 traversed in-place just like any pointer-based data structure. Unlike
/third_party/boost/libs/geometry/doc/index/
Dintroduction.qbk39 …s better and produces less overlapping nodes. In the searching process less nodes must be traversed
/third_party/boost/libs/asio/doc/overview/
Dbuffers.qbk92 traversed as though they were a contiguous sequence of bytes. Helper functions
/third_party/skia/third_party/externals/swiftshader/docs/
DIndex.md56 …ttps://en.wikipedia.org/wiki/Abstract_syntax_tree) (AST), which is then traversed to output assemb…
/third_party/icu/tools/colprobe/
Dsortedlines.cpp1935 int32_t traversed = 0; in reduceDifference() local
1948 traversed++; in reduceDifference()
1950 if(removed < traversed) { in reduceDifference()
/third_party/json/.github/
DCONTRIBUTING.md61 …ot preserve insertion order of name/value pairs. (In fact, keys will be traversed in alphabetical …

123