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

porting sscrisk/CEL

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-04-01 22:15:09 +09:00
parent ad60c8c530
commit db20f64991
181 changed files with 2531 additions and 607 deletions
Download patch file Download diff file Expand all files Collapse all files

8
sprout/range/algorithm/modifying.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_RANGE_ALGORITHM_MODIFYIING_HPP
#define SPROUT_RANGE_ALGORITHM_MODIFYIING_HPP
#include <sprout/config.hpp>
#include <sprout/range/algorithm/fixed.hpp>
#include <sprout/range/algorithm/fit.hpp>
#endif // #ifndef SPROUT_RANGE_ALGORITHM_MODIFYIING_HPP

40
sprout/range/algorithm/non_modifying.hpp Normal file
View file

@ -0,0 +1,40 @@
#ifndef SPROUT_RANGE_ALGORITHM_NON_MODIFYIING_HPP
#define SPROUT_RANGE_ALGORITHM_NON_MODIFYIING_HPP
#include <sprout/config.hpp>
//#include <sprout/range/algorithm/all_of.hpp>
//#include <sprout/range/algorithm/any_of.hpp>
//#include <sprout/range/algorithm/none_of.hpp>
//#include <sprout/range/algorithm/find.hpp>
//#include <sprout/range/algorithm/find_if.hpp>
//#include <sprout/range/algorithm/find_if_not.hpp>
//#include <sprout/range/algorithm/find_end.hpp>
//#include <sprout/range/algorithm/find_first_of.hpp>
//#include <sprout/range/algorithm/adjacent_find.hpp>
//#include <sprout/range/algorithm/count.hpp>
//#include <sprout/range/algorithm/count_if.hpp>
//#include <sprout/range/algorithm/mismatch.hpp>
//#include <sprout/range/algorithm/equal.hpp>
//#include <sprout/range/algorithm/is_permutation.hpp>
//#include <sprout/range/algorithm/search.hpp>
//#include <sprout/range/algorithm/search_n.hpp>
//#include <sprout/range/algorithm/is_partitioned.hpp>
//#include <sprout/range/algorithm/partition_point.hpp>
//#include <sprout/range/algorithm/is_sorted.hpp>
//#include <sprout/range/algorithm/is_sorted_until.hpp>
//#include <sprout/range/algorithm/lower_bound.hpp>
//#include <sprout/range/algorithm/upper_bound.hpp>
//#include <sprout/range/algorithm/equal_range.hpp>
//#include <sprout/range/algorithm/binary_search.hpp>
//#include <sprout/range/algorithm/includes.hpp>
//#include <sprout/range/algorithm/is_heap.hpp>
//#include <sprout/range/algorithm/is_heap_until.hpp>
//#include <sprout/range/algorithm/min.hpp>
//#include <sprout/range/algorithm/max.hpp>
//#include <sprout/range/algorithm/minmax.hpp>
//#include <sprout/range/algorithm/min_element.hpp>
//#include <sprout/range/algorithm/max_element.hpp>
//#include <sprout/range/algorithm/minmax_element.hpp>
//#include <sprout/range/algorithm/lexicographical_compare.hpp>
#endif // #ifndef SPROUT_RANGE_ALGORITHM_NON_MODIFYIING_HPP