Lines Matching refs:pLst
68 if ( !pLst->Count() ) in DECLARE_LIST()
73 DirEntry *pCurLstObj = pLst->GetObject( nCurPos ); in DECLARE_LIST()
218 pLst->Insert( (DirEntry*)pNewEntry, APPEND ); in ImpSortedInsert()
222 pLst->First(); in ImpSortedInsert()
224 if ( ImpInsertPointReached( *pNewEntry, *pNewStat, pLst->GetCurPos(), in ImpSortedInsert()
228 pStatLst->Insert( (FileStat*)pNewStat, pLst->GetCurPos() ); in ImpSortedInsert()
229 pLst->Insert( (DirEntry*)pNewEntry ); in ImpSortedInsert()
232 } while( pLst->Next() ); in ImpSortedInsert()
236 pLst->Insert( (DirEntry*)pNewEntry, APPEND ); in ImpSortedInsert()
251 pLst = NULL; in Construct()
307 if ( pLst ) in Reset()
309 DirEntry* pEntry = pLst->First(); in Reset()
312 DirEntry* pNext = pLst->Next(); in Reset()
316 pLst->Clear(); in Reset()
319 pLst = new DirEntryList(); in Reset()
386 if ( !pLst->Count() ) in Scan()
466 pLst = NULL; in Dir()
488 if ( pLst ) in ~Dir()
490 DirEntry* pEntry = pLst->First(); in ~Dir()
493 DirEntry* pNext = pLst->Next(); in ~Dir()
497 pLst->Clear(); in ~Dir()
499 delete pLst; in ~Dir()
636 if ( pLst ) { //Keine DirEntry's, kein Sort. in ImpSetSort()
637 DirEntryList *pOldLst = pLst; //alte Liste merken in ImpSetSort()
638 pLst = new DirEntryList(); //neue Liste (zu Sortieren) in ImpSetSort()
695 DirEntry *pEntry = pLst->GetObject( nIndex ); in operator []()
717 if ( !pLst ) in operator +=()
718 pLst = new DirEntryList(); in operator +=()
763 return pLst == NULL ? 0 : (sal_uInt16) pLst->Count(); in Count()