Lines Matching refs:elem
127 T* elem = fHash[hashIndex];
129 if (NULL != elem && Key::Equals(*elem, key) && filter(elem)) {
130 return elem;
157 bool GrTHashTable<T, Key, kHashBits>::insert(const Key& key, T* elem) {
165 *fSorted.insert(index) = elem;
167 fHash[hash2Index(key.getHash())] = elem;
172 void GrTHashTable<T, Key, kHashBits>::remove(const Key& key, const T* elem) {
174 if (fHash[index] == elem) {
182 // march forward until we find elem.
183 while (elem != fSorted[index]) {
187 SkASSERT(elem == fSorted[index]);
208 bool GrTHashTable<T, Key, kHashBits>::contains(T* elem) const {
209 int index = fSorted.find(elem);
