alvinalexander.com | career | drupal | java | mac | mysql | perl | scala | uml | unix  

What this is

This file is included in the DevDaily.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Other links

The source code

/*
 *                 Sun Public License Notice
 *
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"). You may not use this file except in
 * compliance with the License. A copy of the License is available at
 * http://www.sun.com/
 *
 * The Original Code is NetBeans. The Initial Developer of the Original
 * Code is Sun Microsystems, Inc. Portions Copyright 1997-2004 Sun
 * Microsystems, Inc. All Rights Reserved.
 */
package org.netbeans.modules.javacore;

import java.util.AbstractSequentialList;
import java.util.Iterator;
import java.util.ListIterator;
import java.util.NoSuchElementException;

/**
 *
 * @author  Martin Matula
 */
public class LazyImmutableList extends AbstractSequentialList {
    private LazyIterator internal;
    private boolean complete = false;
    private final Object[] array;
    private int nextIndex = 0;
    
    /** Creates a new instance of LazyImmutableList */
    public LazyImmutableList(LazyIterator internalIterator) {
        internal = internalIterator;
        array = new Object[internalIterator.maxEstimatedSize()];
    }
    
    public int size() {
        while (internal != null) {
            nextItem();
        }
        return nextIndex;
    }
    
    public ListIterator listIterator(int index) {
        return new LazyImmutableIterator(index);
    }
    
    public int maxEstimatedSize() {
        return internal == null ? nextIndex : internal.maxEstimatedSize();
    }
    
    private void nextItem() {
        if (internal != null && internal.hasNext()) {
            array[nextIndex] = internal.next();
            nextIndex++;
        } else {
            internal = null;
        }
    }
    
    private class LazyImmutableIterator implements ListIterator {
        private int currentIndex;
        
        public LazyImmutableIterator(int index) {
            currentIndex = index;
        }

        public boolean hasNext() {
            while (nextIndex <= currentIndex && internal != null) {
                nextItem();
            }
            return nextIndex > currentIndex;
        }

        public int previousIndex() {
            return currentIndex - 1;
        }

        public Object previous() {
            if (hasPrevious()) {
                currentIndex--;
                return array[currentIndex];
            }
            throw new NoSuchElementException();
        }

        public boolean hasPrevious() {
            return currentIndex > 0;
        }

        public Object next() {
            if (hasNext()) {
                currentIndex++;
                return array[currentIndex - 1];
            }
            throw new NoSuchElementException();
        }

        public int nextIndex() {
            return currentIndex;
        }

        public void add(Object o) {
            throw new UnsupportedOperationException();
        }

        public void set(Object o) {
            throw new UnsupportedOperationException();
        }

        public void remove() {
            throw new UnsupportedOperationException();
        }
    }
    
    public static abstract class LazyIterator implements Iterator {
        public final void remove() {
            throw new UnsupportedOperationException();
        }
        
        protected abstract int maxEstimatedSize();
    }
}
... this post is sponsored by my books ...

#1 New Release!

FP Best Seller

 

new blog posts

 

Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.