Searched refs:pElem1 (Results 1 – 6 of 6) sorted by relevance
| /trunk/main/sot/source/sdstor/ |
| H A D | stgcache.cxx | 116 pCur = pElem1 = NULL; in StgCache() 171 if( !pElem1 ) in Create() 172 pElem1 = pElem->pNext2 = pElem->pLast2 = pElem; in Create() 175 StgPage* p = pElem1; in Create() 181 } while( p != pElem1 ); in Create() 186 if( p->nPage < pElem1->nPage ) in Create() 187 pElem1 = pElem; in Create() 210 if( pElem1 == pElem ) in Erase() 211 pElem1 = ( pElem->pNext2 == pElem ) ? NULL : pElem->pNext2; in Erase() 229 pElem1 = NULL; in Clear() [all …]
|
| H A D | stgcache.hxx | 45 StgPage* pElem1; // top of ordered list member in StgCache
|
| /trunk/main/svx/inc/svx/ |
| H A D | svdetc.hxx | 153 -1 falls *pElem1<*pElem2 154 0 falls *pElem1=*pElem2 155 +1 falls *pElem1>*pElem2 157 virtual int Compare(const void* pElem1, const void* pElem2) const=0; 161 Is1stLessThan2nd(const void* pElem1, const void* pElem2) const;
|
| /trunk/main/svx/source/svdraw/ |
| H A D | svdmark.cxx | 49 virtual int Compare(const void* pElem1, const void* pElem2) const; 52 int ImpSdrUShortContSorter::Compare(const void* pElem1, const void* pElem2) const in Compare() argument 54 sal_uInt16 n1((sal_uInt16)((sal_uIntPtr)pElem1)); in Compare() 323 virtual int Compare(const void* pElem1, const void* pElem2) const; 326 int ImpSdrMarkListSorter::Compare(const void* pElem1, const void* pElem2) const in Compare() argument 328 SdrObject* pObj1 = ((SdrMark*)pElem1)->GetMarkedSdrObj(); in Compare()
|
| H A D | svdhdl.cxx | 1772 virtual int Compare(const void* pElem1, const void* pElem2) const; 1775 int ImpSdrHdlListSorter::Compare(const void* pElem1, const void* pElem2) const in Compare() argument 1777 SdrHdlKind eKind1=((SdrHdl*)pElem1)->GetKind(); in Compare() 1793 if (((SdrHdl*)pElem1)->IsPlusHdl()) n1=4; in Compare() 1798 SdrPageView* pPV1=((SdrHdl*)pElem1)->GetPageView(); in Compare() 1803 SdrObject* pObj1=((SdrHdl*)pElem1)->GetObj(); in Compare() 1807 sal_uInt32 nNum1=((SdrHdl*)pElem1)->GetObjHdlNum(); in Compare() 1812 … return (long)pElem1<(long)pElem2 ? -1 : 1; // Notloesung, um immer die gleiche Sortierung zu haben in Compare()
|
| H A D | svdetc.cxx | 300 virtual int Compare(const void* pElem1, const void* pElem2) const; 303 int ImpUShortContainerSorter::Compare(const void* pElem1, const void* pElem2) const in Compare() argument 305 sal_uInt16 n1=sal_uInt16(sal_uIntPtr(pElem1)); in Compare()
|