001: /*
002: * $Id: TTreeIndex.java,v 1.1 2005/06/30 01:14:44 ahimanikya Exp $
003: * =======================================================================
004: * Copyright (c) 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.ext.indexes.ttree;
042:
043: import java.io.File;
044:
045: import org.apache.commons.collections.primitives.ArrayIntList;
046: import org.apache.commons.collections.primitives.IntCollections;
047: import org.apache.commons.collections.primitives.IntListIterator;
048: import org.apache.commons.logging.Log;
049: import org.apache.commons.logging.LogFactory;
050: import org.axiondb.AxionException;
051: import org.axiondb.Column;
052: import org.axiondb.Function;
053: import org.axiondb.Index;
054: import org.axiondb.IndexLoader;
055: import org.axiondb.Row;
056: import org.axiondb.RowIterator;
057: import org.axiondb.RowSource;
058: import org.axiondb.Table;
059: import org.axiondb.engine.indexes.BaseIndex;
060: import org.axiondb.engine.rowiterators.EmptyRowIterator;
061: import org.axiondb.engine.rowiterators.LazyRowRowIterator;
062: import org.axiondb.event.RowEvent;
063: import org.axiondb.functions.ComparisonFunction;
064: import org.axiondb.functions.EqualFunction;
065: import org.axiondb.functions.GreaterThanFunction;
066: import org.axiondb.functions.GreaterThanOrEqualFunction;
067: import org.axiondb.functions.IsNotNullFunction;
068: import org.axiondb.functions.IsNullFunction;
069: import org.axiondb.functions.LessThanFunction;
070: import org.axiondb.functions.LessThanOrEqualFunction;
071:
072: /**
073: * Base implementation for T-Tree based {@link Index indices}.
074: *
075: * @version $Revision: 1.1 $ $Date: 2005/06/30 01:14:44 $
076: * @author Pavels Andrejevs
077: */
078: public abstract class TTreeIndex extends BaseIndex implements Index {
079:
080: public static final int DEFAULT_MAXNODESIZE = 100;
081:
082: protected static Log log = LogFactory.getLog(TTreeIndex.class);
083:
084: protected TTree _tree;
085:
086: // ---------------------------------------------------------------------
087:
088: public TTreeIndex(String name, Column column, boolean unique)
089: throws AxionException {
090: super (name, column, unique);
091: }
092:
093: public final void changeRowId(Table table, Row row, int oldId,
094: int newId) throws AxionException {
095: try {
096: int colnum = table.getColumnIndex(getIndexedColumn()
097: .getName());
098: Object key = row.get(colnum);
099: _tree.replace(key, oldId, newId);
100:
101: } catch (AxionException e) {
102: String msg = "Unable to change row id";
103: log.error(msg, e);
104: throw new AxionException(msg, e);
105: }
106: }
107:
108: public abstract IndexLoader getIndexLoader();
109:
110: public final RowIterator getInorderRowIterator(RowSource source)
111: throws AxionException {
112: IntListIterator resultIds = null;
113: try {
114: resultIds = _tree.getInorderIterator();
115: } catch (AxionException e) {
116: String msg = "Unable to retrieve values from index"
117: + getName();
118: log.error(msg, e);
119: throw new AxionException(msg, e);
120: }
121: return new LazyRowRowIterator(source, resultIds, _tree.size());
122: }
123:
124: public final RowIterator getRowIterator(RowSource source,
125: Function function, Object value) throws AxionException {
126:
127: IntListIterator resultIds = null;
128: if (function instanceof ComparisonFunction) {
129: Object convertedValue = getIndexedColumn().getDataType()
130: .convert(value);
131:
132: if (null == convertedValue) {
133: // null fails all comparisions I support
134: return EmptyRowIterator.INSTANCE;
135: }
136:
137: if (function instanceof EqualFunction) {
138: if (!isUnique()) {
139: resultIds = _tree.getAll(convertedValue);
140: } else {
141: Integer result = _tree.get(convertedValue);
142: if (result == null) {
143: resultIds = IntCollections
144: .getEmptyIntListIterator();
145: } else {
146: resultIds = IntCollections
147: .singletonIntListIterator(result
148: .intValue());
149: }
150: }
151: } else if (function instanceof LessThanFunction) {
152: resultIds = _tree.select(null, convertedValue, false);
153: } else if (function instanceof LessThanOrEqualFunction) {
154: resultIds = _tree.select(null, convertedValue, true);
155: } else if (function instanceof GreaterThanFunction) {
156: resultIds = _tree.select(convertedValue, null, false);
157: } else if (function instanceof GreaterThanOrEqualFunction) {
158: resultIds = _tree.select(convertedValue, null, true);
159: } else {
160: throw new AxionException("Unsupported function "
161: + function);
162: }
163: } else if (function instanceof IsNotNullFunction) {
164: resultIds = _tree.getAllNotNull();
165: } else if (function instanceof IsNullFunction) {
166: resultIds = _tree.getAllNull();
167: } else {
168: throw new AxionException("Unsupported function " + function);
169: }
170:
171: ArrayIntList ids = new ArrayIntList();
172: while (resultIds.hasNext()) {
173: ids.add(resultIds.next());
174: }
175: return new LazyRowRowIterator(source, ids.listIterator(), ids
176: .size());
177: }
178:
179: public TTree getTTree() {
180: return _tree;
181: }
182:
183: public String getType() {
184: return Index.TTREE;
185: }
186:
187: public final void rowDeleted(RowEvent event) throws AxionException {
188: String colName = getIndexedColumn().getName();
189: int colIndex = event.getTable().getColumnIndex(colName);
190: Object key = event.getOldRow().get(colIndex);
191: key = (key == null) ? _tree.getNullKey() : key;
192: int rowId = event.getOldRow().getIdentifier();
193:
194: try {
195: _tree.delete(key, rowId);
196: } catch (AxionException e) {
197: String msg = "Unable to delete from index " + getName();
198: log.error(msg, e);
199: throw new AxionException(msg, e);
200: }
201: }
202:
203: // TABLE MODIFICATION LISTENER
204: // ---------------------------------------------------------------------
205:
206: public final void rowInserted(RowEvent event) throws AxionException {
207: String colName = getIndexedColumn().getName();
208: int colIndex = event.getTable().getColumnIndex(colName);
209: Object key = event.getNewRow().get(colIndex);
210: int rowId = event.getNewRow().getIdentifier();
211:
212: try {
213: if (key == null) {
214: key = _tree.getNullKey();
215: _tree.insert(key, rowId, false);
216: } else {
217: _tree.insert(key, rowId, isUnique());
218: }
219: } catch (AxionException e) {
220: String msg = "Unable to insert into index " + getName();
221: log.error(msg, e);
222: throw new AxionException(msg, e);
223: }
224: }
225:
226: public final void rowUpdated(RowEvent event) throws AxionException {
227: rowDeleted(event);
228: rowInserted(event);
229: }
230:
231: public void save(File dataDirectory) throws AxionException {
232: getIndexLoader().saveIndex(this , dataDirectory);
233: }
234:
235: public void saveAfterTruncate(File dataDirectory)
236: throws AxionException {
237: getIndexLoader().saveIndexAfterTruncate(this , dataDirectory);
238: }
239:
240: public boolean supportsFunction(Function fn) {
241: if (fn instanceof EqualFunction) {
242: return true;
243: } else if (fn instanceof LessThanFunction) {
244: return true;
245: } else if (fn instanceof LessThanOrEqualFunction) {
246: return true;
247: } else if (fn instanceof GreaterThanFunction) {
248: return true;
249: } else if (fn instanceof GreaterThanOrEqualFunction) {
250: return true;
251: } else if (fn instanceof IsNotNullFunction) {
252: return true;
253: } else if (fn instanceof IsNullFunction) {
254: return true;
255: } else {
256: return false;
257: }
258: }
259:
260: public void truncate() throws AxionException {
261: _tree.truncate();
262: }
263:
264: }
|