Skip to content

Commit b430cba

Browse files
committed
Fix use of unstable feature in test
1 parent f41a26f commit b430cba

File tree

3 files changed

+4
-2
lines changed

3 files changed

+4
-2
lines changed

src/liballoc/lib.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -113,6 +113,7 @@
113113
#![feature(slice_get_slice)]
114114
#![feature(slice_patterns)]
115115
#![feature(slice_rsplit)]
116+
#![feature(slice_sort_by_cached_key)]
116117
#![feature(specialization)]
117118
#![feature(staged_api)]
118119
#![feature(str_internals)]

src/liballoc/slice.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1368,7 +1368,7 @@ impl<T> [T] {
13681368
/// v.sort_by_cached_key(|k| k.abs());
13691369
/// assert!(v == [1, 2, -3, 4, -5]);
13701370
/// ```
1371-
#[unstable(feature = "slice_sort_by_uncached_key", issue = "34447")]
1371+
#[unstable(feature = "slice_sort_by_cached_key", issue = "34447")]
13721372
#[inline]
13731373
pub fn sort_by_cached_key<K, F>(&mut self, f: F)
13741374
where F: FnMut(&T) -> K, K: Ord
@@ -1487,7 +1487,7 @@ impl<T> [T] {
14871487
/// deterministic behavior.
14881488
///
14891489
/// Due to its key calling strategy, [`sort_unstable_by_key`](#method.sort_unstable_by_key)
1490-
/// is likely to be slower than [`sort_by_cached_key`](#method.sort_by_uncached_key) in
1490+
/// is likely to be slower than [`sort_by_cached_key`](#method.sort_by_cached_key) in
14911491
/// cases where the key function is expensive.
14921492
///
14931493
/// # Examples

src/liballoc/tests/lib.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -23,6 +23,7 @@
2323
#![feature(pattern)]
2424
#![feature(placement_in_syntax)]
2525
#![feature(rand)]
26+
#![feature(slice_sort_by_cached_key)]
2627
#![feature(splice)]
2728
#![feature(str_escape)]
2829
#![feature(string_retain)]

0 commit comments

Comments
 (0)