@@ -377,7 +377,7 @@ impl<T> VecDeque<T> {
377
377
/// # Examples
378
378
///
379
379
/// ```
380
- /// #![feature(collections )]
380
+ /// #![feature(deque_extras )]
381
381
///
382
382
/// use std::collections::VecDeque;
383
383
///
@@ -387,6 +387,9 @@ impl<T> VecDeque<T> {
387
387
/// buf.shrink_to_fit();
388
388
/// assert!(buf.capacity() >= 4);
389
389
/// ```
390
+ #[ unstable( feature = "deque_extras" ,
391
+ reason = "needs to be audited" ,
392
+ issue = "27788" ) ]
390
393
pub fn shrink_to_fit ( & mut self ) {
391
394
// +1 since the ringbuffer always leaves one space empty
392
395
// len + 1 can't overflow for an existing, well-formed ringbuffer.
@@ -928,7 +931,7 @@ impl<T> VecDeque<T> {
928
931
///
929
932
/// # Examples
930
933
/// ```
931
- /// #![feature(collections )]
934
+ /// #![feature(deque_extras )]
932
935
///
933
936
/// use std::collections::VecDeque;
934
937
///
@@ -938,6 +941,9 @@ impl<T> VecDeque<T> {
938
941
/// buf.insert(1, 11);
939
942
/// assert_eq!(Some(&11), buf.get(1));
940
943
/// ```
944
+ #[ unstable( feature = "deque_extras" ,
945
+ reason = "needs to be audited" ,
946
+ issue = "27788" ) ]
941
947
pub fn insert ( & mut self , index : usize , value : T ) {
942
948
assert ! ( index <= self . len( ) , "index out of bounds" ) ;
943
949
if self . is_full ( ) {
0 commit comments