mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-11-16 10:49:05 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
843 commits 2 branches 0 tags 18 MiB
Commit graph

843 commits

This branch
This branch
All branches
Author SHA1 Message Date
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
Bolero MURAKAMI
85ac03fa5f Merge pull request #30 from kariya-mitsuru/equal_range 
[algorithm.equal_range, algorithm.lower_bound, algorithm.upper_bound]
 2013-09-01 21:46:03 -07: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
Bolero MURAKAMI
40f8fd7c0a Merge pull request #28 from kariya-mitsuru/lower_bound 
[algorithm.lower_bound] Change a bit.
 2013-08-30 16:14:23 -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
bolero-MURAKAMI
3acc1ac301 add README.rst 2013-08-29 23:21:49 +09:00
bolero-MURAKAMI
1944a437e3 fix search_one_rev 2013-08-28 21:04:03 +09:00
Bolero MURAKAMI
11b172e02d Merge pull request #27 from kariya-mitsuru/find_end 
[algorithm.find_end] Change find_end
 2013-08-28 03:16:42 -07: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
Bolero MURAKAMI
bf16786e3d Merge pull request #24 from kariya-mitsuru/mismatch 
[algorithm.mismatch] remove mismatch2_impl_ra_1
 2013-08-26 23:45:49 -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
Bolero MURAKAMI
e01c9ef98d Merge pull request #23 from kariya-mitsuru/equal 
fix sprout::equal for empty range
 2013-08-26 19:26:23 -07: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
Bolero MURAKAMI
15e0303f06 Merge pull request #22 from kariya-mitsuru/minmax 
[algorithm.minmax_element] fix minmax_element(max part) etc.
 2013-08-26 01:29:00 -07:00
Mitsuru Kariya
6833b85e2b fix minmax_element 2013-08-26 12:10:57 +09:00
Bolero MURAKAMI
1ea2ef0aaf Merge pull request #21 from kariya-mitsuru/less_equal 
[functional.less_equal] set default template parameter to void
 2013-08-25 20:01:57 -07:00
Mitsuru Kariya
e04b465be1 set default template parameter to void 2013-08-26 11:52:18 +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
117ab52460 fix string test 2013-08-17 00:10:42 +09:00
bolero-MURAKAMI
b78911e5b1 fix copyright 2013-08-15 17:36:03 +09:00
bolero-MURAKAMI
ea78afa85a fix next(): for non-LiteralType InputIterator 2013-08-14 23:24:33 +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
3800b22a22 Merge pull request #16 from rhysd/fix/gcc_version_check 
fixed checking gcc version
 2013-08-13 17:06:44 -07:00
rhysd
5160ea064d fixed checking gcc version 2013-08-14 00:49:25 +09:00
bolero-MURAKAMI
6f8213b7cc fix aligned_union_t 2013-08-13 16:28:18 +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
7c8f28115c fix string: add explicit for ctor basic_string(T const*) 2013-08-10 08:55:00 +09:00
bolero-MURAKAMI
071217f1d4 fix rational: for clang 2013-08-09 22:14:43 +09:00
bolero-MURAKAMI
c22735b212 fix warning: for clang 2013-08-09 20:04:27 +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
d663ca160b fix workaround: for nothing __DBL_DENORM_MIN__ 2013-08-08 14:11:20 +09:00
bolero-MURAKAMI
21cefe8a67 fix template-parameter name: Iterator, Range 2013-08-07 22:13:03 +09:00
bolero-MURAKAMI
ddccff51e6 fix include guard 2013-08-07 17:09:07 +09:00
bolero-MURAKAMI
c0589d9925 fix type: SPROUT_UNIQUE_SEED 2013-08-07 16:49:27 +09:00
bolero-MURAKAMI
2236d03165 fic confi/stdlib.hpp 2013-08-07 09:54:38 +09:00