@@ -268,7 +268,7 @@ where R: Rng + ?Sized {
268
268
/// an alternative.
269
269
///
270
270
/// This implementation uses `O(length + amount)` space and `O(length)` time
271
- /// if the "partition_at_index " feature is enabled, or `O(length)` space and
271
+ /// if the "nightly " feature is enabled, or `O(length)` space and
272
272
/// `O(length + amount * log length)` time otherwise.
273
273
///
274
274
/// Panics if `amount > length`.
@@ -298,7 +298,7 @@ where
298
298
/// This implementation uses the algorithm described by Efraimidis and Spirakis
299
299
/// in this paper: https://doi.org/10.1016/j.ipl.2005.11.003
300
300
/// It uses `O(length + amount)` space and `O(length)` time if the
301
- /// "partition_at_index " feature is enabled, or `O(length)` space and `O(length
301
+ /// "nightly " feature is enabled, or `O(length)` space and `O(length
302
302
/// + amount * log length)` time otherwise.
303
303
///
304
304
/// Panics if `amount > length`.
@@ -342,7 +342,7 @@ where
342
342
}
343
343
impl < N > Eq for Element < N > { }
344
344
345
- #[ cfg( feature = "partition_at_index " ) ]
345
+ #[ cfg( feature = "nightly " ) ]
346
346
{
347
347
let mut candidates = Vec :: with_capacity ( length. as_usize ( ) ) ;
348
348
for index in 0 ..length. as_usize ( ) {
@@ -370,7 +370,7 @@ where
370
370
Ok ( IndexVec :: from ( result) )
371
371
}
372
372
373
- #[ cfg( not( feature = "partition_at_index " ) ) ]
373
+ #[ cfg( not( feature = "nightly " ) ) ]
374
374
{
375
375
#[ cfg( all( feature = "alloc" , not( feature = "std" ) ) ) ]
376
376
use crate :: alloc:: collections:: BinaryHeap ;
0 commit comments