Searched refs:SvStringHashTable (Results 1 – 6 of 6) sorted by relevance
137 SvStringHashTable::SvStringHashTable( sal_uInt32 nMaxEntries ) in SvStringHashTable() function in SvStringHashTable160 SvStringHashTable::~SvStringHashTable() in ~SvStringHashTable()191 sal_uInt32 SvStringHashTable::HashFunc( const void * pElement ) const in HashFunc()219 ByteString SvStringHashTable::GetNearString( const ByteString & rName ) const in GetNearString()240 sal_Bool SvStringHashTable::IsEntry( sal_uInt32 nIndex ) const in IsEntry()254 sal_Bool SvStringHashTable::Insert( const ByteString & rName, sal_uInt32 * pIndex ) in Insert()275 sal_Bool SvStringHashTable::Test( const ByteString & rName, sal_uInt32 * pPos ) const in Test()277 return ((SvStringHashTable *)this)->SvHashTable:: in Test()288 SvStringHashEntry * SvStringHashTable::Get( sal_uInt32 nIndex ) const in Get()302 StringCompare SvStringHashTable::Compare( const void * pElement, in Compare()[all …]
56 class SvStringHashTable;59 friend class SvStringHashTable;99 class SvStringHashTable : public SvHashTable class106 SvStringHashTable( sal_uInt32 nMaxEntries ); // max size of hash-tabel107 virtual ~SvStringHashTable();
74 SvStringHashTable * pIdTable;103 SvStringHashTable * GetIdTable() { return pIdTable; } in GetIdTable()
130 SvStringHashTable * pHashTable;
144 IDLAPP->pHashTable = new SvStringHashTable( 2801 ); in Init()
298 pIdTable = new SvStringHashTable( 20003 ); in InsertId()
Completed in 27 milliseconds