OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Sparse
(Results
1 - 2
of
2
) sorted by null
/external/llvm/include/llvm/ADT/
SparseSet.h
1
//===--- llvm/ADT/SparseSet.h -
Sparse
set ----------------------*- C++ -*-===//
11
// Briggs, Torczon, "An efficient representation for
sparse
sets", ACM Letters
14
// A
sparse
set holds a small number of objects identified by integer keys from
15
// a moderately sized universe. The
sparse
set uses more memory than other
97
/// SparseSet contains a dense vector holding all the objects and a
sparse
99
/// the
sparse
array which is the size of the key universe. The SparseT
103
/// When SparseT is uint32_t, find() only touches 2 cache lines, but the
sparse
107
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
129
SparseT *
Sparse
;
146
SparseSet() :
Sparse
(nullptr), Universe(0) {
[
all
...]
SparseMultiSet.h
1
//===--- llvm/ADT/SparseMultiSet.h -
Sparse
multiset ------------*- C++ -*-===//
13
// A
sparse
multiset holds a small number of objects identified by integer keys
14
// from a moderately sized universe. The
sparse
multiset uses more memory than
47
/// SparseMultiSet contains a dense vector holding all the objects and a
sparse
49
/// the
sparse
array which is the size of the key universe. The SparseT template
53
///
sparse
array uses 4 x Universe bytes.
56
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
116
SparseT *
Sparse
;
191
:
Sparse
(nullptr), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) {}
193
~SparseMultiSet() { free(
Sparse
); }
[
all
...]
Completed in 350 milliseconds