Skip to content
Projeler
Gruplar
Parçacıklar
Yardım
Yükleniyor...
Oturum aç / Kaydol
Gezinmeyi değiştir
C
core
Proje
Proje
Ayrıntılar
Etkinlik
Cycle Analytics
Depo (repository)
Depo (repository)
Dosyalar
Kayıtlar (commit)
Dallar (branch)
Etiketler
Katkıda bulunanlar
Grafik
Karşılaştır
Grafikler
Konular (issue)
0
Konular (issue)
0
Liste
Pano
Etiketler
Kilometre Taşları
Birleştirme (merge) Talepleri
0
Birleştirme (merge) Talepleri
0
CI / CD
CI / CD
İş akışları (pipeline)
İşler
Zamanlamalar
Grafikler
Paketler
Paketler
Wiki
Wiki
Parçacıklar
Parçacıklar
Üyeler
Üyeler
Collapse sidebar
Close sidebar
Etkinlik
Grafik
Grafikler
Yeni bir konu (issue) oluştur
İşler
Kayıtlar (commit)
Konu (issue) Panoları
Kenar çubuğunu aç
LibreOffice
core
Commits
3fa955d7
Kaydet (Commit)
3fa955d7
authored
Eki 23, 2012
tarafından
Kohei Yoshida
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Eposta Yamaları
Sade Fark
Make SvTreeEntryList private to svtools.
Change-Id: I283d897cd5a7c15b5b60e99c90c04b696d20c2a3
üst
d7a19a7e
Hide whitespace changes
Inline
Side-by-side
Showing
6 changed files
with
159 additions
and
79 deletions
+159
-79
unodatbr.cxx
dbaccess/source/ui/browser/unodatbr.cxx
+10
-9
dbtreelistbox.cxx
dbaccess/source/ui/control/dbtreelistbox.cxx
+14
-13
treelist.hxx
svtools/inc/svtools/treelist.hxx
+8
-41
treelistbox.hxx
svtools/inc/svtools/treelistbox.hxx
+8
-8
treelist.cxx
svtools/source/contnr/treelist.cxx
+79
-8
treelistbox.cxx
svtools/source/contnr/treelistbox.cxx
+40
-0
No files found.
dbaccess/source/ui/browser/unodatbr.cxx
Dosyayı görüntüle @
3fa955d7
...
@@ -3866,16 +3866,17 @@ void SbaTableQueryBrowser::impl_cleanupDataSourceEntry( const String& _rDataSour
...
@@ -3866,16 +3866,17 @@ void SbaTableQueryBrowser::impl_cleanupDataSourceEntry( const String& _rDataSour
"SbaTableQueryBrowser::impl_cleanupDataSourceEntry: inconsistence (2)!"
);
"SbaTableQueryBrowser::impl_cleanupDataSourceEntry: inconsistence (2)!"
);
// delete any user data of the child entries of the to-be-removed entry
// delete any user data of the child entries of the to-be-removed entry
SvTreeEntryList
*
pList
=
m_pTreeModel
->
GetChildList
(
pDataSourceEntry
);
std
::
pair
<
SvTreeEntryList
::
iterator
,
SvTreeEntryList
::
iterator
>
aIters
=
if
(
pList
)
m_pTreeModel
->
GetChildIterators
(
pDataSourceEntry
);
SvTreeEntryList
::
const_iterator
it
=
aIters
.
first
,
itEnd
=
aIters
.
second
;
for
(;
it
!=
itEnd
;
++
it
)
{
{
for
(
size_t
i
=
0
,
n
=
pList
->
size
();
i
<
n
;
++
i
)
SvTreeListEntry
*
pEntry
=
*
it
;
{
const
DBTreeListUserData
*
pData
=
static_cast
<
const
DBTreeListUserData
*>
(
pEntry
->
GetUserData
());
SvTreeListEntry
*
pEntryLoop
=
static_cast
<
SvTreeListEntry
*>
((
*
pList
)[
i
]);
pEntry
->
SetUserData
(
NULL
);
DBTreeListUserData
*
pData
=
static_cast
<
DBTreeListUserData
*
>
(
pEntryLoop
->
GetUserData
()
);
delete
pData
;
pEntryLoop
->
SetUserData
(
NULL
);
delete
pData
;
}
}
}
// remove the entry
// remove the entry
...
...
dbaccess/source/ui/control/dbtreelistbox.cxx
Dosyayı görüntüle @
3fa955d7
...
@@ -111,23 +111,24 @@ DBTreeListBox::~DBTreeListBox()
...
@@ -111,23 +111,24 @@ DBTreeListBox::~DBTreeListBox()
SvTreeListEntry
*
DBTreeListBox
::
GetEntryPosByName
(
const
String
&
aName
,
SvTreeListEntry
*
pStart
,
const
IEntryFilter
*
_pFilter
)
const
SvTreeListEntry
*
DBTreeListBox
::
GetEntryPosByName
(
const
String
&
aName
,
SvTreeListEntry
*
pStart
,
const
IEntryFilter
*
_pFilter
)
const
{
{
SvTreeList
*
myModel
=
GetModel
();
SvTreeList
*
myModel
=
GetModel
();
SvTreeEntryList
*
pChildren
=
myModel
->
GetChildList
(
pStart
);
std
::
pair
<
SvTreeEntryList
::
iterator
,
SvTreeEntryList
::
iterator
>
aIters
=
myModel
->
GetChildIterators
(
pStart
);
SvTreeListEntry
*
pEntry
=
NULL
;
SvTreeListEntry
*
pEntry
=
NULL
;
if
(
pChildren
)
SvTreeEntryList
::
const_iterator
it
=
aIters
.
first
,
itEnd
=
aIters
.
second
;
for
(;
it
!=
itEnd
;
++
it
)
{
{
size_t
nCount
=
pChildren
->
size
();
pEntry
=
*
it
;
for
(
size_t
i
=
0
;
i
<
nCount
;
++
i
)
const
SvLBoxString
*
pItem
=
static_cast
<
const
SvLBoxString
*>
(
pEntry
->
GetFirstItem
(
SV_ITEM_ID_LBOXSTRING
));
if
(
pItem
&&
pItem
->
GetText
().
equals
(
aName
))
{
{
pEntry
=
static_cast
<
SvTreeListEntry
*>
((
*
pChildren
)[
i
]);
if
(
!
_pFilter
||
_pFilter
->
includeEntry
(
pEntry
))
SvLBoxString
*
pItem
=
(
SvLBoxString
*
)(
pEntry
->
GetFirstItem
(
SV_ITEM_ID_LBOXSTRING
));
// found
if
(
pItem
->
GetText
().
equals
(
aName
)
)
break
;
{
if
(
!
_pFilter
||
_pFilter
->
includeEntry
(
pEntry
)
)
// found
break
;
}
pEntry
=
NULL
;
}
}
pEntry
=
NULL
;
}
}
return
pEntry
;
return
pEntry
;
...
...
svtools/inc/svtools/treelist.hxx
Dosyayı görüntüle @
3fa955d7
...
@@ -64,7 +64,7 @@
...
@@ -64,7 +64,7 @@
class
SvTreeListEntry
;
class
SvTreeListEntry
;
class
S
VT_DLLPUBLIC
S
vTreeEntryList
class
SvTreeEntryList
{
{
private
:
private
:
typedef
std
::
vector
<
SvTreeListEntry
*>
ListType
;
typedef
std
::
vector
<
SvTreeListEntry
*>
ListType
;
...
@@ -297,6 +297,12 @@ public:
...
@@ -297,6 +297,12 @@ public:
SvTreeListEntry
*
GetRootLevelParent
(
SvTreeListEntry
*
pEntry
)
const
;
SvTreeListEntry
*
GetRootLevelParent
(
SvTreeListEntry
*
pEntry
)
const
;
SvTreeEntryList
*
GetChildList
(
SvTreeListEntry
*
pParent
)
const
;
SvTreeEntryList
*
GetChildList
(
SvTreeListEntry
*
pParent
)
const
;
std
::
pair
<
SvTreeEntryList
::
const_iterator
,
SvTreeEntryList
::
const_iterator
>
GetChildIterators
(
const
SvTreeListEntry
*
pParent
)
const
;
std
::
pair
<
SvTreeEntryList
::
iterator
,
SvTreeEntryList
::
iterator
>
GetChildIterators
(
SvTreeListEntry
*
pParent
);
sal_uLong
GetAbsPos
(
SvTreeListEntry
*
pEntry
)
const
;
sal_uLong
GetAbsPos
(
SvTreeListEntry
*
pEntry
)
const
;
sal_uLong
GetRelPos
(
SvTreeListEntry
*
pChild
)
const
sal_uLong
GetRelPos
(
SvTreeListEntry
*
pChild
)
const
{
return
pChild
->
GetChildListPos
();
}
{
return
pChild
->
GetChildListPos
();
}
...
@@ -365,7 +371,7 @@ public:
...
@@ -365,7 +371,7 @@ public:
SvListView
();
// !!! setzt das Model auf 0
SvListView
();
// !!! setzt das Model auf 0
virtual
~
SvListView
();
virtual
~
SvListView
();
void
Clear
();
void
Clear
();
SvTreeList
*
GetModel
()
const
{
return
pModel
;
}
SvTreeList
*
GetModel
()
const
;
virtual
void
SetModel
(
SvTreeList
*
);
virtual
void
SetModel
(
SvTreeList
*
);
virtual
void
ModelNotification
(
virtual
void
ModelNotification
(
sal_uInt16
nActionId
,
sal_uInt16
nActionId
,
...
@@ -523,45 +529,6 @@ inline SvViewData* SvListView::GetViewData( SvTreeListEntry* pEntry )
...
@@ -523,45 +529,6 @@ inline SvViewData* SvListView::GetViewData( SvTreeListEntry* pEntry )
#endif
#endif
}
}
inline
sal_Bool
SvTreeList
::
HasChildren
(
SvTreeListEntry
*
pEntry
)
const
{
if
(
!
pEntry
)
pEntry
=
pRootItem
;
return
(
sal_Bool
)(
pEntry
->
pChildren
!=
0
);
}
inline
SvTreeListEntry
*
SvTreeList
::
GetEntry
(
SvTreeListEntry
*
pParent
,
sal_uLong
nPos
)
const
{
if
(
!
pParent
)
pParent
=
pRootItem
;
SvTreeListEntry
*
pRet
=
0
;
if
(
pParent
->
pChildren
)
pRet
=
(
*
pParent
->
pChildren
)[
nPos
];
return
pRet
;
}
inline
SvTreeListEntry
*
SvTreeList
::
GetEntry
(
sal_uLong
nRootPos
)
const
{
SvTreeListEntry
*
pRet
=
0
;
if
(
nEntryCount
)
pRet
=
(
*
pRootItem
->
pChildren
)[
nRootPos
];
return
pRet
;
}
inline
SvTreeEntryList
*
SvTreeList
::
GetChildList
(
SvTreeListEntry
*
pParent
)
const
{
if
(
!
pParent
)
pParent
=
pRootItem
;
return
pParent
->
pChildren
;
}
inline
SvTreeListEntry
*
SvTreeList
::
GetParent
(
SvTreeListEntry
*
pEntry
)
const
{
SvTreeListEntry
*
pParent
=
pEntry
->
pParent
;
if
(
pParent
==
pRootItem
)
pParent
=
0
;
return
pParent
;
}
#endif
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
svtools/inc/svtools/treelistbox.hxx
Dosyayı görüntüle @
3fa955d7
...
@@ -383,9 +383,9 @@ public:
...
@@ -383,9 +383,9 @@ public:
SvTreeListEntry
*
Prev
(
SvTreeListEntry
*
pEntry
,
sal_uInt16
*
pDepth
=
0
)
const
{
return
pModel
->
Prev
(
pEntry
,
pDepth
);
}
SvTreeListEntry
*
Prev
(
SvTreeListEntry
*
pEntry
,
sal_uInt16
*
pDepth
=
0
)
const
{
return
pModel
->
Prev
(
pEntry
,
pDepth
);
}
SvTreeListEntry
*
Last
()
const
{
return
pModel
->
Last
();
}
SvTreeListEntry
*
Last
()
const
{
return
pModel
->
Last
();
}
SvTreeListEntry
*
FirstChild
(
SvTreeListEntry
*
pParent
)
const
{
return
pModel
->
FirstChild
(
pParent
);
}
SvTreeListEntry
*
FirstChild
(
SvTreeListEntry
*
pParent
)
const
;
SvTreeListEntry
*
NextSibling
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
NextSibling
(
pEntry
);
}
SvTreeListEntry
*
NextSibling
(
SvTreeListEntry
*
pEntry
)
const
;
SvTreeListEntry
*
PrevSibling
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
PrevSibling
(
pEntry
);
}
SvTreeListEntry
*
PrevSibling
(
SvTreeListEntry
*
pEntry
)
const
;
sal_Bool
CopySelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
);
sal_Bool
CopySelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
);
sal_Bool
MoveSelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
);
sal_Bool
MoveSelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
);
...
@@ -396,18 +396,18 @@ public:
...
@@ -396,18 +396,18 @@ public:
SelectionMode
GetSelectionMode
()
const
{
return
eSelMode
;
}
SelectionMode
GetSelectionMode
()
const
{
return
eSelMode
;
}
// pParent==0 -> Root-Ebene
// pParent==0 -> Root-Ebene
SvTreeListEntry
*
GetEntry
(
SvTreeListEntry
*
pParent
,
sal_uLong
nPos
)
const
{
return
pModel
->
GetEntry
(
pParent
,
nPos
);
}
SvTreeListEntry
*
GetEntry
(
SvTreeListEntry
*
pParent
,
sal_uLong
nPos
)
const
;
SvTreeListEntry
*
GetEntry
(
sal_uLong
nRootPos
)
const
{
return
pModel
->
GetEntry
(
nRootPos
);
}
SvTreeListEntry
*
GetEntry
(
sal_uLong
nRootPos
)
const
;
SvTreeListEntry
*
GetEntryFromPath
(
const
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
;
SvTreeListEntry
*
GetEntryFromPath
(
const
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
;
void
FillEntryPath
(
SvTreeListEntry
*
pEntry
,
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
;
void
FillEntryPath
(
SvTreeListEntry
*
pEntry
,
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
;
using
Window
::
GetParent
;
using
Window
::
GetParent
;
SvTreeListEntry
*
GetParent
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
GetParent
(
pEntry
);
}
SvTreeListEntry
*
GetParent
(
SvTreeListEntry
*
pEntry
)
const
;
SvTreeListEntry
*
GetRootLevelParent
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
GetRootLevelParent
(
pEntry
);}
SvTreeListEntry
*
GetRootLevelParent
(
SvTreeListEntry
*
pEntry
)
const
;
using
Window
::
GetChildCount
;
using
Window
::
GetChildCount
;
sal_uLong
GetChildCount
(
SvTreeListEntry
*
pParent
)
const
{
return
pModel
->
GetChildCount
(
pParent
);
}
sal_uLong
GetChildCount
(
SvTreeListEntry
*
pParent
)
const
;
sal_uLong
GetLevelChildCount
(
SvTreeListEntry
*
pParent
)
const
;
sal_uLong
GetLevelChildCount
(
SvTreeListEntry
*
pParent
)
const
;
SvViewDataEntry
*
GetViewDataEntry
(
SvTreeListEntry
*
pEntry
)
const
{
return
(
SvViewDataEntry
*
)
SvListView
::
GetViewData
(
pEntry
);
}
SvViewDataEntry
*
GetViewDataEntry
(
SvTreeListEntry
*
pEntry
)
const
{
return
(
SvViewDataEntry
*
)
SvListView
::
GetViewData
(
pEntry
);
}
...
...
svtools/source/contnr/treelist.cxx
Dosyayı görüntüle @
3fa955d7
...
@@ -1439,17 +1439,45 @@ SvTreeListEntry* SvTreeList::GetRootLevelParent( SvTreeListEntry* pEntry ) const
...
@@ -1439,17 +1439,45 @@ SvTreeListEntry* SvTreeList::GetRootLevelParent( SvTreeListEntry* pEntry ) const
return
pCurParent
;
return
pCurParent
;
}
}
std
::
pair
<
SvTreeEntryList
::
const_iterator
,
SvTreeEntryList
::
const_iterator
>
SvTreeList
::
GetChildIterators
(
const
SvTreeListEntry
*
pParent
)
const
{
typedef
std
::
pair
<
SvTreeEntryList
::
const_iterator
,
SvTreeEntryList
::
const_iterator
>
IteratorPair
;
IteratorPair
aRet
;
if
(
!
pParent
)
pParent
=
pRootItem
;
if
(
!
pParent
->
pChildren
||
pParent
->
pChildren
->
empty
())
// This entry has no children.
return
aRet
;
aRet
.
first
=
pParent
->
pChildren
->
begin
();
aRet
.
second
=
pParent
->
pChildren
->
end
();
return
aRet
;
}
std
::
pair
<
SvTreeEntryList
::
iterator
,
SvTreeEntryList
::
iterator
>
SvTreeList
::
GetChildIterators
(
SvTreeListEntry
*
pParent
)
{
typedef
std
::
pair
<
SvTreeEntryList
::
iterator
,
SvTreeEntryList
::
iterator
>
IteratorPair
;
IteratorPair
aRet
;
if
(
!
pParent
)
pParent
=
pRootItem
;
if
(
!
pParent
->
pChildren
||
pParent
->
pChildren
->
empty
())
// This entry has no children.
return
aRet
;
//*************************************************************************
aRet
.
first
=
pParent
->
pChildren
->
begin
();
//*************************************************************************
aRet
.
second
=
pParent
->
pChildren
->
end
();
//*************************************************************************
//*************************************************************************
return
aRet
;
//*************************************************************************
}
//*************************************************************************
//*************************************************************************
//*************************************************************************
DBG_NAME
(
SvListView
);
DBG_NAME
(
SvListView
);
...
@@ -1526,6 +1554,11 @@ void SvListView::Clear()
...
@@ -1526,6 +1554,11 @@ void SvListView::Clear()
}
}
}
}
SvTreeList
*
SvListView
::
GetModel
()
const
{
return
pModel
;
}
void
SvListView
::
SetModel
(
SvTreeList
*
pNewModel
)
void
SvListView
::
SetModel
(
SvTreeList
*
pNewModel
)
{
{
DBG_CHKTHIS
(
SvListView
,
0
);
DBG_CHKTHIS
(
SvListView
,
0
);
...
@@ -1864,5 +1897,43 @@ void SvTreeList::GetInsertionPos( SvTreeListEntry* pEntry, SvTreeListEntry* pPar
...
@@ -1864,5 +1897,43 @@ void SvTreeList::GetInsertionPos( SvTreeListEntry* pEntry, SvTreeListEntry* pPar
}
}
}
}
sal_Bool
SvTreeList
::
HasChildren
(
SvTreeListEntry
*
pEntry
)
const
{
if
(
!
pEntry
)
pEntry
=
pRootItem
;
return
(
sal_Bool
)(
pEntry
->
pChildren
!=
0
);
}
SvTreeListEntry
*
SvTreeList
::
GetEntry
(
SvTreeListEntry
*
pParent
,
sal_uLong
nPos
)
const
{
if
(
!
pParent
)
pParent
=
pRootItem
;
SvTreeListEntry
*
pRet
=
0
;
if
(
pParent
->
pChildren
)
pRet
=
(
*
pParent
->
pChildren
)[
nPos
];
return
pRet
;
}
SvTreeListEntry
*
SvTreeList
::
GetEntry
(
sal_uLong
nRootPos
)
const
{
SvTreeListEntry
*
pRet
=
0
;
if
(
nEntryCount
)
pRet
=
(
*
pRootItem
->
pChildren
)[
nRootPos
];
return
pRet
;
}
SvTreeEntryList
*
SvTreeList
::
GetChildList
(
SvTreeListEntry
*
pParent
)
const
{
if
(
!
pParent
)
pParent
=
pRootItem
;
return
pParent
->
pChildren
;
}
SvTreeListEntry
*
SvTreeList
::
GetParent
(
SvTreeListEntry
*
pEntry
)
const
{
SvTreeListEntry
*
pParent
=
pEntry
->
pParent
;
if
(
pParent
==
pRootItem
)
pParent
=
0
;
return
pParent
;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
svtools/source/contnr/treelistbox.cxx
Dosyayı görüntüle @
3fa955d7
...
@@ -667,6 +667,21 @@ sal_Bool SvTreeListBox::NotifyCopying(
...
@@ -667,6 +667,21 @@ sal_Bool SvTreeListBox::NotifyCopying(
return
NotifyMoving
(
pTarget
,
pEntry
,
rpNewParent
,
rNewChildPos
);
return
NotifyMoving
(
pTarget
,
pEntry
,
rpNewParent
,
rNewChildPos
);
}
}
SvTreeListEntry
*
SvTreeListBox
::
FirstChild
(
SvTreeListEntry
*
pParent
)
const
{
return
pModel
->
FirstChild
(
pParent
);
}
SvTreeListEntry
*
SvTreeListBox
::
NextSibling
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
NextSibling
(
pEntry
);
}
SvTreeListEntry
*
SvTreeListBox
::
PrevSibling
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
PrevSibling
(
pEntry
);
}
// return: all entries copied
// return: all entries copied
sal_Bool
SvTreeListBox
::
CopySelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
)
sal_Bool
SvTreeListBox
::
CopySelection
(
SvTreeListBox
*
pSource
,
SvTreeListEntry
*
pTarget
)
{
{
...
@@ -867,6 +882,16 @@ void SvTreeListBox::OnCurrentEntryChanged()
...
@@ -867,6 +882,16 @@ void SvTreeListBox::OnCurrentEntryChanged()
mpImpl
->
m_aQuickSelectionEngine
.
Reset
();
mpImpl
->
m_aQuickSelectionEngine
.
Reset
();
}
}
SvTreeListEntry
*
SvTreeListBox
::
GetEntry
(
SvTreeListEntry
*
pParent
,
sal_uLong
nPos
)
const
{
return
pModel
->
GetEntry
(
pParent
,
nPos
);
}
SvTreeListEntry
*
SvTreeListBox
::
GetEntry
(
sal_uLong
nRootPos
)
const
{
return
pModel
->
GetEntry
(
nRootPos
);
}
SvTreeListEntry
*
SvTreeListBox
::
GetEntryFromPath
(
const
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
SvTreeListEntry
*
SvTreeListBox
::
GetEntryFromPath
(
const
::
std
::
deque
<
sal_Int32
>&
_rPath
)
const
{
{
DBG_CHKTHIS
(
SvTreeListBox
,
0
);
DBG_CHKTHIS
(
SvTreeListBox
,
0
);
...
@@ -916,6 +941,21 @@ void SvTreeListBox::FillEntryPath( SvTreeListEntry* pEntry, ::std::deque< sal_In
...
@@ -916,6 +941,21 @@ void SvTreeListBox::FillEntryPath( SvTreeListEntry* pEntry, ::std::deque< sal_In
}
}
}
}
SvTreeListEntry
*
SvTreeListBox
::
GetParent
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
GetParent
(
pEntry
);
}
SvTreeListEntry
*
SvTreeListBox
::
GetRootLevelParent
(
SvTreeListEntry
*
pEntry
)
const
{
return
pModel
->
GetRootLevelParent
(
pEntry
);
}
sal_uLong
SvTreeListBox
::
GetChildCount
(
SvTreeListEntry
*
pParent
)
const
{
return
pModel
->
GetChildCount
(
pParent
);
}
sal_uLong
SvTreeListBox
::
GetLevelChildCount
(
SvTreeListEntry
*
_pParent
)
const
sal_uLong
SvTreeListBox
::
GetLevelChildCount
(
SvTreeListEntry
*
_pParent
)
const
{
{
DBG_CHKTHIS
(
SvTreeListBox
,
0
);
DBG_CHKTHIS
(
SvTreeListBox
,
0
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment