Examples of org.apache.accumulo.core.iterators.SortedMapIterator

Package org.apache.accumulo.core.iterators

Examples of org.apache.accumulo.core.iterators.SortedMapIterator

org.apache.accumulo.core.iterators.SortedMapIterator
A simple iterator over a Java SortedMap Note that this class is intended as an in-memory replacement for RFile$Reader, so its behavior reflects the same assumptions; namely, that this iterator is not responsible for respecting the columnFamilies passed into seek(). If you want a Map-backed Iterator that returns only sought CFs, construct a new ColumnFamilySkippingIterator(new SortedMapIterator(map)). @see org.apache.accumulo.core.iterators.system.ColumnFamilySkippingIterator

    nkv(tm1, 3, 0, false, "1");
    nkv(tm1, 4, 0, false, "2");
    nkv(tm1, 6, 0, false, "3");
    
    List<SortedKeyValueIterator<Key,Value>> skvil = new ArrayList<SortedKeyValueIterator<Key,Value>>(1);
    skvil.add(new SortedMapIterator(tm1));
    MultiIterator mi = new MultiIterator(skvil, true);
    mi.seek(new Range(null, true, nk(5, 9), false), EMPTY_COL_FAMS, false);
    
    assertTrue(mi.hasTop());
    assertTrue(mi.getTopKey().equals(nk(3, 0)));

View Full Code Here

    nkv(tm1, 1, 0, false, "7");
    nkv(tm1, 2, 1, false, "8");
    nkv(tm1, 2, 0, false, "9");
    
    List<SortedKeyValueIterator<Key,Value>> skvil = new ArrayList<SortedKeyValueIterator<Key,Value>>(1);
    skvil.add(new SortedMapIterator(tm1));
    
    KeyExtent extent = new KeyExtent(new Text("tablename"), nr(1), nr(0));
    MultiIterator mi = new MultiIterator(skvil, extent);
    
    Range r1 = new Range((Text) null, (Text) null);

View Full Code Here

    put(tm1, "r2", "cf1", "cq1", 5, "v3");
    put(tm1, "r2", "cf2", "cq4", 5, "v4");
    put(tm1, "r2", "cf2", "cq5", 5, "v5");
    put(tm1, "r3", "cf3", "cq6", 5, "v6");
    
    ColumnFamilySkippingIterator cfi = new ColumnFamilySkippingIterator(new SortedMapIterator(tm1));
    
    cfi.seek(new Range(), EMPTY_SET, true);
    assertFalse(cfi.hasTop());
    
    cfi.seek(new Range(), EMPTY_SET, false);

View Full Code Here

    HashSet<ByteSequence> allColfams = new HashSet<ByteSequence>();
    for (int cf = 0; cf < 1000; cf++) {
      allColfams.add(new ArrayByteSequence(String.format("%06d", cf)));
    }
    
    ColumnFamilySkippingIterator cfi = new ColumnFamilySkippingIterator(new SortedMapIterator(tm1));
    HashSet<ByteSequence> colfams = new HashSet<ByteSequence>();
    
    runTest(cfi, 30000, 0, allColfams, colfams);
    
    colfams.add(new ArrayByteSequence(String.format("%06d", 60)));

View Full Code Here

          put(tm1, r, cf, cq, 6, r * cf * cq);
        }
      }
    }
    
    CountingIterator ci = new CountingIterator(new SortedMapIterator(tm1));
    ColumnFamilySkippingIterator cfi = new ColumnFamilySkippingIterator(ci);
    HashSet<ByteSequence> colfams = new HashSet<ByteSequence>();
    colfams.add(new ArrayByteSequence(String.format("%06d", 4)));
    
    Range range = new Range(nk(0, 4, 0, 6), true, nk(0, 400, 0, 6), true);

View Full Code Here

    TreeMap<Key,Value> tm1 = new TreeMap<Key,Value>();
    put(tm1, "r1", "cf1", "cq1", 5, "v1");
    put(tm1, "r1", "cf1", "cq3", 5, "v2");
    put(tm1, "r2", "cf1", "cq1", 5, "v3");
    
    SortedMapIterator smi = new SortedMapIterator(tm1);
    TestDataSource tds = new TestDataSource(smi);
    SourceSwitchingIterator ssi = new SourceSwitchingIterator(tds);
    
    ssi.seek(new Range(), new ArrayList<ByteSequence>(), false);
    ane(ssi, "r1", "cf1", "cq1", 5, "v1", true);

