Searched refs:traversal (Results 1 – 25 of 209) sorted by relevance
123456789
39 2. |category-to-traversal|_\ (X) is convertible to the most40 derived traversal tag type to which X is also41 convertible, and not to any more-derived traversal tag44 .. |category-to-traversal| replace:: *category-to-traversal*45 .. _`category-to-traversal`: new-iter-concepts.html#category-to-traversal49 traversal tags would add no information]
123 Now we have to determine which `iterator traversal concept`_ our126 traversal iterator`_. Our iterator should be able to make multiple129 must be a `forward traversal iterator`_. Therefore, we'll pass183 satisfy the `forward traversal iterator`_ requirements [#default]_.266 Voil�; a complete and conforming readable, forward-traversal442 traversal iterator`_, we'd have had to templatize its515 .. _`iterator traversal concept`: new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-t…520 .. _`forward traversal iterator`: new-iter-concepts.html#forward-traversal-iterators-lib-forward-tr…521 .. _`bidirectional traversal iterator`: new-iter-concepts.html#bidirectional-traversal-iterators-li…522 .. _`random access traversal iterator`: new-iter-concepts.html#random-access-traversal-iterators-li…
52 issues: *iterator traversal* and *value access*. As a result, many56 traversal, for example, may only legally have a category of "input59 geared towards iterator traversal (hence the category names), while83 Because iterator traversal and value access are mixed together in a130 traversal from the need for a true reference return type.271 The other set of concepts handles traversal:279 The refinement relationships for the traversal concepts are in the282 .. image:: traversal.png285 ``operator++``, the traversal concepts also include requirements on304 dispatching based on the traversal concepts. The tags are related via[all …]
48 minimum of the traversal categories of the iterator types in the ``IteratorTuple``81 Consider the set of standard traversal concepts obtained by taking82 the most refined standard traversal concept modeled by each individual84 models the least refined standard traversal concept in this set.
92 traversal-category(Iterator) =123 on the traversal categories is often used, we see136 bundle the traversal and access category tags143 traversal tag can be directly used for the146 that is convertible to both one of the new traversal tags
21 one of the iterator access concepts and one of the iterator traversal concepts.99 traversal tags. The ``Value`` type must satisfy the requirements of109 concepts or any more derived traversal concepts.
5 …ion of `std::advance` for the Boost iterator [link iterator.concepts.traversal traversal concepts].29 If `Iterator` does not model [link iterator.concepts.traversal.bidirectional Bidirectional Traversa…33 If `Iterator` models [link iterator.concepts.traversal.random_access Random Access Traversal Iterat…48 …on of `std::distance` for the Boost iterator [link iterator.concepts.traversal traversal concepts].66 `Iterator` should model [link iterator.concepts.traversal.single_pass Single Pass Iterator].70 If `Iterator` models [link iterator.concepts.traversal.random_access Random Access Traversal Iterat…74 If `Iterator` models [link iterator.concepts.traversal.random_access Random Access Traversal Iterat…141 …traversal traversal categories] to select the most efficient implementation. For some kinds of ite…
53 `minimum_category` takes two iterator categories or two iterator traversal tags67 [h2 Iterator category and traversal tags manipulation]70 and traversal tags:73 the corresponding traversal tag.75 …<T>::type` - the metafunction takes a tag `T` which derives from one of the iterator traversal tags76 and returns that traversal tag. `T` may also derive from other tags describing the iterator (e.g. w…148 iterator traversal tags.159 and traversal tags are convertible to the less restricting ones.]170 iterator traversal tag.172 If `C` is an iterator traversal tag or convertible to one, `type` equivalent to `C`.[all …]
115 Now we have to determine which `iterator traversal concept`_ our118 traversal iterator`_. Our iterator should be able to make multiple121 must be a `forward traversal iterator`_. Therefore, we'll pass173 satisfy the `forward traversal iterator`_ requirements [#default]_.255 Voila; a complete and conforming readable, forward-traversal426 traversal iterator`_, we'd have had to templatize its497 .. _`iterator traversal concept`: new-iter-concepts.html#iterator-traversal-concepts-lib-iterator-t…502 .. _`forward traversal iterator`: new-iter-concepts.html#forward-traversal-iterators-lib-forward-tr…503 .. _`bidirectional traversal iterator`: new-iter-concepts.html#bidirectional-traversal-iterators-li…504 .. _`random access traversal iterator`: new-iter-concepts.html#random-access-traversal-iterators-li…
4 one of the iterator access concepts and one of the iterator traversal concepts.147 traversal tags. The `Value` type must satisfy the requirements of156 concepts or any more derived traversal concepts.
25 Notice that an iterator (and therefore an range) has one [*/traversal/] property and one or more pr…30 …d always specify the [*/traversal/] property first as done above. This seems reasonable since ther…32 …Similarly, a Readable Range will be one that has the lowest possible [*/traversal/] property (Sing…34 …s are usually more cumbersome to specify the interface of since both [*/traversal/] and [*/value a…
166 …boost:/libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-…167 …bs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-travers…168 …bs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-travers…
19 …traversal-concepts-lib-iterator-traversal traversal category] of the underlying iterator type. The…225 …nerated. Checks are provided for the range concepts related to iterator traversal categories. For …
34 is provided, it's similarly applied on backward traversal to the result of the 60 | | | traversal. …62 | ``ForwardPred`` | Binary |Lambda Expression| | The forward traversal predicate. …65 | | | traversal. …67 | ``BackwardPred`` | Binary |Lambda Expression| | The backward traversal predicate. …
3 `categories`, named according to the type of traversal provided. The10 iterators escape the problems of the traversal-only categorization
31 traversal to form the result that is passed to the first ``BackwardOp`` call.58 | | | traversal. |61 | | | traversal. |
31 traversal to form the result which is passed to the first ``BackwardOp`` call.55 | | | traversal. |58 | | | traversal. |
80 base::FileEnumerator traversal( in CleanOneDir() local83 for (base::FilePath current = traversal.Next(); !current.empty(); in CleanOneDir()84 current = traversal.Next()) { in CleanOneDir()
36 // TODO(gspencer): Add diagonal traversal directions used by TV remotes and40 /// An object used to specify a focus traversal policy used for configuring a43 /// The focus traversal policy is what determines which widget is "next",52 /// * [DefaultFocusTraversal], a widget that imposes a traversal policy on the54 /// * [FocusNode], which is affected by the traversal policy.56 /// creation order to describe the order of traversal.60 /// focus traversal in a direction.184 /// * [DefaultFocusTraversal], a widget that imposes a traversal policy on the187 /// creation order to describe the order of traversal.476 /// * [DefaultFocusTraversal], a widget that imposes a traversal policy on the[all …]
12 /// traversal orders using sort keys.15 /// buttons above and below. The traversal order should allow the user to focus23 /// that wrap the given [Widget] child, providing the traversal order they24 /// should have in the "row" direction, and then the traversal order they should34 /// (including traversal order).62 /// set its traversal order.100 /// set its traversal order.306 Summary: An app that demonstrates a custom semantics traversal order.
50 // type result for a traversal level to the corresponding parser_category69 // metafunctions to get back the resulting parser type of this traversal112 // left traversal environment and resulting parser type121 // right traversal environment and resulting parser type205 // Post-order parser traversal210 // returned from a level of traversal211 // - traversing down the composite parser structure, this traversal
92 >::type traversal; typedef111 , traversal
266 public scanSync(path: string, axis: Axis, traversal: Traversal) {269 … this._scan(path, this._stat(this._walk(path)), axis, traversal, /*noFollow*/ false, results);279 public lscanSync(path: string, axis: Axis, traversal: Traversal) {282 …this._scan(path, this._stat(this._walk(path, /*noFollow*/ true)), axis, traversal, /*noFollow*/ tr…286 …private _scan(path: string, stats: Stats, axis: Axis, traversal: Traversal, noFollow: boolean, res…288 if (!traversal.accept || traversal.accept(path, stats)) {297 if (!traversal.traverse || traversal.traverse(dirname, stats)) {298 … this._scan(dirname, stats, "ancestors-or-self", traversal, noFollow, results);305 … if (stats.isDirectory() && (!traversal.traverse || traversal.traverse(path, stats))) {310 … this._scan(childpath, stats, "descendants-or-self", traversal, noFollow, results);
89 queue for both traversals with the traversal from ``s`` being denoted90 by a ``gray`` entry in the color map and the traversal from ``t``91 being denoted by a ``green`` entry. The traversal method is similar
13 …d ranges (such as null-terminated C-style strings). It allows universal traversal of both types of…17 without the penalty or the need for an extra traversal of the sentry-based ranges in order to find …