236   i.Position  = 0;  in begin()
243   i.Position  = path.size();  in end()
248   assert(Position < Path.size() && "Tried to increment past end!");  in operator ++()
251   Position += Component.size();  in operator ++()
254   if (Position == Path.size()) {  in operator ++()
267   if (is_separator(Path[Position])) {  in operator ++()
275       Component = Path.substr(Position, 1);  in operator ++()
280     while (Position != Path.size() &&  in operator ++()
281            is_separator(Path[Position])) {  in operator ++()
282       ++Position;  in operator ++()
286     if (Position == Path.size()) {  in operator ++()
287       --Position;  in operator ++()
294   size_t end_pos = Path.find_first_of(separators, Position);  in operator ++()
295   Component = Path.slice(Position, end_pos);  in operator ++()
301   return Path.begin() == RHS.Path.begin() && Position == RHS.Position;  in operator ==()
305   return Position - RHS.Position;  in operator -()
311   I.Position = Path.size();  in rbegin()
319   I.Position = 0;  in rend()
327   if (Position == Path.size() &&  in operator ++()
329       is_separator(Path[Position - 1])) {  in operator ++()
330     --Position;  in operator ++()
336   size_t end_pos = Position;  in operator ++()
346   Position = start_pos;  in operator ++()
352          Position == RHS.Position;  in operator ==()