File tree 4 files changed +4
-3
lines changed
4 files changed +4
-3
lines changed Original file line number Diff line number Diff line change 9
9
//! This includes changes in the stability of the constness.
10
10
//!
11
11
//! In order to make an intrinsic usable at compile-time, one needs to copy the implementation
12
- //! from https://github.com/rust-lang/miri/blob/master/src/shims/intrinsics.rs to
12
+ //! from < https://github.com/rust-lang/miri/blob/master/src/shims/intrinsics.rs> to
13
13
//! `compiler/rustc_mir/src/interpret/intrinsics.rs` and add a
14
14
//! `#[rustc_const_unstable(feature = "foo", issue = "01234")]` to the intrinsic.
15
15
//!
Original file line number Diff line number Diff line change @@ -283,6 +283,7 @@ pub mod primitive;
283
283
unused_imports,
284
284
unsafe_op_in_unsafe_fn
285
285
) ]
286
+ #[ cfg_attr( not( bootstrap) , allow( automatic_links) ) ]
286
287
// FIXME: This annotation should be moved into rust-lang/stdarch after clashing_extern_declarations is
287
288
// merged. It currently cannot because bootstrap fails as the lint hasn't been defined yet.
288
289
#[ allow( clashing_extern_declarations) ]
Original file line number Diff line number Diff line change 33
33
//!
34
34
//! Primarily, this module and its children implement the algorithms described in:
35
35
//! "How to Read Floating Point Numbers Accurately" by William D. Clinger,
36
- //! available online: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4152
36
+ //! available online: < http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4152>
37
37
//!
38
38
//! In addition, there are numerous helper functions that are used in the paper but not available
39
39
//! in Rust (or at least in core). Our version is additionally complicated by the need to handle
Original file line number Diff line number Diff line change 1
1
//! Slice sorting
2
2
//!
3
3
//! This module contains a sorting algorithm based on Orson Peters' pattern-defeating quicksort,
4
- //! published at: https://github.com/orlp/pdqsort
4
+ //! published at: < https://github.com/orlp/pdqsort>
5
5
//!
6
6
//! Unstable sorting is compatible with libcore because it doesn't allocate memory, unlike our
7
7
//! stable sorting implementation.
You can’t perform that action at this time.
0 commit comments