| /external/chromium_org/third_party/re2/util/ |
| sparse_set.h | 7 // SparseSet<T>(m) is a set of integers in [0, m).
26 // change after visiting. Thus SparseSet can be a convenient
29 // The SparseSet implementation is NOT thread-safe. It is up to the
34 // The SparseSet interface does not present all the usual STL bells and
54 class SparseSet {
56 SparseSet()
59 SparseSet(int max_size) {
75 ~SparseSet() {
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/regex-re2/util/ |
| sparse_set.h | 7 // SparseSet<T>(m) is a set of integers in [0, m).
26 // change after visiting. Thus SparseSet can be a convenient
29 // The SparseSet implementation is NOT thread-safe. It is up to the
34 // The SparseSet interface does not present all the usual STL bells and
54 class SparseSet {
56 SparseSet()
59 SparseSet(int max_size) {
75 ~SparseSet() {
174 DISALLOW_EVIL_CONSTRUCTORS(SparseSet);
|
| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 1 //===--- llvm/ADT/SparseSet.h - Sparse set ----------------------*- C++ -*-===//
10 // This file defines the SparseSet class derived from the version described in
30 /// SparseSetValTraits - Objects in a SparseSet are identified by keys that can
33 /// long as an index can still be derived from the value. SparseSet never
36 /// object. To compute the index from a key, SparseSet uses a separate
39 /// A simple type declaration, SparseSet<Type>, handles these cases:
43 /// The type declaration SparseSet<Type, UnaryFunction> handles:
79 /// SparseSet - Fast set implmentation for objects that can be identified by
82 /// SparseSet allocates memory proportional to the size of the key universe, so
86 /// Compared to DenseSet and DenseMap, SparseSet provides constant-time fas
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegisterPressure.h | 18 #include "llvm/ADT/SparseSet.h"
135 SparseSet<unsigned> PhysRegs;
136 SparseSet<unsigned, VirtReg2IndexFunctor> VirtRegs;
205 SparseSet<unsigned, VirtReg2IndexFunctor> UntiedDefs;
|
| ScheduleDAGInstrs.h | 18 #include "llvm/ADT/SparseSet.h"
61 /// Use SparseSet as a SparseMap by relying on the fact that it never
65 typedef SparseSet<VReg2SUnit, VirtReg2IndexFunctor> VReg2SUnitMap;
|
| /external/llvm/unittests/ADT/ |
| SparseSetTest.cpp | 1 //===------ ADT/SparseSetTest.cpp - SparseSet unit tests - -----*- C++ -*-===//
10 #include "llvm/ADT/SparseSet.h"
17 typedef SparseSet<unsigned> USet;
168 typedef SparseSet<Alt> ASet;
|
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 13 #include "llvm/ADT/SparseSet.h"
701 SparseSet<LiveRegUnit> &RegUnits,
724 SparseSet<LiveRegUnit>::iterator I = RegUnits.find(*Units);
802 SparseSet<LiveRegUnit> RegUnits;
[all...] |
| EarlyIfConversion.cpp | 24 #include "llvm/ADT/SparseSet.h"
133 SparseSet<unsigned> LiveRegUnits;
317 for (SparseSet<unsigned>::const_iterator
|
| RegAllocFast.cpp | 22 #include "llvm/ADT/SparseSet.h"
85 typedef SparseSet<LiveReg> LiveRegMap;
117 typedef SparseSet<unsigned> UsedInInstrSet;
[all...] |
| RegisterPressure.cpp | 280 for (SparseSet<unsigned>::const_iterator I =
298 for (SparseSet<unsigned>::const_iterator I =
|
| ScheduleDAGInstrs.cpp | 718 // FIXME: Allow SparseSet to reserve space for the creation of virtual
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| dfa.cc | 386 class DFA::Workq : public SparseSet {
390 SparseSet(n+maxmark),
402 SparseSet::clear();
410 SparseSet::insert_new(nextmark_++);
425 SparseSet::insert_new(id);
[all...] |
| prog.cc | 127 typedef SparseSet Workq;
|
| onepass.cc | 348 typedef SparseSet Instq;
|
| nfa.cc | 629 typedef SparseSet Workq;
|
| /external/regex-re2/re2/ |
| dfa.cc | 384 class DFA::Workq : public SparseSet {
388 SparseSet(n+maxmark),
400 SparseSet::clear();
408 SparseSet::insert_new(nextmark_++);
423 SparseSet::insert_new(id);
[all...] |
| prog.cc | 127 typedef SparseSet Workq;
|
| onepass.cc | 348 typedef SparseSet Instq;
|
| nfa.cc | 629 typedef SparseSet Workq;
|
| /external/v8/src/ |
| hydrogen.cc | [all...] |
