This implementation already exists as ConnectedVNInfoEqClasses in
LiveInterval.cpp, and it seems to be generally useful to have a light-weight way
of forming equivalence classes of small integers.

IntEqClasses doesn't allow enumeration of the elements in a class.

llvm-svn: 122293

monotonic keys.

llvm-svn: 122093

moves the iterator to end(), and it is valid to call it on end().

That means it is valid to call advanceTo() with any monotonic key sequence.

llvm-svn: 122092

llvm-svn: 122081

llvm-svn: 122019

llvm-svn: 121995

via their return value instead of an out parameter.

llvm-svn: 121149

llvm-svn: 121127

zextOrTrunc(), and APSInt methods extend(), extOrTrunc() and new method
trunc(), to be const and to return a new value instead of modifying the
object in place.

llvm-svn: 121120

llvm-svn: 121117

namespace. None of them return anything except for success anyway. These will be
converted to returning their result soon.

llvm-svn: 121109

llvm-svn: 121108

llvm-svn: 120989

llvm-svn: 120888

editing of the current interval.

These methods may cause coalescing, there are corresponding set*Unchecked
methods for editing without coalescing. The non-coalescing methods are useful
for applying monotonic transforms to all keys or values in a map without
accidentally coalescing transformed and untransformed intervals.

llvm-svn: 120829

llvm-svn: 120817

llvm-svn: 120803

llvm-svn: 120785

a file exists when it shouldn't.

llvm-svn: 120784

llvm-svn: 120776

llvm-svn: 120616

llvm-svn: 120600

llvm-svn: 120590

setAllBits(), setBit(unsigned), etc.

llvm-svn: 120564

llvm-svn: 120560

Support/PathV2: Add has_{root_path,root_name,root_directory,parent_path,filename,stem,extension} implementation.

llvm-svn: 120559

I'm going to replace this all anyway with a proper table and separated tests
when done.

llvm-svn: 120558

llvm-svn: 120550

llvm-svn: 120547

llvm-svn: 120546

llvm-svn: 120539

llvm-svn: 120514

llvm-svn: 120513

llvm-svn: 120496

llvm-svn: 120349

llvm-svn: 120330

llvm-svn: 120329

llvm-svn: 120298

We always disallowed overlapping inserts with different values, and this makes
the insertion code smaller and faster.

If an overwriting insert is needed, it can be added as a separate method that
trims any existing intervals before inserting. The immediate use cases for
IntervalMap don't need this - they only use disjoint insertions.

llvm-svn: 120264

These iterators don't point anywhere, and they can't be compared to anything.
They are only good for assigning to.

llvm-svn: 120239