| commit | e24a048486ca781c94c87a50474f6dcedbd205ab | |
| author | Shawn O. Pearce <spearce@spearce.org> | |
| Mon, 18 Aug 2008 23:53:19 +0000 (18 16:53 -0700) | ||
| committer | Robin Rosenberg <robin.rosenberg@dewire.com> | |
| Wed, 20 Aug 2008 21:08:19 +0000 (20 23:08 +0200) | ||
| tree | aa67a669868c0246ab89d4d531ed1502c05c5b2a | treesnapshot (tar.gz zip) |
| parent | 2923e1357ecb013cacdd23fda025937d7e70e14c | commitdiff |
Expose beginning of iterator indication from AbstractTreeIterator
Callers like TreeWalk need to know if back(1) is going to be a valid
operation for a given AbstractTreeIterator before they try to make a
call to move the iterator backwards. The new method first() returns
true only if the iterator is already positioned on its first entry,
in which case a call to back(n) (for any n) is invalid.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Robin Rosenberg <robin.rosenberg@dewire.com>
Callers like TreeWalk need to know if back(1) is going to be a valid
operation for a given AbstractTreeIterator before they try to make a
call to move the iterator backwards. The new method first() returns
true only if the iterator is already positioned on its first entry,
in which case a call to back(n) (for any n) is invalid.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
Signed-off-by: Robin Rosenberg <robin.rosenberg@dewire.com>