- 02 7月, 2015 4 次提交
-
-
由 bors 提交于
This was added after Windows 7 SP1, so it's not always available. Instead use the `SetHandleInformation` function to flag a socket as not inheritable. This is not atomic with respect to creating new processes, but it mirrors what Unix does with respect to possibly using the atomic option in the future. Closes #26543
-
由 bors 提交于
I've mirrored them out to crates (bit-vec and bit-set) that build on stable. (not sure if this actually correctly deprecates them in std)
-
由 Alexis Beingessner 提交于
-
由 bors 提交于
Like explained in #26016, typing `?` had no effect with non-english keyboard layouts in the docs. This patch seems to resolve this issue, **tested with AZERTY keyboard in Google Chrome and Firefox**. I haven't tested it with more exotic keyboard layouts or with other browsers though. This code is based on the information found on: http://javascript.info/tutorial/keyboard-events **More specifically:** > The only event which reliably provides the character is keypress. **And** >``` // event.type must be keypress function getChar(event) { if (event.which == null) { return String.fromCharCode(event.keyCode) // IE } else if (event.which!=0 && event.charCode!=0) { return String.fromCharCode(event.which) // the rest } else { return null // special key } } ``` `?` and `S` work, `escape` however does not (on an Azerty keyboard). It would be good if some people could test it with other browsers and keyboard layouts: http://www.mathieudavid.org/test/rustdoc/std/index.html **Edit:** - swedish layout works on Firefox and Chromium - french (azerty) mac layout works on Safari
-
- 01 7月, 2015 34 次提交
-
-
由 bors 提交于
A follow up to #26530, hide SampleRange too. The numerical types implement this trait.
-
由 Ulrik Sverdrup 提交于
-
由 bors 提交于
closes #25037 closes #11715 r? @nrc
-
由 Mathieu David 提交于
In js from the docs, change keyboard eventlistener to be compatible with non-english keyboard layouts. Fixes #26016 Fixes #16572
-
由 bors 提交于
r? @huonw
-
由 Alex Crichton 提交于
This was added after Windows 7 SP1, so it's not always available. Instead use the `SetHandleInformation` function to flag a socket as not inheritable. This is not atomic with respect to creating new processes, but it mirrors what Unix does with respect to possibly using the atomic option in the future. Closes #26543
-
由 Nick Cameron 提交于
-
由 bors 提交于
This recently regressed in #24689, and this updates the `Display` implementation to take formatting flags into account. Closes #26625
-
由 Alex Crichton 提交于
This recently regressed in #24689, and this updates the `Display` implementation to take formatting flags into account. Closes #26625
-
由 bors 提交于
- Successful merges: #26373, #26506, #26580, #26622, #26627, #26651, #26678, #26692 - Failed merges:
-
由 bors 提交于
Fixes #26646. Loops over all `#[repr(..)]` attributes instead of stopping at the first one to make sure they are all marked as used. Previously it stopped after the first `#[repr(C)]` was found causing all other attributes to be skipped by the linter.
-
由 Steve Klabnik 提交于
Fixes #26620
-
由 Steve Klabnik 提交于
Fixes #26620
-
由 Steve Klabnik 提交于
fmt: Update docs and mention :#? pretty-printing Expose `:#?` well in the docs for fmt and Debug itself. Also update some out of date information and fix formatting in `std::fmt` docs.
-
由 Steve Klabnik 提交于
Part of #24407. cc @michaelsproul r? @Manishearth
-
由 Steve Klabnik 提交于
-
由 Steve Klabnik 提交于
-
由 Steve Klabnik 提交于
I found a sentence that felt a bit awkward to read in its current form, so I added a comma to break it up.
-
由 Steve Klabnik 提交于
-
由 Steve Klabnik 提交于
-
由 Ariel Ben-Yehuda 提交于
Fixes #26636
-
由 bors 提交于
Update substring search to use the Two Way algorithm To improve our substring search performance, revive the two way searcher and adapt it to the Pattern API. Fixes #25483, a performance bug: that particular case now completes faster in optimized rust than in ruby (but they share the same order of magnitude). Many thanks to @gereeter who helped me understand the reverse case better and wrote the comment explaining `next_back` in the code. I had quickcheck to fuzz test forward and reverse searching thoroughly. The two way searcher implements both forward and reverse search, but not double ended search. The forward and reverse parts of the two way searcher are completely independent. The two way searcher algorithm has very small, constant space overhead, requiring no dynamic allocation. Our implementation is relatively fast, especially due to the `byteset` addition to the algorithm, which speeds up many no-match cases. A bad case for the two way algorithm is: ``` let haystack = (0..10_000).map(|_| "dac").collect::<String>(); let needle = (0..100).map(|_| "bac").collect::<String>()); ``` For this particular case, two way is not much faster than the naive implementation it replaces.
-
由 Tshepang Lekhonkhobe 提交于
-
由 Alexis Beingessner 提交于
-
由 Guillaume Gomez 提交于
Add more explanations
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
由 Guillaume Gomez 提交于
-
- 30 6月, 2015 2 次提交