1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/clojure/lang/Range.java	Sat Aug 21 06:25:44 2010 -0400
     1.3 @@ -0,0 +1,64 @@
     1.4 +/**
     1.5 + *   Copyright (c) Rich Hickey. All rights reserved.
     1.6 + *   The use and distribution terms for this software are covered by the
     1.7 + *   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
     1.8 + *   which can be found in the file epl-v10.html at the root of this distribution.
     1.9 + *   By using this software in any fashion, you are agreeing to be bound by
    1.10 + * 	 the terms of this license.
    1.11 + *   You must not remove this notice, or any other, from this software.
    1.12 + **/
    1.13 +
    1.14 +/* rich Apr 1, 2008 */
    1.15 +
    1.16 +package clojure.lang;
    1.17 +
    1.18 +public class Range extends ASeq implements IReduce, Counted{
    1.19 +final int end;
    1.20 +final int n;
    1.21 +
    1.22 +public Range(int start, int end){
    1.23 +	this.end = end;
    1.24 +	this.n = start;
    1.25 +}
    1.26 +
    1.27 +public Range(IPersistentMap meta, int start, int end){
    1.28 +	super(meta);
    1.29 +	this.end = end;
    1.30 +	this.n = start;
    1.31 +}
    1.32 +
    1.33 +public Obj withMeta(IPersistentMap meta){
    1.34 +	if(meta == meta())
    1.35 +		return this;
    1.36 +	return new Range(meta(), end, n);
    1.37 +}
    1.38 +
    1.39 +public Object first(){
    1.40 +	return n;
    1.41 +}
    1.42 +
    1.43 +public ISeq next(){
    1.44 +	if(n < end-1)
    1.45 +		return new Range(_meta, n + 1, end);
    1.46 +	return null;
    1.47 +}
    1.48 +
    1.49 +public Object reduce(IFn f) throws Exception{
    1.50 +	Object ret = n;
    1.51 +	for(int x = n+1;x < end;x++)
    1.52 +		ret = f.invoke(ret, x);
    1.53 +	return ret;
    1.54 +}
    1.55 +
    1.56 +public Object reduce(IFn f, Object start) throws Exception{
    1.57 +	Object ret = f.invoke(start,n);
    1.58 +	for(int x = n+1;x < end;x++)
    1.59 +		ret = f.invoke(ret, x);
    1.60 +	return ret;
    1.61 +}
    1.62 +
    1.63 +public int count() {
    1.64 +    return end - n;
    1.65 +    }
    1.66 +
    1.67 +}