---

yaml
---
r: 4937
b: refs/heads/master
c: d9bc3cb
h: refs/heads/master
i:
  4935: 8fed9ee
v: v3

Author: catamorphism

[refs]

@@ -1,2 +1,2 @@
 ---
-refs/heads/master: 1cb85015c397cefa9de7653a98b7572ef511e0ef
+refs/heads/master: d9bc3cb10c4d1e856998c8e35ce7d89e0d74f4d6

trunk/src/lib/char.rs

@@ -1,4 +1,4 @@
-pred is_whitespace(c: char) -> bool {
+pure fn is_whitespace(c: char) -> bool {
     const ch_space: char = '\u0020';
     const ch_ogham_space_mark: char = '\u1680';
     const ch_mongolian_vowel_sep: char = '\u180e';

trunk/src/lib/istr.rs

@@ -73,12 +73,12 @@ fn is_ascii(s: &istr) -> bool {
 }
 
 /// Returns true if the string has length 0
-pred is_empty(s: &istr) -> bool {
+pure fn is_empty(s: &istr) -> bool {
     for c: u8 in s { ret false; } ret true;
 }
 
 /// Returns true if the string has length greater than 0
-pred is_not_empty(s: &istr) -> bool {
+pure fn is_not_empty(s: &istr) -> bool {
     !is_empty(s)
 }
 

trunk/src/lib/uint.rs

@@ -10,17 +10,17 @@ fn div(x: uint, y: uint) -> uint { ret x / y; }
 
 fn rem(x: uint, y: uint) -> uint { ret x % y; }
 
-pred lt(x: uint, y: uint) -> bool { ret x < y; }
+pure fn lt(x: uint, y: uint) -> bool { ret x < y; }
 
-pred le(x: uint, y: uint) -> bool { ret x <= y; }
+pure fn le(x: uint, y: uint) -> bool { ret x <= y; }
 
-pred eq(x: uint, y: uint) -> bool { ret x == y; }
+pure fn eq(x: uint, y: uint) -> bool { ret x == y; }
 
-pred ne(x: uint, y: uint) -> bool { ret x != y; }
+pure fn ne(x: uint, y: uint) -> bool { ret x != y; }
 
-pred ge(x: uint, y: uint) -> bool { ret x >= y; }
+pure fn ge(x: uint, y: uint) -> bool { ret x >= y; }
 
-pred gt(x: uint, y: uint) -> bool { ret x > y; }
+pure fn gt(x: uint, y: uint) -> bool { ret x > y; }
 
 fn max(x: uint, y: uint) -> uint { if x > y { ret x; } ret y; }
 

trunk/src/lib/vec.rs

@@ -77,13 +77,13 @@ fn from_mut<@T>(v: &[mutable T]) -> [T] {
 }
 
 // Predicates
-pred is_empty<T>(v: &[mutable? T]) -> bool {
+pure fn is_empty<T>(v: &[mutable? T]) -> bool {
     // FIXME: This would be easier if we could just call len
     for t: T in v { ret false; }
     ret true;
 }
 
-pred is_not_empty<T>(v: &[mutable? T]) -> bool { ret !is_empty(v); }
+pure fn is_not_empty<T>(v: &[mutable? T]) -> bool { ret !is_empty(v); }
 
 // Accessors
 

trunk/src/test/compile-fail/constrained-type-missing-check.rs

@@ -8,7 +8,7 @@ tag list { cons(int, @list); nil; }
 
 type bubu = {x: int, y: int};
 
-pred less_than(x: int, y: int) -> bool { ret x < y; }
+pure fn less_than(x: int, y: int) -> bool { ret x < y; }
 
 type ordered_range = {low: int, high: int} : less_than(low, high);
 

trunk/src/test/compile-fail/do-while-pred-constraints.rs

@@ -2,7 +2,7 @@
 
 fn print_even(y: int) : even(y) { log y; }
 
-pred even(y: int) -> bool { true }
+pure fn even(y: int) -> bool { true }
 
 fn main() {
     let y: int = 42;

trunk/src/test/compile-fail/if-check-precond-fail.rs

@@ -1,5 +1,5 @@
 // error-pattern:Unsatisfied precondition constraint
-pred even(x: uint) -> bool {
+pure fn even(x: uint) -> bool {
     if x < 2u {
         ret false;
     } else if x == 2u { ret true; } else { ret even(x - 2u); }

trunk/src/test/compile-fail/impure-pred.rs

@@ -3,7 +3,7 @@
 
 fn g() { }
 
-pred f(q: int) -> bool { g(); ret true; }
+pure fn f(q: int) -> bool { g(); ret true; }
 
 fn main() {
     let x = 0;

trunk/src/test/compile-fail/not-pred-args.rs

@@ -2,7 +2,7 @@
 
 // error-pattern: Constraint args must be
 
-pred f(q: int) -> bool { ret true; }
+pure fn f(q: int) -> bool { ret true; }
 
 fn main() {
     // should fail to typecheck, as pred args must be slot variables

trunk/src/test/compile-fail/pred-assign.rs

@@ -4,7 +4,7 @@
 
 fn f(a: int, b: int) : lt(a, b) { }
 
-pred lt(a: int, b: int) -> bool { ret a < b; }
+pure fn lt(a: int, b: int) -> bool { ret a < b; }
 
 fn main() {
     let a: int = 10;

trunk/src/test/compile-fail/pred-on-wrong-slots.rs

@@ -4,7 +4,7 @@
 
 fn f(a: int, b: int) : lt(a, b) { }
 
-pred lt(a: int, b: int) -> bool { ret a < b; }
+pure fn lt(a: int, b: int) -> bool { ret a < b; }
 
 fn main() {
     let a: int = 10;

trunk/src/test/compile-fail/pred-swap.rs

@@ -4,7 +4,7 @@
 
 fn f(a: int, b: int) : lt(a, b) { }
 
-pred lt(a: int, b: int) -> bool { ret a < b; }
+pure fn lt(a: int, b: int) -> bool { ret a < b; }
 
 fn main() {
     let a: int = 10;

trunk/src/test/compile-fail/while-loop-pred-constraints.rs

@@ -2,7 +2,7 @@
 
 fn print_even(y: int) : even(y) { log y; }
 
-pred even(y: int) -> bool { true }
+pure fn even(y: int) -> bool { true }
 
 fn main() {
 

trunk/src/test/run-fail/if-check-fail.rs

@@ -1,5 +1,5 @@
 // error-pattern:Number is odd
-pred even(x: uint) -> bool {
+pure fn even(x: uint) -> bool {
     if x < 2u {
         ret false;
     } else if x == 2u { ret true; } else { ret even(x - 2u); }

trunk/src/test/run-fail/pred.rs

@@ -2,6 +2,6 @@
 // error-pattern:Predicate lt(b, a) failed
 fn f(a: int, b: int) { }
 
-pred lt(a: int, b: int) -> bool { ret a < b; }
+pure fn lt(a: int, b: int) -> bool { ret a < b; }
 
 fn main() { let a: int = 10; let b: int = 23; check (lt(b, a)); f(b, a); }

trunk/src/test/run-pass/claim-nonterm.rs

@@ -3,6 +3,6 @@ use std;
 import std::str::*;
 import std::uint::*;
 
-pred fails(a: uint) -> bool { fail; }
+pure fn fails(a: uint) -> bool { fail; }
 
 fn main() { let b: uint = 4u; claim (fails(b)); }

trunk/src/test/run-pass/constrained-type.rs

@@ -4,7 +4,7 @@ tag list { cons(int, @list); nil; }
 
 type bubu = {x: int, y: int};
 
-pred less_than(x: int, y: int) -> bool { ret x < y; }
+pure fn less_than(x: int, y: int) -> bool { ret x < y; }
 
 type ordered_range = {low: int, high: int}  : less_than(*.low, *.high);
 

trunk/src/test/run-pass/if-check-precond.rs

@@ -1,4 +1,4 @@
-pred even(x: uint) -> bool {
+pure fn even(x: uint) -> bool {
     if x < 2u {
         ret false;
     } else if x == 2u { ret true; } else { ret even(x - 2u); }

trunk/src/test/run-pass/if-check.rs

@@ -1,4 +1,4 @@
-pred even(x: uint) -> bool {
+pure fn even(x: uint) -> bool {
     if x < 2u {
         ret false;
     } else if x == 2u { ret true; } else { ret even(x - 2u); }

trunk/src/test/run-pass/pred-check.rs

@@ -1,4 +1,4 @@
 // -*- rust -*-
-pred f(q: int) -> bool { ret true; }
+pure fn f(q: int) -> bool { ret true; }
 
 fn main() { let x = 0; check (f(x)); }

trunk/src/test/run-pass/pred-not-bool.rs

@@ -1,3 +1,5 @@
+// FIXME should be in run-pass
+
 // -*- rust -*-
 
 // error-pattern: Non-boolean return type

trunk/src/test/run-pass/pred.rs

@@ -1,7 +1,7 @@
 // -*- rust -*-
 fn f(a: int, b: int) { }
 
-pred lt(a: int, b: int) -> bool { ret a < b; }
+pure fn lt(a: int, b: int) -> bool { ret a < b; }
 
 fn main() {
     let a: int = 10;

trunk/src/test/run-pass/typestate-transitive.rs

@@ -1,4 +1,4 @@
-pred p(i: int) -> bool { true }
+pure fn p(i: int) -> bool { true }
 
 fn f(i: int) : p(i) -> int { i }
 

trunk/src/test/run-pass/wierd-exprs.rs

@@ -40,7 +40,7 @@ fn hammertime() -> int {
 }
 
 fn canttouchthis() -> uint {
-    pred p() -> bool { true }
+    pure fn p() -> bool { true }
     let _a = (assert (true)) == (check (p()));
     let _c = (check (p())) == ();
     let _b = (log 0) == (ret 0u);

trunk/src/test/stdtest/vec.rs

@@ -10,7 +10,7 @@ fn square(n: uint) -> uint { ret n * n; }
 
 fn square_alias(n: &uint) -> uint { ret n * n; }
 
-pred is_three(n: &uint) -> bool { ret n == 3u; }
+pure fn is_three(n: &uint) -> bool { ret n == 3u; }
 
 fn square_if_odd(n: &uint) -> option::t<uint> {
     ret if n % 2u == 1u { some(n * n) } else { none };