KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > eclipse > jdt > internal > compiler > util > CompoundNameVector


1 /*******************************************************************************
2  * Copyright (c) 2000, 2006 IBM Corporation and others.
3  * All rights reserved. This program and the accompanying materials
4  * are made available under the terms of the Eclipse Public License v1.0
5  * which accompanies this distribution, and is available at
6  * http://www.eclipse.org/legal/epl-v10.html
7  *
8  * Contributors:
9  * IBM Corporation - initial API and implementation
10  *******************************************************************************/
11 package org.eclipse.jdt.internal.compiler.util;
12
13 import org.eclipse.jdt.core.compiler.CharOperation;
14
15 public final class CompoundNameVector {
16     static int INITIAL_SIZE = 10;
17     
18     public int size;
19     int maxSize;
20     char[][][] elements;
21 public CompoundNameVector() {
22     maxSize = INITIAL_SIZE;
23     size = 0;
24     elements = new char[maxSize][][];
25 }
26 public void add(char[][] newElement) {
27     if (size == maxSize) // knows that size starts <= maxSize
28 System.arraycopy(elements, 0, (elements = new char[maxSize *= 2][][]), 0, size);
29     elements[size++] = newElement;
30 }
31 public void addAll(char[][][] newElements) {
32     if (size + newElements.length >= maxSize) {
33         maxSize = size + newElements.length; // assume no more elements will be added
34 System.arraycopy(elements, 0, (elements = new char[maxSize][][]), 0, size);
35     }
36     System.arraycopy(newElements, 0, elements, size, newElements.length);
37     size += newElements.length;
38 }
39 public boolean contains(char[][] element) {
40     for (int i = size; --i >= 0;)
41         if (CharOperation.equals(element, elements[i]))
42             return true;
43     return false;
44 }
45 public char[][] elementAt(int index) {
46     return elements[index];
47 }
48 public char[][] remove(char[][] element) {
49     // assumes only one occurrence of the element exists
50 for (int i = size; --i >= 0;)
51         if (element == elements[i]) {
52             // shift the remaining elements down one spot
53 System.arraycopy(elements, i + 1, elements, i, --size - i);
54             elements[size] = null;
55             return element;
56         }
57     return null;
58 }
59 public void removeAll() {
60     for (int i = size; --i >= 0;)
61         elements[i] = null;
62     size = 0;
63 }
64 public String JavaDoc toString() {
65     StringBuffer JavaDoc buffer = new StringBuffer JavaDoc();
66     for (int i = 0; i < size; i++) {
67         buffer.append(CharOperation.toString(elements[i])).append("\n"); //$NON-NLS-1$
68 }
69     return buffer.toString();
70 }
71 }
72
Popular Tags