Examples of jdbm.helper.FastIterator

jdbm.helper.FastIterator
Fast and simple iterator. @version $Revision: 1.2 $ @author Alex Boisvert

      private BTreeSet() {
      }


      @Override
      public Iterator<InternalCacheEntry> iterator() {
         final FastIterator fi;
         try {
            fi = tree.keys();
         } catch (IOException e) {
            throw new CacheException(e);
         }


         return new Iterator<InternalCacheEntry>() {
            int entriesReturned = 0;
            InternalCacheEntry current = null;
            boolean next = true;


            public boolean hasNext() {
               if (current == null && next) {
                  Object key = fi.next();
                  if (key == null) {
                     next = false;
                  } else {
                     try {
                        current = unmarshall(tree.get(key), key);

View Full Code Here


   @Override
   public Set<Object> loadAllKeys(Set<Object> keysToExclude) throws CacheLoaderException {
      try {
         Set<Object> s = new HashSet<Object>();
         FastIterator fi = tree.keys();
         Object o;
         while ((o = fi.next()) != null) if (keysToExclude == null || !keysToExclude.contains(o)) s.add(o);
         return s;
      } catch (IOException e) {
         throw new CacheLoaderException(e);
      }
   }

View Full Code Here


   @Override
   public Set<Object> loadAllKeys(Set<Object> keysToExclude) throws CacheLoaderException {
      try {
         Set<Object> s = new HashSet<Object>();
         FastIterator fi = tree.keys();
         Object o;
         while ((o = fi.next()) != null) if (keysToExclude == null || !keysToExclude.contains(o)) s.add(o);
         return s;
      } catch (IOException e) {
         throw new CacheLoaderException(e);
      }
   }

View Full Code Here

      private BTreeSet() {
      }


      @Override
      public Iterator<InternalCacheEntry> iterator() {
         final FastIterator fi;
         try {
            fi = tree.keys();
         } catch (IOException e) {
            throw new CacheException(e);
         }


         return new Iterator<InternalCacheEntry>() {
            int entriesReturned = 0;
            InternalCacheEntry current = null;
            boolean next = true;


            @Override
            public boolean hasNext() {
               if (current == null && next) {
                  Object key = fi.next();
                  if (key == null) {
                     next = false;
                  } else {
                     try {
                        current = unmarshall(tree.get(key), key);

View Full Code Here

        throws IOException
    {
        init();


        try {
            FastIterator iter = hashtable.keys();
            Object key = iter.next();
            while ( key != null ) {
                Object val = hashtable.get( key );
                System.out.println( "enum key=" + key + " val=" + val );
            }
        } finally {

View Full Code Here

        for ( int i = 0; i < total; i++ ) {
            testTree.put( Long.valueOf("" + i), Long.valueOf("" + i) );
        }
        recman.commit();
    
        FastIterator fi = testTree.values();
        Object item;
        int count = 0;
        while( (item = fi.next()) != null ) {
            count++;
        }
        assertEquals( count, total );


        recman.close();

View Full Code Here


    void checkEnumerations(Hashtable hash, HashDirectory dir)
    throws IOException {
        // enumeration test


        FastIterator iter;
        Hashtable clone;
        int count;


        // test keys
        clone = (Hashtable) hash.clone();
        count = 0;
        iter = dir.keys();
        String s = (String) iter.next();
        while ( s != null ) {
            count++;
            clone.remove( s );
            s = (String) iter.next();
        }
        assertEquals(hash.size(), count);


        // test values
        clone = (Hashtable)hash.clone();
        count = 0;
        iter = dir.values();
        s = (String) iter.next();
        while ( s != null ) {
            count++;
            clone.remove( s );
            s = (String) iter.next();
        }
        assertEquals(hash.size(), count);
    }

View Full Code Here


   private final class BTreeSet extends AbstractSet<InternalCacheEntry> {


      @Override
      public Iterator<InternalCacheEntry> iterator() {
         final FastIterator fi;
         try {
            fi = tree.keys();
         } catch (IOException e) {
            throw new CacheException(e);
         }


         return new Iterator<InternalCacheEntry>() {


            InternalCacheEntry current = null;
            boolean next = true;


            public boolean hasNext() {
               if (current == null && next) {
                  Object key = fi.next();
                  if (key == null) {
                     next = false;
                  } else {
                     try {
                        current = unmarshall(tree.get(key), key);

View Full Code Here


   @Override
   public Set<Object> loadAllKeys(Set<Object> keysToExclude) throws CacheLoaderException {
      try {
         Set<Object> s = new HashSet<Object>();
         FastIterator fi = tree.keys();
         Object o;
         while ((o = fi.next()) != null) if (keysToExclude == null || !keysToExclude.contains(o)) s.add(o);
         return s;
      } catch (IOException e) {
         throw new CacheLoaderException(e);
      }
   }

View Full Code Here

      private BTreeSet() {
      }


      @Override
      public Iterator<InternalCacheEntry> iterator() {
         final FastIterator fi;
         try {
            fi = tree.keys();
         } catch (IOException e) {
            throw new CacheException(e);
         }


         return new Iterator<InternalCacheEntry>() {
            int entriesReturned = 0;
            InternalCacheEntry current = null;
            boolean next = true;


            public boolean hasNext() {
               if (current == null && next) {
                  Object key = fi.next();
                  if (key == null) {
                     next = false;
                  } else {
                     try {
                        current = unmarshall(tree.get(key), key);

View Full Code Here

0 1 2

TOP

Related Classes of jdbm.helper.FastIterator

jdbm.HashtableTest

jdbm.htree.TestHashDirectory

jdbm.htree.TestHTree

org.infinispan.loaders.jdbm.JdbmCacheStore

org.infinispan.loaders.jdbm.JdbmCacheStore$BTreeSet

org.jpos.space.JDBMSpace

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.