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
113
114
115
|
//
// Copyright 2006 Jim Bublitz <jbublitz@nwinternet.com>
// Earlier copyrights 1998 - 2005 Jim Bublitz and/or Phil Thompson
// may also apply
// Generated by preSip
// module khtml version KDE 3.5.3
// This software is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of
// the License, or (at your option) any later version.
//
// This software 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public
// License along with this library; see the file COPYING.
// If not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
namespace DOM
{
class RangeException
{
%TypeHeaderCode
#include <dom2_range.h>
%End
public:
RangeException (ushort);
RangeException (const DOM::RangeException&);
enum RangeExceptionCode
{
BAD_BOUNDARYPOINTS_ERR,
INVALID_NODE_TYPE_ERR,
_EXCEPTION_OFFSET,
_EXCEPTION_MAX
};
ushort code;
}; // class RangeException
class Range
{
%TypeHeaderCode
#include <dom2_range.h>
%End
public:
Range ();
Range (const DOM::Document);
Range (const DOM::Range&);
Range (const DOM::Node, const long, const DOM::Node, const long);
DOM::Node startContainer () const;
long startOffset () const;
DOM::Node endContainer () const;
long endOffset () const;
bool collapsed () const;
DOM::Node commonAncestorContainer ();
void setStart (const DOM::Node&, long);
void setEnd (const DOM::Node&, long);
void setStartBefore (const DOM::Node&);
void setStartAfter (const DOM::Node&);
void setEndBefore (const DOM::Node&);
void setEndAfter (const DOM::Node&);
void collapse (bool);
void selectNode (const DOM::Node&);
void selectNodeContents (const DOM::Node&);
enum CompareHow
{
START_TO_START,
START_TO_END,
END_TO_END,
END_TO_START
};
short compareBoundaryPoints (DOM::Range::CompareHow, const DOM::Range&);
bool boundaryPointsValid ();
void deleteContents ();
DOM::DocumentFragment extractContents ();
DOM::DocumentFragment cloneContents ();
void insertNode (const DOM::Node&);
void surroundContents (const DOM::Node&);
DOM::Range cloneRange ();
DOM::DOMString toString ();
DOM::DOMString toHTML ();
%If ( KDE_3_2_0 - )
DOM::DocumentFragment createContextualFragment (const DOM::DOMString&);
%End
void detach ();
bool isDetached () const;
//ig RangeImpl* handle () const;
bool isNull () const;
protected:
//ig Range (RangeImpl*);
}; // class Range
}; // namespace DOM
|