View Full Code Here

    TreeMap<Key,Value> tm1 = new TreeMap<Key,Value>();
    put(tm1, "r1", "cf1", "cq1", 5, "v1");
    put(tm1, "r1", "cf1", "cq3", 5, "v2");
    put(tm1, "r2", "cf1", "cq1", 5, "v3");
    
    SortedMapIterator smi = new SortedMapIterator(tm1);
    TestDataSource tds = new TestDataSource(smi);
    SourceSwitchingIterator ssi = new SourceSwitchingIterator(tds);
    
    ssi.seek(new Range(), new ArrayList<ByteSequence>(), false);
    ane(ssi, "r1", "cf1", "cq1", 5, "v1", true);
    
    TreeMap<Key,Value> tm2 = new TreeMap<Key,Value>();
    put(tm2, "r1", "cf1", "cq1", 5, "v4");
    put(tm2, "r1", "cf1", "cq3", 5, "v5");
    put(tm2, "r2", "cf1", "cq1", 5, "v6");
    
    SortedMapIterator smi2 = new SortedMapIterator(tm2);
    TestDataSource tds2 = new TestDataSource(smi2);
    tds.next = tds2;
    
    ane(ssi, "r1", "cf1", "cq3", 5, "v2", true);
    ane(ssi, "r2", "cf1", "cq1", 5, "v6", true);

View Full Code Here

    put(tm1, "r1", "cf1", "cq3", 5, "v3");
    put(tm1, "r1", "cf1", "cq4", 5, "v4");
    put(tm1, "r3", "cf1", "cq1", 5, "v5");
    put(tm1, "r3", "cf1", "cq2", 5, "v6");
    
    SortedMapIterator smi = new SortedMapIterator(tm1);
    TestDataSource tds = new TestDataSource(smi);
    SourceSwitchingIterator ssi = new SourceSwitchingIterator(tds, true);
    
    ssi.seek(new Range(), new ArrayList<ByteSequence>(), false);
    ane(ssi, "r1", "cf1", "cq1", 5, "v1", true);
    
    TreeMap<Key,Value> tm2 = new TreeMap<Key,Value>(tm1);
    put(tm2, "r1", "cf1", "cq5", 5, "v7"); // should not see this because it should not switch until the row is finished
    put(tm2, "r2", "cf1", "cq1", 5, "v8"); // should see this new row after it switches
    
    // setup a new data source, but it should not switch until the current row is finished
    SortedMapIterator smi2 = new SortedMapIterator(tm2);
    TestDataSource tds2 = new TestDataSource(smi2);
    tds.next = tds2;
    
    ane(ssi, "r1", "cf1", "cq2", 5, "v2", true);
    ane(ssi, "r1", "cf1", "cq3", 5, "v3", true);

View Full Code Here

    // ensure switch is done on initial seek
    TreeMap<Key,Value> tm1 = new TreeMap<Key,Value>();
    put(tm1, "r1", "cf1", "cq1", 5, "v1");
    put(tm1, "r1", "cf1", "cq2", 5, "v2");
    
    SortedMapIterator smi = new SortedMapIterator(tm1);
    TestDataSource tds = new TestDataSource(smi);
    SourceSwitchingIterator ssi = new SourceSwitchingIterator(tds, false);
    
    TreeMap<Key,Value> tm2 = new TreeMap<Key,Value>();
    put(tm2, "r1", "cf1", "cq1", 6, "v3");
    put(tm2, "r1", "cf1", "cq2", 6, "v4");
    
    SortedMapIterator smi2 = new SortedMapIterator(tm2);
    TestDataSource tds2 = new TestDataSource(smi2);
    tds.next = tds2;
    
    ssi.seek(new Range(), new ArrayList<ByteSequence>(), false);

View Full Code Here

    // esnure switchNow() works w/ deepCopy()
    TreeMap<Key,Value> tm1 = new TreeMap<Key,Value>();
    put(tm1, "r1", "cf1", "cq1", 5, "v1");
    put(tm1, "r1", "cf1", "cq2", 5, "v2");
    
    SortedMapIterator smi = new SortedMapIterator(tm1);
    TestDataSource tds = new TestDataSource(smi);
    SourceSwitchingIterator ssi = new SourceSwitchingIterator(tds, false);
    
    SortedKeyValueIterator<Key,Value> dc1 = ssi.deepCopy(null);
    
    TreeMap<Key,Value> tm2 = new TreeMap<Key,Value>();
    put(tm2, "r1", "cf1", "cq1", 6, "v3");
    put(tm2, "r2", "cf1", "cq2", 6, "v4");
    
    SortedMapIterator smi2 = new SortedMapIterator(tm2);
    TestDataSource tds2 = new TestDataSource(smi2);
    tds.setNext(tds2);
    
    ssi.switchNow();

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.accumulo.core.iterators.SortedMapIterator

org.apache.accumulo.core.client.mock.MockBatchScanner

org.apache.accumulo.core.client.mock.MockScanner

org.apache.accumulo.core.data.Key

org.apache.accumulo.core.data.Range

org.apache.accumulo.core.iterators.AggregatingIteratorTest

org.apache.accumulo.core.iterators.ColumnFamilySkippingIteratorTest

org.apache.accumulo.core.iterators.DeletingIteratorTest

org.apache.accumulo.core.iterators.FilteringIteratorTest

org.apache.accumulo.core.iterators.IntersectingIteratorTest

org.apache.accumulo.core.iterators.IterUtilTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.