mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-30 07:00:37 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions
14764 commits 7 branches 511 tags 95 MiB
Commit graph

541 commits

Author SHA1 Message Date
Andrei Alexandrescu
bf3669f369 Merge pull request #4687 from wilzbach/std_algorithm_comparison 
add unittest attributes to std.algorithm.comparison
 2016-08-15 05:38:44 -04:00
Andrei Alexandrescu
66ba7b87f0 This is 3% faster because of better use of speculative hardware 2016-08-12 17:09:47 -04:00
Andrei Alexandrescu
30cb5191b0 Simplify, eliminate redundant work in sort 2016-08-12 15:55:45 -04:00
Steven Schveighoffer
c4578cdb80 Merge pull request #4716 from WalterBright/sorting-overflow 
sorting.d: add overflow checks
 2016-08-05 11:31:01 -04:00
Walter Bright
ec8534d58b sorting.d: add overflow checks 2016-08-05 00:44:20 -07:00
Walter Bright
8f69e217bf comparison.d: add overflow checks 2016-08-05 00:39:33 -07:00
Walter Bright
03a5eae0f4 fix .ptr safety problem in schwartzSort() 2016-08-03 00:03:21 -07:00
Walter Bright
7b30453dd2 Merge pull request #4686 from wilzbach/std_algorithm_iteration 
add unittest attributes to std.algorithm.iteration
 2016-08-02 04:07:44 -07:00
Jack Stouffer
f30c6a106c Enable always true assert checks in Travis 2016-07-31 10:47:26 -04:00
Walter Bright
c6aa7e19d5 Merge pull request #4685 from wilzbach/std_algorithm_sorting 
add unittest attributes to std.algorithm.sorting
 2016-07-29 15:09:35 -07:00
Sebastian Wilzbach
790aada728 replace functions with lambda aliases 2016-07-29 18:16:34 +02:00
Sebastian Wilzbach
fde82ff034 std.algorithm.sorting: enable CTFE test for Timsort 2016-07-29 17:31:20 +02:00
Sebastian Wilzbach
016d5145b2 make std.algorithm.sorting @safe-er 2016-07-29 17:14:20 +02:00
Sebastian Wilzbach
bd98ca10d7 add unittest attributes to std.algorithm.comparison 2016-07-29 12:25:56 +02:00
Sebastian Wilzbach
d7a18dc52e add unittest attributes to std.algorithm.iteration 2016-07-29 12:25:22 +02:00
Ilya Yaroshenko
efe33e3470 fix docs in iteration 
`sum` is not precise. Precise algorithms are Python `fsum` and Mir's [`sum!(Summation.precise)`](http://docs.mir.dlang.io/latest/mir_sum.html)
 2016-07-26 10:07:42 +02:00
Nick Treleaven
46a08e86d7 [trivial] Tweak docs for std.algorithm.sort 2016-07-18 12:03:37 +01:00
Andrei Alexandrescu
cd68d1a582 Merge pull request #4603 from JackStouffer/cache 
Enhanced cache and map to provide length info for their slices
 2016-07-15 16:45:30 -04:00
Jack Stouffer
fcb57098d1 Enhanced cache and map to provide length info for their slices 2016-07-14 14:03:25 -04:00
Jack Stouffer
c9222e1ecc Added messages to asserts in std.algorithm.iteration 2016-07-14 13:16:23 -04:00
Dmitry Olshansky
f49908c56b Merge pull request #4578 from JackStouffer/unused-variables 
Remove or Fix Unused Variables
 2016-07-11 21:38:30 +02:00
Steven Schveighoffer
c74537000c Fix all windows cycles 2016-07-08 21:07:15 -04:00
Jack Stouffer
b24000513d Removed unused variables from std.algorithm.sorting 2016-07-08 11:34:48 -04:00
Jack Stouffer
6b22c63c5b Enable long line checks in travis 2016-07-02 01:10:29 -04:00
Jack Stouffer
268fa2538d Add some const and immutable to std.algorithm 2016-07-01 17:11:09 -04:00
Jack Stouffer
ad7dbaa050 Fixed Issue 14485: .front of empty filtered zip range is accessible 2016-06-28 09:48:56 -04:00
Andrei Alexandrescu
e59c06b410 Merge pull request #4431 from wilzbach/document_std_algorithm_test 
add external imports to documented unittests in std.algorithm
 2016-06-18 06:38:44 -04:00
Andrei Alexandrescu
ac9c93cb9e Merge pull request #4315 from wilzbach/algorithms_private_cleanup 
std.algorithm: set accidentally exposed methods to private
 2016-06-18 04:27:58 -04:00
Andrei Alexandrescu
7172eda466 Merge pull request #4327 from tsbockman/isPowerOf2 
Add `std.math.isPowerOf2()`. Supports floating-point and integers.
 2016-06-16 23:09:02 -04:00
