
org.zoodb.jdo.internal.util.OrderedMergeIterator Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of parent Show documentation
Show all versions of parent Show documentation
ZooDB Java JDO Object Database.
The newest version!
/*
* Copyright 2009-2013 Tilmann Zaeschke. All rights reserved.
*
* This file is part of ZooDB.
*
* ZooDB is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* ZooDB is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with ZooDB. If not, see .
*
* See the README and COPYING files for further information.
*/
package org.zoodb.jdo.internal.util;
import java.util.ArrayList;
import java.util.NoSuchElementException;
import org.zoodb.jdo.internal.server.index.PagedUniqueLongLong.LLEntry;
/**
* This merging iterator merges multiple iterators into a single one.
* The returned results are ordered in the natural (Java) order.
* The iterator expects the sub-iterators to be sorted.
*
* TODO For queries across multiple nodes, merge asynchronously by running sub-iterators in
* different threads and merge the result as they arrive.
*
* @author Tilmann Zaeschke
*
*/
public class OrderedMergeIterator implements CloseableIterator {
private final ArrayList> iterators =
new ArrayList>();
private final ArrayList currentValues;
private LLEntry current;
private final IteratorRegistry registry;
public OrderedMergeIterator(CloseableIterator[] iterators) {
this(null, iterators);
}
public OrderedMergeIterator(IteratorRegistry registry, CloseableIterator[] iterators) {
this.registry = registry;
if (registry != null) {
registry.registerIterator(this);
}
//init values
currentValues = new ArrayList();
for (int i = 0; i < iterators.length; i++) {
CloseableIterator iter = iterators[i];
if (iter.hasNext()) {
this.iterators.add(iter);
currentValues.add(iter.next());
}
}
//find smallest value
if (!currentValues.isEmpty()) {
int currentPos = 0;
current = currentValues.get(0);
for (int i = 1; i < currentValues.size(); i++) {
if (current.getKey() > currentValues.get(i).getKey()) {
currentPos = i;
current = currentValues.get(i);
}
}
//refill
getNext(currentPos);
}
}
private void getNext(int currentPos) {
CloseableIterator iter = iterators.get(currentPos);
if (iter.hasNext()) {
currentValues.set(currentPos, iter.next());
} else {
iter.close();
iterators.remove(currentPos);
currentValues.remove(currentPos);
}
}
@Override
public boolean hasNext() {
if (current == null) {
return false;
}
return true;
}
@Override
public LLEntry next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
LLEntry dummy = current;
//find smallest value
if (currentValues.isEmpty()) {
current = null;
} else {
int currentPos = 0;
current = currentValues.get(0);
for (int i = 1; i < currentValues.size(); i++) {
if (current.getKey() > currentValues.get(i).getKey()) {
currentPos = i;
current = currentValues.get(i);
}
}
//refill
getNext(currentPos);
}
return dummy;
}
@Override
public void remove() {
throw new UnsupportedOperationException();
//current.remove();
}
@Override
public void close() {
for (CloseableIterator> i: iterators) {
i.close();
}
if (registry != null) {
registry.deregisterIterator(this);
}
}
@Override
public void refresh() {
for (CloseableIterator> it: iterators) {
it.refresh();
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy