---

yaml
---
r: 81729
b: refs/heads/master
c: 7cb0c63
h: refs/heads/master
i:
  81727: 4184bfd
v: v3

Author: sebcrozet

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: eb519b952d2cc2b2af6b3be38377daa431983929
+refs/heads/master: 7cb0c6392b431280a624def34f6704984a4f3e2f
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 6c08cc2db4f98e9f07ae7d50338396c4123c2f0a
 refs/heads/try: 70152ff55722878cde684ee6462c14c65f2c4729

trunk/Makefile.in

@@ -442,7 +442,6 @@ CSREQ$(1)_T_$(2)_H_$(3) = \
 	$$(TSREQ$(1)_T_$(2)_H_$(3)) \
 	$$(HBIN$(1)_H_$(3))/rustpkg$$(X_$(3)) \
 	$$(HBIN$(1)_H_$(3))/rustdoc$$(X_$(3)) \
-	$$(HBIN$(1)_H_$(3))/rustdoc_ng$$(X_$(3)) \
 	$$(HBIN$(1)_H_$(3))/rusti$$(X_$(3)) \
 	$$(HBIN$(1)_H_$(3))/rust$$(X_$(3)) \
 	$$(HLIB$(1)_H_$(3))/$(CFG_LIBRUSTPKG_$(3)) \

trunk/README.md

@@ -61,7 +61,7 @@ documentation.
 
 [repo]: https://github.com/mozilla/rust
 [tarball]: http://static.rust-lang.org/dist/rust-0.7.tar.gz
-[tutorial]: http://static.rust-lang.org/doc/0.7/tutorial.html
+[tutorial]: http://static.rust-lang.org/doc/tutorial.html
 
 ## Notes
 

trunk/RELEASES.txt

