From f0a1df692e9580f5aad837da1a5725f026b19a45 Mon Sep 17 00:00:00 2001
From: Alex Crichton <alex@alexcrichton.com>
Date: Tue, 20 May 2014 21:24:01 -0700
Subject: [PATCH] test: Add test for fixed issue #11736
Closes #11736
---
src/test/run-pass/issue-11736.rs | 35 ++++++++++++++++++++++++++++++++
1 file changed, 35 insertions(+)
create mode 100644 src/test/run-pass/issue-11736.rs
diff --git a/src/test/run-pass/issue-11736.rs b/src/test/run-pass/issue-11736.rs
new file mode 100644
index 00000000000..4eb9dd1474e
--- /dev/null
+++ b/src/test/run-pass/issue-11736.rs
@@ -0,0 +1,35 @@
+// Copyright 2014 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.
+
+extern crate collections;
+extern crate std;
+
+use collections::Bitv;
+
+fn main() {
+ // Generate sieve of Eratosthenes for n up to 1e6
+ let n = 1000000u;
+ let sieve = Bitv::new(n+1, true);
+ let limit: uint = (n as f32).sqrt() as uint;
+ for i in range(2, limit+1) {
+ if sieve[i] {
+ let mut j = 0;
+ while i*i + j*i <= n {
+ sieve[i*i+j*i] = false;
+ j += 1;
+ }
+ }
+ }
+ for i in range(2, n+1) {
+ if sieve[i] {
+ }
+ }
+}
+