tmp/tmp1t2207vg/{from.md → to.md}
RENAMED
|
@@ -33,11 +33,11 @@ path lexically_relative(const path& base) const;
|
|
| 33 |
- any *filename* in `relative_path()` or `base.relative_path()` can be
|
| 34 |
interpreted as a *root-name*,
|
| 35 |
|
| 36 |
returns `path()`.
|
| 37 |
|
| 38 |
-
[*Note
|
| 39 |
*relative-path* is acceptable as a *root-name*. — *end note*]
|
| 40 |
|
| 41 |
Determines the first mismatched element of `*this` and `base` as if by:
|
| 42 |
|
| 43 |
``` cpp
|
|
@@ -76,26 +76,26 @@ The above assertions will succeed. On Windows, the returned path’s
|
|
| 76 |
*directory-separator* characters will be backslashes rather than
|
| 77 |
slashes, but that does not affect `path` equality.
|
| 78 |
|
| 79 |
— *end example*]
|
| 80 |
|
| 81 |
-
[*Note
|
| 82 |
operational function `relative()`. — *end note*]
|
| 83 |
|
| 84 |
-
[*Note
|
| 85 |
consistent matching of elements, apply `lexically_normal()` to `*this`,
|
| 86 |
`base`, or both. — *end note*]
|
| 87 |
|
| 88 |
``` cpp
|
| 89 |
path lexically_proximate(const path& base) const;
|
| 90 |
```
|
| 91 |
|
| 92 |
*Returns:* If the value of `lexically_relative(base)` is not an empty
|
| 93 |
path, return it. Otherwise return `*this`.
|
| 94 |
|
| 95 |
-
[*Note
|
| 96 |
operational function `proximate()`. — *end note*]
|
| 97 |
|
| 98 |
-
[*Note
|
| 99 |
consistent matching of elements, apply `lexically_normal()` to `*this`,
|
| 100 |
`base`, or both. — *end note*]
|
| 101 |
|
|
|
|
| 33 |
- any *filename* in `relative_path()` or `base.relative_path()` can be
|
| 34 |
interpreted as a *root-name*,
|
| 35 |
|
| 36 |
returns `path()`.
|
| 37 |
|
| 38 |
+
[*Note 7*: On a POSIX implementation, no *filename* in a
|
| 39 |
*relative-path* is acceptable as a *root-name*. — *end note*]
|
| 40 |
|
| 41 |
Determines the first mismatched element of `*this` and `base` as if by:
|
| 42 |
|
| 43 |
``` cpp
|
|
|
|
| 76 |
*directory-separator* characters will be backslashes rather than
|
| 77 |
slashes, but that does not affect `path` equality.
|
| 78 |
|
| 79 |
— *end example*]
|
| 80 |
|
| 81 |
+
[*Note 8*: If symlink following semantics are desired, use the
|
| 82 |
operational function `relative()`. — *end note*]
|
| 83 |
|
| 84 |
+
[*Note 9*: If normalization [[fs.path.generic]] is needed to ensure
|
| 85 |
consistent matching of elements, apply `lexically_normal()` to `*this`,
|
| 86 |
`base`, or both. — *end note*]
|
| 87 |
|
| 88 |
``` cpp
|
| 89 |
path lexically_proximate(const path& base) const;
|
| 90 |
```
|
| 91 |
|
| 92 |
*Returns:* If the value of `lexically_relative(base)` is not an empty
|
| 93 |
path, return it. Otherwise return `*this`.
|
| 94 |
|
| 95 |
+
[*Note 10*: If symlink following semantics are desired, use the
|
| 96 |
operational function `proximate()`. — *end note*]
|
| 97 |
|
| 98 |
+
[*Note 11*: If normalization [[fs.path.generic]] is needed to ensure
|
| 99 |
consistent matching of elements, apply `lexically_normal()` to `*this`,
|
| 100 |
`base`, or both. — *end note*]
|
| 101 |
|