diff options
| author | Rich Hickey <richhickey@gmail.com> | 2006-06-09 15:20:14 +0000 |
|---|---|---|
| committer | Rich Hickey <richhickey@gmail.com> | 2006-06-09 15:20:14 +0000 |
| commit | 875c7c12aa5f20e02a3d3d08643e6eaaca61419a (patch) | |
| tree | 53d1e246dc1b397d5f38aff5c9152160e0e54d04 /src | |
| parent | 4b2bb1e90da439d7bed1527959baa0235b0b1bd7 (diff) | |
reordered sig of Seq.push()
Diffstat (limited to 'src')
| -rw-r--r-- | src/cli/runtime/PersistentTree.cs | 6 | ||||
| -rw-r--r-- | src/org/clojure/runtime/PersistentTree.java | 6 |
2 files changed, 6 insertions, 6 deletions
diff --git a/src/cli/runtime/PersistentTree.cs b/src/cli/runtime/PersistentTree.cs index cfdb05cb..2cb0a2b6 100644 --- a/src/cli/runtime/PersistentTree.cs +++ b/src/cli/runtime/PersistentTree.cs @@ -639,10 +639,10 @@ public class Seq : ISeq{ }
internal static Seq create(Node t, bool asc){
- return new Seq(push(t,asc,null),asc);
+ return new Seq(push(t, null, asc),asc);
}
- static ISeq push(Node t, bool asc, ISeq stack){
+ static ISeq push(Node t, ISeq stack, bool asc){
while(t != null)
{
stack = RT.cons(t,stack);
@@ -657,7 +657,7 @@ public class Seq : ISeq{ public ISeq rest() {
Node t = (Node)stack.first();
- ISeq nextstack = push(asc ? t.right() : t.left(),asc,stack.rest());
+ ISeq nextstack = push(asc ? t.right() : t.left(), stack.rest(), asc);
if(nextstack != null)
{
return new Seq(nextstack,asc);
diff --git a/src/org/clojure/runtime/PersistentTree.java b/src/org/clojure/runtime/PersistentTree.java index 02d0b573..2bd76409 100644 --- a/src/org/clojure/runtime/PersistentTree.java +++ b/src/org/clojure/runtime/PersistentTree.java @@ -616,10 +616,10 @@ static public class Seq implements ISeq{ } static Seq create(Node t, boolean asc){ - return new Seq(push(t,asc,null),asc); + return new Seq(push(t, null, asc),asc); } - static ISeq push(Node t, boolean asc, ISeq stack){ + static ISeq push(Node t, ISeq stack, boolean asc){ while(t != null) { stack = RT.cons(t,stack); @@ -634,7 +634,7 @@ static public class Seq implements ISeq{ public ISeq rest() { Node t = (Node)stack.first(); - ISeq nextstack = push(asc ? t.right() : t.left(),asc,stack.rest()); + ISeq nextstack = push(asc ? t.right() : t.left(), stack.rest(), asc); if(nextstack != null) { return new Seq(nextstack,asc); |