| Commit message (Expand) | Author | Age |
|---|
| * | Use only explicit bool conversion operators | David Blaikie | 2013-05-15 |
| * | Provide a common half-open interval map info implementation, and just | Chandler Carruth | 2012-12-27 |
| * | Sort the #include lines for the include/... tree with the script. | Chandler Carruth | 2012-12-03 |
| * | Add a few missing 'template' keywords | Douglas Gregor | 2012-03-11 |
| * | Fixed typo. | Lang Hames | 2011-12-22 |
| * | Add IntervalMap::const_iterator::atBegin(). | Jakob Stoklund Olesen | 2011-08-19 |
| * | Add an InterferenceCache class for caching per-block interference ranges. | Jakob Stoklund Olesen | 2011-04-02 |
| * | Add more checks to IntervalMapOverlaps::advance() to ensure that advanceTo sees | Jakob Stoklund Olesen | 2010-12-17 |
| * | It is allowed to call IntervalMap::const_iterator::advanceTo() with a key that | Jakob Stoklund Olesen | 2010-12-17 |
| * | Fix crash when IntervalMapOverlaps::advanceTo moves past the last overlap. | Jakob Stoklund Olesen | 2010-12-17 |
| * | Provide LiveIntervalUnion::Query::checkLoopInterference. | Jakob Stoklund Olesen | 2010-12-17 |
| * | Add basic test exposing many bugs. | Jakob Stoklund Olesen | 2010-12-16 |
| * | Add IntervalMapOverlaps - An iterator for overlapping intervals in two | Jakob Stoklund Olesen | 2010-12-16 |
| * | Remove debugging code. | Jakob Stoklund Olesen | 2010-12-14 |
| * | Fix begin() and end() on const IntervalMap. | Jakob Stoklund Olesen | 2010-12-07 |
| * | Add IntervalMap::iterator::set{Start,Stop,Value} methods that allow limited | Jakob Stoklund Olesen | 2010-12-03 |
| * | Don't use std::copy and std::copy_backward, run 10% faster. | Jakob Stoklund Olesen | 2010-11-28 |
| * | Disallow overlapping inserts, even when inserting the same value. | Jakob Stoklund Olesen | 2010-11-28 |
| * | Tweak comments to make it clear that we are working in a namespace. | Jakob Stoklund Olesen | 2010-11-28 |
| * | Add default constructors for iterators. | Jakob Stoklund Olesen | 2010-11-28 |
| * | Implement const_iterator::advanceTo(). | Jakob Stoklund Olesen | 2010-11-28 |
| * | Speed up simple insertions into an unbranched tree by not creating an iterator. | Jakob Stoklund Olesen | 2010-11-28 |
| * | Add more tests for erase(). Fix a few exposed bugs. | Jakob Stoklund Olesen | 2010-11-27 |
| * | Add test case with randomly ordered insertions, massive coalescing. | Jakob Stoklund Olesen | 2010-11-27 |
| * | Add B+-tree test case that creates a height 3 tree with a smaller root node. | Jakob Stoklund Olesen | 2010-11-26 |
| * | Extract template function adjustSiblingSizes(), allowing instances to be shared | Jakob Stoklund Olesen | 2010-11-26 |
| * | Move tree navigation to a new Path class that doesn't have to be a template. | Jakob Stoklund Olesen | 2010-11-26 |
| * | Generalize overflowLeaf to also handle overflows in branch nodes. | Jakob Stoklund Olesen | 2010-11-24 |
| * | Fix old GCC build error. | Jakob Stoklund Olesen | 2010-11-20 |
| * | Detemplatize NodeRef. | Jakob Stoklund Olesen | 2010-11-20 |
| * | Rename NodeBase::{key,val} as {first,second} and swap the BranchNode arrays such | Jakob Stoklund Olesen | 2010-11-20 |
| * | Implement IntervalMap destructor. | Jakob Stoklund Olesen | 2010-11-19 |
| * | Implement IntervalMap::clear(). | Jakob Stoklund Olesen | 2010-11-19 |
| * | Support backwards iteration starting from end(). | Jakob Stoklund Olesen | 2010-11-19 |
| * | Rename methods for clarity instead of brevity. No functional changes. | Jakob Stoklund Olesen | 2010-11-19 |
| * | Include raw_ostream.h unconditionally even if it is only used for debug code. | Jakob Stoklund Olesen | 2010-11-19 |
| * | Work around GCC 4.0 build error: | Jakob Stoklund Olesen | 2010-11-19 |
| * | Add ADT/IntervalMap. | Jakob Stoklund Olesen | 2010-11-19 |
| * | Revert "Add ADT/IntervalMap.", GCC doesn't like it. | Jakob Stoklund Olesen | 2010-11-19 |
| * | Add ADT/IntervalMap. | Jakob Stoklund Olesen | 2010-11-19 |
