Remove references to traits that no longer exist

This specifically means:
- `Deque`
- `Map`
- `Set`

diff --git a/src/libcollections/dlist.rs b/src/libcollections/dlist.rs
index 712c0bcabd58ce15b6181beecd9bd57569d6af43..11468776ac85156151af59305e6b536837fbe8ab 100644 (file)
--- a/src/libcollections/dlist.rs
+++ b/src/libcollections/dlist.rs
@@ -10,7 +10,8 @@
 
 //! A doubly-linked list with owned nodes.
 //!
-//! The `DList` allows pushing and popping elements at either end.
+//! The `DList` allows pushing and popping elements at either end and is thus
+//! efficiently usable as a double-ended queue.
 
 // DList is constructed like a singly-linked list over the field `next`.
 // including the last link being None; each Node owns its `next` field.

diff --git a/src/libcollections/enum_set.rs b/src/libcollections/enum_set.rs
index 28514b991921180d81fdcab2905dd4a84eda197c..d8dc1f36e056d6e4ab6d310c1cbae730745c30f3 100644 (file)
--- a/src/libcollections/enum_set.rs
+++ b/src/libcollections/enum_set.rs
@@ -20,7 +20,7 @@
 // FIXME(contentions): implement union family of methods? (general design may be wrong here)
 
 #[deriving(Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
-/// A specialized `Set` implementation to use enum types.
+/// A specialized set implementation to use enum types.
 pub struct EnumSet<E> {
     // We must maintain the invariant that no bits are set
     // for which no variant exists

diff --git a/src/libcollections/ring_buf.rs b/src/libcollections/ring_buf.rs
index 516b953dad9ba443d21d4e712e30e2e48f4db693..6aa083d67f578268d3556aaa5ffdf334b3295021 100644 (file)
--- a/src/libcollections/ring_buf.rs
+++ b/src/libcollections/ring_buf.rs
@@ -34,7 +34,7 @@
 // FIXME(conventions): implement shrink_to_fit. Awkward with the current design, but it should
 // be scrapped anyway. Defer to rewrite?
 
-/// `RingBuf` is a circular buffer.
+/// `RingBuf` is a circular buffer, which can be used as a double-ended queue efficiently.
 pub struct RingBuf<T> {
     // tail and head are pointers into the buffer. Tail always points
     // to the first element that could be read, Head always points

diff --git a/src/libcollections/tree/mod.rs b/src/libcollections/tree/mod.rs
index 20823a2affc7f5d73fd887a23bf81b9b932089d2..6b185950308e74bbd21bcf3c62a622fa21d70bc7 100644 (file)
--- a/src/libcollections/tree/mod.rs
+++ b/src/libcollections/tree/mod.rs
@@ -9,8 +9,7 @@
 // except according to those terms.
 
 //! Maps are collections of unique keys with corresponding values, and sets are
-//! just unique keys without a corresponding value. The `Map` and `Set` traits in
-//! `std::container` define the basic interface.
+//! just unique keys without a corresponding value.
 //!
 //! This crate defines the `TreeMap` and `TreeSet` types. Their keys must implement `Ord`.
 //!

diff --git a/src/libcollections/tree/set.rs b/src/libcollections/tree/set.rs
index 15bf4988619cc24a6bbd806ae7b7bdec924cdeae..3747f56de68f125554e88643aca14f27046e77c1 100644 (file)
--- a/src/libcollections/tree/set.rs
+++ b/src/libcollections/tree/set.rs
@@ -23,8 +23,8 @@
 // FIXME(conventions): implement bounded iterators
 // FIXME(conventions): replace rev_iter(_mut) by making iter(_mut) DoubleEnded
 
-/// An implementation of the `Set` trait on top of the `TreeMap` container. The
-/// only requirement is that the type of the elements contained ascribes to the
+/// An implementation of a set on top of the `TreeMap` container. The only
+/// requirement is that the type of the elements contained ascribes to the
 /// `Ord` trait.
 ///
 /// ## Example

diff --git a/src/libcollections/trie/mod.rs b/src/libcollections/trie/mod.rs
index 9dcb182cd267570b259926cb1993bfbdc0f27527..4d9191a65b695fa80946a2431bf35245462b1240 100644 (file)
--- a/src/libcollections/trie/mod.rs
+++ b/src/libcollections/trie/mod.rs
@@ -9,8 +9,7 @@
 // except according to those terms.
 
 //! Maps are collections of unique keys with corresponding values, and sets are
-//! just unique keys without a corresponding value. The `Map` and `Set` traits in
-//! `std::container` define the basic interface.
+//! just unique keys without a corresponding value.
 //!
 //! This crate defines `TrieMap` and `TrieSet`, which require `uint` keys.
 //!