- 13 7月, 2013 1 次提交
-
-
由 Alex Crichton 提交于
-
- 12 7月, 2013 16 次提交
-
-
由 Daniel Micay 提交于
documents conversion, size hints and double-ended iterators and adds more of the traits to the prelude
-
由 Alex Crichton 提交于
-
由 Graydon Hoare 提交于
extra: add explicit ratchet-noise-percent option to benchmark ratchet, plus a few test breaking fixes.
-
由 Graydon Hoare 提交于
-
由 Graydon Hoare 提交于
It was re-reading terminfo on each line of output.
-
由 Graydon Hoare 提交于
-
由 Graydon Hoare 提交于
-
由 Graydon Hoare 提交于
-
由 Graydon Hoare 提交于
initial sketch of codegen mode for compiletest; doesn't measure / compare / ratchet the disassembly yet
-
由 Niko Matsakis 提交于
-
由 Chris Morgan 提交于
-
由 Chris Morgan 提交于
Indentation now works correctly on subsequent lines of a multi-line comment, whether there are leaders (` * `) or not. (Formerly it was incorrectly doing a two-space indent if there was no leader.) By default, this no longer puts a ` * ` leader on `/*!` comments, as that appears to be the current convention in the Rust source code, but that can easily be re-enabled if desired: let g:rust_bang_comment_leader = 1
-
由 Niko Matsakis 提交于
-
由 Niko Matsakis 提交于
-
由 Niko Matsakis 提交于
-
由 Niko Matsakis 提交于
-
- 11 7月, 2013 22 次提交
-
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
Let RingBuf have a logical name for a concrete type, and Deque is used for the Deque trait (implemented by RingBuf and dlist).
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
An iterator that allows mutating the list is very useful but needs care to not be unsound. ListIteration exposes only insert_before (used for insert_ordered) and peek_next so far.
-
由 blake2-ppc 提交于
The exception is the function check_links which needs access to struct Node (which is not pub).
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
Rawlink<T> holds a *mut T pointer and can convert itself to Option<&mut T>. The null pointer is of course None.
-
由 blake2-ppc 提交于
-
由 blake2-ppc 提交于
This is an owned sendable linked list which allows insertion and deletion at both ends, with fast traversal through iteration, and fast append/prepend. It is indended to replace the previous managed DList with exposed list nodes. It does not match it feature by feature, but DList could grow more methods if needed.
-
由 Alex Crichton 提交于
Closes #6004
-
由 Alex Crichton 提交于
-
由 Alex Crichton 提交于
-
由 Daniel Micay 提交于
just avoid giving an inline hint in the first place
-
由 Daniel Micay 提交于
This implements the trait for vector iterators, replacing the reverse iterator types. The methods will stay, for implementing the future reverse Iterable traits and convenience. This can also be trivially implemented for circular buffers and other variants of arrays like strings and `SmallIntMap`/`SmallIntSet`. The `DoubleEndedIterator` trait will allow for implementing algorithms like in-place reverse on generic mutable iterators. The naming (`Range` vs. `Iterator`, `Bidirectional` vs. `DoubleEnded`) can be bikeshedded in the future.
-
由 Brendan Cully 提交于
-
由 Brendan Cully 提交于
-
由 Brendan Cully 提交于
-
由 Gary Linscott 提交于
This is much faster for strings, and eventually when there is a buffered reader of some sort. Reading example.json 100 times before was around 1.18s. After: - reading from string 0.68s - reading from file 1.08s (extra time is all in io::Reader)
-
由 Niko Matsakis 提交于
-
- 10 7月, 2013 1 次提交
-
-
由 Niko Matsakis 提交于
-