Class Seq

src/jvm/clojure/lang/PersistentArrayMap.java:365–435

}

static class Seq extends ASeq implements Counted, IReduce, IDrop {
	final Object[] array;
	final int i;

	Seq(Object[] array, int i){
		this.array = array;
		this.i = i;
	}

	public Seq(IPersistentMap meta, Object[] array, int i){
		super(meta);
		this.array = array;
		this.i = i;
	}

	public Object first(){
		return MapEntry.create(array[i],array[i+1]);
	}

	public ISeq next(){
		if(i + 2 < array.length)
			return new Seq(array, i + 2);
		return null;
	}

	public int count(){
		return (array.length - i) / 2;
	}

	public Sequential drop(int n) {
		if(n < count()) {
			return new Seq(array, i + (2 * n));
		} else {
			return null;
		}
	}

	public Obj withMeta(IPersistentMap meta){
		if(meta() == meta)
			return this;
		return new Seq(meta, array, i);
	}

	public Iterator iterator() {
		return new Iter(array, i-2, APersistentMap.MAKE_ENTRY);
	}

	public Object reduce(IFn f) {
		if(i < array.length) {
			Object acc = MapEntry.create(array[i], array[i+1]);
			for(int j=i+2;j < array.length;j+=2){
				acc = f.invoke(acc, MapEntry.create(array[j], array[j+1]));
				if(RT.isReduced(acc))
					return ((IDeref)acc).deref();
			}
			return acc;
		} else {
			return f.invoke();