summaryrefslogtreecommitdiff
path: root/unittests/ADT
Commit message (Expand)AuthorAge
* Add an argument to APInt's magic udiv calculation to specify the number of bi...Benjamin Kramer2011-03-17
* The signed version of our "magic number" computation for the integer approxim...Cameron Zwarich2011-02-21
* Part of this test is invariant inside the inner loop - move it outsideDuncan Sands2011-02-03
* Remove NoVendor and NoOS, added in commit 123990, from Triple. While itDuncan Sands2011-02-02
* Don't infinitely recurse! Patch by Marius Wachtler!Chris Lattner2011-01-27
* Clang was not parsing target triples involving EABI and was generating wrong ...Renato Golin2011-01-21
* Add ADT/IntEqClasses.h as a light-weight implementation of EquivalenceClasses.h.Jakob Stoklund Olesen2010-12-21
* Add more checks to IntervalMapOverlaps::advance() to ensure that advanceTo seesJakob Stoklund Olesen2010-12-17
* It is allowed to call IntervalMap::const_iterator::advanceTo() with a key thatJakob Stoklund Olesen2010-12-17
* Fix crash when IntervalMapOverlaps::advanceTo moves past the last overlap.Jakob Stoklund Olesen2010-12-17
* Complete tests for IntervalMapOverlaps.Jakob Stoklund Olesen2010-12-17
* Add basic test exposing many bugs.Jakob Stoklund Olesen2010-12-16
* Add IntervalMap::iterator::set{Start,Stop,Value} methods that allow limitedJakob Stoklund Olesen2010-12-03
* Support/ADT/Twine: Add toNullTerminatedStringRef.Michael J. Spencer2010-12-01
* PR5207: Rename overloaded APInt methods set(), clear(), flip() toJay Foad2010-12-01
* Merge System into Support.Michael J. Spencer2010-11-29
* Disallow overlapping inserts, even when inserting the same value.Jakob Stoklund Olesen2010-11-28
* Add default constructors for iterators.Jakob Stoklund Olesen2010-11-28
* Implement const_iterator::advanceTo().Jakob Stoklund Olesen2010-11-28
* Add more tests for erase(). Fix a few exposed bugs.Jakob Stoklund Olesen2010-11-27
* Add test case with randomly ordered insertions, massive coalescing.Jakob Stoklund Olesen2010-11-27
* Add B+-tree test case that creates a height 3 tree with a smaller root node.Jakob Stoklund Olesen2010-11-26
* Tweak ImmutableMap/ImmutableSet/ImmutableList APIsTed Kremenek2010-11-24
* Implement IntervalMap::clear().Jakob Stoklund Olesen2010-11-19
* Support backwards iteration starting from end().Jakob Stoklund Olesen2010-11-19
* Add test for PR 8111. By Frits van Bommel.Dale Johannesen2010-11-19
* Add ADT/IntervalMap.Jakob Stoklund Olesen2010-11-19
* Revert "Add ADT/IntervalMap.", GCC doesn't like it.Jakob Stoklund Olesen2010-11-19
* Add ADT/IntervalMap.Jakob Stoklund Olesen2010-11-19
* Switch attribute macros to use 'LLVM_' as a prefix. We retain the old namesChandler Carruth2010-10-23
* Move ValueMapTest from ADT to VMCore so that ADT doesn't needDan Gohman2010-09-27
* Add an all() method to BitVector, for testing whether all bits are set.Dan Gohman2010-09-27
* Add better support for environment portion of triple. Original patch byDuncan Sands2010-09-16
* Attempt to unbreak the FreeBSD buildbot by XFAILing a unit test that seems to beJakob Stoklund Olesen2010-09-14
* StringRef::compare_numeric also differed from StringRef::compare for characte...Benjamin Kramer2010-08-26
* Do unsigned char comparisons in StringRef::compare_lower to be more consisten...Benjamin Kramer2010-08-26
* Silence 'unused' warning.Bill Wendling2010-08-19
* Add a 'normalize' method to the Triple class, which takes a mucked upDuncan Sands2010-08-12
* Remove the ValueMap copy constructor. It's not used anywhere,Duncan Sands2010-08-08
* Fix the ValueMap copy constructor. The issue is that the map keys are valueDuncan Sands2010-07-30
* Switch from EXPECT_EQ({true,false, ...) to the more canonicalChandler Carruth2010-07-13
* Use non-bool values for .count.Bill Wendling2010-07-10
* ADT: Add DAGDeltaAlgorithm, which is a DAG minimization algorithm built on to...Daniel Dunbar2010-06-08
* Add StringRef::compare_numeric and use it to sort TableGen register records.Jakob Stoklund Olesen2010-05-26
* Fix const ilist_node::get{Prev,Next}Node() to actually compile. Picky, picky.Daniel Dunbar2010-05-13
* ADT: Add ilist_node::get{Prev,Next}Node, which return the adjacent node or null.Daniel Dunbar2010-05-12
* Update BitVectorTest.cpp to stay in sync with SmallBitVectorTest.cpp,Dan Gohman2010-04-30
* SmallBitVector: Rework find_first/find_next and tweak test to test them (at l...Benjamin Kramer2010-04-30
* Implement a read/write operator[] for SmallBitVector with a proxy class.Benjamin Kramer2010-04-30
* silence some unused-value warnings.Chris Lattner2010-04-18