llvm/ADT/SparseMultiSet.h

92   /// circular in Prev indices, and INVALID-terminated in Next indices. This
97     static const unsigned INVALID = ~0U;
107       return Next == INVALID;
112       return Prev == INVALID;
117     bool isValid() const { return Prev != INVALID; }
131   unsigned FreelistIdx = SMSNode::INVALID;
178     Dense[Idx].Prev = SMSNode::INVALID;
233       if (Idx == SMSNode::INVALID)
236       assert(Idx < SMS->Dense.size() && "Out of range, non-INVALID Idx?");
319   iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); }
321     return const_iterator(this, SMSNode::INVALID, SMSNode::INVALID);
346     FreelistIdx = SMSNode::INVALID;
413     iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx);
423     unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
492       assert(N.Next == SMSNode::INVALID && "Singleton has next?");
493       return iterator(this, SMSNode::INVALID, ValIndexOf(N.Data));