File: interval_set.h

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (87 lines) | stat: -rw-r--r-- 2,648 bytes parent folder | download | duplicates (8)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
//===--------- interval_set.h - A sorted interval set -----------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// Implements a coalescing interval set.
//
//===----------------------------------------------------------------------===//

#ifndef ORC_RT_INTERVAL_SET_H
#define ORC_RT_INTERVAL_SET_H

#include "interval_map.h"

namespace __orc_rt {

/// Implements a coalescing interval set.
///
/// Adjacent intervals are coalesced.
///
/// NOTE: The interface is kept mostly compatible with LLVM's IntervalMap
///       collection to make it easy to swap over in the future if we choose
///       to.
template <typename KeyT, IntervalCoalescing Coalescing>
class IntervalSet {
private:
  using ImplMap = IntervalMap<KeyT, std::monostate, Coalescing>;
public:

  using value_type = std::pair<KeyT, KeyT>;

  class const_iterator {
    friend class IntervalSet;
  public:
    using difference_type = typename ImplMap::iterator::difference_type;
    using value_type = IntervalSet::value_type;
    using pointer = const value_type *;
    using reference = const value_type &;
    using iterator_category = std::input_iterator_tag;

    const_iterator() = default;
    const value_type &operator*() const { return I->first; }
    const value_type *operator->() const { return &I->first; }
    const_iterator &operator++() { ++I; return *this; }
    const_iterator operator++(int) { auto Tmp = I; ++I; return Tmp; }
    friend bool operator==(const const_iterator &LHS,
                           const const_iterator &RHS) {
      return LHS.I == RHS.I;
    }
    friend bool operator!=(const const_iterator &LHS,
                           const const_iterator &RHS) {
      return LHS.I != RHS.I;
    }
  private:
    const_iterator(typename ImplMap::const_iterator I) : I(std::move(I)) {}
    typename ImplMap::const_iterator I;
  };

  bool empty() const { return Map.empty(); }

  void clear() { Map.clear(); }

  const_iterator begin() const { return const_iterator(Map.begin()); }
  const_iterator end() const { return const_iterator(Map.end()); }

  const_iterator find(KeyT K) const {
    return const_iterator(Map.find(K));
  }

  void insert(KeyT KS, KeyT KE) {
    Map.insert(std::move(KS), std::move(KE), std::monostate());
  }

  void erase(KeyT KS, KeyT KE) {
    Map.erase(KS, KE);
  }

private:
  ImplMap Map;
};

} // End namespace __orc_rt

#endif // ORC_RT_INTERVAL_SET_H