Home
last modified time | relevance | path

Searched refs:SparseIdx (Results 1 – 17 of 17) sorted by relevance

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DSparseMultiSet.h232 unsigned SparseIdx; variable
235 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
247 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h226 unsigned SparseIdx; variable
229 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
241 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
257 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
268 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
288 Idx = SMS->findIndex(SparseIdx).Prev();
413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h227 unsigned SparseIdx; variable
230 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
242 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
258 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
269 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
289 Idx = SMS->findIndex(SparseIdx).Prev();
414 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/
H A DSparseMultiSet.h227 unsigned SparseIdx; variable
230 : SMS(P), Idx(I), SparseIdx(SI) {} in iterator_base()
242 bool isKeyed() const { return SparseIdx < SMS->Universe; } in isKeyed()
258 assert(isKeyed() && SMS->sparseIndex(SMS->Dense[Idx].Data) == SparseIdx &&
269 assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
289 Idx = SMS->findIndex(SparseIdx).Prev();
414 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); in equal_range()