@Override public Tuple<V, V> next() { // We can now return the found value V value = dupKeyValues[pos]; pos++; return new Tuple<V, V>( value, value ); }
@Override public Tuple<Integer, Integer> readUnsortedTuple( DataInputStream in ) { try { if ( in.available() <= 0 ) { return null; } Tuple<Integer, Integer> t = new Tuple<Integer, Integer>( in.readInt(), in.readInt() ); return t; } catch ( IOException e ) { e.printStackTrace(); } return null; } }
Tuple<K, Integer> newTuple = new Tuple<K, Integer>( readTuples[tupleCandidate.value].key, tupleCandidate.value ); candidates.put( newTuple, readTuples[tupleCandidate.value].getValue() );
sortedTuples[pos] = new Tuple<K, Set<V>>(); sortedTuples[pos].key = entry.getKey(); sortedTuples[pos].value = entry.getValue();
/** * {@inheritDoc} */ public Tuple<K, V> findLeftMost() throws IOException { V val = null; val = values[0].getCursor().next(); return new Tuple<K, V>( getKey( 0 ), val ); }
Tuple<Dn, E> t = new Tuple<Dn, E>(); t.setKey( new Dn( in.readUTF() ) );
/** * {@inheritDoc} */ public Tuple<K, V> findLeftMost() throws IOException { K key = keys[0].getKey(); boolean isSubTree = ( btree.getType() == PERSISTED_SUB ); if ( isSubTree ) { return new Tuple<K, V>( key, null ); } ValueCursor<V> cursor = values[0].getCursor(); try { cursor.beforeFirst(); if ( cursor.hasNext() ) { return new Tuple<K, V>( key, cursor.next() ); } else { // Null value return new Tuple<K, V>( key, null ); } } finally { cursor.close(); } }
/** * {@inheritDoc} */ public Tuple<K, V> findRightMost() throws EndOfFileExceededException, IOException { K key = keys[nbElems - 1].getKey(); boolean isSubTree = ( btree.getType() == PERSISTED_SUB ); if ( isSubTree ) { return new Tuple<K, V>( key, null ); } ValueCursor<V> cursor = values[nbElems - 1].getCursor(); try { cursor.afterLast(); if ( cursor.hasPrev() ) { return new Tuple<K, V>( key, cursor.prev() ); } else { // Null value return new Tuple<K, V>( key, null ); } } finally { cursor.close(); } }
Tuple<K, Set<V>> tuple = new Tuple<K, Set<V>>(); tuple.value = new TreeSet<V>();
/** * {@inheritDoc} */ public Tuple<K, V> findRightMost() throws EndOfFileExceededException, IOException { V val = null; ValueCursor<V> valueCursor = values[nbElems - 1].getCursor(); valueCursor.afterLast(); val = valueCursor.prev(); return new Tuple<K, V>( getKey( nbElems - 1 ), val ); }
SortedFile sortedFile = new SortedFile( file, nbReads ); Tuple<Iterator<Tuple<K, Set<V>>>, SortedFile> result = new Tuple<Iterator<Tuple<K, Set<V>>>, SortedFile>( uniqueIterator, sortedFile );
t = new Tuple<Dn, E>();
Tuple<K, V> tuple = new Tuple<K, V>(); tuple.setKey( leaf.getKey( parentPos.pos ) );
Tuple<K, Integer> candidate = new Tuple<K, Integer>( readTuples[i].key, i, btree.getKeySerializer() .getComparator() );
Tuple<K, V> tuple = new Tuple<K, V>( leaf.getKey( parentPos.pos ), value );
Tuple<K, V> tuple = new Tuple<K, V>( leaf.getKey( parentPos.pos ), value );
Tuple<K, V> tuple = new Tuple<K, V>(); tuple.setKey( leaf.getKey( parentPos.pos ) );
removedElement = new Tuple<K, V>( getKey( index ), valueHolder.getCursor().next() ); // the entire value was removed keyRemoved = true; removedElement = new Tuple<K, V>( getKey( index ), null ); // the entire value was removed keyRemoved = true; removedElement = new Tuple<K, V>( getKey( index ), value ); // the entire value was removed