mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Just land already

Browse Source
This commit is contained in:
Brian Anderson 2014-07-20 17:57:29 -07:00
parent 27e70c5d49
commit 71a75cc2ce
5 changed files with 44 additions and 44 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
src/libcollections/dlist.rs
View File

@ -279,12 +279,12 @@ impl<T> DList<T> {
/// # Example
///
/// ```rust
/// use std::collections::{DList, Deque};
/// use std::collections::DList;
///
/// let mut dl = DList::new();
/// dl.push_back(1i);
/// dl.push_back(2);
/// dl.push_back(3);
/// dl.push(1i);
/// dl.push(2);
/// dl.push(3);
///
/// dl.rotate_forward();
///
@ -306,12 +306,12 @@ impl<T> DList<T> {
/// # Example
///
/// ```rust
/// use std::collections::{DList, Deque};
/// use std::collections::DList;
///
/// let mut dl = DList::new();
/// dl.push_back(1i);
/// dl.push_back(2);
/// dl.push_back(3);
/// dl.push(1i);
/// dl.push(2);
/// dl.push(3);
///
/// dl.rotate_backward();
///
@ -333,14 +333,14 @@ impl<T> DList<T> {
/// # Example
///
/// ```rust
/// use std::collections::{DList, Deque};
/// use std::collections::DList;
///
/// let mut a = DList::new();
/// let mut b = DList::new();
/// a.push_back(1i);
/// a.push_back(2);
/// b.push_back(3i);
/// b.push_back(4);
/// a.push(1i);
/// a.push(2);
/// b.push(3i);
/// b.push(4);
///
/// a.append(b);
///
@ -374,14 +374,14 @@ impl<T> DList<T> {
/// # Example
///
/// ```rust
/// use std::collections::{DList, Deque};
/// use std::collections::DList;
///
/// let mut a = DList::new();
/// let mut b = DList::new();
/// a.push_back(1i);
/// a.push_back(2);
/// b.push_back(3i);
/// b.push_back(4);
/// a.push(1i);
/// a.push(2);
/// b.push(3i);
/// b.push(4);
///
/// a.prepend(b);
///
@ -403,13 +403,13 @@ impl<T> DList<T> {
/// # Example
///
/// ```rust
/// use std::collections::{DList, Deque};
/// use std::collections::DList;
///
/// let mut a: DList<int> = DList::new();
/// a.push_back(2i);
/// a.push_back(4);
/// a.push_back(7);
/// a.push_back(8);
/// a.push(2i);
/// a.push(4);
/// a.push(7);
/// a.push(8);
///
/// // insert 11 before the first odd number in the list
/// a.insert_when(11, |&e, _| e % 2 == 1);

36
src/libcollections/lib.rs
View File

@ -360,9 +360,9 @@ pub trait MutableSeq<T>: Mutable {
/// use std::collections::{RingBuf, Deque};
///
/// let mut queue = RingBuf::new();
/// queue.push_back(1i);
/// queue.push_back(2i);
/// queue.push_back(3i);
/// queue.push(1i);
/// queue.push(2i);
/// queue.push(3i);
///
/// // Will print 1, 2, 3
/// while !queue.is_empty() {
@ -398,13 +398,13 @@ pub trait MutableSeq<T>: Mutable {
/// // Init deque with 1, 2, 3, 4
/// deque.push_front(2i);
/// deque.push_front(1i);
/// deque.push_back(3i);
/// deque.push_back(4i);
/// deque.push(3i);
/// deque.push(4i);
///
/// // Will print (1, 4) and (2, 3)
/// while !deque.is_empty() {
/// let f = deque.pop_front().unwrap();
/// let b = deque.pop_back().unwrap();
/// let b = deque.pop().unwrap();
/// println!("{}", (f, b));
/// }
/// ```
@ -420,8 +420,8 @@ pub trait Deque<T> : MutableSeq<T> {
/// let mut d = RingBuf::new();
/// assert_eq!(d.front(), None);
///
/// d.push_back(1i);
/// d.push_back(2i);
/// d.push(1i);
/// d.push(2i);
/// assert_eq!(d.front(), Some(&1i));
/// ```
fn front<'a>(&'a self) -> Option<&'a T>;
@ -437,8 +437,8 @@ pub trait Deque<T> : MutableSeq<T> {
/// let mut d = RingBuf::new();
/// assert_eq!(d.front_mut(), None);
///
/// d.push_back(1i);
/// d.push_back(2i);
/// d.push(1i);
/// d.push(2i);
/// match d.front_mut() {
/// Some(x) => *x = 9i,
/// None => (),
@ -458,8 +458,8 @@ pub trait Deque<T> : MutableSeq<T> {
/// let mut d = DList::new();
/// assert_eq!(d.back(), None);
///
/// d.push_back(1i);
/// d.push_back(2i);
/// d.push(1i);
/// d.push(2i);
/// assert_eq!(d.back(), Some(&2i));
/// ```
fn back<'a>(&'a self) -> Option<&'a T>;
@ -475,8 +475,8 @@ pub trait Deque<T> : MutableSeq<T> {
/// let mut d = DList::new();
/// assert_eq!(d.back(), None);
///
/// d.push_back(1i);
/// d.push_back(2i);
/// d.push(1i);
/// d.push(2i);
/// match d.back_mut() {
/// Some(x) => *x = 9i,
/// None => (),
@ -503,7 +503,7 @@ pub trait Deque<T> : MutableSeq<T> {
///
/// # Example
///
/// ```
/// ```ignore
/// use std::collections::{DList, Deque};
///
/// let mut d = DList::new();
@ -518,7 +518,7 @@ pub trait Deque<T> : MutableSeq<T> {
///
/// # Example
///
/// ```
/// ```ignore
/// use std::collections::{RingBuf, Deque};
///
/// let mut d = RingBuf::new();
@ -540,8 +540,8 @@ pub trait Deque<T> : MutableSeq<T> {
/// use std::collections::{RingBuf, Deque};
///
/// let mut d = RingBuf::new();
/// d.push_back(1i);
/// d.push_back(2i);
/// d.push(1i);
/// d.push(2i);
///
/// assert_eq!(d.pop_front(), Some(1i));
/// assert_eq!(d.pop_front(), Some(2i));

2
src/libcollections/string.rs
View File

@ -575,7 +575,7 @@ mod tests {
use std::prelude::*;
use test::Bencher;
use Mutable;
use {Mutable, MutableSeq};
use str;
use str::{Str, StrSlice, Owned, Slice};
use super::String;

2
src/libcollections/vec.rs
View File

@ -981,7 +981,7 @@ impl<T> Vec<T> {
///
/// # Example
///
/// ```
/// ```ignore
/// let mut vec = vec![1i, 2, 3];
/// vec.unshift(4);
/// assert_eq!(vec, vec![4, 1, 2, 3]);

2
src/libstd/collections/hashmap.rs
View File

@ -1291,7 +1291,7 @@ impl<K: Eq + Hash<S>, V, S, H: Hasher<S>> HashMap<K, V, H> {
/// // new value based on the first letter of the key.
/// |key, already, new| {
/// if key.as_slice().starts_with("z") {
/// already.unshift(new);
/// already.insert(0, new);
/// } else {
/// already.push(new);
/// }