Home
last modified time | relevance | path

Searched refs:ElementPtr (Results 1 – 6 of 6) sorted by relevance

/aoo4110/main/sw/source/core/bastyp/
H A Dbparr.cxx95 ElementPtr pElem = p->pData[ from - p->nStart ]; in Move()
115 ElementPtr* pElem = p->pData + nElem; in ForEach()
250 p->pData = new ElementPtr [ MAXENTRY ]; in InsBlock()
305 ElementPtr *pFrom = q->pData + nCount, in Insert()
336 ElementPtr pLast = p->pData[ MAXENTRY-1 ]; in Insert()
353 ElementPtr *pFrom = p->pData + p->nElem, in Insert()
359 ((ElementPtr&)rElem)->nOffset = sal_uInt16(pos); in Insert()
360 ((ElementPtr&)rElem)->pBlock = p; in Insert()
390 ElementPtr *pTo = p->pData + pos, in Remove()
465 ((ElementPtr&)rElem)->pBlock = p; in Replace()
[all …]
/aoo4110/main/sw/qa/core/
H A Dbigpointerarray-new.hxx60 typedef BigPtrEntry* ElementPtr; typedef
61 typedef sal_Bool (*FnForEach)(const ElementPtr&, void* pArgs);
68 typedef std::deque<ElementPtr> Container_t;
92 void Insert(const ElementPtr& rElem, sal_uLong pos);
128 void Replace(sal_uLong pos, const ElementPtr& rElem);
137 ElementPtr operator[](sal_uLong pos) const;
H A Dbigpointerarray-new.cxx64 ElementPtr BigPtrArray::operator[](sal_uLong pos) const in operator []()
70 void BigPtrArray::Insert(const ElementPtr& rElem, sal_uLong pos) in Insert()
93 void BigPtrArray::Replace(sal_uLong pos, const ElementPtr& rElem) in Replace()
H A DTest-BigPtrArray.cxx76 sal_Bool AddToCount(const ElementPtr& rElem, void* pArgs) in AddToCount()
/aoo4110/main/sw/inc/
H A Dbparr.hxx47 typedef BigPtrEntry* ElementPtr; typedef
50 typedef sal_Bool (*FnForEach)( const ElementPtr&, void* pArgs );
65 ElementPtr* pData; // Datenblock
95 void Insert( const ElementPtr& r, sal_uLong pos );
98 void Replace( sal_uLong pos, const ElementPtr& r);
100 ElementPtr operator[]( sal_uLong ) const;
/aoo4110/main/sw/source/core/docnode/
H A Dnodes.cxx2608 const ElementPtr pIns = pNode; in InsertNode()
2615 const ElementPtr pIns = pNode; in InsertNode()

Completed in 32 milliseconds