Lines Matching refs:Key
77 unsigned operator()(const KeyT &Key) const {
78 return KeyFunctorT()(Key);
205 assert(Idx < Universe && "Key out of range");
221 /// @param Key A valid key to find.
224 iterator find(const KeyT &Key) {
225 return findIndex(KeyIndexOf(Key));
228 const_iterator find(const KeyT &Key) const {
229 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
232 /// count - Returns 1 if this set contains an element identified by Key,
235 size_type count(const KeyT &Key) const {
236 return find(Key) == end() ? 0 : 1;
260 /// Otherwise, automatically construct a new value from Key, insert it,
262 ValueT &operator[](const KeyT &Key) {
263 return *insert(ValueT(Key)).first;
299 /// erase - Erases an element identified by Key, if it exists.
301 /// @param Key The key identifying the element to erase.
304 bool erase(const KeyT &Key) {
305 iterator I = find(Key);