001: /*
002: * $Id: ObjectArrayIndex.java,v 1.4 2005/03/12 02:10:41 ahimanikya Exp $
003: * =======================================================================
004: * Copyright (c) 2002-2005 Axion Development Team. All rights reserved.
005: *
006: * Redistribution and use in source and binary forms, with or without
007: * modification, are permitted provided that the following conditions
008: * are met:
009: *
010: * 1. Redistributions of source code must retain the above
011: * copyright notice, this list of conditions and the following
012: * disclaimer.
013: *
014: * 2. Redistributions in binary form must reproduce the above copyright
015: * notice, this list of conditions and the following disclaimer in
016: * the documentation and/or other materials provided with the
017: * distribution.
018: *
019: * 3. The names "Tigris", "Axion", nor the names of its contributors may
020: * not be used to endorse or promote products derived from this
021: * software without specific prior written permission.
022: *
023: * 4. Products derived from this software may not be called "Axion", nor
024: * may "Tigris" or "Axion" appear in their names without specific prior
025: * written permission.
026: *
027: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
028: * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
029: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
030: * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
031: * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
032: * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
033: * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
034: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
035: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
036: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
037: * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
038: * =======================================================================
039: */
040:
041: package org.axiondb.engine.indexes;
042:
043: import java.util.ArrayList;
044: import java.util.List;
045:
046: import org.apache.commons.collections.primitives.IntList;
047: import org.axiondb.AxionException;
048: import org.axiondb.Column;
049: import org.axiondb.IndexLoader;
050: import org.axiondb.engine.ObjectArrayIndexLoader;
051:
052: /**
053: * An {@link BaseArrayIndex index}over <code>Object</code> keys.
054: *
055: * @version $Revision: 1.4 $ $Date: 2005/03/12 02:10:41 $
056: * @author Rodney Waldhoff
057: */
058: public class ObjectArrayIndex extends BaseArrayIndex {
059:
060: public ObjectArrayIndex(String name, Column column, boolean unique) {
061: super (name, column, unique);
062: _keys = new ArrayList();
063: }
064:
065: public ObjectArrayIndex(String name, Column column, boolean unique,
066: ArrayList keys, IntList values) {
067: super (name, column, unique, values);
068: _keys = keys;
069: }
070:
071: public IndexLoader getIndexLoader() {
072: return LOADER;
073: }
074:
075: public List getKeyList() {
076: return _keys;
077: }
078:
079: public void truncate() throws AxionException {
080: super .truncate();
081: if (_keys != null) {
082: _keys.clear();
083: }
084: }
085:
086: protected int find(Object seeking, boolean required) {
087: int high = _keys.size();
088: int low = 0;
089: int cur = 0;
090: boolean found = false;
091: while (low < high) {
092: cur = (high + low) / 2;
093: int comp = getComparator().compare(seeking, _keys.get(cur));
094: if (0 == comp) {
095: found = true;
096: break;
097: } else if (comp < 0) {
098: high = cur;
099: } else { // if(comp > 0)
100: if (low == cur) {
101: cur++;
102: }
103: low = cur;
104: }
105: }
106: if (!isUnique()) {
107: while (cur > 0
108: && getComparator().compare(seeking,
109: _keys.get(cur - 1)) == 0) {
110: cur--;
111: }
112: }
113: if (!found) {
114: return required ? -1 : cur;
115: }
116: return cur;
117: }
118:
119: protected List getKeyList(int minIndex, int maxIndex) {
120: return _keys.subList(minIndex, maxIndex);
121: }
122:
123: protected int insertKey(Object seeking) throws AxionException {
124: int high = _keys.size();
125: int low = 0;
126: int cur = 0;
127: while (low < high) {
128: cur = (high + low) / 2;
129: int comp = getComparator().compare(seeking, _keys.get(cur));
130: if (0 == comp) {
131: if (isUnique()) {
132: throw new AxionException("Expected "
133: + getIndexedColumn()
134: + " to be unique, found " + seeking
135: + " already.");
136: }
137: break;
138: } else if (comp < 0) {
139: high = cur;
140: } else { // if(comp > 0)
141: if (low == cur) {
142: cur++;
143: }
144: low = cur;
145: }
146: }
147: _keys.add(cur, seeking);
148: return cur;
149: }
150:
151: protected int removeKey(Comparable seeking) throws AxionException {
152: int index = find(seeking, true);
153: if (-1 != index) {
154: _keys.remove(index);
155: }
156: return index;
157: }
158:
159: protected int removeKey(Object value) throws AxionException {
160: return removeKey((Comparable) value);
161: }
162:
163: protected void removeKeyAt(int index) throws AxionException {
164: _keys.remove(index);
165: }
166:
167: private static final IndexLoader LOADER = new ObjectArrayIndexLoader();
168:
169: private ArrayList _keys = null;
170: }
|