Lines Matching refs:elem
23 bool operator()(const T* elem) const { return true; }
54 int slowFindIndex(T* elem) const { return fSorted.find(elem); }
133 T* elem = fHash[hashIndex];
135 if (NULL != elem && Key::EQ(*elem, key) && findFunc(elem)) {
136 return elem;
163 bool GrTHashTable<T, Key, kHashBits>::insert(const Key& key, T* elem) {
171 *fSorted.insert(index) = elem;
173 fHash[hash2Index(key.getHash())] = elem;
178 void GrTHashTable<T, Key, kHashBits>::remove(const Key& key, const T* elem) {
180 if (fHash[index] == elem) {
188 // march forward until we find elem.
189 while (elem != fSorted[index]) {
193 GrAssert(elem == fSorted[index]);
204 T* elem = fSorted[elemIndex];
206 return elem;
238 bool GrTHashTable<T, Key, kHashBits>::contains(T* elem) const {
239 int index = fSorted.find(elem);
