| commit | ef7a0bf9698fb111b5643c41dbb82d467f3cc8dd | |
| author | Daniel Dunbar <daniel@zuster.org> | |
| Wed, 12 May 2010 21:35:19 +0000 (12 21:35 +0000) | ||
| committer | Daniel Dunbar <daniel@zuster.org> | |
| Wed, 12 May 2010 21:35:19 +0000 (12 21:35 +0000) | ||
| tree | f7ef143fdf660030e760607e80245e36d8a93c0e | treesnapshot (tar.gz zip) |
| parent | 57d4b224657e81a7a99ed1d4d89b216a533142ad | commitdiff |
ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.
- This provides a convenient alternative to using something llvm::prior or
manual iterator access, for example::
if (T *Prev = foo->getPrevNode())
...
instead of::
iterator it(foo);
if (it != begin()) {
--it;
...
}
- Chris, please review.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103647 91177308-0d34-0410-b5e6-96231b3b80d8
- This provides a convenient alternative to using something llvm::prior or
manual iterator access, for example::
if (T *Prev = foo->getPrevNode())
...
instead of::
iterator it(foo);
if (it != begin()) {
--it;
...
}
- Chris, please review.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@103647 91177308-0d34-0410-b5e6-96231b3b80d8
| include/llvm/ADT/ilist_node.h | diffblobblamehistory | |
| unittests/ADT/ilistTest.cpp | [new file with mode: 0644] | blob |