From 02a8d5b57057a5c76667e85e92ea2c8a95303150 Mon Sep 17 00:00:00 2001
From: Alex Crichton <alex@alexcrichton.com>
Date: Wed, 10 Jun 2015 17:59:02 -0700
Subject: [PATCH] std: Deprecate the RandomAccessIterator trait

This trait has not proven itself over time as being core and fundamentally
useful to iterators, so it's being deprecated to allow time to iterate on it out
of tree.
---
 src/libcore/iter.rs | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/libcore/iter.rs b/src/libcore/iter.rs
index 30c2d3fcb6d5..9d7585993c33 100644
--- a/src/libcore/iter.rs
+++ b/src/libcore/iter.rs
@@ -1230,6 +1230,10 @@ impl<'a, I: DoubleEndedIterator + ?Sized> DoubleEndedIterator for &'a mut I {
 #[unstable(feature = "iter_idx",
            reason = "not widely used, may be better decomposed into Index \
                      and ExactSizeIterator")]
+#[deprecated(since = "1.2.0",
+             reason = "trait has not proven itself as a widely useful \
+                       abstraction for iterators, and more time may be needed \
+                       for iteration on the design")]
 pub trait RandomAccessIterator: Iterator {
     /// Returns the number of indexable elements. At most `std::usize::MAX`
     /// elements are indexable, even if the iterator represents a longer range.