/
LSPContainer.java
86 lines (74 loc) · 2.69 KB
/
LSPContainer.java
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
/*
* Copyright (c) 2001-2004, Mikael Ståldal
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the author nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*
* Note: This is known as "the modified BSD license". It's an approved
* Open Source and Free Software license, see
* http://www.opensource.org/licenses/
* and
* http://www.gnu.org/philosophy/license-list.html
*/
package nu.staldal.lsp.compile;
import java.util.ArrayList;
import org.xml.sax.Locator;
public abstract class LSPContainer extends LSPNode
{
private ArrayList<LSPNode> children;
public LSPContainer(int capacity, Locator locator)
{
super(locator);
if (capacity >= 0)
children = new ArrayList<LSPNode>(capacity);
else
children = new ArrayList<LSPNode>();
}
public int numberOfChildren()
{
return children.size();
}
public LSPNode getChild(int index)
throws ArrayIndexOutOfBoundsException
{
return children.get(index);
}
public void addChild(LSPNode newChild)
{
children.add(newChild);
}
public LSPNode replaceChild(LSPNode newChild, int index)
throws ArrayIndexOutOfBoundsException
{
LSPNode oldChild = children.get(index);
children.set(index, newChild);
return oldChild;
}
}