@@ -1,148 +1,3 @@
-Version 0.8 (October 2013)
---------------------------
-
-   * ~2100 changes, numerous bugfixes
-
-   * Language
-      * The `for` loop syntax has changed to work with the `Iterator` trait.
-      * At long last, unwinding works on Windows.
-      * Default methods definitely mostly work.
-      * Many trait inheritance bugs fixed.
-      * Owned and borrowed trait objects work more reliably.
-      * `copy` is no longer a keyword. It has been replaced by the `Clone` trait.
-      * rustc no longer emits code for the `debug!` macro unless it is passed
-        `--cfg debug`
-      * mod.rs is now "blessed". When loading `mod foo;`, rustc will now look
-        for foo.rs, then foo/mod.rs, and will generate an error when both are
-        present.
-      * Strings no longer contain trailing nulls. The new `std::c_str` module
-        provides new mechanisms for converting to C strings.
-      * The type of foreign functions is now `extern "C" fn` instead of `*u8'.
-      * The FFI has been overhauled such that foreign functions are called directly,
-        instead of through a stack-switching wrapper.
-      * Calling a foreign function must be done through a Rust function with the
-        `#[fixed_stack_segment]` attribute.
-      * The `externfn!` macro can be used to declare both a foreign function and
-        a `#[fixed_stack_segment]` wrapper at once.
-      * `pub` and `priv` modifiers on `extern` blocks are no longer parsed.
-      * `unsafe` is no longer allowed on extern fns - they are all unsafe.
-      * `priv` is disallowed everywhere except for struct fields and enum variants.
-      * `&T` (besides `&'static T`) is no longer allowed in `@T`.
-      * `ref` bindings in irrefutable patterns work correctly now.
-      * `char` is now prevented from containing invalid code points.
-      * Casting to `bool` is no longer allowed.
-      * `yield` is a reserved keyword.
-      * `typeof` is a reserved keyword.
-      * Crates may be imported by URL with `extern mod foo = "url";`.
-      * Explicit enum discriminants may be given as uints as in `enum E { V = 0u }`
-      * Static vectors can be initialized with repeating elements,
-        e.g. `static foo: [u8, .. 100]: [0, .. 100];`.
-      * Static structs can be initialized with functional record update,
-        e.g. `static foo: Foo = Foo { a: 5, .. bar };`.
-      * `cfg!` can be used to conditionally execute code based on the crate
-        configuration, similarly to `#[cfg(...)]`.
-      * The `unnecessary_qualification` lint detects unneeded module
-        prefixes (default: allow).
-      * Arithmetic operations have been implemented on the SIMD types in
-        `std::unstable::simd`.
-      * Exchange allocation headers were removed, reducing memory usage.
-      * `format!` implements a completely new, extensible, and higher-performance
-        string formatting system. It will replace `fmt!`.
-      * `print!` and `println!` write formatted strings (using the `format!`
-        extension) to stdout.
-      * `write!` and `writeln!` write formatted strings (using the `format!`
-        extension) to the new Writers in `std::rt::io`.
-      * The library section in which a function or static is placed may
-        be specified with `#[link_section = "..."]`.
-      * The `proto!` syntax extension for defining bounded message protocols
-        was removed.
-      * `macro_rules!` is hygenic for `let` declarations.
-      * The `#[export_name]` attribute specifies the name of a symbol.
-      * `unreachable!` can be used to indicate unreachable code, and fails
-        if executed.
-
-   * Libraries
-      * std: Transitioned to the new runtime, written in Rust.
-      * std: Added an experimental I/O library, `rt::io`, based on the new
-        runtime.
-      * std: A new generic `range` function was added to the prelude, replacing
-        `uint::range` and friends.
-      * std: `range_rev` no longer exists. Since range is an iterator it can be
-        reversed with `range(lo, hi).invert()`.
-      * std: The `chain` method on option renamed to `and_then`; `unwrap_or_default`
-        renamed to `unwrap_or`.
-      * std: The `iterator` module was renamed to `iter`.
-      * std: Integral types now support the `checked_add`, `checked_sub`, and
-        `checked_mul` operations for detecting overflow.
-      * std: Many methods in `str`, `vec`, `option, `result` were renamed for
-        consistency.
-      * std: Methods are standardizing on conventions for casting methods:
-        `to_foo` for copying, `into_foo` for moving, `as_foo` for temporary
-        and cheap casts.
-      * std: The `CString` type in `c_str` provides new ways to convert to and
-        from C strings.
-      * std: `DoubleEndedIterator` can yield elements in two directions.
-      * std: The `mut_split` method on vectors partitions an `&mut [T]` into
-        two splices.
-      * std: `str::from_bytes` renamed to `str::from_utf8`.
-      * std: `pop_opt` and `shift_opt` methods added to vectors.
-      * std: The task-local data interface no longer uses @, and keys are
-        no longer function pointers.
-      * std: The `swap_unwrap` method of `Option` renamed to `take_unwrap`.
-      * std: Added `SharedPort` to `comm`.
-      * std: `Eq` has a default method for `ne`; only `eq` is required
-        in implementations.
-      * std: `Ord` has default methods for `le`, `gt` and `le`; only `lt`
-        is required in implementations.
-      * std: `is_utf8` performance is improved, impacting many string functions.
-      * std: `os::MemoryMap` provides cross-platform mmap.
-      * std: `ptr::offset` is now unsafe, but also more optimized. Offsets that
-        are not 'in-bounds' are considered undefined.
-      * std: Many freestanding functions in `vec` removed in favor of methods.
-      * std: Many freestanding functions on scalar types removed in favor of
-        methods.
-      * std: Many options to task builders were removed since they don't make
-        sense in the new scheduler design.
-      * std: More containers implement `FromIterator` so can be created by the
-        `collect` method.
-      * std: More complete atomic types in `unstable::atomics`.
-      * std: `comm::PortSet` removed.
-      * std: Mutating methods in the `Set` and `Map` traits have been moved into
-        the `MutableSet` and `MutableMap` traits. `Container::is_empty`,
-        `Map::contains_key`, `MutableMap::insert`, and `MutableMap::remove` have
-        default implementations.
-      * extra: `dlist`, the doubly-linked list was modernized.
-      * extra: Added a `hex` module with `ToHex` and `FromHex` traits.
-      * extra: Added `glob` module, replacing `std::os::glob`.
-      * extra: `rope` was removed.
-      * extra: `deque` was renamed to `ringbuf`. `RingBuf` implements `Deque`.
-      * extra: `net`, and `timer` were removed. The experimental replacements
-        are `std::rt::io::net` and `std::rt::io::timer`.
-      * extra: Iterators implemented for `SmallIntMap`.
-      * extra: Iterators implemented for `Bitv` and `BitvSet`.
-      * extra: `SmallIntSet` removed. Use `BitvSet`.
-      * extra: Performance of JSON parsing greatly improved.
-      * extra: `semver` updated to SemVer 2.0.0.
-      * extra: `term` handles more terminals correctly.
-      * extra: `dbg` module removed.
-
-   * Other
-      * rustc's debug info generation (`-Z debug-info`) is greatly improved.
-      * rustc accepts `--target-cpu` to compile to a specific CPU architecture,
-        similarly to gcc's `--march` flag.
-      * rustpkg has received many improvements.
-      * rustpkg supports git tags as package IDs.
-      * rustpkg builds into target-specific directories so it can be used for
-        cross-compiling.
-      * The number of concurrent test tasks is controlled by the environment
-        variable RUST_TEST_TASKS.
-      * The test harness can now report metrics for benchmarks.
-      * All tools have man pages.
-      * Programs compiled with `--test` now support the `-h` and `--help` flags.
-      * The runtime uses jemalloc for allocations.
-      * Segmented stacks are temporarily disabled as part of the transition to
-        the new runtime. Stack overflows are possible!
-
 Version 0.7 (July 2013)
 -----------------------
 

trunk/doc/rust.md

@@ -248,7 +248,7 @@ string_body : non_double_quote
             | '\x5c' [ '\x22' | common_escape ] ;
 
 common_escape : '\x5c'
-              | 'n' | 'r' | 't' | '0'
+              | 'n' | 'r' | 't'
               | 'x' hex_digit 2
               | 'u' hex_digit 4
               | 'U' hex_digit 8 ;
@@ -962,76 +962,24 @@ parameters to allow methods with that trait to be called on values
 of that type.
 
 
-#### Unsafety
+#### Unsafe functions
 
-Unsafe operations are those that potentially violate the memory-safety guarantees of Rust's static semantics.
+Unsafe functions are those containing unsafe operations that are not contained in an [`unsafe` block](#unsafe-blocks).
+Such a function must be prefixed with the keyword `unsafe`.
 
-The following language level features cannot be used in the safe subset of Rust:
+Unsafe operations are those that potentially violate the memory-safety guarantees of Rust's static semantics.
+Specifically, the following operations are considered unsafe:
 
   - Dereferencing a [raw pointer](#pointer-types).
-  - Calling an unsafe function (including an intrinsic or foreign function).
-
-##### Unsafe functions
-
-Unsafe functions are functions that are not safe in all contexts and/or for all possible inputs.
-Such a function must be prefixed with the keyword `unsafe`.
+  - Casting a [raw pointer](#pointer-types) to a safe pointer type.
+  - Calling an unsafe function.
 
 ##### Unsafe blocks
 
-A block of code can also be prefixed with the `unsafe` keyword, to permit calling `unsafe` functions
-or dereferencing raw pointers within a safe function.
-
-When a programmer has sufficient conviction that a sequence of potentially unsafe operations is
-actually safe, they can encapsulate that sequence (taken as a whole) within an `unsafe` block. The
-compiler will consider uses of such code safe, in the surrounding context.
-
-Unsafe blocks are used to wrap foreign libraries, make direct use of hardware or implement features
-not directly present in the language. For example, Rust provides the language features necessary to
-implement memory-safe concurrency in the language but the implementation of tasks and message
-passing is in the standard library.
-
-Rust's type system is a conservative approximation of the dynamic safety requirements, so in some
-cases there is a performance cost to using safe code.  For example, a doubly-linked list is not a
-tree structure and can only be represented with managed or reference-counted pointers in safe code.
-By using `unsafe` blocks to represent the reverse links as raw pointers, it can be implemented with
-only owned pointers.
-
-##### Behavior considered unsafe
-
-This is a list of behavior which is forbidden in all Rust code. Type checking provides the guarantee
-that these issues are never caused by safe code. An `unsafe` block or function is responsible for
-never invoking this behaviour or exposing an API making it possible for it to occur in safe code.
-
-* Data races
-* Dereferencing a null/dangling raw pointer
-* Mutating an immutable value/reference, if it is not marked as non-`Freeze`
-* Reads of [undef](http://llvm.org/docs/LangRef.html#undefined-values) (uninitialized) memory
-* Breaking the [pointer aliasing rules](http://llvm.org/docs/LangRef.html#pointer-aliasing-rules)
-  with raw pointers (a subset of the rules used by C)
-* Invoking undefined behavior via compiler intrinsics:
-    * Indexing outside of the bounds of an object with `std::ptr::offset` (`offset` intrinsic), with
-      the exception of one byte past the end which is permitted.
-    * Using `std::ptr::copy_nonoverlapping_memory` (`memcpy32`/`memcpy64` instrinsics) on
-      overlapping buffers
-* Invalid values in primitive types, even in private fields/locals:
-    * Dangling/null pointers in non-raw pointers, or slices
-    * A value other than `false` (0) or `true` (1) in a `bool`
-    * A discriminant in an `enum` not included in the type definition
-    * A value in a `char` which is a surrogate or above `char::MAX`
-    * non-UTF-8 byte sequences in a `str`
-
-##### Behaviour not considered unsafe
-
-This is a list of behaviour not considered *unsafe* in Rust terms, but that may be undesired.
-
-* Deadlocks
-* Reading data from private fields (`std::repr`, `format!("{:?}", x)`)
-* Leaks due to reference count cycles, even in the global heap
-* Exiting without calling destructors
-* Sending signals
-* Accessing/modifying the file system
-* Unsigned integer overflow (well-defined as wrapping)
-* Signed integer overflow (well-defined as two's complement representation wrapping)
+A block of code can also be prefixed with the `unsafe` keyword, to permit a sequence of unsafe operations in an otherwise-safe function.
+This facility exists because the static semantics of Rust are a necessary approximation of the dynamic semantics.
+When a programmer has sufficient conviction that a sequence of unsafe operations is actually safe, they can encapsulate that sequence (taken as a whole) within an `unsafe` block. The compiler will consider uses of such code "safe", to the surrounding context.
+
 
 #### Diverging functions
 

trunk/doc/tutorial-container.md

@@ -4,14 +4,14 @@
 
 The container traits are defined in the `std::container` module.
 
-## Unique vectors
+## Unique and managed vectors
 
-Vectors have `O(1)` indexing, push (to the end) and pop (from the end). Vectors
-are the most common container in Rust, and are flexible enough to fit many use
-cases.
+Vectors have `O(1)` indexing and removal from the end, along with `O(1)`
+amortized insertion. Vectors are the most common container in Rust, and are
+flexible enough to fit many use cases.
 
 Vectors can also be sorted and used as efficient lookup tables with the
-`bsearch()` method, if all the elements are inserted at one time and
+`std::vec::bsearch` function, if all the elements are inserted at one time and
 deletions are unnecessary.
 
 ## Maps and sets
@@ -42,15 +42,10 @@ implementing the `IterBytes` trait.
 
 ## Double-ended queues
 
-The `extra::ringbuf` module implements a double-ended queue with `O(1)`
-amortized inserts and removals from both ends of the container. It also has
-`O(1)` indexing like a vector. The contained elements are not required to be
-copyable, and the queue will be sendable if the contained type is sendable.
-Its interface `Deque` is defined in `extra::collections`.
-
-The `extra::dlist` module implements a double-ended linked list, also
-implementing the `Deque` trait, with `O(1)` removals and inserts at either end,
-and `O(1)` concatenation.
+The `extra::deque` module implements a double-ended queue with `O(1)` amortized
+inserts and removals from both ends of the container. It also has `O(1)`
+indexing like a vector. The contained elements are not required to be copyable,
+and the queue will be sendable if the contained type is sendable.
 
 ## Priority queues
 
@@ -202,11 +197,11 @@ The function `range` (or `range_inclusive`) allows to simply iterate through a g
 
 ~~~
 for i in range(0, 5) {
-  print!("{} ", i) // prints "0 1 2 3 4"
+  printf!("%d ", i) // prints "0 1 2 3 4"
 }
 
 for i in std::iter::range_inclusive(0, 5) { // needs explicit import
-  print!("{} ", i) // prints "0 1 2 3 4 5"
+  printf!("%d ", i) // prints "0 1 2 3 4 5"
 }
 ~~~
 
@@ -238,15 +233,15 @@ let mut it = xs.iter().zip(ys.iter());
 
 // print out the pairs of elements up to (&3, &"baz")
 for (x, y) in it {
-    println!("{} {}", *x, *y);
+    printfln!("%d %s", *x, *y);
 
     if *x == 3 {
         break;
     }
 }
 
 // yield and print the last pair from the iterator
-println!("last: {:?}", it.next());
+printfln!("last: %?", it.next());
 
 // the iterator is now fully consumed
 assert!(it.next().is_none());
@@ -340,13 +335,13 @@ another `DoubleEndedIterator` with `next` and `next_back` exchanged.
 ~~~
 let xs = [1, 2, 3, 4, 5, 6];
 let mut it = xs.iter();
-println!("{:?}", it.next()); // prints `Some(&1)`
-println!("{:?}", it.next()); // prints `Some(&2)`
-println!("{:?}", it.next_back()); // prints `Some(&6)`
+printfln!("%?", it.next()); // prints `Some(&1)`
+printfln!("%?", it.next()); // prints `Some(&2)`
+printfln!("%?", it.next_back()); // prints `Some(&6)`
 
 // prints `5`, `4` and `3`
 for &x in it.invert() {
-    println!("{}", x)
+    printfln!("%?", x)
 }
 ~~~
 
@@ -361,11 +356,11 @@ let xs = [1, 2, 3, 4];
 let ys = [5, 6, 7, 8];
 let mut it = xs.iter().chain(ys.iter()).map(|&x| x * 2);
 
-println!("{:?}", it.next()); // prints `Some(2)`
+printfln!("%?", it.next()); // prints `Some(2)`
 
 // prints `16`, `14`, `12`, `10`, `8`, `6`, `4`
 for x in it.invert() {
-    println!("{}", x);
+    printfln!("%?", x);
 }
 ~~~
 
@@ -392,17 +387,17 @@ underlying iterators are.
 let xs = [1, 2, 3, 4, 5];
 let ys = ~[7, 9, 11];
 let mut it = xs.iter().chain(ys.iter());
-println!("{:?}", it.idx(0)); // prints `Some(&1)`
-println!("{:?}", it.idx(5)); // prints `Some(&7)`
-println!("{:?}", it.idx(7)); // prints `Some(&11)`
-println!("{:?}", it.idx(8)); // prints `None`
+printfln!("%?", it.idx(0)); // prints `Some(&1)`
+printfln!("%?", it.idx(5)); // prints `Some(&7)`
+printfln!("%?", it.idx(7)); // prints `Some(&11)`
+printfln!("%?", it.idx(8)); // prints `None`
 
 // yield two elements from the beginning, and one from the end
 it.next();
 it.next();
 it.next_back();
 
-println!("{:?}", it.idx(0)); // prints `Some(&3)`
-println!("{:?}", it.idx(4)); // prints `Some(&9)`
-println!("{:?}", it.idx(6)); // prints `None`
+printfln!("%?", it.idx(0)); // prints `Some(&3)`
+printfln!("%?", it.idx(4)); // prints `Some(&9)`
+printfln!("%?", it.idx(6)); // prints `None`
 ~~~