King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Code Issues Releases Wiki Activity
935 commits 2 branches 0 tags 40 MiB
Commit graph

200 commits

Author SHA1 Message Date
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
Mitsuru Kariya
2e984eacb7 intermediate 
fix tristate_lexicographical_compare(w/delimiter version)

reduce complexity

remove unnecessary code etc.

remove testcode
 2013-09-02 20:57:45 +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
bolero-MURAKAMI
d732a73431 add is_permutation algorithm: robust version (N3607) 2013-05-16 19:03:27 +09:00
bolero-MURAKAMI
d6aaabe45f add equal algorithm: robust version (N3607) 2013-05-16 18:37:37 +09:00
bolero-MURAKAMI
dce6fff6a4 add mismatch algorithm: robust version (N3607) 2013-05-16 15:13:49 +09:00
bolero-MURAKAMI
a5b7eda260 fix libs/random/example/array.cpp 2013-04-11 15:50:14 +09:00
bolero-MURAKAMI
8885b115f7 add case_conv algorithms 2013-04-09 19:27:06 +09:00
bolero-MURAKAMI
410c369a6a add enable_make_indexes 2013-04-06 13:06:51 +09:00
bolero-MURAKAMI
049d4592c2 fix index_range implementation 2013-03-31 15:14:10 +09:00
bolero-MURAKAMI
2e8b85e90c fix tuple construction, darkroom rgb & vector3d construction 2013-03-27 02:02:16 +09:00
bolero-MURAKAMI
a2b368a7cc add identity 2013-03-21 22:11:40 +09:00
bolero-MURAKAMI
2cb55b6b6c fix for GCC4.8 RC 2013-03-21 20:00:42 +09:00
bolero-MURAKAMI
899bf3fa77 add sub_window, add sub_offset 2013-02-26 16:14:04 +09:00
bolero-MURAKAMI
74e83e31a7 add back_inserter, front_inserter 2013-02-26 10:43:27 +09:00
bolero-MURAKAMI
7c706381d4 fix iterator implementation 2013-02-23 15:21:27 +09:00
bolero-MURAKAMI
84376c3f69 fix string_ref 2013-02-20 01:12:56 +09:00
bolero-MURAKAMI
ac5ac257e6 fix include header 2013-02-08 00:49:47 +09:00
bolero-MURAKAMI
7aa10d1e08 support hash: floating point 2013-02-07 23:12:57 +09:00
bolero-MURAKAMI
f3b405ad0f fix algorithm: bogo_sort, bozo_sort 2013-02-04 01:10:26 +09:00
bolero-MURAKAMI
092910e2f7 add iterator category check for algorithm incomplete implementation 2013-01-31 23:25:18 +09:00
bolero-MURAKAMI
1cfec16e52 add range adaptors adjacent_filtered, uniqued 2013-01-27 16:56:14 +09:00
bolero-MURAKAMI
271f348972 support STL container: set operation algorithms 2013-01-26 21:30:29 +09:00
bolero-MURAKAMI
ee8602f6a3 fix index_tuple 2013-01-25 15:14:29 +09:00
bolero-MURAKAMI
48f1b2d615 add new signatures: some algorithms 2013-01-20 20:49:37 +09:00
bolero-MURAKAMI
9a593cbb81 fix reverse_iterator 
support STL container: some algorithms
 2013-01-20 08:53:20 +09:00
bolero-MURAKAMI
a9cd556f8e fix support for STL container: some algorithms 2013-01-17 03:53:17 +09:00
bolero-MURAKAMI
d99a7d1436 fix: copy - support STL container 2013-01-14 01:13:48 +09:00
bolero-MURAKAMI
b51b14efa9 fix recursion depth: cstring algorithm 2013-01-13 01:16:48 +09:00
bolero-MURAKAMI
f26032dce8 fix implementation 2013-01-12 04:08:44 +09:00
bolero-MURAKAMI
84508d6a6c fix recursion depth: all algorithms 2013-01-12 03:41:13 +09:00
bolero-MURAKAMI
cb584edb3f fix recursion depth: some algorithms 2013-01-12 02:39:51 +09:00
bolero-MURAKAMI
830fc27394 add test: some algorithms 2013-01-11 03:17:06 +09:00
bolero-MURAKAMI
e2b207d3be fix recursion depth: some algorithms 2013-01-11 02:55:19 +09:00
bolero-MURAKAMI
bb59363682 fix algorithm 2013-01-03 17:38:45 +09:00
bolero-MURAKAMI
5019f6aa96 fix recursion depth O(logN): some algorithms 2013-01-03 17:01:50 +09:00
bolero-MURAKAMI
e5332c18c2 add tristate_lexicographical_compare: delimiter version 2012-12-22 02:53:21 +09:00
bolero-MURAKAMI
ddac080ec0 add tristate_lexicographical_compare 2012-12-21 23:12:54 +09:00
bolero-MURAKAMI
f673db1451 fix for VC++11 2012-12-17 20:10:17 +09:00
bolero-MURAKAMI
d5c61e65ca fix recursion depth: detail::count_n, detail::count_n_if, detail::overlap_count 2012-12-17 02:14:07 +09:00
bolero-MURAKAMI
570b834367 add some algorithm test 2012-12-17 00:51:10 +09:00
bolero-MURAKAMI
bc04943aaa fix recursion depth: all_of_equal, any_of_equal, none_of_equal, one_of_equal 2012-12-17 00:36:19 +09:00
bolero-MURAKAMI
750e3b944d fix recursion depth: lexicographical_compare 2012-12-17 00:14:24 +09:00
bolero-MURAKAMI
1c085cb707 fix recursion depth: min_element, max_element, minmax_element 2012-12-16 21:46:16 +09:00
bolero-MURAKAMI
86f68671a1 fix recursion depth: is_heap, is_heap_until 2012-12-16 18:20:24 +09:00
bolero-MURAKAMI
0201107eec fix recursion depth: includes 2012-12-15 23:48:52 +09:00
bolero-MURAKAMI
eea1c2bbc1 fix rexursion depth: is_pertitioned, partition_point, is_sorted, is_sorted_until 2012-12-15 17:41:20 +09:00
bolero-MURAKAMI
d6914ddd72 fix implementation: search_n 2012-12-13 18:08:59 +09:00
bolero-MURAKAMI
9b0d1a7933 fix recursion depth: find_end 2012-12-13 13:03:18 +09:00
bolero-MURAKAMI
90890d2336 fix recursion depth: search 2012-12-13 12:18:19 +09:00
bolero-MURAKAMI
cf9f6670b6 fix next, prev 2012-12-12 17:46:36 +09:00
bolero-MURAKAMI
75228465fe fix recursion depth: count, count_if, mismatch, equal, is_permutation 2012-12-12 01:47:14 +09:00
bolero-MURAKAMI
b5bdde21c4 fix recursion depth: find_first_of, adjacent_find 2012-12-11 12:59:36 +09:00
bolero-MURAKAMI
54400ea7d0 fix recursion depth: all_of, any_of, none_of, one_of, find, find_if, find_if_not 2012-12-09 14:34:14 +09:00
bolero-MURAKAMI
e286c9bc6b add adaptors::jointed 2012-11-17 01:59:56 +09:00
bolero-MURAKAMI
87ee4f4032 deprecated old sort implementation 2012-11-14 12:17:48 +09:00