File: insertion_ordered_set.h

package info (click to toggle)
chromium 138.0.7204.183-1~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 6,080,960 kB
  • sloc: cpp: 34,937,079; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,954; asm: 946,768; xml: 739,971; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,811; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (49 lines) | stat: -rw-r--r-- 1,229 bytes parent folder | download | duplicates (6) 
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
 
// Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef COMPONENTS_OPTIMIZATION_GUIDE_CORE_INSERTION_ORDERED_SET_H_
#define COMPONENTS_OPTIMIZATION_GUIDE_CORE_INSERTION_ORDERED_SET_H_

#include <vector>

#include "base/containers/flat_set.h"

namespace optimization_guide {

// Keeps a set of unique element, while preserving the insertion order. vector()
// can be accessed to get the ordered elements.
template <typename T>
class InsertionOrderedSet {
 public:
  InsertionOrderedSet() = default;

  void insert(const T& elem) {
    auto ret = set_.insert(elem);
    if (ret.second) {
      // The element wasn't already in the container.
      vector_.push_back(elem);
    }
  }

  void clear() {
    set_.clear();
    vector_.clear();
  }

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

  size_t size() const { return vector_.size(); }

  const std::vector<T>& vector() const { return vector_; }

  const base::flat_set<T>& set() const { return set_; }

 private:
  base::flat_set<T> set_;
  std::vector<T> vector_;
};

}  // namespace optimization_guide

#endif  // COMPONENTS_OPTIMIZATION_GUIDE_CORE_INSERTION_ORDERED_SET_H_