llvm-project.git/llvm/unittests/ADT/IntervalMapTest.cpp, branch users/nico/python-2

[IntervalMap] Add move and copy ctors and assignment operators

2022-10-27T08:45:24+00:00

And update the unittest.

Reviewed By: dblaikie

Differential Revision: https://reviews.llvm.org/D136242

[ADT] Explicitly delete copy/move constructors and operator= in IntervalMap

2022-05-26T14:58:18+00:00

The default implementations will perform a shallow copy instead of a deep
copy, causing some internal data structures to be shared between different
objects. Disable these operations so they don't get accidentally used.

Differential Revision: https://reviews.llvm.org/D126401

[ADT] Add CoalescingBitVector, implemented using IntervalMap [1/3]

2020-02-27T20:39:46+00:00

Add CoalescingBitVector to ADT. This is part 1 of a 3-part series to
address a compile-time explosion issue in LiveDebugValues.

---

CoalescingBitVector is a bitvector that, under the hood, relies on an
IntervalMap to coalesce elements into intervals.

CoalescingBitVector efficiently represents sets which predominantly
contain contiguous ranges (e.g.  the VarLocSets in LiveDebugValues,
which are very long sequences that look like {1, 2, 3, ...}). OTOH,
CoalescingBitVector isn't good at representing sets with lots of gaps
between elements. The first N coalesced intervals of set bits are stored
in-place (in the initial heap allocation).

Compared to SparseBitVector, CoalescingBitVector offers more predictable
performance for non-sequential find() operations. This provides a
crucial speedup in LiveDebugValues.

Differential Revision: https://reviews.llvm.org/D74984

Update the file headers across all of the LLVM projects in the monorepo

2019-01-19T08:50:56+00:00

to reflect the new license.

We understand that people may be surprised that we're moving the header
entirely to discuss the new license. We checked this carefully with the
Foundation's lawyer and we believe this is the correct approach.

Essentially, all code in the project is now made available by the LLVM
project under our new license, so you will see that the license headers
include that license only. Some of our contributors have contributed
code under our old license, and accordingly, we have retained a copy of
our old license notice in the top-level files in each project and
repository.

llvm-svn: 351636

[ADT] IntervalMap: add overlaps(a, b) method

2018-12-21T13:04:34+00:00

Summary:
This function checks whether the mappings in the interval map overlap
with the given range [a;b]. The motivation is to enable checking for
overlap before inserting a new interval into the map.

Reviewers: vsk, dblaikie

Subscribers: dexonsmith, kristina, llvm-commits

Differential Revision: https://reviews.llvm.org/D55760

llvm-svn: 349898

[ADT] IntervalMap: fix setStart and setStop

2016-11-03T19:14:46+00:00

Summary:
These functions currently require that the new closed interval has a length of
at least 2.  They also currently permit empty half-open intervals.  This patch
defines nonEmpty in each traits structure and uses it to correct the
implementations of setStart and setStop.

Reviewers: stoklund, chandlerc

Subscribers: llvm-commits

Differential Revision: https://reviews.llvm.org/D26064

llvm-svn: 285957

Add more checks to IntervalMapOverlaps::advance() to ensure that advanceTo sees

2010-12-17T22:07:54+00:00

monotonic keys.

llvm-svn: 122093

It is allowed to call IntervalMap::const_iterator::advanceTo() with a key that

2010-12-17T22:07:51+00:00

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

Fix crash when IntervalMapOverlaps::advanceTo moves past the last overlap.

2010-12-17T19:18:38+00:00

llvm-svn: 122081

Complete tests for IntervalMapOverlaps.

2010-12-17T01:31:49+00:00

llvm-svn: 122019