Lines Matching refs:elem
43 int slowFindIndex(T* elem) const { return fSorted.find(elem); }
113 T* elem = fHash[hashIndex];
115 if (NULL == elem || !Key::EQ(*elem, key)) {
121 elem = fSorted[index];
123 fHash[hashIndex] = elem;
125 return elem;
129 bool GrTHashTable<T, Key, kHashBits>::insert(const Key& key, T* elem) {
137 *fSorted.insert(index) = elem;
139 fHash[hash2Index(key.getHash())] = elem;
144 void GrTHashTable<T, Key, kHashBits>::remove(const Key& key, const T* elem) {
146 if (fHash[index] == elem) {
154 // march forward until we find elem.
155 while (elem != fSorted[index]) {
159 GrAssert(elem == fSorted[index]);
170 T* elem = fSorted[elemIndex];
172 return elem;
211 bool GrTHashTable<T, Key, kHashBits>::contains(T* elem) const {
212 int index = fSorted.find(elem);
