Searched refs:hash_entry (Results 1 – 7 of 7) sorted by relevance
86 struct hash_entry struct in INetURLHistory_Impl105 sal_Bool operator== (const hash_entry &rOther) const in operator ==() argument109 sal_Bool operator< (const hash_entry &rOther) const in operator <() argument147 hash_entry m_pHash[INETHIST_SIZE_LIMIT];154 void downheap (hash_entry a[], sal_uInt16 n, sal_uInt16 k);155 void heapsort (hash_entry a[], sal_uInt16 n);260 hash_entry h = a[k]; in downheap()277 hash_entry h; in heapsort()319 hash_entry e = m_pHash[nSI]; in move()326 (nDI - nSI) * sizeof(hash_entry)); in move()[all …]
54 struct hash_entry { const char* name; enum parseKey eKey; }; argument72 static const struct hash_entry *in_word_set (const char *str, unsigned int len);110 const struct hash_entry *121 static const struct hash_entry wordlist[] = in in_word_set()
1 struct hash_entry { const char* name; enum parseKey eKey; };
787 const hash_entry* pEntry = PdfKeywordHash::in_word_set( rCmd.getStr(), in parseLine()
54 struct hash_entry { const char* name; enum parseKey eKey; }; argument68 static const struct hash_entry *in_word_set (const char *str, unsigned int len);123 const struct hash_entry *134 static const struct hash_entry wordlist[] = in in_word_set()
1 struct hash_entry { char* name; enum parseKey eKey; };
339 const hash_entry* pEntry = AfmKeywordHash::in_word_set( ident, len ); in recognize()
Completed in 41 milliseconds