Lines Matching refs:nIndex
90 sal_uInt32 nIndex; in Test_Insert() local
97 nIndex = nHash % nMax; in Test_Insert()
103 while( (nMax != nLoop) && IsEntry( nIndex ) ) in Test_Insert()
105 if( COMPARE_EQUAL == Compare( pElement, nIndex ) ) in Test_Insert()
108 *pInsertPos = nIndex; // place of Element in Test_Insert()
113 nIndex = (sal_uInt16)(nIndex + nHash + 7) % nMax; in Test_Insert()
122 *pInsertPos = nIndex; // return free place in Test_Insert()
240 sal_Bool SvStringHashTable::IsEntry( sal_uInt32 nIndex ) const in IsEntry()
242 if( nIndex >= GetMax() ) in IsEntry()
244 return pEntries[ nIndex ].HasId(); in IsEntry()
256 sal_uInt32 nIndex; in Insert() local
258 if( !pIndex ) pIndex = &nIndex; in Insert()
288 SvStringHashEntry * SvStringHashTable::Get( sal_uInt32 nIndex ) const in Get()
290 if( IsEntry( nIndex ) ) in Get()
291 return pEntries + nIndex; in Get()
303 sal_uInt32 nIndex ) const in Compare()
305 return ((const ByteString *)pElement)->CompareTo( pEntries[ nIndex ].GetName() ); in Compare()