mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-12-25 21:35:41 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
683 commits 2 branches 0 tags 18 MiB
Commit graph

153 commits

Author SHA1 Message Date
bolero-MURAKAMI
ab0731c4fc [sprout.random] add seed_array 2013-11-08 23:20:43 +09:00
bolero-MURAKAMI
a954fd7d51 fix: partition_copy parameter 2013-11-06 00:04:06 +09:00
bolero-MURAKAMI
2c9f0647f4 fix: random generator/distribution result type (add const) 2013-11-04 18:50:48 +09:00
bolero-MURAKAMI
040278bd11 add new directory sprout/algorithm/cxx14/ 2013-10-31 18:57:41 +09:00
bolero-MURAKAMI
2232778731 remove slipped file 2013-10-31 12:37:38 +09:00
bolero-MURAKAMI
b95e583394 add config: SPROUT_INITIALIZER_LIST_CONSTEXPR 2013-10-27 16:25:13 +09:00
Bolero MURAKAMI
39bc2bfc5d Merge pull request #56 from kariya-mitsuru/algorithm.search_n 
[algorithm.search_n] Fix search_n's complexity violation.
 2013-10-26 19:50:46 -07:00
Bolero MURAKAMI
5d6fc5c726 Merge pull request #39 from kariya-mitsuru/is_permutation 
[algorithm.is_permutation] Reduce complexity
 2013-10-26 19:50:21 -07:00
bolero-MURAKAMI
c40b33067e [sprout.array] support for C++14 constexpr 2013-10-26 00:32:36 +09:00
bolero-MURAKAMI
c58c9cc0fc fix: math functions (support for inferior C++14 standard) 
add C++14 constexpr modifying algorithms
 2013-10-25 12:29:16 +09:00
bolero-MURAKAMI
cc4cad6895 add c++14 constexpr version: generate, generate_n 2013-10-17 19:22:40 +09:00
bolero-MURAKAMI
7b11799ace add c++14 constexpr version: fill, fill_n 2013-10-16 13:04:49 +09:00
bolero-MURAKAMI
3f85600f53 add c++14 constexpr version: transform, replace 2013-10-15 20:22:20 +09:00
bolero-MURAKAMI
a3427d375f add constexpr algorithm C++14 version: move, move_backward, swap_ranges, iter_swap 2013-10-15 14:01:34 +09:00
bolero-MURAKAMI
a90bbd5f38 add advance C++14 constexpr version 2013-10-05 13:35:26 +09:00
Mitsuru Kariya
1a5d40d821 [algorithm.search_n] Fix search_n's complexity violation. 
According to document, at most last - first applications of the corresponding predicate,
but (last - first) * count applications.
 2013-10-03 01:37:53 +09:00
Mitsuru Kariya
ddedba4772 Reduce complexity 
change line separation

Fix 4 Iterator parameter version(missing mismatch parameter)

Fix 4 ForwardIterator version.
 2013-09-05 23:29:24 +09:00
Bolero MURAKAMI
d9e9c23f67 Merge pull request #36 from kariya-mitsuru/count_if 
[algorithm.count_if] Reduce inner function parameter.
 2013-09-03 04:47:23 -07:00
Bolero MURAKAMI
d64c676ed0 Merge pull request #35 from kariya-mitsuru/count 
[algorithm.count] Reduce inner function parameter.
 2013-09-03 04:37:40 -07:00
Mitsuru Kariya
588d6c3f1b [algorithm.count_if] Reduce inner function parameter. 2013-09-03 09:32:54 +09:00
Mitsuru Kariya
ad73036997 [algorithm.count] Reduce inner function parameter. 2013-09-03 09:28:24 +09:00
Mitsuru Kariya
37bcbe7917 [algorithm.binary_search] Use comp parameter for lower_bound. 2013-09-02 22:47:15 +09:00
bolero-MURAKAMI
5686785ea9 fix: less.hpp header, erase lower/upper_bound detail header 2013-09-02 14:46:13 +09:00
Mitsuru Kariya
5b13f3b8a2 [algorithm.equal_range, etc] Change recursive function parameters from "Iter, Iter" to "Iter, length." 2013-09-01 00:13:23 +09:00
Bolero-MURAKAMI
bbeb2f1b4b fix less namespace and header 2013-08-31 08:29:24 +09:00
Bolero MURAKAMI
69a735f874 Merge pull request #29 from kariya-mitsuru/upper_bound 
[algorithm.upper_bound] Change a bit.
 2013-08-30 16:14:43 -07:00
