Lines Matching refs:pEntry
87 SvListEntry *pEntry = (SvListEntry*)pChilds->First(); in SetListPositions() local
89 while ( pEntry ) in SetListPositions()
91 pEntry->nListPos &= 0x80000000; in SetListPositions()
92 pEntry->nListPos |= nCur; in SetListPositions()
94 pEntry = (SvListEntry*)pChilds->Next(); in SetListPositions()
221 sal_Bool SvTreeList::IsEntryVisible( const SvListView* pView, SvListEntry* pEntry ) const in IsEntryVisible()
223 DBG_ASSERT(pView&&pEntry,"IsVisible:Invalid Params"); in IsEntryVisible()
227 if ( pEntry == pRootItem ) in IsEntryVisible()
232 pEntry = pEntry->pParent; in IsEntryVisible()
233 } while( pView->IsExpanded( pEntry ) ); in IsEntryVisible()
237 sal_uInt16 SvTreeList::GetDepth( SvListEntry* pEntry ) const in GetDepth()
239 DBG_ASSERT(pEntry&&pEntry!=pRootItem,"GetDepth:Bad Entry"); in GetDepth()
241 while( pEntry->pParent != pRootItem ) in GetDepth()
244 pEntry = pEntry->pParent; in GetDepth()
265 SvListEntry* pEntry = (SvListEntry*)(pRootList->First()); in Clear() local
266 while( pEntry ) in Clear()
268 delete pEntry; in Clear()
269 pEntry = (SvListEntry*)(pRootList->Next()); in Clear()
519 SvListEntry* pEntry = CreateEntry(); in CloneEntry() local
520 pSource->Clone( pEntry ); in CloneEntry()
539 SvListEntry* SvTreeList::Clone( SvListEntry* pEntry, sal_uLong& nCloneCount ) const in Clone() argument
541 SvListEntry* pClonedEntry = CloneEntry( pEntry ); in Clone()
543 SvTreeEntryList* pChilds = pEntry->pChilds; in Clone()
813 SvListEntry* pEntry = 0; in Last() local
816 pEntry = (SvListEntry*)(pActList->Last()); in Last()
817 pActList = pEntry->pChilds; in Last()
821 return pEntry; in Last()
834 sal_uLong SvTreeList::GetVisiblePos( const SvListView* pView, SvListEntry* pEntry ) const in GetVisiblePos()
836 DBG_ASSERT(pView&&pEntry,"View/Entry?"); in GetVisiblePos()
844 SvViewData* pViewData = pView->GetViewData( pEntry ); in GetVisiblePos()
867 SvListEntry* pEntry = First(); // erster Eintrag immer sichtbar in GetVisibleCount() local
868 while ( pEntry ) in GetVisibleCount()
870 SvViewData* pViewData = pView->GetViewData( pEntry ); in GetVisibleCount()
873 pEntry = NextVisible( pView, pEntry ); in GetVisibleCount()
1026 SvListEntry* pEntry = Last(); in LastVisible() local
1027 while( pEntry && !IsEntryVisible( pView, pEntry ) ) in LastVisible()
1028 pEntry = PrevVisible( pView, pEntry ); in LastVisible()
1029 if ( pEntry && pDepth ) in LastVisible()
1030 *pDepth = GetDepth( pEntry ); in LastVisible()
1031 return pEntry; in LastVisible()
1044 SvListEntry* SvTreeList::NextVisible(const SvListView* pView,SvListEntry* pEntry,sal_uInt16& nDelta… in NextVisible() argument
1046 DBG_ASSERT(pView&&pEntry&&IsEntryVisible(pView,pEntry),"NextVis:Wrong Prms/!Vis"); in NextVisible()
1048 sal_uLong nVisPos = GetVisiblePos( pView, pEntry ); in NextVisible()
1060 pEntry = NextVisible( pView, pEntry ); in NextVisible()
1062 DBG_ASSERT(pEntry,"Entry?"); in NextVisible()
1064 return pEntry; in NextVisible()
1077 SvListEntry* SvTreeList::PrevVisible( const SvListView* pView, SvListEntry* pEntry, sal_uInt16& nDe… in PrevVisible() argument
1079 DBG_ASSERT(pView&&pEntry&&IsEntryVisible(pView,pEntry),"PrevVis:Parms/!Vis"); in PrevVisible()
1081 sal_uLong nVisPos = GetVisiblePos( pView, pEntry ); in PrevVisible()
1090 pEntry = PrevVisible( pView, pEntry ); in PrevVisible()
1092 DBG_ASSERT(pEntry,"Entry?"); in PrevVisible()
1094 return pEntry; in PrevVisible()
1131 SvListEntry* SvTreeList::NextSibling( SvListEntry* pEntry ) const in NextSibling()
1133 DBG_ASSERT(pEntry,"Entry?"); in NextSibling()
1134 if( !pEntry ) in NextSibling()
1136 SvTreeEntryList* pList = pEntry->pParent->pChilds; in NextSibling()
1138 sal_uLong nPos = pEntry->GetChildListPos(); in NextSibling()
1140 pEntry = (SvListEntry*)(pList->GetObject( nPos )); in NextSibling()
1141 return pEntry; in NextSibling()
1144 SvListEntry* SvTreeList::PrevSibling( SvListEntry* pEntry ) const in PrevSibling()
1146 DBG_ASSERT(pEntry,"Entry?"); in PrevSibling()
1147 if( !pEntry ) in PrevSibling()
1150 SvTreeEntryList* pList = pEntry->pParent->pChilds; in PrevSibling()
1152 sal_uLong nPos = pEntry->GetChildListPos(); in PrevSibling()
1156 pEntry = (SvListEntry*)(pList->GetObject( nPos )); in PrevSibling()
1157 return pEntry; in PrevSibling()
1161 SvListEntry* SvTreeList::LastSibling( SvListEntry* pEntry ) const in LastSibling()
1163 DBG_ASSERT(pEntry,"LastSibling:Entry?"); in LastSibling()
1164 if( !pEntry ) in LastSibling()
1167 SvTreeEntryList* pSibs = pEntry->pParent->pChilds; in LastSibling()
1185 SvListEntry* SvTreeList::NextSelected( const SvListView* pView, SvListEntry* pEntry ) const in NextSelected()
1187 DBG_ASSERT(pView&&pEntry,"NextSel:View/Entry?"); in NextSelected()
1188 pEntry = Next( pEntry ); in NextSelected()
1189 while( pEntry && !pView->IsSelected(pEntry) ) in NextSelected()
1190 pEntry = Next( pEntry ); in NextSelected()
1191 return pEntry; in NextSelected()
1204 SvListEntry* SvTreeList::PrevSelected( const SvListView* pView, SvListEntry* pEntry) const in PrevSelected()
1206 DBG_ASSERT(pView&&pEntry,"PrevSel:View/Entry?"); in PrevSelected()
1207 pEntry = Prev( pEntry ); in PrevSelected()
1208 while( pEntry && !pView->IsSelected(pEntry) ) in PrevSelected()
1209 pEntry = Prev( pEntry ); in PrevSelected()
1211 return pEntry; in PrevSelected()
1227 SvListEntry* pEntry = Last(); in LastSelected() local
1228 while( pEntry && !pView->IsSelected(pEntry) ) in LastSelected()
1229 pEntry = Prev( pEntry ); in LastSelected()
1230 return pEntry; in LastSelected()
1242 sal_uLong SvTreeList::Insert( SvListEntry* pEntry,SvListEntry* pParent,sal_uLong nPos ) in Insert() argument
1244 DBG_ASSERT( pEntry,"Entry?"); in Insert()
1259 GetInsertionPos( pEntry, pParent, nPos ); in Insert()
1262 pEntry->pParent = pParent; in Insert()
1264 pList->Insert( pEntry, nPos ); in Insert()
1269 pEntry->nListPos = pList->Count()-1; in Insert()
1274 Broadcast( LISTACTION_INSERTED, pEntry ); in Insert()
1288 sal_uLong SvTreeList::GetAbsPos( SvListEntry* pEntry) const in GetAbsPos()
1292 return pEntry->nAbsPos; in GetAbsPos()
1308 SvListEntry* pEntry = First(); in SetAbsolutePositions() local
1309 while ( pEntry ) in SetAbsolutePositions()
1311 pEntry->nAbsPos = nPos; in SetAbsolutePositions()
1313 pEntry = Next( pEntry ); in SetAbsolutePositions()
1332 void SvTreeList::Expand( SvListView* pView, SvListEntry* pEntry ) in Expand() argument
1334 DBG_ASSERT(pEntry&&pView,"Expand:View/Entry?"); in Expand()
1335 if ( pView->IsExpanded(pEntry) ) in Expand()
1338 DBG_ASSERT(pEntry->pChilds,"Expand:No Childs!"); in Expand()
1340 SvViewData* pViewData = pView->GetViewData(pEntry); in Expand()
1342 SvListEntry* pParent = pEntry->pParent; in Expand()
1364 void SvTreeList::Collapse( SvListView* pView, SvListEntry* pEntry ) in Collapse() argument
1366 DBG_ASSERT(pView&&pEntry,"Collapse:View/Entry?"); in Collapse()
1367 if ( !pView->IsExpanded(pEntry) ) in Collapse()
1370 DBG_ASSERT(pEntry->pChilds,"Collapse:No Childs!"); in Collapse()
1372 SvViewData* pViewData = pView->GetViewData( pEntry ); in Collapse()
1375 SvListEntry* pParent = pEntry->pParent; in Collapse()
1397 sal_Bool SvTreeList::Select( SvListView* pView, SvListEntry* pEntry, sal_Bool bSelect ) in Select() argument
1399 DBG_ASSERT(pView&&pEntry,"Select:View/Entry?"); in Select()
1400 SvViewData* pViewData = pView->GetViewData( pEntry ); in Select()
1436 sal_Bool SvTreeList::Remove( SvListEntry* pEntry ) in Remove() argument
1438 DBG_ASSERT(pEntry,"Cannot remove root, use clear"); in Remove()
1440 if( !pEntry->pParent ) in Remove()
1450 Broadcast( LISTACTION_REMOVING, pEntry ); in Remove()
1451 sal_uLong nRemoved = 1 + GetChildCount(pEntry); in Remove()
1454 SvListEntry* pParent = pEntry->pParent; in Remove()
1459 if ( pEntry->HasChildListPos() ) in Remove()
1461 sal_uLong nListPos = pEntry->GetChildListPos(); in Remove()
1467 pList->Remove( (void*) pEntry ); in Remove()
1489 Broadcast( LISTACTION_REMOVED, pEntry ); in Remove()
1491 delete pEntry; // loescht auch alle Childs in Remove()
1533 SvListEntry* pEntry = First(); in SelectAll() local
1534 while ( pEntry ) in SelectAll()
1536 SvViewData* pViewData = pView->GetViewData( pEntry ); in SelectAll()
1542 pEntry = Next( pEntry ); in SelectAll()
1556 SvListEntry* pEntry = First(); in GetEntryAtAbsPos() local
1557 while ( nAbsPos && pEntry ) in GetEntryAtAbsPos()
1559 pEntry = Next( pEntry ); in GetEntryAtAbsPos()
1562 return pEntry; in GetEntryAtAbsPos()
1568 SvListEntry* pEntry = First(); in GetEntryAtVisPos() local
1569 while ( nVisPos && pEntry ) in GetEntryAtVisPos()
1571 pEntry = NextVisible( pView, pEntry ); in GetEntryAtVisPos()
1574 return pEntry; in GetEntryAtVisPos()
1581 SvListEntry* pEntry = (SvListEntry*)(pList->GetObject(0)); in SetListPositions() local
1582 if( pEntry->pParent ) in SetListPositions()
1583 pEntry->pParent->InvalidateChildrensListPositions(); in SetListPositions()
1598 void SvTreeList::InvalidateEntry( SvListEntry* pEntry ) in InvalidateEntry() argument
1600 Broadcast( LISTACTION_INVALIDATE_ENTRY, pEntry ); in InvalidateEntry()
1616 SvListEntry* pEntry = (SvListEntry*)(pList->First()); in lcl_CheckList() local
1618 while ( pEntry ) in lcl_CheckList()
1620 DBG_ASSERT(pEntry->GetChildListPos()==nPos,"Wrong ListPos"); in lcl_CheckList()
1621 pEntry = (SvListEntry*)(pList->Next()); in lcl_CheckList()
1632 SvListEntry* pEntry = First(); in CheckIntegrity() local
1633 while( pEntry ) in CheckIntegrity()
1636 if ( pEntry->pChilds ) in CheckIntegrity()
1637 lcl_CheckList( pEntry->pChilds ); in CheckIntegrity()
1638 pEntry = Next( pEntry ); in CheckIntegrity()
1644 SvListEntry* SvTreeList::GetRootLevelParent( SvListEntry* pEntry ) const in GetRootLevelParent()
1646 DBG_ASSERT(pEntry,"GetRootLevelParent:No Entry"); in GetRootLevelParent()
1648 if ( pEntry ) in GetRootLevelParent()
1650 pCurParent = pEntry->pParent; in GetRootLevelParent()
1652 return pEntry; // ist sein eigener Parent in GetRootLevelParent()
1716 SvListEntry* pEntry; in InitTable() local
1720 pEntry = pModel->pRootItem; in InitTable()
1723 aDataTable.Insert( (sal_uLong)pEntry, pViewData ); in InitTable()
1725 pEntry = pModel->First(); in InitTable()
1726 while( pEntry ) in InitTable()
1728 pViewData = CreateViewData( pEntry ); in InitTable()
1730 InitViewData( pViewData, pEntry ); in InitTable()
1731 aDataTable.Insert( (sal_uLong)pEntry, pViewData ); in InitTable()
1732 pEntry = pModel->Next( pEntry ); in InitTable()
1763 SvListEntry* pEntry = pModel->pRootItem; in Clear() local
1766 aDataTable.Insert( (sal_uLong)pEntry, pViewData ); in Clear()
1832 void SvListView::ActionMoving( SvListEntry* pEntry,SvListEntry*,sal_uLong) in ActionMoving() argument
1835 SvListEntry* pParent = pEntry->pParent; in ActionMoving()
1856 void SvListView::ActionInserted( SvListEntry* pEntry ) in ActionInserted() argument
1859 DBG_ASSERT(pEntry,"Insert:No Entry"); in ActionInserted()
1860 SvViewData* pData = CreateViewData( pEntry ); in ActionInserted()
1861 InitViewData( pData, pEntry ); in ActionInserted()
1865 aDataTable.Insert( (sal_uLong)pEntry, pData ); in ActionInserted()
1867 if ( nVisibleCount && pModel->IsEntryVisible( this, pEntry )) in ActionInserted()
1874 void SvListView::ActionInsertedTree( SvListEntry* pEntry ) in ActionInsertedTree() argument
1877 if ( pModel->IsEntryVisible( this, pEntry )) in ActionInsertedTree()
1883 SvListEntry* pCurEntry = pEntry; in ActionInsertedTree()
1890 InitViewData( pViewData, pEntry ); in ActionInsertedTree()
1918 void SvListView::ActionRemoving( SvListEntry* pEntry ) in ActionRemoving() argument
1921 DBG_ASSERT(pEntry,"Remove:No Entry"); in ActionRemoving()
1923 SvViewData* pViewData = (SvViewData*)aDataTable.Get( (sal_uLong)pEntry ); in ActionRemoving()
1926 nSelRemoved = 1 + pModel->GetChildSelectionCount( this, pEntry ); in ActionRemoving()
1929 if ( pModel->IsEntryVisible( this, pEntry ) ) in ActionRemoving()
1930 nVisibleRemoved = 1 + pModel->GetVisibleChildCount( this, pEntry ); in ActionRemoving()
1943 pViewData = (SvViewData*)aDataTable.Get((sal_uLong)pEntry); in ActionRemoving()
1945 aDataTable.Remove( (sal_uLong)pEntry ); in ActionRemoving()
1946 RemoveViewData( pEntry ); in ActionRemoving()
1948 SvListEntry* pCurEntry = pEntry->pParent; in ActionRemoving()
2064 void SvTreeList::GetInsertionPos( SvListEntry* pEntry, SvListEntry* pParent, in GetInsertionPos() argument
2067 DBG_ASSERT(pEntry,"No Entry"); in GetInsertionPos()
2086 eCompare = Compare( pEntry, pTempEntry ); in GetInsertionPos()