1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
Copyright (C) 2001-2003 KSVG Team
This file is part of the KDE project
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "SVGPathSegList.h"
#include "SVGPathSegListImpl.h"
using namespace KSVG;
SVGPathSegList::SVGPathSegList()
{
impl = new SVGPathSegListImpl();
impl->ref();
}
SVGPathSegList::SVGPathSegList(const SVGPathSegList &other)
{
(*this) = other;
}
SVGPathSegList &SVGPathSegList::operator=(const SVGPathSegList &other)
{
if(impl == other.impl)
return *this;
if(impl)
impl->deref();
impl = other.impl;
if(impl)
impl->ref();
return *this;
}
SVGPathSegList::SVGPathSegList(SVGPathSegListImpl *other)
{
impl = other;
if(impl)
impl->ref();
}
SVGPathSegList::~SVGPathSegList()
{
if(impl)
impl->deref();
}
unsigned long SVGPathSegList::numberOfItems() const
{
if(!impl) return 0;
return impl->numberOfItems();
}
void SVGPathSegList::clear()
{
if(impl)
impl->clear();
}
SVGPathSeg *SVGPathSegList::initialize(SVGPathSeg *newItem)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->initialize(newItem->handle()));
}
SVGPathSeg *SVGPathSegList::getItem(unsigned long index)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->getItem(index));
}
SVGPathSeg *SVGPathSegList::insertItemBefore(SVGPathSeg *newItem, unsigned long index)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->insertItemBefore(newItem->handle(), index));
}
SVGPathSeg *SVGPathSegList::replaceItem(SVGPathSeg *newItem, unsigned long index)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->replaceItem(newItem->handle(), index));
}
SVGPathSeg *SVGPathSegList::removeItem(unsigned long index)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->removeItem(index));
}
SVGPathSeg *SVGPathSegList::appendItem(SVGPathSeg *newItem)
{
if(!impl) return new SVGPathSeg(0);
return new SVGPathSeg(impl->appendItem(newItem->handle()));
}
|
