Mercurial > lasercutter

annotate src/clojure/lang/Range.java @ 10:ef7dbbd6452c

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
added clojure source goodness
author Robert McIntyre <rlm@mit.edu>
date Sat, 21 Aug 2010 06:25:44 -0400
parents
children
rev   line source
rlm@10 1 /**
rlm@10 2 * Copyright (c) Rich Hickey. All rights reserved.
rlm@10 3 * The use and distribution terms for this software are covered by the
rlm@10 4 * Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
rlm@10 5 * which can be found in the file epl-v10.html at the root of this distribution.
rlm@10 6 * By using this software in any fashion, you are agreeing to be bound by
rlm@10 7 * the terms of this license.
rlm@10 8 * You must not remove this notice, or any other, from this software.
rlm@10 9 **/
rlm@10 10
rlm@10 11 /* rich Apr 1, 2008 */
rlm@10 12
rlm@10 13 package clojure.lang;
rlm@10 14
rlm@10 15 public class Range extends ASeq implements IReduce, Counted{
rlm@10 16 final int end;
rlm@10 17 final int n;
rlm@10 18
rlm@10 19 public Range(int start, int end){
rlm@10 20 this.end = end;
rlm@10 21 this.n = start;
rlm@10 22 }
rlm@10 23
rlm@10 24 public Range(IPersistentMap meta, int start, int end){
rlm@10 25 super(meta);
rlm@10 26 this.end = end;
rlm@10 27 this.n = start;
rlm@10 28 }
rlm@10 29
rlm@10 30 public Obj withMeta(IPersistentMap meta){
rlm@10 31 if(meta == meta())
rlm@10 32 return this;
rlm@10 33 return new Range(meta(), end, n);
rlm@10 34 }
rlm@10 35
rlm@10 36 public Object first(){
rlm@10 37 return n;
rlm@10 38 }
rlm@10 39
rlm@10 40 public ISeq next(){
rlm@10 41 if(n < end-1)
rlm@10 42 return new Range(_meta, n + 1, end);
rlm@10 43 return null;
rlm@10 44 }
rlm@10 45
rlm@10 46 public Object reduce(IFn f) throws Exception{
rlm@10 47 Object ret = n;
rlm@10 48 for(int x = n+1;x < end;x++)
rlm@10 49 ret = f.invoke(ret, x);
rlm@10 50 return ret;
rlm@10 51 }
rlm@10 52
rlm@10 53 public Object reduce(IFn f, Object start) throws Exception{
rlm@10 54 Object ret = f.invoke(start,n);
rlm@10 55 for(int x = n+1;x < end;x++)
rlm@10 56 ret = f.invoke(ret, x);
rlm@10 57 return ret;
rlm@10 58 }
rlm@10 59
rlm@10 60 public int count() {
rlm@10 61 return end - n;
rlm@10 62 }
rlm@10 63
rlm@10 64 }