@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 int compare( Tuple<Dn, String> t1, Tuple<Dn, String> t2 ) { Dn dn1 = t1.getKey(); Dn dn2 = t2.getKey(); if ( dn1.isAncestorOf( dn2 ) ) { return -1; } else if ( dn2.isAncestorOf( dn1 ) ) { return 1; } else if ( dn1.equals( dn2 ) ) { return 0; } return comparator.compare( dn1, dn2 ); } }
int nbValues = tuple.getValue().size(); fos.write( IntSerializer.serialize( nbValues ) ); for ( V value : tuple.getValue() ) SortedFile sortedFile = new SortedFile( file, nbReads ); Tuple<Iterator<Tuple<K, Set<V>>>, SortedFile> result = new Tuple<Iterator<Tuple<K, Set<V>>>, SortedFile>( uniqueIterator, sortedFile );
@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; } }
private void injectTuple( BTree<K, V> btree, InMemoryLeaf<K, V> leaf, int leafPos, Tuple<K, V> tuple ) { BTreeFactory.setKey( btree, leaf, leafPos, tuple.getKey() ); ValueHolder<V> valueHolder = new InMemoryValueHolder<V>( btree, tuple.getValue() ); BTreeFactory.setValue( btree, leaf, leafPos, valueHolder ); }
sortedTuples[pos] = new Tuple<K, Set<V>>(); sortedTuples[pos].key = entry.getKey(); sortedTuples[pos].value = entry.getValue();
.findLeftMost().getKey() );
/** * gets a list of all the copied pages of a given B-Tree. * * @param name the name of the B-Tree * @return list of RevisionOffset * @throws Exception */ private List<RevisionOffset> getRevisions( String name ) throws Exception { TupleCursor<RevisionName, long[]> cursor = rm.copiedPageBtree.browse(); List<RevisionOffset> lst = new ArrayList<RevisionOffset>(); while ( cursor.hasNext() ) { Tuple<RevisionName, long[]> t = cursor.next(); RevisionName rn = t.getKey(); if ( name.equals( rn.getName() ) ) { //System.out.println( t.getValue() ); lst.add( new RevisionOffset( rn.getRevision(), t.getValue() ) ); } } cursor.close(); return lst; } }