Sebastian Wilzbach
ec47ac4224 Remove the WEB macro in favor of HTTP 
replacement: sed 's/\$(WEB/\$(HTTP/g' -i **/*.d
 2016-06-16 00:14:51 +02:00
Sebastian Wilzbach
8b60ec24b0 add external imports to documented unittests in std.algorithm 2016-06-15 03:42:28 +02:00
Steven Schveighoffer
c5bb43ce54 Merge pull request #4425 from JackStouffer/issue16073 
Partial Fix for Issue 16073 (part 2)
 2016-06-14 11:01:59 -04:00
Jack Stouffer
94d74ac8f5 [Issue 16073] Fix incorrect uses of random access range primitives in std.algorithm.sorting 2016-06-14 10:04:01 -04:00
Dmitry Olshansky
6dc8e467b0 Merge pull request #4415 from WalterBright/safeSchwartz 
make the Schwartz @safe
 2016-06-10 21:10:00 +04:00
Walter Bright
a85f48a85b Merge pull request #4394 from JackStouffer/equal 
Added auto-decoding special case to std.algorithm.comparison.equal
 2016-06-07 10:44:27 -07:00
Jack Stouffer
cb073a2cc9 Added auto-decoding special case to std.algorithm.comparison.equal 2016-06-07 09:07:59 -04:00
Walter Bright
23613c2189 make the Schwartz @safe 2016-06-07 04:19:06 -07:00
tsbockman
18d1b436e4 Update Phobos to use the new std.math.isPowerOf2() everywhere. 
`std.uni` looks like it may depend upon its local `isPowerOf2()` implementation
to return `true` for `0`. Since the semantics are different from the standard
version, I have renamed it to `isPow2OrZero()` to avoid confusion.
 2016-06-04 21:19:38 -07:00
Sebastian Wilzbach
823203fc4f fix slipped through style violations 2016-06-05 01:30:55 +02:00
Sebastian Wilzbach
0c100a7b5a std.algorithm: set accidentally exposed methods to private 2016-06-04 16:13:07 +02:00
Vladimir Panteleev
28a7775fe4 Merge pull request #4395 from s-ludwig/master 
Use REF_ALTTEXT for overview table symbol links. See issue 14403.
 2016-06-03 13:22:58 +03:00
Andreas Zwinkau
9d77777941 Removed outdated comment 
Slipped through pull request #4362. Since "above" is a different
algorithm the removed comment is misleading. It did make sense in
previous versions of PR #4362.
 2016-06-02 22:59:40 +02:00
Sönke Ludwig
e43ac92e69 Use REF_ALTTEXT for overview table symbol links. See issue 14403. 2016-06-02 22:11:11 +02:00
Andreas Zwinkau
a9d5b8ca77 Improve speed of find for random access needles (strings) 
For find a string within a string, std.algorithm.searching.find was
unnecessarily slow. The reason is it created intermediate slices. A
naively written nested-for-loop implementation was a few times
faster.

For random access ranges (which strings are) this uses an index based
algorithm, which does not need to create an intermediate slice. Speed
is now comparable to the nested-for-loop implementation even in rather
pathological cases.

This might help with issue 9646.
 2016-06-02 21:44:50 +02:00
Steven Schveighoffer
e216c10b2c Merge pull request #4383 from JackStouffer/issue16073 
Partial Fix for Issue 16073
 2016-06-02 14:30:24 -04:00
Jack Stouffer
74398e70cf [Issue 16073] Fix incorrect uses of random access range primitives in std.algorithm.searching 2016-06-02 09:31:07 -04:00
Jack Stouffer
3a1db06f41 [Issue 16073] Fix incorrect uses of random access range primitives in std.algorithm.mutation 2016-06-02 09:31:06 -04:00
Jack Stouffer
a818c7e059 [Issue 16073] Fix incorrect uses of random access range primitives in std.algorithm.iteration 2016-06-02 09:31:01 -04:00
Sebastian Wilzbach
ca098c57d2 manual allman brace fixup 2016-05-31 13:07:53 +02:00
Sebastian Wilzbach
1d34a121e9 apply all-man braces in Phobos 
// find common cases
sed -E "s/^(\s*)((if|static if|for|foreach|foreach_reverse|while|unittest|switch|else|version).*)\s*\{$/\1\2\n\1{/" -i **/*.d
// catch else-if
sed -E "s/^(\s*)} (else static if| if|else if|else)(.*)\s*\{$/\1}\n\1\2\3\n\1{/" -i **/*.d
// remove created trailing whitespace
sed -i 's/[ \t]*$//' **/*.d
 2016-05-31 13:07:53 +02:00