diff options
| author | pierwill <pierwill@users.noreply.github.com> | 2020-06-29 17:12:20 -0700 |
|---|---|---|
| committer | pierwill <pierwill@users.noreply.github.com> | 2020-07-02 17:04:58 -0700 |
| commit | bdc1f40fcd7be14dde6f94ae5392039a72517eb7 (patch) | |
| tree | 900407de7f48277dc60a37ed4d588aba8600d29d | |
| parent | 0ca7f74dbd23a3e8ec491cd3438f490a3ac22741 (diff) | |
| download | rust-bdc1f40fcd7be14dde6f94ae5392039a72517eb7.tar.gz rust-bdc1f40fcd7be14dde6f94ae5392039a72517eb7.zip | |
Standardize bibliographic citations in rustc API docs
| -rw-r--r-- | src/librustc_ast_pretty/pp.rs | 10 | ||||
| -rw-r--r-- | src/librustc_data_structures/graph/dominators/mod.rs | 11 | ||||
| -rw-r--r-- | src/librustc_span/hygiene.rs | 9 |
3 files changed, 14 insertions, 16 deletions
diff --git a/src/librustc_ast_pretty/pp.rs b/src/librustc_ast_pretty/pp.rs index e6090db3284..4bb806a923e 100644 --- a/src/librustc_ast_pretty/pp.rs +++ b/src/librustc_ast_pretty/pp.rs @@ -1,10 +1,8 @@ //! This pretty-printer is a direct reimplementation of Philip Karlton's -//! Mesa pretty-printer, as described in appendix A of -//! -//! ```text -//! STAN-CS-79-770: "Pretty Printing", by Derek C. Oppen. -//! Stanford Department of Computer Science, 1979. -//! ``` +//! Mesa pretty-printer, as described in the appendix to +//! Derek C. Oppen, "Pretty Printing" (1979), +//! Stanford Computer Science Department STAN-CS-79-770, +//! <http://i.stanford.edu/pub/cstr/reports/cs/tr/79/770/CS-TR-79-770.pdf>. //! //! The algorithm's aim is to break a stream into as few lines as possible //! while respecting the indentation-consistency requirements of the enclosing diff --git a/src/librustc_data_structures/graph/dominators/mod.rs b/src/librustc_data_structures/graph/dominators/mod.rs index a7f9340dead..438a0d0c6ff 100644 --- a/src/librustc_data_structures/graph/dominators/mod.rs +++ b/src/librustc_data_structures/graph/dominators/mod.rs @@ -1,8 +1,9 @@ -//! Algorithm citation: -//! A Simple, Fast Dominance Algorithm. -//! Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy -//! Rice Computer Science TS-06-33870 -//! <https://www.cs.rice.edu/~keith/EMBED/dom.pdf> +//! Finding the dominators in a control-flow graph. +//! +//! Algorithm based on Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy, +//! "A Simple, Fast Dominance Algorithm", +//! Rice Computer Science TS-06-33870, +//! <https://www.cs.rice.edu/~keith/EMBED/dom.pdf>. use super::iterate::reverse_post_order; use super::ControlFlowGraph; diff --git a/src/librustc_span/hygiene.rs b/src/librustc_span/hygiene.rs index 60bbdd0495c..b8f8917fccb 100644 --- a/src/librustc_span/hygiene.rs +++ b/src/librustc_span/hygiene.rs @@ -1,9 +1,8 @@ -//! Machinery for hygienic macros, inspired by the `MTWT[1]` paper. +//! Machinery for hygienic macros. //! -//! `[1]` Matthew Flatt, Ryan Culpepper, David Darais, and Robert Bruce Findler. 2012. -//! *Macros that work together: Compile-time bindings, partial expansion, -//! and definition contexts*. J. Funct. Program. 22, 2 (March 2012), 181-216. -//! DOI=10.1017/S0956796812000093 <https://doi.org/10.1017/S0956796812000093> +//! Inspired by Matthew Flatt et al., “Macros That Work Together: Compile-Time Bindings, Partial +//! Expansion, and Definition Contexts,” *Journal of Functional Programming* 22, no. 2 +//! (March 1, 2012): 181–216, <https://doi.org/10.1017/S0956796812000093>. // Hygiene data is stored in a global variable and accessed via TLS, which // means that accesses are somewhat expensive. (`HygieneData::with` |