Mitsuru Kariya
9704d9e777 [algorithm.upper_bound] Change a bit. 2013-08-31 01:08:37 +09:00
Mitsuru Kariya
729c42d081 [algorithm.lower_bound] Change a bit. 2013-08-31 00:57:06 +09:00
Mitsuru Kariya
bfc22a86a7 Change find_end: 
1.Fix for ForwardIterator when [first2, last2) is empty.
2.Fix RandomAccessIterator version.(search from last1)
3.Add BidirectionalIterator version.(search from last1)
4.Add sprout::detail::search_one_rev helper function for
  BidirectionalIterator version.
 2013-08-28 13:24:15 +09:00
Bolero MURAKAMI
f194a7f68c Merge pull request #25 from kariya-mitsuru/find_first_of 
[algorithm.find_first_of] fix find_first_of bind position
 2013-08-27 02:09:37 -07:00
Mitsuru Kariya
35b145d169 fix find_first_of bind position 2013-08-27 14:43:01 +09:00
Mitsuru Kariya
c1af6b4f14 remove equal2_impl_ra_1 2013-08-27 12:53:09 +09:00
bolero-MURAKAMI
2191429a9b fix equal: empty range check 2013-08-27 11:36:37 +09:00
Mitsuru Kariya
98445c98eb fix equal for empty range 2013-08-27 02:16:11 +09:00
bolero-MURAKAMI
d6592a9ce3 fix minmax_element 2013-08-26 17:38:11 +09:00
Mitsuru Kariya
6833b85e2b fix minmax_element 2013-08-26 12:10:57 +09:00
bolero-MURAKAMI
b500c7c993 add minmax initializer_list version 2013-08-23 23:20:36 +09:00
bolero-MURAKAMI
5ea46e507f add min, max: initialize_list version 2013-08-23 22:38:40 +09:00
bolero-MURAKAMI
2dc912522b fix make_array: explicit conversion to T 2013-08-23 12:08:17 +09:00
bolero-MURAKAMI
ce4a65b2ad fix algorithm: one_of, one_of_equal ( empty range input ) 2013-08-17 18:41:58 +09:00
bolero-MURAKAMI
1971e351e6 refix copy algorithm 2013-08-14 21:57:26 +09:00
bolero-MURAKAMI
4e4c1b1786 fix non-modifying algorithm: for InputIterator Requirements 2013-08-14 10:37:52 +09:00
bolero-MURAKAMI
6ae41ef6de fix algorithm: copy for InputIterator 2013-08-13 01:55:26 +09:00
bolero-MURAKAMI
72fe72a623 extraordinary fix: find_end implementation 2013-08-12 00:09:40 +09:00
bolero-MURAKAMI
baf8995e81 [Destructive changes] add sprout::string constructor (already not an aggregate) 2013-08-09 19:04:37 +09:00
bolero-MURAKAMI
cb1077d247 add copyright 2013-08-08 18:54:33 +09:00
bolero-MURAKAMI
21cefe8a67 fix template-parameter name: Iterator, Range 2013-08-07 22:13:03 +09:00
bolero-MURAKAMI
0aeaf19c47 fix fit-algorithm implementation: min compare 2013-07-24 19:22:26 +09:00
bolero-MURAKAMI
57e35349e5 fix warning (for -Wextra) 2013-07-22 22:00:09 +09:00
bolero-MURAKAMI
50f2ba6e31 fix compiler config: borland, visualc 2013-07-07 01:09:35 +09:00