---

yaml
---
r: 31444
b: refs/heads/dist-snap
c: 4463172
h: refs/heads/master
v: v3

Author: catamorphism

[refs]

@@ -7,6 +7,6 @@ refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: d0c6ce338884ee21843f4b40bf6bf18d222ce5df
 refs/heads/incoming: d9317a174e434d4c99fc1a37fd7dc0d2f5328d37
-refs/heads/dist-snap: f1f9066274114637510a48ab1087750262ae0699
+refs/heads/dist-snap: 44631722ff234241cb7100103320a402fe4fdfa9
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503

branches/dist-snap/doc/tutorial.md

@@ -34,8 +34,9 @@ high-level features include:
 * ***Higher-order functions.*** Rust functions may take closures as
   arguments or return closures as return values.  Closures in Rust are
   very powerful and used pervasively.
-* ***Interface polymorphism.*** Rust's type system features a unique
-  combination of Java-style interfaces and Haskell-style typeclasses.
+* ***Trait polymorphism.*** Rust's type system features a unique
+  combination of Java-style interfaces and Haskell-style typeclasses
+  called _traits_.
 * ***Parametric polymorphism (generics).*** Functions and types can be
   parameterized over type variables with optional type constraints.
 * ***Type inference.*** Type annotations on local variable
@@ -734,9 +735,12 @@ of numeric literal patterns can be expressed with `to`. The underscore
 (`_`) is a wildcard pattern that matches everything.
 
 If the arm with the wildcard pattern was left off in the above
-example, running it on a number greater than ten (or negative) would
-cause a run-time failure. When no arm matches, `alt` constructs do not
-silently fall through—they blow up instead.
+example, the typechecker would reject it at compile time. `alt`
+constructs must be exhaustive: they must have an arm covering every
+possible case. (You may use the `alt check` construct to write a
+non-exhaustive match, but it's highly undesirable to do so. You may
+reason that the missing cases will never occur, but the typechecker
+provides you with no assurance that your reasoning is correct.)
 
 A powerful application of pattern matching is *destructuring*, where
 you use the matching to get at the contents of data types. Remember
@@ -2089,9 +2093,9 @@ resource type. Rust has several kinds that can be used as type bounds:
   mutable fields nor shared boxes.
 
 > ***Note:*** Rust type kinds are syntactically very similar to
