---

yaml
---
r: 142746
b: refs/heads/try2
c: 0f9b9a5
h: refs/heads/master
v: v3

Author: blake2-ppc

[refs]

@@ -5,7 +5,7 @@ refs/heads/snap-stage3: 78a7676898d9f80ab540c6df5d4c9ce35bb50463
 refs/heads/try: 519addf6277dbafccbb4159db4b710c37eaa2ec5
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
-refs/heads/try2: b2b88b326d476425f66d1def14aef3fd286d5aec
+refs/heads/try2: 0f9b9a5fb7348471e9d51bcc298667c71647e0e1
 refs/heads/dist-snap: ba4081a5a8573875fed17545846f6f6902c8ba8d
 refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
 refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503

branches/try2/src/libextra/dlist.rs

@@ -11,6 +11,9 @@
 //! A doubly-linked list with owned nodes.
 //!
 //! The DList allows pushing and popping elements at either end.
+//!
+//! DList implements the trait Deque. It should be imported with `use
+//! extra::container::Deque`.
 
 
 // DList is constructed like a singly-linked list over the field `next`.
@@ -27,7 +30,7 @@ use std::iterator::FromIterator;
 
 use container::Deque;
 
-/// A doubly-linked list
+/// A doubly-linked list.
 pub struct DList<T> {
     priv length: uint,
     priv list_head: Link<T>,

branches/try2/src/libextra/ringbuf.rs

@@ -9,6 +9,9 @@
 // except according to those terms.
 
 //! A double-ended queue implemented as a circular buffer
+//!
+//! RingBuf implements the trait Deque. It should be imported with `use
+//! extra::container::Deque`.
 
 use std::num;
 use std::util;
@@ -21,7 +24,7 @@ use container::Deque;
 static INITIAL_CAPACITY: uint = 8u; // 2^3
 static MINIMUM_CAPACITY: uint = 2u;
 
-#[allow(missing_doc)]
+/// RingBuf is a circular buffer that implements Deque.
 #[deriving(Clone)]
 pub struct RingBuf<T> {
     priv nelts: uint,