---

yaml
---
r: 66365
b: refs/heads/master
c: 3dfbc5a
h: refs/heads/master
i:
  66363: 346294c
v: v3

Author: catamorphism

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 63afb8ccc8dd945e35fa43ca319aeaa5fba78134
+refs/heads/master: 3dfbc5a9c49d65295bf96ce435a29df72e03c09e
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 18e3db7392d2d0697b7e27d6d986139960144d85
 refs/heads/try: 7b78b52e602bb3ea8174f9b2006bff3315f03ef9

trunk/doc/rust.md

@@ -2620,7 +2620,7 @@ assert!(b != "world");
 
 The vector type constructor represents a homogeneous array of values of a given type.
 A vector has a fixed size.
-(Operations like `vec.push` operate solely on owned vectors.)
+(Operations like `vec::push` operate solely on owned vectors.)
 A vector type can be annotated with a _definite_ size,
 written with a trailing asterisk and integer literal, such as `[int * 10]`.
 Such a definite-sized vector type is a first-class type, since its size is known statically.

trunk/src/compiletest/compiletest.rs

@@ -75,7 +75,7 @@ pub fn parse_config(args: ~[~str]) -> config {
          ];
 
     assert!(!args.is_empty());
-    let args_ = args.tail();
+    let args_ = vec::tail(args);
     let matches =
         &match getopts::getopts(args_, opts) {
           Ok(m) => m,

trunk/src/compiletest/runtest.rs

@@ -321,7 +321,8 @@ fn check_error_patterns(props: &TestProps,
     if done { return; }
 
     let missing_patterns =
-        props.error_patterns.slice(next_err_idx, props.error_patterns.len());
+        vec::slice(props.error_patterns, next_err_idx,
+                   props.error_patterns.len());
     if missing_patterns.len() == 1u {
         fatal_ProcRes(fmt!("error pattern '%s' not found!",
                            missing_patterns[0]), ProcRes);

trunk/src/libextra/arc.rs

@@ -517,6 +517,7 @@ mod tests {
 
     use arc::*;
 
+    use core::vec;
     use core::cell::Cell;
     use core::comm;
     use core::task;

trunk/src/libextra/c_vec.rs

@@ -159,7 +159,8 @@ mod tests {
 
             assert!(mem as int != 0);
 
-            c_vec_with_dtor(mem as *mut u8, n as uint, || free(mem))
+            return c_vec_with_dtor(mem as *mut u8, n as uint,
+                                   || unsafe { free(mem) });
         }
     }
 

trunk/src/libextra/crypto/sha2.rs

@@ -11,6 +11,7 @@
 use core::prelude::*;
 
 use core::uint;
+use core::vec;
 
 use digest::Digest;
 
@@ -117,7 +118,7 @@ impl Engine512 {
         }
 
         while in.len() - i >= 8 {
-            let w = to_u64(in.slice(i, i + 8));
+            let w = to_u64(vec::slice(in, i, i + 8));
             self.process_word(w);
             self.bit_counter.add_bytes(8);
             i += 8;
@@ -273,43 +274,43 @@ impl Engine512 {
     fn result_512(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u64(self.H0, out.mut_slice(0, 8));
-        from_u64(self.H1, out.mut_slice(8, 16));
-        from_u64(self.H2, out.mut_slice(16, 24));
-        from_u64(self.H3, out.mut_slice(24, 32));
-        from_u64(self.H4, out.mut_slice(32, 40));
-        from_u64(self.H5, out.mut_slice(40, 48));
-        from_u64(self.H6, out.mut_slice(48, 56));
-        from_u64(self.H7, out.mut_slice(56, 64));
+        from_u64(self.H0, vec::mut_slice(out, 0, 8));
+        from_u64(self.H1, vec::mut_slice(out, 8, 16));
+        from_u64(self.H2, vec::mut_slice(out, 16, 24));
+        from_u64(self.H3, vec::mut_slice(out, 24, 32));
+        from_u64(self.H4, vec::mut_slice(out, 32, 40));
+        from_u64(self.H5, vec::mut_slice(out, 40, 48));
+        from_u64(self.H6, vec::mut_slice(out, 48, 56));
+        from_u64(self.H7, vec::mut_slice(out, 56, 64));
     }
 
     fn result_384(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u64(self.H0, out.mut_slice(0, 8));
-        from_u64(self.H1, out.mut_slice(8, 16));
-        from_u64(self.H2, out.mut_slice(16, 24));
-        from_u64(self.H3, out.mut_slice(24, 32));
-        from_u64(self.H4, out.mut_slice(32, 40));
-        from_u64(self.H5, out.mut_slice(40, 48));
+        from_u64(self.H0, vec::mut_slice(out, 0, 8));
+        from_u64(self.H1, vec::mut_slice(out, 8, 16));
+        from_u64(self.H2, vec::mut_slice(out, 16, 24));
+        from_u64(self.H3, vec::mut_slice(out, 24, 32));
+        from_u64(self.H4, vec::mut_slice(out, 32, 40));
+        from_u64(self.H5, vec::mut_slice(out, 40, 48));
     }
 
     fn result_256(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u64(self.H0, out.mut_slice(0, 8));
-        from_u64(self.H1, out.mut_slice(8, 16));
-        from_u64(self.H2, out.mut_slice(16, 24));
-        from_u64(self.H3, out.mut_slice(24, 32));
+        from_u64(self.H0, vec::mut_slice(out, 0, 8));
+        from_u64(self.H1, vec::mut_slice(out, 8, 16));
+        from_u64(self.H2, vec::mut_slice(out, 16, 24));
+        from_u64(self.H3, vec::mut_slice(out, 24, 32));
     }
 
     fn result_224(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u64(self.H0, out.mut_slice(0, 8));
-        from_u64(self.H1, out.mut_slice(8, 16));
-        from_u64(self.H2, out.mut_slice(16, 24));
-        from_u32((self.H3 >> 32) as u32, out.mut_slice(24, 28));
+        from_u64(self.H0, vec::mut_slice(out, 0, 8));
+        from_u64(self.H1, vec::mut_slice(out, 8, 16));
+        from_u64(self.H2, vec::mut_slice(out, 16, 24));
+        from_u32((self.H3 >> 32) as u32, vec::mut_slice(out, 24, 28));
     }
 }
 
@@ -399,7 +400,7 @@ impl Engine256 {
         }
 
         while in.len() - i >= 4 {
-            let w = to_u32(in.slice(i, i + 4));
+            let w = to_u32(vec::slice(in, i, i + 4));
             self.process_word(w);
             self.length_bytes += 4;
             i += 4;
@@ -555,26 +556,26 @@ impl Engine256 {
     fn result_256(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u32(self.H0, out.mut_slice(0, 4));
-        from_u32(self.H1, out.mut_slice(4, 8));
-        from_u32(self.H2, out.mut_slice(8, 12));
-        from_u32(self.H3, out.mut_slice(12, 16));
-        from_u32(self.H4, out.mut_slice(16, 20));
-        from_u32(self.H5, out.mut_slice(20, 24));
-        from_u32(self.H6, out.mut_slice(24, 28));
-        from_u32(self.H7, out.mut_slice(28, 32));
+        from_u32(self.H0, vec::mut_slice(out, 0, 4));
+        from_u32(self.H1, vec::mut_slice(out, 4, 8));
+        from_u32(self.H2, vec::mut_slice(out, 8, 12));
+        from_u32(self.H3, vec::mut_slice(out, 12, 16));
+        from_u32(self.H4, vec::mut_slice(out, 16, 20));
+        from_u32(self.H5, vec::mut_slice(out, 20, 24));
+        from_u32(self.H6, vec::mut_slice(out, 24, 28));
+        from_u32(self.H7, vec::mut_slice(out, 28, 32));
     }
 
     fn result_224(&mut self, out: &mut [u8]) {
         self.finish();
 
-        from_u32(self.H0, out.mut_slice(0, 4));
-        from_u32(self.H1, out.mut_slice(4, 8));
-        from_u32(self.H2, out.mut_slice(8, 12));
-        from_u32(self.H3, out.mut_slice(12, 16));
-        from_u32(self.H4, out.mut_slice(16, 20));
-        from_u32(self.H5, out.mut_slice(20, 24));
-        from_u32(self.H6, out.mut_slice(24, 28));
+        from_u32(self.H0, vec::mut_slice(out, 0, 4));
+        from_u32(self.H1, vec::mut_slice(out, 4, 8));
+        from_u32(self.H2, vec::mut_slice(out, 8, 12));
+        from_u32(self.H3, vec::mut_slice(out, 12, 16));
+        from_u32(self.H4, vec::mut_slice(out, 16, 20));
+        from_u32(self.H5, vec::mut_slice(out, 20, 24));
+        from_u32(self.H6, vec::mut_slice(out, 24, 28));
     }
 }
 

trunk/src/libextra/deque.rs

@@ -137,7 +137,7 @@ impl<T> Deque<T> {
     ///
     /// * n - The number of elements to reserve space for
     pub fn reserve(&mut self, n: uint) {
-        self.elts.reserve(n);
+        vec::reserve(&mut self.elts, n);
     }
 
     /// Reserve capacity for at least `n` elements in the given deque,
@@ -151,7 +151,7 @@ impl<T> Deque<T> {
     ///
     /// * n - The number of elements to reserve space for
     pub fn reserve_at_least(&mut self, n: uint) {
-        self.elts.reserve_at_least(n);
+        vec::reserve_at_least(&mut self.elts, n);
     }
 
     /// Front-to-back iterator.
@@ -256,6 +256,7 @@ mod tests {
     use super::*;
     use core::cmp::Eq;
     use core::kinds::Copy;
+    use core::vec::capacity;
     use core;
 
     #[test]
@@ -441,23 +442,23 @@ mod tests {
         let mut d = Deque::new();
         d.add_back(0u64);
         d.reserve(50);
-        assert_eq!(d.elts.capacity(), 50);
+        assert_eq!(capacity(&mut d.elts), 50);
         let mut d = Deque::new();
         d.add_back(0u32);
         d.reserve(50);
-        assert_eq!(d.elts.capacity(), 50);
+        assert_eq!(capacity(&mut d.elts), 50);
     }
 
     #[test]
     fn test_reserve_at_least() {
         let mut d = Deque::new();
         d.add_back(0u64);
         d.reserve_at_least(50);
-        assert_eq!(d.elts.capacity(), 64);
+        assert_eq!(capacity(&mut d.elts), 64);
         let mut d = Deque::new();
         d.add_back(0u32);
         d.reserve_at_least(50);
-        assert_eq!(d.elts.capacity(), 64);
+        assert_eq!(capacity(&mut d.elts), 64);
     }
 
     #[test]

trunk/src/libextra/dlist.rs

@@ -526,6 +526,8 @@ mod tests {
 
     use super::*;
 
+    use core::vec;
+
     #[test]
     fn test_dlist_concat() {
         let a = from_vec([1,2]);

trunk/src/libextra/ebml.rs

@@ -85,6 +85,7 @@ pub mod reader {
     use core::ptr::offset;
     use core::str;
     use core::unstable::intrinsics::bswap32;
+    use core::vec;
 
     // ebml reading
 
@@ -247,7 +248,7 @@ pub mod reader {
     }
 
     pub fn with_doc_data<T>(d: Doc, f: &fn(x: &[u8]) -> T) -> T {
-        f(d.data.slice(d.start, d.end))
+        f(vec::slice(*d.data, d.start, d.end))
     }
 
 

trunk/src/libextra/net_tcp.rs

@@ -976,7 +976,9 @@ impl io::Writer for TcpSocketBuf {
         let socket_data_ptr: *TcpSocketData =
             &(*((*(self.data)).sock).socket_data);
         let w_result = write_common_impl(socket_data_ptr,
-                                         data.slice(0, data.len()).to_owned());
+                                         vec::slice(data,
+                                                    0,
+                                                    data.len()).to_owned());
         if w_result.is_err() {
             let err_data = w_result.get_err();
             debug!(
@@ -1457,23 +1459,33 @@ mod test {
 
             #[test]
             fn test_gl_tcp_server_and_client_ipv4() {
-                impl_gl_tcp_ipv4_server_and_client();
+                unsafe {
+                    impl_gl_tcp_ipv4_server_and_client();
+                }
             }
             #[test]
             fn test_gl_tcp_get_peer_addr() {
-                impl_gl_tcp_ipv4_get_peer_addr();
+                unsafe {
+                    impl_gl_tcp_ipv4_get_peer_addr();
+                }
             }
             #[test]
             fn test_gl_tcp_ipv4_client_error_connection_refused() {
-                impl_gl_tcp_ipv4_client_error_connection_refused();
+                unsafe {
+                    impl_gl_tcp_ipv4_client_error_connection_refused();
+                }
             }
             #[test]
             fn test_gl_tcp_server_address_in_use() {
-                impl_gl_tcp_ipv4_server_address_in_use();
+                unsafe {
+                    impl_gl_tcp_ipv4_server_address_in_use();
+                }
             }
             #[test]
             fn test_gl_tcp_server_access_denied() {
-                impl_gl_tcp_ipv4_server_access_denied();
+                unsafe {
+                    impl_gl_tcp_ipv4_server_access_denied();
+                }
             }
             // Strange failure on Windows. --pcwalton
             #[test]

trunk/src/libextra/num/bigint.rs

@@ -298,8 +298,9 @@ impl Mul<BigUint, BigUint> for BigUint {
 
         fn cut_at(a: &BigUint, n: uint) -> (BigUint, BigUint) {
             let mid = uint::min(a.data.len(), n);
-            return (BigUint::from_slice(a.data.slice(mid, a.data.len())),
-                    BigUint::from_slice(a.data.slice(0, mid)));
+            return (BigUint::from_slice(vec::slice(a.data, mid,
+                                                   a.data.len())),
+                    BigUint::from_slice(vec::slice(a.data, 0, mid)));
         }
 
 
@@ -412,7 +413,7 @@ impl Integer for BigUint {
                 return (Zero::zero(), Zero::zero(), copy *a);
             }
 
-            let an = a.data.slice(a.data.len() - n, a.data.len());
+            let an = vec::slice(a.data, a.data.len() - n, a.data.len());
             let bn = *b.data.last();
             let mut d = ~[];
             let mut carry = 0;
@@ -577,7 +578,7 @@ impl BigUint {
         let mut power: BigUint  = One::one();
         loop {
             let start = uint::max(end, unit_len) - unit_len;
-            match uint::parse_bytes(buf.slice(start, end), radix) {
+            match uint::parse_bytes(vec::slice(buf, start, end), radix) {
                 // FIXME(#6102): Assignment operator for BigInt causes ICE
                 // Some(d) => n += BigUint::from_uint(d) * power,
                 Some(d) => n = n + BigUint::from_uint(d) * power,
@@ -633,7 +634,7 @@ impl BigUint {
         if n_unit == 0 { return copy *self; }
         if self.data.len() < n_unit { return Zero::zero(); }
         return BigUint::from_slice(
-            self.data.slice(n_unit, self.data.len())
+            vec::slice(self.data, n_unit, self.data.len())
         );
     }
 
@@ -1131,7 +1132,7 @@ impl BigInt {
             sign  = Minus;
             start = 1;
         }
-        return BigUint::parse_bytes(buf.slice(start, buf.len()), radix)
+        return BigUint::parse_bytes(vec::slice(buf, start, buf.len()), radix)
             .map_consume(|bu| BigInt::from_biguint(sign, bu));
     }
 
@@ -1175,7 +1176,7 @@ mod biguint_tests {
         let data = [ &[], &[1], &[2], &[-1], &[0, 1], &[2, 1], &[1, 1, 1]  ]
             .map(|v| BigUint::from_slice(*v));
         for data.iter().enumerate().advance |(i, ni)| {
-            for data.slice(i, data.len()).iter().enumerate().advance |(j0, nj)| {
+            for vec::slice(data, i, data.len()).iter().enumerate().advance |(j0, nj)| {
                 let j = j0 + i;
                 if i == j {
                     assert_eq!(ni.cmp(nj), Equal);
@@ -1653,7 +1654,7 @@ mod bigint_tests {
         nums.push_all_move(vs.map(|s| BigInt::from_slice(Plus, *s)));
 
         for nums.iter().enumerate().advance |(i, ni)| {
-            for nums.slice(i, nums.len()).iter().enumerate().advance |(j0, nj)| {
+            for vec::slice(nums, i, nums.len()).iter().enumerate().advance |(j0, nj)| {
                 let j = i + j0;
                 if i == j {
                     assert_eq!(ni.cmp(nj), Equal);

trunk/src/libextra/priority_queue.rs

@@ -52,12 +52,12 @@ impl<T:Ord> PriorityQueue<T> {
     }
 
     /// Returns the number of elements the queue can hold without reallocating
-    pub fn capacity(&self) -> uint { self.data.capacity() }
+    pub fn capacity(&self) -> uint { vec::capacity(&self.data) }
 
-    pub fn reserve(&mut self, n: uint) { self.data.reserve(n) }
+    pub fn reserve(&mut self, n: uint) { vec::reserve(&mut self.data, n) }
 
     pub fn reserve_at_least(&mut self, n: uint) {
-        self.data.reserve_at_least(n)
+        vec::reserve_at_least(&mut self.data, n)
     }
 
     /// Pop the greatest item from the queue - fails if empty