-> [interfaces](#interfaces) when used as type bounds, and can be
-> conveniently thought of as built-in interfaces. In the future type
-> kinds will actually be interfaces that the compiler has special
+> [traits](#traits) when used as type bounds, and can be
+> conveniently thought of as built-in traits. In the future type
+> kinds will actually be traits that the compiler has special
 > knowledge about.
 
 ## Generic functions and argument-passing
@@ -2388,9 +2392,9 @@ This makes it possible to rebind a variable without actually mutating
 it, which is mostly useful for destructuring (which can rebind, but
 not assign).
 
-# Interfaces
+# Traits
 
-Interfaces are Rust's take on value polymorphism—the thing that
+Traits are Rust's take on value polymorphism—the thing that
 object-oriented languages tend to solve with methods and inheritance.
 For example, writing a function that can operate on multiple types of
 collections.
@@ -2400,27 +2404,27 @@ collections.
 
 ## Declaration
 
-An interface consists of a set of methods. A method is a function that
+A trait consists of a set of methods. A method is a function that
 can be applied to a `self` value and a number of arguments, using the
 dot notation: `self.foo(arg1, arg2)`.
 
-For example, we could declare the interface `to_str` for things that
+For example, we could declare the trait `to_str` for things that
 can be converted to a string, with a single method of the same name:
 
 ~~~~
-iface to_str {
+trait to_str {
     fn to_str() -> ~str;
 }
 ~~~~
 
 ## Implementation
 
-To actually implement an interface for a given type, the `impl` form
+To actually implement an trait for a given type, the `impl` form
 is used. This defines implementations of `to_str` for the `int` and
 `~str` types.
 
 ~~~~
-# iface to_str { fn to_str() -> ~str; }
+# trait to_str { fn to_str() -> ~str; }
 impl of to_str for int {
     fn to_str() -> ~str { int::to_str(self, 10u) }
 }
@@ -2439,13 +2443,13 @@ method that matches the name, and simply calls that.
 
 Implementations are not globally visible. Resolving a method to an
 implementation requires that implementation to be in scope. You can
-import and export implementations using the name of the interface they
+import and export implementations using the name of the trait they
 implement (multiple implementations with the same name can be in scope
 without problems). Or you can give them an explicit name if you
 prefer, using this syntax:
 
 ~~~~
-# iface to_str { fn to_str() -> ~str; }
+# trait to_str { fn to_str() -> ~str; }
 impl nil_to_str of to_str for () {
     fn to_str() -> ~str { ~"()" }
 }
@@ -2461,7 +2465,7 @@ known at compile time, it is possible to specify 'bounds' for type
 parameters.
 
 ~~~~
-# iface to_str { fn to_str() -> ~str; }
+# trait to_str { fn to_str() -> ~str; }
 fn comma_sep<T: to_str>(elts: ~[T]) -> ~str {
     let mut result = ~"", first = true;
     for elts.each |elt| {
@@ -2476,18 +2480,18 @@ fn comma_sep<T: to_str>(elts: ~[T]) -> ~str {
 The syntax for this is similar to the syntax for specifying that a
 parameter type has to be copyable (which is, in principle, another
 kind of bound). By declaring `T` as conforming to the `to_str`
-interface, it becomes possible to call methods from that interface on
+trait, it becomes possible to call methods from that trait on
 values of that type inside the function. It will also cause a
 compile-time error when anyone tries to call `comma_sep` on an array
 whose element type does not have a `to_str` implementation in scope.
 
-## Polymorphic interfaces
+## Polymorphic traits
 
-Interfaces may contain type parameters. This defines an interface for
+Traits may contain type parameters. This defines a trait for
 generalized sequence types:
 
 ~~~~
-iface seq<T> {
+trait seq<T> {
     fn len() -> uint;
     fn iter(fn(T));
 }
@@ -2499,26 +2503,26 @@ impl <T> of seq<T> for ~[T] {
 }
 ~~~~
 
-Note that the implementation has to explicitly declare the its
-parameter `T` before using it to specify its interface type. This is
+Note that the implementation has to explicitly declare the type
+parameter that it binds, `T`, before using it to specify its trait type. This is
 needed because it could also, for example, specify an implementation
 of `seq<int>`—the `of` clause *refers* to a type, rather than defining
 one.
 
-The type parameters bound by an iface are in scope in each of the
+The type parameters bound by a trait are in scope in each of the
 method declarations. So, re-declaring the type parameter
-`T` as an explicit type parameter for `len` -- in either the iface or
+`T` as an explicit type parameter for `len` -- in either the trait or
 the impl -- would be a compile-time error.
 
-## The `self` type in interfaces
+## The `self` type in traits
 
-In an interface, `self` is a special type that you can think of as a
-type parameter. An implementation of the interface for any given type
+In a trait, `self` is a special type that you can think of as a
+type parameter. An implementation of the trait for any given type
 `T` replaces the `self` type parameter with `T`. The following
-interface describes types that support an equality operation:
+trait describes types that support an equality operation:
 
 ~~~~
-iface eq {
+trait eq {
   fn equals(&&other: self) -> bool;
 }
 
@@ -2530,15 +2534,15 @@ impl of eq for int {
 Notice that `equals` takes an `int` argument, rather than a `self` argument, in
 an implementation for type `int`.
 
-## Casting to an interface type
+## Casting to an trait type
 
 The above allows us to define functions that polymorphically act on
-values of *an* unknown type that conforms to a given interface.
+values of *an* unknown type that conforms to a given trait.
 However, consider this function:
 
 ~~~~
 # type circle = int; type rectangle = int;
-# iface drawable { fn draw(); }
+# trait drawable { fn draw(); }
 # impl of drawable for int { fn draw() {} }
 # fn new_circle() -> int { 1 }
 fn draw_all<T: drawable>(shapes: ~[T]) {
@@ -2549,14 +2553,14 @@ fn draw_all<T: drawable>(shapes: ~[T]) {
 ~~~~
 
 You can call that on an array of circles, or an array of squares
-(assuming those have suitable `drawable` interfaces defined), but not
+(assuming those have suitable `drawable` traits defined), but not
 on an array containing both circles and squares.
 
-When this is needed, an interface name can be used as a type, causing
+When this is needed, a trait name can be used as a type, causing
 the function to be written simply like this:
 
 ~~~~
-# iface drawable { fn draw(); }
+# trait drawable { fn draw(); }
 fn draw_all(shapes: ~[drawable]) {
     for shapes.each |shape| { shape.draw(); }
 }
@@ -2571,11 +2575,11 @@ is very similar to the 'vtables' used in most object-oriented
 languages.
 
 To construct such a value, you use the `as` operator to cast a value
-to an interface type:
+to a trait type:
 
 ~~~~
 # type circle = int; type rectangle = int;
-# iface drawable { fn draw(); }
+# trait drawable { fn draw(); }
 # impl of drawable for int { fn draw() {} }
 # fn new_circle() -> int { 1 }
 # fn new_rectangle() -> int { 2 }
@@ -2594,10 +2598,10 @@ Note that the allocation of a box is somewhat more expensive than
 simply using a type parameter and passing in the value as-is, and much
 more expensive than statically resolved method calls.
 
-## Interface-less implementations
+## Trait-less implementations
 
 If you only intend to use an implementation for static overloading,
-and there is no interface available that it conforms to, you are free
+and there is no trait available that it conforms to, you are free
 to leave off the `of` clause.  However, this is only possible when you
 are defining an implementation in the same module as the receiver
 type, and the receiver type is a named type (i.e., an enum or a
@@ -2620,9 +2624,10 @@ OpenSSL libraries installed, it should 'just work'.
 
 ~~~~ {.xfail-test}
 use std;
+import libc::c_uint;
 
 extern mod crypto {
-    fn SHA1(src: *u8, sz: uint, out: *u8) -> *u8;
+    fn SHA1(src: *u8, sz: c_uint, out: *u8) -> *u8;
 }
 
 fn as_hex(data: ~[u8]) -> ~str {
@@ -2634,7 +2639,7 @@ fn as_hex(data: ~[u8]) -> ~str {
 fn sha1(data: ~str) -> ~str unsafe {
     let bytes = str::bytes(data);
     let hash = crypto::SHA1(vec::unsafe::to_ptr(bytes),
-                            vec::len(bytes), ptr::null());
+                            vec::len(bytes) as c_uint, ptr::null());
     ret as_hex(vec::unsafe::from_buf(hash, 20u));
 }
 
@@ -2700,7 +2705,7 @@ return a pointer.
 
 ~~~~ {.xfail-test}
 # extern mod crypto {
-fn SHA1(src: *u8, sz: uint, out: *u8) -> *u8;
+fn SHA1(src: *u8, sz: libc::c_uint, out: *u8) -> *u8;
 # }
 ~~~~
 
@@ -2791,7 +2796,7 @@ This pointer will become invalid as soon as the vector it points into
 is cleaned up, so you should be very careful how you use it. In this
 case, the local variable `bytes` outlives the pointer, so we're good.
 
-Passing a null pointer as third argument to `SHA1` causes it to use a
+Passing a null pointer as the third argument to `SHA1` makes it use a
 static buffer, and thus save us the effort of allocating memory
 ourselves. `ptr::null` is a generic function that will return an
 unsafe null pointer of the correct type (Rust generics are awesome
@@ -2814,15 +2819,17 @@ microsecond-resolution timer.
 
 ~~~~
 use std;
-type timeval = {mut tv_sec: uint,
-                mut tv_usec: uint};
+import libc::c_ulonglong;
+
+type timeval = {mut tv_sec: c_ulonglong,
+                mut tv_usec: c_ulonglong};
 #[nolink]
-extern mod libc {
+extern mod lib_c {
     fn gettimeofday(tv: *timeval, tz: *()) -> i32;
 }
 fn unix_time_in_microseconds() -> u64 unsafe {
-    let x = {mut tv_sec: 0u, mut tv_usec: 0u};
-    libc::gettimeofday(ptr::addr_of(x), ptr::null());
+    let x = {mut tv_sec: 0 as c_ulonglong, mut tv_usec: 0 as c_ulonglong};
+    lib_c::gettimeofday(ptr::addr_of(x), ptr::null());
     ret (x.tv_sec as u64) * 1000_000_u64 + (x.tv_usec as u64);
 }
 
@@ -2838,8 +2845,8 @@ define a record type with the same contents, and declare
 
 The second argument to `gettimeofday` (the time zone) is not used by
 this program, so it simply declares it to be a pointer to the nil
-type. Since null pointer look the same, no matter which type they are
-supposed to point at, this is safe.
+type. Since all null pointers have the same representation regardless of
+their referent type, this is safe.
 
 # Tasks
 

branches/dist-snap/mk/tests.mk

@@ -95,6 +95,9 @@ cleantestlibs:
 check: cleantestlibs cleantmptestlogs tidy all check-stage2
 	$(Q)$(S)src/etc/check-summary.py tmp/*.log
 
+check-notidy: cleantestlibs cleantmptestlogs all check-stage2
+	$(Q)$(S)src/etc/check-summary.py tmp/*.log
+
 check-full: cleantestlibs cleantmptestlogs tidy \
             all check-stage1 check-stage2 check-stage3
 	$(Q)$(S)src/etc/check-summary.py tmp/*.log