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
f42fee33
Kaydet (Commit)
f42fee33
authored
Eki 29, 2012
tarafından
Kohei Yoshida
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Eposta Yamaları
Sade Fark
Finally removed SvTreeEntryList.
Change-Id: I9e9f6fa6a198bbab7397f7e10a3c39ecdd9e00f9
üst
2a44d106
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
0 additions
and
166 deletions
+0
-166
treelist.hxx
svtools/inc/svtools/treelist.hxx
+0
-39
treelist.cxx
svtools/source/contnr/treelist.cxx
+0
-127
No files found.
svtools/inc/svtools/treelist.hxx
Dosyayı görüntüle @
f42fee33
...
@@ -63,45 +63,6 @@
...
@@ -63,45 +63,6 @@
#define SVLISTENTRYFLAG_NOT_SELECTABLE 0x0010
#define SVLISTENTRYFLAG_NOT_SELECTABLE 0x0010
class
SvTreeListEntry
;
class
SvTreeListEntry
;
class
SvTreeEntryList
{
private
:
typedef
std
::
vector
<
SvTreeListEntry
*>
ListType
;
ListType
maEntryList
;
public
:
typedef
ListType
::
const_iterator
const_iterator
;
typedef
ListType
::
iterator
iterator
;
SvTreeEntryList
();
SvTreeEntryList
(
const
SvTreeEntryList
&
rList
);
void
DestroyAll
();
void
push_back
(
SvTreeListEntry
*
pItem
);
void
insert
(
SvTreeListEntry
*
pItem
,
size_t
i
);
void
remove
(
SvTreeListEntry
*
pItem
);
void
remove
(
size_t
i
);
void
replace
(
SvTreeListEntry
*
pNew
,
SvTreeListEntry
*
pOld
);
void
clear
();
bool
empty
()
const
;
size_t
size
()
const
;
size_t
GetPos
(
const
SvTreeListEntry
*
pItem
)
const
;
SvTreeListEntry
*
operator
[](
size_t
i
);
const
SvTreeListEntry
*
operator
[](
size_t
i
)
const
;
const_iterator
begin
()
const
;
const_iterator
end
()
const
;
iterator
begin
();
iterator
end
();
SvTreeListEntry
*
front
();
SvTreeListEntry
*
back
();
};
class
SvListView
;
class
SvListView
;
class
SvViewData
class
SvViewData
...
...
svtools/source/contnr/treelist.cxx
Dosyayı görüntüle @
f42fee33
...
@@ -31,133 +31,6 @@
...
@@ -31,133 +31,6 @@
#include <stdio.h>
#include <stdio.h>
SvTreeEntryList
::
SvTreeEntryList
()
{}
void
SvTreeEntryList
::
push_back
(
SvTreeListEntry
*
pItem
)
{
maEntryList
.
push_back
(
pItem
);
}
void
SvTreeEntryList
::
insert
(
SvTreeListEntry
*
pItem
,
size_t
i
)
{
if
(
i
<
maEntryList
.
size
()
)
{
maEntryList
.
insert
(
maEntryList
.
begin
()
+
i
,
pItem
);
}
else
{
maEntryList
.
push_back
(
pItem
);
}
}
void
SvTreeEntryList
::
remove
(
SvTreeListEntry
*
pItem
)
{
for
(
std
::
vector
<
SvTreeListEntry
*>::
iterator
it
=
maEntryList
.
begin
();
it
!=
maEntryList
.
end
();
++
it
)
{
if
(
*
it
==
pItem
)
{
maEntryList
.
erase
(
it
);
break
;
}
}
}
void
SvTreeEntryList
::
remove
(
size_t
i
)
{
if
(
i
<
maEntryList
.
size
()
)
{
maEntryList
.
erase
(
maEntryList
.
begin
()
+
i
);
}
}
void
SvTreeEntryList
::
replace
(
SvTreeListEntry
*
pNew
,
SvTreeListEntry
*
pOld
)
{
for
(
size_t
i
=
0
,
n
=
maEntryList
.
size
();
i
<
n
;
++
i
)
{
if
(
maEntryList
[
i
]
==
pOld
)
{
maEntryList
[
i
]
=
pNew
;
break
;
}
}
}
void
SvTreeEntryList
::
clear
()
{
maEntryList
.
clear
();
}
bool
SvTreeEntryList
::
empty
()
const
{
return
maEntryList
.
empty
();
}
size_t
SvTreeEntryList
::
size
()
const
{
return
maEntryList
.
size
();
}
size_t
SvTreeEntryList
::
GetPos
(
const
SvTreeListEntry
*
pItem
)
const
{
for
(
size_t
i
=
0
,
n
=
maEntryList
.
size
();
i
<
n
;
++
i
)
{
if
(
maEntryList
[
i
]
==
pItem
)
{
return
i
;
}
}
return
(
size_t
)
~
0
;
}
SvTreeListEntry
*
SvTreeEntryList
::
operator
[](
size_t
i
)
{
return
i
<
maEntryList
.
size
()
?
maEntryList
[
i
]
:
NULL
;
}
const
SvTreeListEntry
*
SvTreeEntryList
::
operator
[](
size_t
i
)
const
{
return
i
<
maEntryList
.
size
()
?
maEntryList
[
i
]
:
NULL
;
}
SvTreeEntryList
::
const_iterator
SvTreeEntryList
::
begin
()
const
{
return
maEntryList
.
begin
();
}
SvTreeEntryList
::
const_iterator
SvTreeEntryList
::
end
()
const
{
return
maEntryList
.
end
();
}
SvTreeEntryList
::
iterator
SvTreeEntryList
::
begin
()
{
return
maEntryList
.
begin
();
}
SvTreeEntryList
::
iterator
SvTreeEntryList
::
end
()
{
return
maEntryList
.
end
();
}
SvTreeListEntry
*
SvTreeEntryList
::
front
()
{
return
maEntryList
.
front
();
}
SvTreeListEntry
*
SvTreeEntryList
::
back
()
{
return
maEntryList
.
back
();
}
void
SvTreeEntryList
::
DestroyAll
()
{
ListType
::
const_iterator
it
=
maEntryList
.
begin
(),
itEnd
=
maEntryList
.
end
();
for
(;
it
!=
itEnd
;
++
it
)
delete
*
it
;
}
SvTreeEntryList
::
SvTreeEntryList
(
const
SvTreeEntryList
&
rList
)
{
maEntryList
.
clear
();
for
(
size_t
i
=
0
,
n
=
rList
.
size
();
i
<
n
;
++
i
)
maEntryList
.
push_back
(
const_cast
<
SvTreeListEntry
*>
(
rList
[
i
]));
}
DBG_NAME
(
SvViewData
);
DBG_NAME
(
SvViewData
);
SvViewData
::
SvViewData
()
SvViewData
::
SvViewData
()
...
...
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