| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2015-07-23 | Auto merge of #27192 - dotdash:inline_eq_slice, r=luqmana | bors | -12/+3 | |
| eq_slice_() used to be a common implementation for two function that both called it, but of those only eq_slice() is left, so we can as well directly inline the code. | ||||
| 2015-07-22 | placate `make tidy`. | Felix S. Klock II | -1/+1 | |
| 2015-07-22 | Rollup merge of #27151 - pfalabella:patch-2, r=steveklabnik | Steve Klabnik | -4/+4 | |
| I'm pretty sure this was a typo | ||||
| 2015-07-22 | Change signature for `move_val_init` intrinsic to take `*mut T` for `dest`. | Felix S. Klock II | -0/+8 | |
| rebase update to typeck/check/mod.rs | ||||
| 2015-07-22 | prototype Placer protocol for unstable overloaded-box and placement-in. | Felix S. Klock II | -0/+112 | |
| 2015-07-22 | Auto merge of #27176 - alexcrichton:fix-stock-llvm, r=brson | bors | -0/+6 | |
| This commit moves the IR files in the distribution, rust_try.ll, rust_try_msvc_64.ll, and rust_try_msvc_32.ll into the compiler from the main distribution. There's a few reasons for this change: * LLVM changes its IR syntax from time to time, so it's very difficult to have these files build across many LLVM versions simultaneously. We'll likely want to retain this ability for quite some time into the future. * The implementation of these files is closely tied to the compiler and runtime itself, so it makes sense to fold it into a location which can do more platform-specific checks for various implementation details (such as MSVC 32 vs 64-bit). * This removes LLVM as a build-time dependency of the standard library. This may end up becoming very useful if we move towards building the standard library with Cargo. In the immediate future, however, this commit should restore compatibility with LLVM 3.5 and 3.6. | ||||
| 2015-07-21 | trans: Move rust_try into the compiler | Alex Crichton | -0/+6 | |
| This commit moves the IR files in the distribution, rust_try.ll, rust_try_msvc_64.ll, and rust_try_msvc_32.ll into the compiler from the main distribution. There's a few reasons for this change: * LLVM changes its IR syntax from time to time, so it's very difficult to have these files build across many LLVM versions simultaneously. We'll likely want to retain this ability for quite some time into the future. * The implementation of these files is closely tied to the compiler and runtime itself, so it makes sense to fold it into a location which can do more platform-specific checks for various implementation details (such as MSVC 32 vs 64-bit). * This removes LLVM as a build-time dependency of the standard library. This may end up becoming very useful if we move towards building the standard library with Cargo. In the immediate future, however, this commit should restore compatibility with LLVM 3.5 and 3.6. | ||||
| 2015-07-21 | Inline eq_slice_() into eq_slice() | Björn Steinbrink | -12/+3 | |
| eq_slice_() used to be a common implementation for two function that both called it, but of those only eq_slice() is left, so we can as well directly inline the code. | ||||
| 2015-07-21 | Auto merge of #27168 - brson:stdprim, r=steveklabnik | bors | -97/+5 | |
| This makes the primitive descriptions on the front page read properly as descriptions of types and not of the associated modules. Having the primitive and module docs derived from the same source causes problems, primarily that they can't contain hyperlinks cross-referencing each other. This crates dedicated private modules in `std` to document the primitive types, then for all primitives that have a corresponding module, puts hyperlinks in moth the primitive docs and the module docs cross-linking each other. This should help clear up confusion when readers find themselves on the wrong page. This also removes all the duplicate `#[doc(primitive)]` tags in various places (especially core), so the core docs will no longer attempt to document the primitives for now. Seems like an acceptable tradeoff to get some cleanup for std. | ||||
| 2015-07-21 | Auto merge of #27129 - arthurprs:debug_atomic, r=alexcrichton | bors | -0/+21 | |
| I'm being constantly bitten by the lack of this implementation. I'm unsure if there's a reason to avoid these implementations though. Since we have a "lossy" implementation for both Mutex and RWLock (RWLock {{ locked }}) I don't think there's a big reason for not having a Debug implementation for the atomic types, even if the user can't specify the ordering. | ||||
| 2015-07-20 | Auto merge of #27056 - Eljay:doc-comments, r=nikomatsakis | bors | -10/+10 | |
| Fixes #23812 by stripping the decoration when desugaring macro doc comments into #[doc] attributes, and detects whether the attribute should be inner or outer style and outputs the appropriate token tree. | ||||
| 2015-07-20 | std: Create separate docs for the primitives | Brian Anderson | -95/+3 | |
| Having the primitive and module docs derived from the same source causes problems, primarily that they can't contain hyperlinks cross-referencing each other. This crates dedicated private modules in `std` to document the primitive types, then for all primitives that have a corresponding module, puts hyperlinks in moth the primitive docs and the module docs cross-linking each other. This should help clear up confusion when readers find themselves on the wrong page. | ||||
| 2015-07-20 | doc: Clean up primitive short descriptions | Brian Anderson | -2/+2 | |
| This makes the primitive descriptions on the front page read properly as descriptions of types and not of the associated modules. | ||||
| 2015-07-20 | impl Debug for Atomic types | arthurprs | -0/+21 | |
| 2015-07-20 | Auto merge of #27026 - nagisa:overflowing-unsigned, r=pnkfelix | bors | -3/+0 | |
| This commit fixes the negate_unsigned feature gate to appropriately account for inferred variables. This is technically a [breaking-change], but I’d consider it a bug fix. cc @brson for your relnotes. Fixes https://github.com/rust-lang/rust/issues/24676 Fixes #26840 Fixes https://github.com/rust-lang/rust/issues/25206 | ||||
| 2015-07-20 | s/has gained/has not gained/g | Paolo Falabella | -4/+4 | |
| I'm pretty sure this was a typo | ||||
| 2015-07-19 | Auto merge of #27110 - arthurprs:optintstr, r=Gankro | bors | -13/+111 | |
| I wrote a reasonably optimized version for both functions. Further optimizations are possible but I tried to keep the code size small (which I think is important), it's a road of diminished gains. The repository used for testing/benchmarks is https://github.com/arthurprs/rust-optimized-inttostr Benchmarks are ran for 3 different distributions, bellow are string length histograms for the u32 type * _h (big numbers skew) [0, 0, 5, 29, 103, 212, 551, 1138, 1887, 3196, 2879] * _m (slight small number skew): [0, 2807, 1334, 1057, 905, 821, 772, 707, 627, 605, 365] * _l (small numbers skew): [0, 8004, 567, 351, 248, 212, 170, 126, 136, 112, 74] Tested processors are * x64 laptop (i7-2670QM) * x32 server (Digital Ocean E5-2630L-v2) ### Display It uses a small look up table (200 bytes) and decode up to 4 characters at a time. I also took special precautions to reduce 64bit arithmetic on 32bit architectures and the gains are huge in these cases. Overall, on modern 64bit CPUs it's pretty much the same speed as the stdlib implementation for very small numbers (0..99), but pulls ahead as the length of the decimal increases. On slight older CPUs (w/ worse ALUs) or 32bit architectures it's pretty much always faster. x64 benchmarks ``` test bench::display_h_new_u08 ... bench: 71,041 ns/iter (+/- 2,894) test bench::display_h_new_u16 ... bench: 378,255 ns/iter (+/- 36,547) test bench::display_h_new_u32 ... bench: 4,232,483 ns/iter (+/- 509,661) test bench::display_h_new_u64 ... bench: 5,166,740 ns/iter (+/- 421,124) test bench::display_h_stdlib_u08 ... bench: 73,536 ns/iter (+/- 5,287) test bench::display_h_stdlib_u16 ... bench: 451,443 ns/iter (+/- 16,879) test bench::display_h_stdlib_u32 ... bench: 5,551,070 ns/iter (+/- 518,151) test bench::display_h_stdlib_u64 ... bench: 8,624,374 ns/iter (+/- 643,701) test bench::display_l_new_u08 ... bench: 71,547 ns/iter (+/- 504) test bench::display_l_new_u16 ... bench: 399,727 ns/iter (+/- 28,030) test bench::display_l_new_u32 ... bench: 4,365,303 ns/iter (+/- 414,414) test bench::display_l_new_u64 ... bench: 5,302,382 ns/iter (+/- 292,324) test bench::display_l_stdlib_u08 ... bench: 75,445 ns/iter (+/- 2,487) test bench::display_l_stdlib_u16 ... bench: 444,313 ns/iter (+/- 16,203) test bench::display_l_stdlib_u32 ... bench: 5,761,801 ns/iter (+/- 387,186) test bench::display_l_stdlib_u64 ... bench: 8,790,365 ns/iter (+/- 614,846) test bench::display_m_new_u08 ... bench: 71,820 ns/iter (+/- 2,956) test bench::display_m_new_u16 ... bench: 399,649 ns/iter (+/- 20,643) test bench::display_m_new_u32 ... bench: 4,355,561 ns/iter (+/- 179,189) test bench::display_m_new_u64 ... bench: 5,070,594 ns/iter (+/- 341,950) test bench::display_m_stdlib_u08 ... bench: 74,900 ns/iter (+/- 1,909) test bench::display_m_stdlib_u16 ... bench: 448,788 ns/iter (+/- 20,791) test bench::display_m_stdlib_u32 ... bench: 5,717,939 ns/iter (+/- 316,824) test bench::display_m_stdlib_u64 ... bench: 8,787,160 ns/iter (+/- 482,864) ``` x86 benchmarks ``` test bench::display_h_new_u08 ... bench: 94,246 ns/iter (+/- 34,872) test bench::display_h_new_u16 ... bench: 533,805 ns/iter (+/- 22,499) test bench::display_h_new_u32 ... bench: 6,127,747 ns/iter (+/- 2,192,789) test bench::display_h_new_u64 ... bench: 14,994,203 ns/iter (+/- 1,609,345) test bench::display_h_stdlib_u08 ... bench: 107,233 ns/iter (+/- 8,571) test bench::display_h_stdlib_u16 ... bench: 631,186 ns/iter (+/- 11,332) test bench::display_h_stdlib_u32 ... bench: 7,696,344 ns/iter (+/- 957,917) test bench::display_h_stdlib_u64 ... bench: 45,677,401 ns/iter (+/- 4,991,344) test bench::display_l_new_u08 ... bench: 95,855 ns/iter (+/- 27,735) test bench::display_l_new_u16 ... bench: 532,084 ns/iter (+/- 40,479) test bench::display_l_new_u32 ... bench: 5,973,953 ns/iter (+/- 211,676) test bench::display_l_new_u64 ... bench: 14,773,064 ns/iter (+/- 1,276,579) test bench::display_l_stdlib_u08 ... bench: 106,350 ns/iter (+/- 63,963) test bench::display_l_stdlib_u16 ... bench: 637,746 ns/iter (+/- 101,005) test bench::display_l_stdlib_u32 ... bench: 7,740,640 ns/iter (+/- 848,478) test bench::display_l_stdlib_u64 ... bench: 44,846,932 ns/iter (+/- 4,514,694) test bench::display_m_new_u08 ... bench: 94,549 ns/iter (+/- 13,029) test bench::display_m_new_u16 ... bench: 546,030 ns/iter (+/- 35,804) test bench::display_m_new_u32 ... bench: 5,983,924 ns/iter (+/- 1,180,559) test bench::display_m_new_u64 ... bench: 14,817,873 ns/iter (+/- 2,271,464) test bench::display_m_stdlib_u08 ... bench: 107,806 ns/iter (+/- 8,805) test bench::display_m_stdlib_u16 ... bench: 630,714 ns/iter (+/- 6,586) test bench::display_m_stdlib_u32 ... bench: 7,784,210 ns/iter (+/- 358,601) test bench::display_m_stdlib_u64 ... bench: 46,223,927 ns/iter (+/- 6,553,176) ``` ### from_str_radix (FromStr) All valid digits are ascii so I modified the function to use the underlining bytes instead and simplified the match to avoid wasting cycles. x64 benchmarks ``` test bench::from_str_h_new_u08 ... bench: 28,153 ns/iter (+/- 624) test bench::from_str_h_new_u16 ... bench: 223,513 ns/iter (+/- 11,554) test bench::from_str_h_new_u32 ... bench: 3,098,935 ns/iter (+/- 231,022) test bench::from_str_h_new_u64 ... bench: 5,009,900 ns/iter (+/- 341,961) test bench::from_str_h_stdlib_u08 ... bench: 34,033 ns/iter (+/- 2,068) test bench::from_str_h_stdlib_u16 ... bench: 248,785 ns/iter (+/- 14,208) test bench::from_str_h_stdlib_u32 ... bench: 4,150,536 ns/iter (+/- 266,070) test bench::from_str_h_stdlib_u64 ... bench: 6,817,997 ns/iter (+/- 449,838) test bench::from_str_l_new_u08 ... bench: 27,552 ns/iter (+/- 1,500) test bench::from_str_l_new_u16 ... bench: 234,360 ns/iter (+/- 13,144) test bench::from_str_l_new_u32 ... bench: 3,140,261 ns/iter (+/- 248,175) test bench::from_str_l_new_u64 ... bench: 5,176,583 ns/iter (+/- 350,416) test bench::from_str_l_stdlib_u08 ... bench: 35,060 ns/iter (+/- 2,154) test bench::from_str_l_stdlib_u16 ... bench: 252,135 ns/iter (+/- 23,461) test bench::from_str_l_stdlib_u32 ... bench: 4,154,599 ns/iter (+/- 369,606) test bench::from_str_l_stdlib_u64 ... bench: 6,892,767 ns/iter (+/- 213,030) test bench::from_str_m_new_u08 ... bench: 28,252 ns/iter (+/- 1,384) test bench::from_str_m_new_u16 ... bench: 231,051 ns/iter (+/- 16,540) test bench::from_str_m_new_u32 ... bench: 3,166,504 ns/iter (+/- 134,418) test bench::from_str_m_new_u64 ... bench: 5,103,195 ns/iter (+/- 218,912) test bench::from_str_m_stdlib_u08 ... bench: 35,012 ns/iter (+/- 2,735) test bench::from_str_m_stdlib_u16 ... bench: 250,967 ns/iter (+/- 14,708) test bench::from_str_m_stdlib_u32 ... bench: 4,101,845 ns/iter (+/- 205,802) test bench::from_str_m_stdlib_u64 ... bench: 6,823,001 ns/iter (+/- 267,215) ``` x86 benchmarks ``` test bench::from_str_h_new_u08 ... bench: 23,682 ns/iter (+/- 3,590) test bench::from_str_h_new_u16 ... bench: 190,916 ns/iter (+/- 29,688) test bench::from_str_h_new_u32 ... bench: 2,649,952 ns/iter (+/- 308,576) test bench::from_str_h_new_u64 ... bench: 23,458,434 ns/iter (+/- 2,327,427) test bench::from_str_h_stdlib_u08 ... bench: 45,551 ns/iter (+/- 6,968) test bench::from_str_h_stdlib_u16 ... bench: 313,739 ns/iter (+/- 17,175) test bench::from_str_h_stdlib_u32 ... bench: 4,615,669 ns/iter (+/- 470,766) test bench::from_str_h_stdlib_u64 ... bench: 30,589,482 ns/iter (+/- 2,278,996) test bench::from_str_l_new_u08 ... bench: 23,763 ns/iter (+/- 5,545) test bench::from_str_l_new_u16 ... bench: 185,472 ns/iter (+/- 33,097) test bench::from_str_l_new_u32 ... bench: 2,691,307 ns/iter (+/- 473,886) test bench::from_str_l_new_u64 ... bench: 22,952,593 ns/iter (+/- 1,963,742) test bench::from_str_l_stdlib_u08 ... bench: 45,285 ns/iter (+/- 16,337) test bench::from_str_l_stdlib_u16 ... bench: 313,624 ns/iter (+/- 6,643) test bench::from_str_l_stdlib_u32 ... bench: 4,595,679 ns/iter (+/- 1,876,361) test bench::from_str_l_stdlib_u64 ... bench: 30,434,683 ns/iter (+/- 1,901,996) test bench::from_str_m_new_u08 ... bench: 23,812 ns/iter (+/- 1,505) test bench::from_str_m_new_u16 ... bench: 185,553 ns/iter (+/- 19,788) test bench::from_str_m_new_u32 ... bench: 2,614,920 ns/iter (+/- 66,230) test bench::from_str_m_new_u64 ... bench: 23,241,778 ns/iter (+/- 3,474,077) test bench::from_str_m_stdlib_u08 ... bench: 45,634 ns/iter (+/- 1,436) test bench::from_str_m_stdlib_u16 ... bench: 316,479 ns/iter (+/- 21,212) test bench::from_str_m_stdlib_u32 ... bench: 4,609,147 ns/iter (+/- 487,068) test bench::from_str_m_stdlib_u64 ... bench: 30,165,173 ns/iter (+/- 1,601,830) ``` | ||||
| 2015-07-19 | optimize from_str_radix | arthurprs | -11/+25 | |
| 2015-07-18 | optimize integer formatting | arthurprs | -2/+86 | |
| 2015-07-18 | Fix doc comment parsing in macros. | Lee Jeffery | -10/+10 | |
| 2015-07-17 | Remove confusing 'mutability root' term | Steve Klabnik | -7/+7 | |
| And some other outdated language. @echochamber came asking about these docs on IRC today, and they're a bit weird. I've updated them to be less ambiguous and use contemporary terminology. | ||||
| 2015-07-16 | Rollup merge of #27039 - bluss:siphash-tests, r=alexcrichton | Manish Goregaokar | -2/+0 | |
| core: Revive SipHash's tests These tests were bitrotting, include them in the crate and bring them up to date and compiling.. and they pass. | ||||
| 2015-07-15 | Make AtomicPtr Send | William Throwe | -1/+2 | |
| This appears to have just been an oversight, and it is annoying to not be able to use an Arc<AtomicPtr>. | ||||
| 2015-07-14 | Fix negate_unsigned feature gate check | Simonas Kazlauskas | -3/+0 | |
| This commit fixes the negate_unsigned feature gate to appropriately account for infered variables. This is technically a [breaking-change]. | ||||
| 2015-07-14 | core: Revive SipHash's tests | Ulrik Sverdrup | -2/+0 | |
| These tests were bitrotting, include them in the crate and bring them up to date and compiling.. and they pass. | ||||
| 2015-07-13 | Auto merge of #26241 - SimonSapin:derefmut-for-string, r=alexcrichton | bors | -0/+79 | |
| See https://github.com/rust-lang/rfcs/issues/1157 | ||||
| 2015-07-13 | Add str::split_at_mut | Simon Sapin | -0/+15 | |
| 2015-07-13 | Implement IndexMut for String and str. | Simon Sapin | -0/+64 | |
| ... matching the existing Index impls. There is no reason not to if String implement DerefMut. The code removed in `src/librustc/middle/effect.rs` was added in #9750 to prevent things like `s[0] = 0x80` where `s: String`, but I belive became unnecessary when the Index(Mut) traits were introduced. | ||||
| 2015-07-13 | Auto merge of #26981 - wthrowe:div_docs, r=Gankro | bors | -6/+26 | |
| This resolves #26845. I'm not entirely satisfied with the placement of the rounding discussion in the docs for the `Div` and `Rem` traits, but I couldn't come up with anywhere better to put it. Suggestions are welcome. I didn't add any discussion of rounding to the `checked_div` (or rem) or `wrapping_div` documentation because those seem to make it pretty clear that they do the same thing as `Div`. | ||||
| 2015-07-12 | Move rounding discussion to integer Div/Rem impls | William Throwe | -8/+22 | |
| 2015-07-12 | Auto merge of #26966 - nagisa:tail-init, r=alexcrichton | bors | -4/+32 | |
| Fixes #26906 | ||||
| 2015-07-12 | Rollup merge of #26974 - tshepang:trailing-comma, r=Gankro | Manish Goregaokar | -15/+15 | |
| 2015-07-11 | Correct and clarify integer division rounding docs | William Throwe | -4/+10 | |
| 2015-07-11 | Auto merge of #26913 - sfackler:tuple-debug, r=alexcrichton | bors | -7/+12 | |
| This does change the Debug output for 1-tuples to `(foo)` instead of `(foo,)` but I don't think it's that big of a deal. r? @alexcrichton | ||||
| 2015-07-12 | Implement RFC 1058 | Simonas Kazlauskas | -4/+32 | |
| 2015-07-11 | Auto merge of #26878 - Esption:master, r=pnkfelix | bors | -1/+1 | |
| I noticed in docs, specifically http://doc.rust-lang.org/std/primitive.u8.html#method.is_power_of_two, that it was like this, and it was apparently in multiple places too. Didn't change any occurrences through the cross-depo things. There's a lot in /src/llvm/ for instance, but I'm not confident on how to go about sending fixes for those, so this is just what's in the base rust depo. r? @steveklabnik | ||||
| 2015-07-10 | Add trailing , for 1-tuples | Steven Fackler | -1/+16 | |
| 2015-07-09 | Auto merge of #26909 - rick68:patch-10, r=dotdash | bors | -5/+5 | |
| fix typos | ||||
| 2015-07-09 | Auto merge of #26885 - mvdnes:wrapping_div, r=alexcrichton | bors | -0/+10 | |
| Resolves #26867 | ||||
| 2015-07-08 | Change tuple Debug impls to use builders | Steven Fackler | -13/+3 | |
| 2015-07-09 | Auto merge of #26884 - dotdash:fast, r=alexcrichton | bors | -4/+22 | |
| Exploiting the fact that getting the length of the slices is known, we can use a counted loop instead of iterators, which means that we only need a single counter, instead of having to increment and check one pointer for each iterator. Benchmarks comparing vectors with 100,000 elements: Before: ``` running 8 tests test eq1_u8 ... bench: 66,757 ns/iter (+/- 113) test eq2_u16 ... bench: 111,267 ns/iter (+/- 149) test eq3_u32 ... bench: 126,282 ns/iter (+/- 111) test eq4_u64 ... bench: 126,418 ns/iter (+/- 155) test ne1_u8 ... bench: 88,990 ns/iter (+/- 161) test ne2_u16 ... bench: 89,126 ns/iter (+/- 265) test ne3_u32 ... bench: 96,901 ns/iter (+/- 92) test ne4_u64 ... bench: 96,750 ns/iter (+/- 137) ``` After: ``` running 8 tests test eq1_u8 ... bench: 46,413 ns/iter (+/- 521) test eq2_u16 ... bench: 46,500 ns/iter (+/- 74) test eq3_u32 ... bench: 50,059 ns/iter (+/- 92) test eq4_u64 ... bench: 54,001 ns/iter (+/- 92) test ne1_u8 ... bench: 47,595 ns/iter (+/- 53) test ne2_u16 ... bench: 47,521 ns/iter (+/- 59) test ne3_u32 ... bench: 44,889 ns/iter (+/- 74) test ne4_u64 ... bench: 47,775 ns/iter (+/- 68) ``` | ||||
| 2015-07-09 | Update intrinsics.rs | Wei-Ming Yang | -5/+5 | |
| fix typos | ||||
| 2015-07-08 | 'iff' for docs to 'if and only if' | Esption | -2/+2 | |
| 2015-07-08 | Rollup merge of #26891 - steveklabnik:gh26552, r=huonw | Steve Klabnik | -0/+4 | |
| Added a proper Unsafety header, as well as mentioning that the pointer shouldn't be null. Fixes #26552 | ||||
| 2015-07-08 | Fix up unsafe section of slice::from_raw_parts | Steve Klabnik | -0/+4 | |
| Added a proper Unsafety header, as well as mentioning that the pointer shouldn't be null. Fixes #26552 | ||||
| 2015-07-08 | Make mention of alternate flags in std::fmt traits | Steve Klabnik | -0/+43 | |
| https://www.reddit.com/r/rust/comments/3ceaui/psa_produces_prettyprinted_debug_output/ | ||||
| 2015-07-08 | Use wrapping_div call and correct the feature name | Mathijs van de Nes | -2/+2 | |
| 2015-07-08 | Implement Div for Wrapping<T> | Mathijs van de Nes | -0/+10 | |
| Resolves #26867 | ||||
| 2015-07-08 | Improve PartialEq for slices | Björn Steinbrink | -4/+22 | |
| Exploiting the fact that getting the length of the slices is known, we can use a counted loop instead of iterators, which means that we only need a single counter, instead of having to increment and check one pointer for each iterator. Benchmarks comparing vectors with 100,000 elements: Before: ``` running 8 tests test eq1_u8 ... bench: 66,757 ns/iter (+/- 113) test eq2_u16 ... bench: 111,267 ns/iter (+/- 149) test eq3_u32 ... bench: 126,282 ns/iter (+/- 111) test eq4_u64 ... bench: 126,418 ns/iter (+/- 155) test ne1_u8 ... bench: 88,990 ns/iter (+/- 161) test ne2_u16 ... bench: 89,126 ns/iter (+/- 265) test ne3_u32 ... bench: 96,901 ns/iter (+/- 92) test ne4_u64 ... bench: 96,750 ns/iter (+/- 137) ``` After: ``` running 8 tests test eq1_u8 ... bench: 46,413 ns/iter (+/- 521) test eq2_u16 ... bench: 46,500 ns/iter (+/- 74) test eq3_u32 ... bench: 50,059 ns/iter (+/- 92) test eq4_u64 ... bench: 54,001 ns/iter (+/- 92) test ne1_u8 ... bench: 47,595 ns/iter (+/- 53) test ne2_u16 ... bench: 47,521 ns/iter (+/- 59) test ne3_u32 ... bench: 44,889 ns/iter (+/- 74) test ne4_u64 ... bench: 47,775 ns/iter (+/- 68) ``` | ||||
| 2015-07-08 | Fixed some occurrences of 'if' being spelled 'iff' | Esption | -2/+2 | |
