| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2016-01-21 | [MIR] Promote temps to alloca on multi-assignment | Simonas Kazlauskas | -2/+4 | |
| Fixes #31002 | ||||
| 2015-08-21 | nits from pnkfelix | Niko Matsakis | -23/+30 | |
| 2015-08-18 | generalize bitvector code into a bitmatrix; write some unit tests, but | Niko Matsakis | -9/+176 | |
| probably not enough. This code is so simple, what could possibly go wrong? | ||||
| 2015-07-09 | Use vec![elt; n] where possible | Ulrik Sverdrup | -3/+1 | |
| The common pattern `iter::repeat(elt).take(n).collect::<Vec<_>>()` is exactly equivalent to `vec![elt; n]`, do this replacement in the whole tree. (Actually, vec![] is smart enough to only call clone n - 1 times, while the former solution would call clone n times, and this fact is virtually irrelevant in practice.) | ||||
| 2015-04-17 | Add licenses. | Niko Matsakis | -0/+10 | |
| 2015-04-17 | Port to using the newer graph, which offers iterators instead of the | Niko Matsakis | -0/+32 | |
| older `each` method, but is otherwise identical. | ||||
