From c8bd9d2beb863d08cfca3503aef67a9cc7b7fd7e Mon Sep 17 00:00:00 2001 From: Steve Klabnik Date: Sun, 7 Dec 2014 14:12:01 -0500 Subject: [PATCH] Remove mention of Dequeue in collections docs. https://botbot.me/mozilla/rust/2014-12-07/?msg=27003846&page=20 --- src/libcollections/dlist.rs | 3 --- src/libcollections/ring_buf.rs | 3 +-- 2 files changed, 1 insertion(+), 5 deletions(-) diff --git a/src/libcollections/dlist.rs b/src/libcollections/dlist.rs index 39cdf0c4564..edef37d4b85 100644 --- a/src/libcollections/dlist.rs +++ b/src/libcollections/dlist.rs @@ -11,9 +11,6 @@ //! 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 collections::Deque`. // 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/ring_buf.rs b/src/libcollections/ring_buf.rs index e11ba35367e..695eda11216 100644 --- a/src/libcollections/ring_buf.rs +++ b/src/libcollections/ring_buf.rs @@ -11,7 +11,6 @@ //! This crate 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 `collections`. use core::prelude::*; @@ -35,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 that implements `Deque`. +/// `RingBuf` is a circular buffer. pub struct RingBuf { // tail and head are pointers into the buffer. Tail always points // to the first element that could be read, Head always points -- 2.44.0