blob: c7b40e6361823aa190eb7ed8642c3d2efd0902e2 (
plain) (
blame)
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/*******************************************************************************
* Copyright (c) 2001, 2004 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
* Jens Lukowski/Innoopract - initial renaming/restructuring
*
*******************************************************************************/
package org.eclipse.wst.sse.core.internal.text;
import java.util.Enumeration;
import org.eclipse.wst.sse.core.text.IStructuredDocumentRegion;
import org.eclipse.wst.sse.core.text.IStructuredDocumentRegionList;
public class CoreNodeList implements IStructuredDocumentRegionList {
int countedLength;
int currentIndex = -1;
//com.ibm.sed.interfaces.core.Core
IStructuredDocumentRegion[] flatNodes;
//com.ibm.sed.interfaces.core.Core
IStructuredDocumentRegion head;
/**
* CoreNodeList constructor comment.
*/
public CoreNodeList() {
super();
// create an array, even if zero length
flatNodes = new IStructuredDocumentRegion[0];
}
public CoreNodeList(IStructuredDocumentRegion newHead) {
super();
// save head
head = newHead;
int count = 0;
IStructuredDocumentRegion countNode = newHead;
// we have to go through the list once, to get its
// length in order to create the array
while (countNode != null) {
count++;
countNode = countNode.getNext();
}
// create an array, even if zero length
flatNodes = new IStructuredDocumentRegion[count];
// start countNode over again, so to speak.
countNode = newHead;
count = 0;
while (countNode != null) {
flatNodes[count++] = countNode;
countNode = countNode.getNext();
}
if (count > 0) {
currentIndex = 0;
// else it stays at -1 initialized at object creation
//
// save length
countedLength = count;
}
}
public CoreNodeList(IStructuredDocumentRegion start, IStructuredDocumentRegion end) {
super();
// save head
head = start;
int count = 0;
IStructuredDocumentRegion countNode = start;
if ((start == null) || (end == null)) {
// error condition
//throw new IllegalArgumentException("Must provide start and end
// nodes to construct CoreNodeList");
} else {
count = 1;
while ((countNode != null) && (countNode != end)) {
count++;
countNode = countNode.getNext();
}
}
// if we ended because the last one was null,
// backup one.
if (countNode == null)
count--;
if (count < 0) {
count = 0;
}
flatNodes = new IStructuredDocumentRegion[count];
if (count > 0) {
flatNodes[0] = countNode = start;
for (int i = 1; i < count; i++) {
flatNodes[i] = flatNodes[i - 1].getNext();
}
}
currentIndex = 0;
countedLength = count;
}
public Enumeration elements() {
StructuredDocumentRegionEnumeration result = null;
if ((flatNodes != null) && (flatNodes.length > 0))
result = new StructuredDocumentRegionEnumeration(flatNodes[0], flatNodes[flatNodes.length - 1]);
else
result = new StructuredDocumentRegionEnumeration(null);
return result;
}
public int getLength() {
return flatNodes.length;
}
public boolean includes(Object o) {
if (flatNodes == null)
return false;
for (int i = 0; i < flatNodes.length; i++)
if (flatNodes[i] == o)
return true;
return false;
}
public IStructuredDocumentRegion item(int i) {
return flatNodes[i];
}
}
|
