rust - https://github.com/rust-lang/rust

Age	Commit message (Collapse)	Author	Lines
2020-08-30	mv compiler to compiler/	mark	-86/+0

2019-12-22	Format the world	Mark Rousskov	-11/+4

2019-09-29	remove indexed_vec re-export from rustc_data_structures	csmoe	-1/+1

2019-09-23	Add cycle detection for graphs	Dylan MacKenzie	-0/+10

2019-08-02	librustc_data_structures: Unconfigure tests during normal build	Vadim Petrochenkov	-1/+1

2019-07-28	Deny `unused_lifetimes` through rustbuild	Vadim Petrochenkov	-0/+2

2019-07-03	Remove needless lifetimes	Jeremy Stucki	-6/+6

2019-07-02	add a `depth_first_search` helper function	Niko Matsakis	-0/+7

2019-07-02	introduce a `VecGraph` abstraction that cheaply stores graphs	Niko Matsakis	-0/+5
	This is perhaps better than the linked list approach I was using before. Lower memory overhead, Theta(N+E) storage. Does require a sort. =)
2018-12-25	Remove licenses	Mark Rousskov	-10/+0

2018-07-12	introduce a generic SCC computation	Niko Matsakis	-0/+1

2018-07-12	rename `control_flow_graph` to `graph`	Niko Matsakis	-0/+78

2018-07-12	rename `graph` to `control_flow_graph::implementation`	Niko Matsakis	-417/+0

2018-03-20	Implement some trivial size_hints for various iterators	Phlosioneer	-0/+13
	This also implements ExactSizeIterator where applicable. Addresses most of the Iterator traits mentioned in #23708.
2018-03-07	Run rustfmt on `src/librustc_data_structures/graph/mod.rs`.	Corey Farwell	-24/+29

2018-03-07	Replace iterator structures with `impl Trait`.	Corey Farwell	-77/+25

2017-10-09	Refactor to use `debug_struct` in several Debug impls	Malo Jaffré	-13/+2
	Fixes #44771.
2017-09-14	rustc: Preallocate when building the dep graph	Alex Crichton	-0/+7
	This commit alters the `query` function in the dep graph module to preallocate memory using `with_capacity` instead of relying on automatic growth. Discovered in #44576 it was found that for the syntex_syntax clean incremental benchmark the peak memory usage was found when the dep graph was being saved, particularly the `DepGraphQuery` data structure itself. PRs like #44142 which add more queries end up just making this much larger! I didn't see an immediately obvious way to reduce the size of the `DepGraphQuery` object, but it turns out that `with_capacity` helps quite a bit! Locally 831 MB was used [before] this commit, and 770 MB is in use at the peak of the compiler [after] this commit. That's a nice 7.5% improvement! This won't quite make up for the losses in #44142 but I figured it's a good start. [before]: https://gist.github.com/alexcrichton/2d2b9c7a65503761925c5a0bcfeb0d1e [before]: https://gist.github.com/alexcrichton/6da51f2a6184bfb81694cc44f06deb5b
2017-08-19	rustc: Remove some dead code	Vadim Petrochenkov	-109/+0

2017-08-15	use field init shorthand EVERYWHERE	Zack M. Davis	-11/+11
	Like #43008 (f668999), but _much more aggressive_.
2017-08-07	rustc::middle::dataflow - visit the CFG in RPO	Ariel Ben-Yehuda	-0/+36
	We used to propagate bits in node-id order, which sometimes caused an excessive number of iterations, especially when macros were present. As everyone knows, visiting the CFG in RPO bounds the number of iterators by 1 plus the depth of the most deeply nested loop (times the height of the lattice, which is 1). Fixes #43704.
2016-11-02	Added Graph::is_cyclicic_node algorithm	Havvy	-11/+40

2016-11-02	Change Make comment into doc comment on Graph::iterate_until_fixed_point	Havvy	-8/+5

2016-11-02	Added general iterators for graph nodes and edges	Havvy	-4/+44
	Also used those general iterators in other methods.
2016-11-01	Normalize generic bounds in graph iterators	Havvy	-3/+6
	Use where clasues and only where clauses for bounds in the iterators for Graph. The rest of the code uses bounds on the generic declarations for Debug, and we may want to change those to for consistency. I did not do that here because I don't know whether or not that's a good idea. But for the iterators, they were inconsistent causing confusion, at least for me.
2016-10-20	run rustfmt on graph folder	Srinivas Reddy Thatiparthy	-2/+2

2016-08-09	isolate predecessor computation	Niko Matsakis	-18/+44
	The new `Predecessors` type computes a set of interesting targets and their HIR predecessors, and discards everything in between.
2016-05-18	identify inputs of `MetaData(X)` nodes	Niko Matsakis	-4/+10
	Generate a second hash file that contains the metadata for an X node.
2016-03-05	adopt new header style to sidestep rust-lang-nursery/rustfmt#836	Niko Matsakis	-12/+6

2016-03-05	apply rustfmt to librustc_data_structures, correcting ↵	Niko Matsakis	-53/+65
	rust-lang-nursery/rustfmt#836
2016-02-18	Remove unnecessary explicit lifetime bounds.	Corey Farwell	-10/+10
	These explicit lifetimes can be ommitted because of lifetime elision rules. Instances were found using rust-clippy.
2016-01-05	Introduce the DepGraph and DepTracking map abstractions,	Niko Matsakis	-3/+11
	along with a README explaining how they are to be used
2015-09-06	add a few accessors to Graph	Niko Matsakis	-0/+10

2015-06-19	Expand the "givens" set to cover transitive relations. The givens array	Niko Matsakis	-3/+3
	stores relationships like `'c <= '0` (where `'c` is a free region and `'0` is an inference variable) that are derived from closure arguments. These are (rather hackily) ignored for purposes of inference, preventing spurious errors. The current code did not handle transitive cases like `'c <= '0` and `'0 <= '1`. Fixes #24085.
2015-04-24	Change name of unit test sub-module to "tests".	Johannes Oertel	-1/+1
	Changes the style guidelines regarding unit tests to recommend using a sub-module named "tests" instead of "test" for unit tests as "test" might clash with imports of libtest.
2015-04-17	Port to using the newer graph, which offers iterators instead of the	Niko Matsakis	-0/+403
	older `each` method, but is otherwise identical.