King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-07-02 14:04:09 +00:00
Code Issues Releases Wiki Activity

fix io fromat from int

Browse source 
add range::sinusoidal
fix algorithm random_access_iterator parformance
This commit is contained in:
bolero-MURAKAMI 2012-04-30 19:41:24 +09:00
parent 3ff16b4054
commit cb830f141d
14 changed files with 438 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

2
sprout/algorithm/fixed/copy.hpp
View file

@ -30,7 +30,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? *sprout::next(first, Indexes - offset)
? first[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

2
sprout/algorithm/fixed/copy_backward.hpp
View file

@ -31,7 +31,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes < offset && Indexes + size >= static_cast<std::size_t>(offset) && Indexes + input_size >= static_cast<std::size_t>(offset)
? *sprout::next(last, Indexes - offset)
? last[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

2
sprout/algorithm/fixed/replace_copy.hpp
View file

@ -33,7 +33,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? NS_SSCRISK_CEL_OR_SPROUT::equal_to<T>()(*sprout::next(first, Indexes - offset), old_value) ? new_value : *sprout::next(first, Indexes - offset)
? NS_SSCRISK_CEL_OR_SPROUT::equal_to<T>()(first[Indexes - offset], old_value) ? new_value : first[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

2
sprout/algorithm/fixed/replace_copy_if.hpp
View file

@ -32,7 +32,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? pred(*sprout::next(first, Indexes - offset)) ? new_value : *sprout::next(first, Indexes - offset)
? pred(first[Indexes - offset]) ? new_value : first[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

2
sprout/algorithm/fixed/reverse_copy.hpp
View file

@ -30,7 +30,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? *sprout::prev(last, 1 + Indexes - offset)
? last[-(1 + Indexes - offset)]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

4
sprout/algorithm/fixed/rotate_copy.hpp
View file

@ -32,8 +32,8 @@ namespace sprout {
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? (Indexes < offset + NS_SSCRISK_CEL_OR_SPROUT::distance(middle, last)
? *sprout::next(middle, Indexes - offset)
: *sprout::prev(sprout::next(first, Indexes - offset), NS_SSCRISK_CEL_OR_SPROUT::distance(first, middle))
? middle[Indexes - offset]
: first[(Indexes - offset) - NS_SSCRISK_CEL_OR_SPROUT::distance(first, middle)]
)
: *sprout::next(sprout::internal_begin(result), Indexes)
)...

2
sprout/algorithm/fixed/swap_element_copy.hpp
View file

@ -36,7 +36,7 @@ namespace sprout {
? *pos2
: sprout::next(first, Indexes - offset) == pos2
? *pos1
: *sprout::next(first, Indexes - offset)
: first[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);

4
sprout/algorithm/fixed/transform.hpp
View file

@ -31,7 +31,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? op(*sprout::next(first, Indexes - offset))
? op(first[Indexes - offset])
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);
@ -134,7 +134,7 @@ namespace sprout {
result,
sprout::size(result),
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? op(*sprout::next(first1, Indexes - offset), *sprout::next(first2, Indexes - offset))
? op(first1[Indexes - offset], first2[Indexes - offset])
: *sprout::next(sprout::internal_begin(result), Indexes)
)...
);