From Jason Turner

[fs.path.itr]

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpqvj36ai4/{from.md → to.md} +40 -0
tmp/tmpqvj36ai4/{from.md → to.md} RENAMED
@@ -0,0 +1,40 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ #### `path` iterators <a id="fs.path.itr">[[fs.path.itr]]</a>
2
+
3
+ Path iterators iterate over the elements of the pathname in the generic
4
+ format ([[fs.path.generic]]).
5
+
6
+ A `path::iterator` is a constant iterator satisfying all the
7
+ requirements of a bidirectional iterator ([[bidirectional.iterators]])
8
+ except that, for dereferenceable iterators `a` and `b` of type
9
+ `path::iterator` with `a == b`, there is no requirement that `*a` and
10
+ `*b` are bound to the same object. Its `value_type` is `path`.
11
+
12
+ Calling any non-const member function of a `path` object invalidates all
13
+ iterators referring to elements of that object.
14
+
15
+ For the elements of the pathname in the generic format, the forward
16
+ traversal order is as follows:
17
+
18
+ - The *root-name* element, if present.
19
+ - The *root-directory* element, if present. \[*Note 1*: The generic
20
+ format is required to ensure lexicographical comparison works
21
+ correctly. — *end note*]
22
+ - Each successive *filename* element, if present.
23
+ - An empty element, if a trailing non-root *directory-separator* is
24
+ present.
25
+
26
+ The backward traversal order is the reverse of forward traversal.
27
+
28
+ ``` cpp
29
+ iterator begin() const;
30
+ ```
31
+
32
+ *Returns:* An iterator for the first present element in the traversal
33
+ list above. If no elements are present, the end iterator.
34
+
35
+ ``` cpp
36
+ iterator end() const;
37
+ ```
38
+
39
+ *Returns:* The end iterator.
40
+