| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2019-04-15 | warn(missing_docs) in liballoc, and add missing docs | Ralf Jung | -0/+10 | |
| 2019-02-12 | Revert "Remove mentions of unstable sort_by_cached key from stable ↵ | Scott McMurray | -0/+4 | |
| documentation" This reverts commit 9c7b69e17909ceb090a1c4b8882a4e0924a2a755. | ||||
| 2019-02-12 | Stabilize slice_sort_by_cached_key | Scott McMurray | -2/+1 | |
| 2019-02-10 | libs: doc comments | Alexander Regueiro | -3/+3 | |
| 2019-02-03 | liballoc: revert nested imports style changes. | Mazdak Farrokhzad | -14/+11 | |
| 2019-02-02 | liballoc: apply uniform_paths. | Mazdak Farrokhzad | -2/+2 | |
| 2019-02-02 | liballoc: prefer imports of borrow from libcore. | Mazdak Farrokhzad | -1/+2 | |
| 2019-02-02 | liballoc: adjust abolute imports + more import fixes. | Mazdak Farrokhzad | -3/+1 | |
| 2019-02-02 | liballoc: refactor & fix some imports. | Mazdak Farrokhzad | -9/+12 | |
| 2019-02-02 | liballoc: cargo check passes on 2018 | Mazdak Farrokhzad | -6/+7 | |
| 2018-12-25 | Remove licenses | Mark Rousskov | -10/+0 | |
| 2018-12-09 | Auto merge of #56463 - ljedrz:slice_concat_join, r=nikic | bors | -3/+3 | |
| slice: tweak concat & join - use `sum` instead of `fold` (readability) - adjust the capacity for `join` - the number of separators is `n - 1`, not `n`; proof: ``` fn main() { let a = [[1, 2], [4, 5]]; let v = a.join(&3); assert_ne!(v.len(), v.capacity()); // len is 5, capacity is 6 } ``` | ||||
| 2018-12-07 | Various minor/cosmetic improvements to code | Alexander Regueiro | -5/+5 | |
| 2018-12-03 | slice: tweak concat & join | ljedrz | -3/+3 | |
| 2018-11-22 | Auto merge of #53918 - Havvy:doc-sort-by, r=GuillaumeGomez | bors | -0/+16 | |
| Doc total order requirement of sort(_unstable)_by I took the definition of what a total order is from the Ord trait docs. I specifically put "elements of the slice" because if you have a slice of f64s, but know none are NaN, then sorting by partial ord is total in this case. I'm not sure if I should give such an example in the docs or not. r? @GuillaumeGomez | ||||
| 2018-10-18 | Stabilize slice::rchunks(), rchunks_mut(), rchunks_exact(), rchunk_exact_mut() | Sebastian Dröge | -1/+1 | |
| Fixes #55177 | ||||
| 2018-10-18 | Stabilize slice::chunks_exact() and slice::chunks_exact_mut() | Sebastian Dröge | -1/+1 | |
| Fixes #47115 | ||||
| 2018-10-18 | Add slice::rchunks(), rchunks_mut(), rchunks_exact() and rchunks_exact_mut() | Sebastian Dröge | -0/+2 | |
| These work exactly like the normal chunks iterators but start creating chunks from the end of the slice. See #55177 for the tracking issue | ||||
| 2018-10-05 | Linkify types in docs | Havvy (Ryan Scheel) | -1/+1 | |
| 2018-10-05 | Slice total example: Move closer to total defn | Havvy (Ryan Scheel) | -6/+9 | |
| 2018-10-05 | Example of total ord of elements for sort_by | Havvy (Ryan Scheel) | -0/+6 | |
| 2018-10-05 | Doc total order requirement of sort(_unstable)_by | Havvy (Ryan Scheel) | -0/+7 | |
| I took the definition of what a total order is from the Ord trait docs. I specifically put "elements of the slice" because if you have a slice of f64s, but know none are NaN, then sorting by partial ord is total in this case. I'm not sure if I should give such an example in the docs or not. | ||||
| 2018-09-25 | Also rename ExactChunks iterator name to ChunksExact | Sebastian Dröge | -1/+1 | |
| 2018-09-24 | Rename slice::exact_chunks() to slice::chunks_exact() | Sebastian Dröge | -1/+1 | |
| See https://github.com/rust-lang/rust/issues/47115#issuecomment-403090815 and https://github.com/rust-lang/rust/issues/47115#issuecomment-424053547 | ||||
| 2018-09-20 | std: Check for overflow in `str::repeat` | Alex Crichton | -1/+15 | |
| This commit fixes a buffer overflow issue in the standard library discovered by Scott McMurray where if a large number was passed to `str::repeat` it may cause and out of bounds write to the buffer of a `Vec`. This bug was accidentally introduced in #48657 when optimizing the `str::repeat` function. The bug affects stable Rust releases 1.26.0 to 1.29.0. We plan on backporting this fix to create a 1.29.1 release, and the 1.30.0 release onwards will include this fix. The fix in this commit is to introduce a deterministic panic in the case of capacity overflow. When repeating a slice where the resulting length is larger than the address space, there’s no way it can succeed anyway! The standard library and surrounding libraries were briefly checked to see if there were othere instances of preallocating a vector with a calculation that may overflow. No instances of this bug (out of bounds write due to a calculation overflow) were found at this time. Note that this commit is the first steps towards fixing this issue, we'll be making a formal post to the Rust security list once these commits have been merged. | ||||
| 2018-08-20 | Replace usages of ptr::offset with ptr::{add,sub}. | Corey Farwell | -4/+4 | |
| 2018-06-02 | Rollup merge of #51147 - tmccombs:sliceindex, r=SimonSapin | Mark Simulacrum | -1/+1 | |
| Stabilize SliceIndex trait. CC #35729 According to recommendations in https://github.com/rust-lang/rust/issues/35729#issuecomment-377784884 | ||||
| 2018-06-01 | incorporate changes from code review | Emerentius | -11/+13 | |
| further reduce unsafe fn calls reduce right drift assert! sufficient capacity | ||||
| 2018-06-01 | optimize joining and concatenation for slices | Emerentius | -11/+11 | |
| for both Vec<T> and String - eliminates the boolean first flag in fn join() for String only - eliminates repeated bounds checks in join(), concat() - adds fast paths for small string separators up to a len of 4 bytes | ||||
| 2018-06-01 | Stabilize SliceIndex trait. | Thayne McCombs | -1/+1 | |
| Fixes #35729 According to recommendations in https://github.com/rust-lang/rust/issues/35729#issuecomment-377784884 | ||||
| 2018-05-21 | Stabilize feature from_ref | Stjepan Glavina | -2/+2 | |
| 2018-05-17 | Switch to 1.26 bootstrap compiler | Mark Simulacrum | -11/+2 | |
| 2018-05-09 | move See also links to top | Michael Lamparski | -2/+2 | |
| 2018-04-24 | Auto merge of #48999 - GuillaumeGomez:add-repeat-on-slice, r=Kimundi | bors | -0/+71 | |
| Add repeat method on slice Fixes #48784. | ||||
| 2018-04-21 | Replace SliceExt with inherent [T] methods in libcore | Simon Sapin | -1391/+5 | |
| 2018-04-21 | Move non-allocating [u8] inherent methods to libcore | Simon Sapin | -54/+4 | |
| Fixes #45803 | ||||
| 2018-04-17 | stabilize `swap_with_slice` feature | tinaun | -7/+1 | |
| 2018-04-17 | stabilize `slice_rsplit` feature | tinaun | -8/+3 | |
| 2018-04-09 | Add trivial early return for sort_by_cached_key | varkor | -0/+1 | |
| 2018-03-28 | Add repeat method on slice | Guillaume Gomez | -0/+71 | |
| 2018-03-26 | Remove mentions of unstable sort_by_cached key from stable documentation | varkor | -8/+0 | |
| 2018-03-18 | Check that the size optimisation is not redundant | varkor | -5/+10 | |
| 2018-03-18 | Clarify time complexity | varkor | -2/+3 | |
| 2018-03-17 | Improve and fix documentation for sort_by_cached_key | varkor | -8/+12 | |
| 2018-03-17 | Fix use of unstable feature in test | varkor | -2/+2 | |
| 2018-03-16 | Add sort_by_cached_key method | varkor | -11/+50 | |
| 2018-03-16 | Index enumeration by minimally sized type | varkor | -12/+25 | |
| 2018-03-16 | Cull the quadratic | varkor | -0/+1 | |
| 2018-03-16 | Update documentation | varkor | -10/+11 | |
| 2018-03-16 | Clarify behaviour of sort_unstable_by_key with respect to sort_by_key | varkor | -4/+11 | |
 |
index : rust | |
| https://github.com/rust-lang/rust |
| about summary refs log tree commit diff |