---

yaml
---
r: 68572
b: refs/heads/auto
c: 54e01eb
h: refs/heads/master
v: v3

Author: bblum

[refs]

@@ -14,6 +14,6 @@ refs/heads/try3: 9387340aab40a73e8424c48fd42f0c521a4875c0
 refs/tags/release-0.3.1: 495bae036dfe5ec6ceafd3312b4dca48741e845b
 refs/tags/release-0.4: e828ea2080499553b97dfe33b3f4d472b4562ad7
 refs/tags/release-0.5: 7e3bcfbf21278251ee936ad53e92e9b719702d73
-refs/heads/auto: 919f5a7e687052b317028d1ba26f9d3c01ed94d4
+refs/heads/auto: 54e01eb7e0ea74c01a797f56e2bf602c298a9769
 refs/heads/servo: af82457af293e2a842ba6b7759b70288da276167
 refs/tags/release-0.6: b4ebcfa1812664df5e142f0134a5faea3918544c

branches/auto/src/test/run-pass/closure-bounds-recursive-stack-closure.rs

@@ -0,0 +1,31 @@
+// Copyright 2013 The Rust Project Developers. See the COPYRIGHT
+// file at the top-level directory of this distribution and at
+// http://rust-lang.org/COPYRIGHT.
+//
+// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// option. This file may not be copied, modified, or distributed
+// except according to those terms.
+
+// Ensures that it's legal to create a recursive stack closure as long as
+// its environment is copyable
+
+struct R<'self> {
+    // This struct is needed to create the
+    // otherwise infinite type of a fn that
+    // accepts itself as argument:
+    c: &'self fn:Copy(&R, uint) -> uint
+}
+
+fn main() {
+    // Stupid version of fibonacci.
+    let fib: &fn:Copy(&R, uint) -> uint = |fib, x| {
+        if x == 0 || x == 1 {
+            x
+        } else {
+            (fib.c)(fib, x-1) + (fib.c)(fib, x-2)
+        }
+    };
+    assert!(fib(&R { c: fib }, 7) == 13);
+}