Daniel Dunbar 78bb7f4dc9 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. llvm-svn: 103647		2010-05-12 21:35:19 +00:00
..
APFloatTest.cpp
APIntTest.cpp
BitVectorTest.cpp	Update BitVectorTest.cpp to stay in sync with SmallBitVectorTest.cpp,	2010-04-30 20:50:28 +00:00
DeltaAlgorithmTest.cpp
DenseMapTest.cpp
DenseSetTest.cpp
ilistTest.cpp	ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.	2010-05-12 21:35:19 +00:00
ImmutableSetTest.cpp
Makefile
SmallBitVectorTest.cpp	Update BitVectorTest.cpp to stay in sync with SmallBitVectorTest.cpp,	2010-04-30 20:50:28 +00:00
SmallStringTest.cpp
SmallVectorTest.cpp	Fix SmallVector's insert to handle non-random-access iterators.	2010-03-26 18:53:37 +00:00
SparseBitVectorTest.cpp
StringMapTest.cpp
StringRefTest.cpp
TripleTest.cpp
TwineTest.cpp
ValueMapTest.cpp	silence some unused-value warnings.	2010-04-18 03:28:20 +00:00