mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-01-21 20:36:37 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix warning (for -Wextra)

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-07-22 22:00:09 +09:00
parent 49243e6c94
commit 57e35349e5
146 changed files with 459 additions and 499 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
libs/algorithm/test/clamp_range_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をクランプ (4 <= x <= 7)
{
@ -109,8 +109,8 @@ namespace testspr {
}
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をクランプ (4 <= x <= 7)
{

4
libs/algorithm/test/copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をコピー
{

4
libs/algorithm/test/copy_backward.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をコピー
{

4
libs/algorithm/test/copy_if.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// 奇数をコピー
{

4
libs/algorithm/test/copy_n.cpp
View file

@ -11,8 +11,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// 6 要素をコピー
{

4
libs/algorithm/test/copy_until.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// 6 未満をコピー
{

4
libs/algorithm/test/copy_while.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// 6 未満をコピー
{

8
libs/algorithm/test/merge.cpp
View file

@ -13,8 +13,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 4>{{3, 5, 7, 9}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 4>{{2, 4, 6, 8}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// マージ
{
@ -111,8 +111,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 4>{{3, 5, 7, 9}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 4>{{2, 4, 6, 8}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// マージ
{

4
libs/algorithm/test/partition_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をパーティション (is_odd)
{

4
libs/algorithm/test/remove_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 0, 3, 0, 5, 0, 7, 0, 9, 0}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// [2 .. 8) の範囲を削除 (0)
{

4
libs/algorithm/test/remove_copy_if.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 0, 3, 0, 5, 0, 7, 0, 9, 0}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// [2 .. 8) の範囲を削除 (is_odd)
{

4
libs/algorithm/test/replace_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 0, 3, 0, 5, 0, 7, 0, 9, 0}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を置換 (0 -> -1)
{

4
libs/algorithm/test/replace_copy_if.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 0, 3, 0, 5, 0, 7, 0, 9, 0}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を置換 (is_odd -> -1)
{

4
libs/algorithm/test/reverse_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を反転
{

4
libs/algorithm/test/rotate_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を回転
{

8
libs/algorithm/test/set_difference.cpp
View file

@ -13,8 +13,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// ˜_—<5F><E28094>·
{
@ -111,8 +111,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// ˜_—<5F><E28094>·
{

8
libs/algorithm/test/set_intersection.cpp
View file

@ -13,8 +13,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{20, 25, 30, 35, 40}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// ˜_—<5F><E28094>Ï
{
@ -111,8 +111,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{20, 25, 30, 35, 40}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// ˜_—<5F><E28094>Ï
{

8
libs/algorithm/test/set_symmetric_difference.cpp
View file

@ -13,8 +13,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// ”r‘¼“I˜_—<5F>˜a
{
@ -111,8 +111,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// ”r‘¼“I˜_—<5F>˜a
{

8
libs/algorithm/test/set_union.cpp
View file

@ -13,8 +13,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// ˜_—<5F>˜a
{
@ -111,8 +111,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 10, 15, 20, 25}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// ˜_—<5F>˜a
{

4
libs/algorithm/test/stable_partition_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をパーティション (is_odd)
{

4
libs/algorithm/test/swap_element_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲をスワップ
{

8
libs/algorithm/test/transform.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を変換
{
@ -104,8 +104,8 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
// [2 .. 8) の範囲を変換
{

8
libs/algorithm/test/unique_copy.cpp
View file

@ -12,8 +12,8 @@ namespace testspr {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 3, 3, 5, 5, 7, 7, 9, 9}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// [2 .. 8) の範囲「……ユニーク」
{
@ -97,8 +97,8 @@ namespace testspr {
}
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 3, 3, 5, 5, 7, 7, 9, 9}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{{}};
// [2 .. 8) の範囲「……ユニーク」
{

12
sprout/algorithm/fixed/clamp_range_copy.hpp
View file

@ -22,7 +22,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, typename Compare, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
clamp_range_copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator first, RandomAccessIterator, Result const& result,
typename std::iterator_traits<RandomAccessIterator>::value_type const& low,
typename std::iterator_traits<RandomAccessIterator>::value_type const& high,
Compare comp,
@ -66,11 +66,11 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
clamp_range_copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename std::iterator_traits<InputIterator>::value_type const& low,
typename std::iterator_traits<InputIterator>::value_type const& high,
Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator, Result const& result,
typename std::iterator_traits<InputIterator>::value_type const&,
typename std::iterator_traits<InputIterator>::value_type const&,
Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -20,7 +20,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator first, RandomAccessIterator, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -57,8 +57,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_impl(
InputIterator first, InputIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -20,7 +20,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
copy_backward_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator, RandomAccessIterator last, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -56,8 +56,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_backward_impl(
BidirectionalIterator first, BidirectionalIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator, BidirectionalIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -19,8 +19,8 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_if_impl(InputIterator first, InputIterator last, Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
copy_if_impl(InputIterator, InputIterator, Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -32,8 +32,8 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_n_impl(InputIterator first, Size n, Result const& result,
typename sprout::container_traits<Result>::difference_type offset,
copy_n_impl(InputIterator, Size, Result const& result,
typename sprout::container_traits<Result>::difference_type,
Args const&... args
)
{

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

@ -34,8 +34,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_until_impl(
InputIterator first, InputIterator last, Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator, Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -33,8 +33,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
copy_while_impl(
InputIterator first, InputIterator last, Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator, Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -51,7 +51,7 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Container>::type
>::type
generate_impl(
Container const& cont, Generator const& next,
Container const& cont, Generator const&,
typename sprout::container_traits<Container>::size_type size
)
{

24
sprout/algorithm/fixed/make_heap.hpp
View file

@ -75,12 +75,12 @@ namespace sprout {
template<int D, typename Container, typename Compare, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
make_heap_impl_1(
Container const& cont, Compare comp,
typename sprout::container_traits<Container>::difference_type offset,
typename sprout::container_traits<Container>::difference_type size,
typename sprout::container_traits<Container>::difference_type n,
typename sprout::container_traits<Container>::difference_type l,
typename sprout::container_traits<Container>::difference_type r
Container const&, Compare,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type
)
{
return sprout::throw_recursive_function_template_instantiation_exeeded();
@ -121,12 +121,12 @@ namespace sprout {
template<int D, typename Container, typename Compare, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK_DECL(D)>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
make_heap_impl(
Container const& cont, Compare comp,
typename sprout::container_traits<Container>::difference_type offset,
typename sprout::container_traits<Container>::difference_type size,
typename sprout::container_traits<Container>::difference_type n,
typename sprout::container_traits<Container>::difference_type l,
typename sprout::container_traits<Container>::difference_type r
Container const&, Compare,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type,
typename sprout::container_traits<Container>::difference_type
)
{
return sprout::throw_recursive_function_template_instantiation_exeeded();

8
sprout/algorithm/fixed/merge.hpp
View file

@ -21,10 +21,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
merge_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1,
InputIterator2, InputIterator2,
Result const& result, Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -19,8 +19,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
partition_copy_impl(
InputIterator first, InputIterator last, Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator, Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

14
sprout/algorithm/fixed/recurrence.hpp
View file

@ -19,7 +19,7 @@ namespace sprout {
InitSize == 0,
typename sprout::container_traits<Container>::value_type
>::type
call_gen(Generator const& gen, Args const&... args) {
call_gen(Generator const& gen, Args const&...) {
return gen();
}
template<std::size_t InitSize, typename Container, typename Generator, typename Head, typename... Args>
@ -35,14 +35,14 @@ namespace sprout {
InitSize != 0 && InitSize != sizeof...(Args) + 1,
typename sprout::container_traits<Container>::value_type
>::type
call_gen(Generator const& gen, Head const& head, Args const&... args) {
call_gen(Generator const& gen, Head const&, Args const&... args) {
return call_gen<InitSize, Container>(gen, args...);
}
template<typename Container, typename Generator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
recurrence_impl_drop(
Container const& cont, Generator const& gen,
typename sprout::container_traits<Container>::size_type size
Container const& cont, Generator const&,
typename sprout::container_traits<Container>::size_type
)
{
return sprout::detail::container_complate(cont);
@ -71,7 +71,7 @@ namespace sprout {
recurrence_impl_drop(
Container const& cont, Generator const& gen,
typename sprout::container_traits<Container>::size_type size,
Head const& head, Inits const&... inits
Head const&, Inits const&... inits
)
{
return sprout::fixed::detail::recurrence_impl_drop(cont, gen, size, inits...);
@ -82,8 +82,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Container>::type
>::type
recurrence_impl_1(
Container const& cont, Generator const& gen,
typename sprout::container_traits<Container>::size_type size,
Container const& cont, Generator const&,
typename sprout::container_traits<Container>::size_type,
Args const&... args
)
{

6
sprout/algorithm/fixed/remove_copy.hpp
View file

@ -20,9 +20,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
remove_copy_impl(
InputIterator first, InputIterator last,
Result const& result, T const& value,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, T const&,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

6
sprout/algorithm/fixed/remove_copy_if.hpp
View file

@ -20,9 +20,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
remove_copy_if_impl(
InputIterator first, InputIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -21,7 +21,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, typename T, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last,
RandomAccessIterator first, RandomAccessIterator,
Result const& result, T const& old_value, T const& new_value,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
@ -60,9 +60,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy_impl(
InputIterator first, InputIterator last,
Result const& result, T const& old_value, T const& new_value,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, T const&, T const&,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -20,7 +20,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, typename T, typename Predicate, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_if_impl_ra(
RandomAccessIterator first, RandomAccessIterator last,
RandomAccessIterator first, RandomAccessIterator,
Result const& result, Predicate pred, T const& new_value,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
@ -59,9 +59,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy_if_impl(
InputIterator first, InputIterator last,
Result const& result, Predicate pred, T const& new_value,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, Predicate, T const&,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -20,7 +20,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
reverse_copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator, RandomAccessIterator last, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -58,8 +58,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
reverse_copy_impl(
BidirectionalIterator first, BidirectionalIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator, BidirectionalIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -64,9 +64,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
rotate_copy_impl_1(
ForwardIterator first, ForwardIterator last,
ForwardIterator, ForwardIterator,
Result const& result,
typename sprout::container_traits<Result>::size_type size,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{
@ -95,10 +95,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
rotate_copy_impl(
ForwardIterator first, ForwardIterator middle,
ForwardIterator middle_first, ForwardIterator last,
ForwardIterator, ForwardIterator,
ForwardIterator, ForwardIterator,
Result const& result,
typename sprout::container_traits<Result>::size_type size,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

8
sprout/algorithm/fixed/set_difference.hpp
View file

@ -21,10 +21,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_difference_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1,
InputIterator2, InputIterator2,
Result const& result, Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

8
sprout/algorithm/fixed/set_intersection.hpp
View file

@ -21,10 +21,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_intersection_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1,
InputIterator2, InputIterator2,
Result const& result, Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

8
sprout/algorithm/fixed/set_symmetric_difference.hpp
View file

@ -21,10 +21,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_symmetric_difference_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1,
InputIterator2, InputIterator2,
Result const& result, Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

8
sprout/algorithm/fixed/set_union.hpp
View file

@ -21,10 +21,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
set_union_impl(
InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Result const& result, Compare comp,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1,
InputIterator2, InputIterator2,
Result const& result, Compare,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

14
sprout/algorithm/fixed/stable_partition_copy.hpp
View file

@ -19,9 +19,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
stable_partition_copy_impl_1(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator, BidirectionalIterator,
Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{
@ -59,10 +59,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
stable_partition_copy_impl(
BidirectionalIterator first, BidirectionalIterator last,
Result const& result, Predicate pred,
typename sprout::container_traits<Result>::size_type size,
BidirectionalIterator temp_first,
BidirectionalIterator, BidirectionalIterator,
Result const& result, Predicate,
typename sprout::container_traits<Result>::size_type,
BidirectionalIterator,
Args const&... args
)
{

14
sprout/algorithm/fixed/stable_sort.hpp
View file

@ -26,12 +26,12 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Container>::type
>::type
stable_sort_impl_synonym(
Container const& cont, Compare comp,
typename sprout::container_traits<Container>::size_type size,
typename sprout::container_traits<Container>::const_iterator first,
typename sprout::container_traits<Container>::const_iterator last,
typename sprout::container_traits<Container>::value_type const& value,
typename sprout::container_traits<Container>::size_type count,
Container const& cont, Compare,
typename sprout::container_traits<Container>::size_type,
typename sprout::container_traits<Container>::const_iterator,
typename sprout::container_traits<Container>::const_iterator,
typename sprout::container_traits<Container>::value_type const&,
typename sprout::container_traits<Container>::size_type,
Args const&... args
)
{
@ -187,7 +187,7 @@ namespace sprout {
(sprout::container_traits<Container>::static_size <= 1),
typename sprout::fixed::result_of::algorithm<Container>::type
>::type
stable_sort(Container const& cont, Compare comp) {
stable_sort(Container const& cont, Compare) {
return sprout::deep_copy(cont);
}
template<typename Container, typename Compare>

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

@ -19,7 +19,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
swap_element_copy_impl_ra(
RandomAccessIterator first, RandomAccessIterator last,
RandomAccessIterator first, RandomAccessIterator,
Result const& result,
RandomAccessIterator pos1, RandomAccessIterator pos2,
sprout::index_tuple<Indexes...>,
@ -67,10 +67,10 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
swap_element_copy_impl(
ForwardIterator first, ForwardIterator last,
ForwardIterator, ForwardIterator,
Result const& result,
ForwardIterator pos1, ForwardIterator pos2,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator, ForwardIterator,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{
@ -106,7 +106,7 @@ namespace sprout {
std::forward_iterator_tag*
)
{
return sprout::fixed::detail::swap_element_copy_impl(first, last, result, sprout::size(result));
return sprout::fixed::detail::swap_element_copy_impl(first, last, result, pos1, pos2, sprout::size(result));
}
} // namespace detail
//

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

@ -21,7 +21,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, typename UnaryOperation, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
transform_impl_ra(
RandomAccessIterator first, RandomAccessIterator last,
RandomAccessIterator first, RandomAccessIterator,
Result const& result, UnaryOperation op,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
@ -61,9 +61,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
transform_impl(
InputIterator first, InputIterator last,
Result const& result, UnaryOperation op,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, UnaryOperation,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{
@ -139,7 +139,7 @@ namespace sprout {
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Result, typename BinaryOperation, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
transform_impl_ra(
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2,
RandomAccessIterator1 first1, RandomAccessIterator1, RandomAccessIterator2 first2,
Result const& result, BinaryOperation op,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
@ -178,9 +178,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
transform_impl(
InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
Result const& result, BinaryOperation op,
typename sprout::container_traits<Result>::size_type size,
InputIterator1, InputIterator1, InputIterator2,
Result const& result, BinaryOperation,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

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

@ -19,7 +19,7 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Container>::type
>::type
unfold_impl_1(
Container const& cont, Generator const& gen, Next const& next,
Container const& cont, Generator const&, Next const& next,
typename sprout::container_traits<Container>::size_type size,
Args const&... args
)
@ -50,7 +50,7 @@ namespace sprout {
sprout::container_traits<Container>::static_size == 0,
typename sprout::fixed::result_of::algorithm<Container>::type
>::type unfold_impl(
Container const& cont, Generator const& gen, Init const& init,
Container const& cont, Generator const&, Init const&,
typename sprout::container_traits<Container>::size_type size
)
{

10
sprout/algorithm/fixed/unique_copy.hpp
View file

@ -21,9 +21,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
InputIterator first, InputIterator last,
InputIterator, InputIterator,
Result const& result,
typename sprout::container_traits<Result>::size_type size,
typename sprout::container_traits<Result>::size_type,
Head const& head,
Args const&... args
)
@ -99,9 +99,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy_impl(
InputIterator first, InputIterator last,
Result const& result, BinaryPredicate pred,
typename sprout::container_traits<Result>::size_type size,
InputIterator, InputIterator,
Result const& result, BinaryPredicate,
typename sprout::container_traits<Result>::size_type,
Head const& head,
Args const&... args
)

2
sprout/algorithm/mismatch.hpp
View file

@ -164,7 +164,7 @@ namespace sprout {
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR RandomAccessIterator1
mismatch2_impl_ra(
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2 last2, BinaryPredicate pred,
RandomAccessIterator1 first1, RandomAccessIterator1, RandomAccessIterator2 first2, RandomAccessIterator2, BinaryPredicate pred,
typename std::iterator_traits<RandomAccessIterator1>::difference_type size
)
{

67
sprout/algorithm/string/join.hpp
View file

@ -148,8 +148,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator first_cont, ContIterator last_cont,
Args const&... args
);
template<typename Result, typename ContIterator, typename... Args>
@ -157,8 +156,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator first_cont, ContIterator last_cont,
Args const&... args
);
template<typename Result, typename ContIterator, typename InputIterator, typename... Args>
@ -166,10 +164,8 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl_1(
ContIterator first_cont,
ContIterator last_cont,
InputIterator first,
InputIterator last,
ContIterator, ContIterator,
InputIterator, InputIterator,
Args const&... args
)
{
@ -180,10 +176,8 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl_1(
ContIterator first_cont,
ContIterator last_cont,
InputIterator first,
InputIterator last,
ContIterator first_cont, ContIterator last_cont,
InputIterator first, InputIterator last,
Args const&... args
)
{
@ -201,8 +195,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator, ContIterator,
Args const&... args
)
{
@ -213,8 +206,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator first_cont, ContIterator last_cont,
Args const&... args
)
{
@ -279,8 +271,7 @@ namespace sprout {
template<typename Result, typename ContIterator, typename SepIterator, typename SizeIterator, typename Sizes>
inline SPROUT_CONSTEXPR typename sprout::container_traits<Result>::value_type
join_impl_ra_2(
ContIterator first_cont,
SepIterator first,
ContIterator first_cont, SepIterator first,
SizeIterator found,
Sizes const& sizes,
sprout::index_t idx
@ -337,8 +328,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator first_cont, ContIterator last_cont,
Args const&... args
);
template<typename Result, typename ContIterator, typename... Args>
@ -346,8 +336,7 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
ContIterator first_cont, ContIterator last_cont,
Args const&... args
);
template<typename Result, typename ContIterator, typename SepIterator, typename InputIterator, typename... Args>
@ -355,13 +344,10 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl_1(
ContIterator first_cont,
ContIterator last_cont,
SepIterator sep_first,
SepIterator sep_last,
bool sep,
InputIterator first,
InputIterator last,
ContIterator, ContIterator,
SepIterator, SepIterator,
bool,
InputIterator, InputIterator,
Args const&... args
)
{
@ -372,13 +358,10 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl_1(
ContIterator first_cont,
ContIterator last_cont,
SepIterator sep_first,
SepIterator sep_last,
ContIterator first_cont, ContIterator last_cont,
SepIterator sep_first, SepIterator sep_last,
bool sep,
InputIterator first,
InputIterator last,
InputIterator first, InputIterator last,
Args const&... args
)
{
@ -410,11 +393,9 @@ namespace sprout {
sprout::container_traits<Result>::static_size == sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
SepIterator sep_first,
SepIterator sep_last,
bool sep,
ContIterator, ContIterator,
SepIterator, SepIterator,
bool,
Args const&... args
)
{
@ -425,10 +406,8 @@ namespace sprout {
sprout::container_traits<Result>::static_size != sizeof...(Args),
Result
>::type join_impl(
ContIterator first_cont,
ContIterator last_cont,
SepIterator sep_first,
SepIterator sep_last,
ContIterator first_cont, ContIterator last_cont,
SepIterator sep_first, SepIterator sep_last,
bool sep,
Args const&... args
)

10
sprout/bitset/bitset.hpp
View file

@ -149,7 +149,7 @@ namespace sprout {
template<sprout::index_t... Indexes>
SPROUT_CONSTEXPR base_bitset<N>
do_left_shift_impl_1(
std::size_t wshift, std::size_t offset,
std::size_t wshift, std::size_t,
sprout::index_tuple<Indexes...>
) const SPROUT_NOEXCEPT
{
@ -192,7 +192,7 @@ namespace sprout {
template<sprout::index_t... Indexes>
SPROUT_CONSTEXPR base_bitset<N>
do_right_shift_impl_1(
std::size_t wshift, std::size_t offset, std::size_t limit,
std::size_t wshift, std::size_t, std::size_t limit,
sprout::index_tuple<Indexes...>
) const SPROUT_NOEXCEPT
{
@ -696,7 +696,7 @@ namespace sprout {
return throw std::out_of_range("base_bitset::getword"), *new word_type();
}
SPROUT_CONSTEXPR word_type
getword(std::size_t pos) const SPROUT_NOEXCEPT {
getword(std::size_t) const SPROUT_NOEXCEPT {
return 0;
}
SPROUT_CONSTEXPR word_type
@ -854,8 +854,8 @@ namespace sprout {
}
template<typename Cont, typename... Args>
static SPROUT_CONSTEXPR copied_type remake(
Cont&& cont,
typename sprout::container_traits<sprout::detail::base_bitset<N> >::difference_type size,
Cont&&,
typename sprout::container_traits<sprout::detail::base_bitset<N> >::difference_type,
Args&&... args
)
{

20
sprout/checksum/sha1.hpp
View file

@ -76,10 +76,10 @@ namespace sprout {
}
template<int D = 16, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
SPROUT_CONSTEXPR sha1 const process(
sprout::array<std::uint32_t, 5> const& h,
sprout::array<std::uint8_t, 64> const& block,
std::size_t block_byte_index,
std::uint64_t bit_count
sprout::array<std::uint32_t, 5> const&,
sprout::array<std::uint8_t, 64> const&,
std::size_t,
std::uint64_t
) const
{
return sprout::throw_recursive_function_template_instantiation_exeeded();
@ -101,8 +101,8 @@ namespace sprout {
}
template<int D, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
SPROUT_CONSTEXPR sha1 const process_block_2(
std::uint32_t a, std::uint32_t b, std::uint32_t c, std::uint32_t d, std::uint32_t e,
std::size_t i, std::uint32_t f, std::uint32_t k
std::uint32_t, std::uint32_t, std::uint32_t, std::uint32_t, std::uint32_t,
std::size_t, std::uint32_t, std::uint32_t
) const
{
return sprout::throw_recursive_function_template_instantiation_exeeded();
@ -137,8 +137,8 @@ namespace sprout {
}
template<int D, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
SPROUT_CONSTEXPR sha1 const process_block_1(
std::uint32_t a, std::uint32_t b, std::uint32_t c, std::uint32_t d, std::uint32_t e,
std::size_t i = 0
std::uint32_t, std::uint32_t, std::uint32_t, std::uint32_t, std::uint32_t,
std::size_t
) const
{
return sprout::throw_recursive_function_template_instantiation_exeeded();
@ -170,7 +170,7 @@ namespace sprout {
}
template<int D = 16, typename Iterator, typename... Args, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
SPROUT_CONSTEXPR typename std::enable_if<sizeof...(Args) == 64, sha1 const>::type
process_block_impl(Iterator first, Iterator last, Args... args) const {
process_block_impl(Iterator, Iterator, Args...) const {
return sprout::throw_recursive_function_template_instantiation_exeeded();
}
template<int D = 16, typename Iterator, typename... Args, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_CONTINUE(D)>
@ -193,7 +193,7 @@ namespace sprout {
}
template<int D = 16, typename Iterator, typename... Args, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
SPROUT_CONSTEXPR typename std::enable_if<sizeof...(Args) != 64, sha1 const>::type
process_block_impl(Iterator first, Iterator last, Args... args) const {
process_block_impl(Iterator, Iterator, Args...) const {
return sprout::throw_recursive_function_template_instantiation_exeeded();
}
#else

4
sprout/compost/effects/chorus.hpp
View file

@ -39,13 +39,13 @@ namespace sprout {
}
template<typename Outdirected>
SPROUT_CONSTEXPR typename std::iterator_traits<Outdirected>::value_type
calc_1(Outdirected const& x, value_type const& tau, value_type const& t) const {
calc_1(Outdirected const& x, value_type const& t) const {
return calc_2(x, static_cast<typename Outdirected::index_type>(t), t - static_cast<typename Outdirected::index_type>(t));
}
template<typename Outdirected>
SPROUT_CONSTEXPR typename std::iterator_traits<Outdirected>::value_type
calc(Outdirected const& x, value_type const& tau) const {
return calc_1(x, tau, x.index() - tau);
return calc_1(x, x.index() - tau);
}
public:
SPROUT_CONSTEXPR chorus_outdirected_value(

2
sprout/compost/effects/clipped.hpp
View file

@ -68,7 +68,7 @@ namespace sprout {
}
template<typename Range>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::effects::clipped_forwarder const& rhs)
operator|(Range&& lhs, sprout::compost::effects::clipped_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::clamped(-1., 1.)

2
sprout/compost/effects/rectified.hpp
View file

@ -49,7 +49,7 @@ namespace sprout {
//
template<typename Range>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::effects::rectified_forwarder const& rhs)
operator|(Range&& lhs, sprout::compost::effects::rectified_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::transformed(sprout::compost::rectify_value<>())

4
sprout/compost/effects/vibrato.hpp
View file

@ -38,13 +38,13 @@ namespace sprout {
}
template<typename Outdirected>
SPROUT_CONSTEXPR typename std::iterator_traits<Outdirected>::value_type
calc_1(Outdirected const& x, value_type const& tau, value_type const& t) const {
calc_1(Outdirected const& x, value_type const& t) const {
return calc_2(x, static_cast<typename Outdirected::index_type>(t), t - static_cast<typename Outdirected::index_type>(t));
}
template<typename Outdirected>
SPROUT_CONSTEXPR typename std::iterator_traits<Outdirected>::value_type
calc(Outdirected const& x, value_type const& tau) const {
return calc_1(x, tau, x.index() - tau);
return calc_1(x, x.index() - tau);
}
public:
SPROUT_CONSTEXPR vibrato_outdirected_value(

2
sprout/compost/formats/as_complex.hpp
View file

@ -37,7 +37,7 @@ namespace sprout {
//
template<typename Range>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::formats::as_complex_forwarder const& rhs)
operator|(Range&& lhs, sprout::compost::formats::as_complex_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::transformed(sprout::compost::to_complex_value())

2
sprout/compost/formats/as_imag.hpp
View file

@ -38,7 +38,7 @@ namespace sprout {
//
template<typename Range>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::formats::as_imag_forwarder const& rhs)
operator|(Range&& lhs, sprout::compost::formats::as_imag_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::transformed(sprout::compost::to_imag_value())

2
sprout/compost/formats/as_pcm_wave.hpp
View file

@ -72,7 +72,7 @@ namespace sprout {
//
template<typename Range, typename IntType>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::formats::as_pcm_wave_forwarder<IntType> const& rhs)
operator|(Range&& lhs, sprout::compost::formats::as_pcm_wave_forwarder<IntType> const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::transformed(sprout::compost::normalized_to_pcm_wave<IntType>())

2
sprout/compost/formats/as_real.hpp
View file

@ -38,7 +38,7 @@ namespace sprout {
//
template<typename Range>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, sprout::compost::formats::as_real_forwarder const& rhs)
operator|(Range&& lhs, sprout::compost::formats::as_real_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::transformed(sprout::compost::to_real_value())

2
sprout/compost/formats/left_channel.hpp
View file

@ -25,7 +25,7 @@ namespace sprout {
//
template<typename Range, typename T>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, left_channel_forwarder const& rhs)
operator|(Range&& lhs, left_channel_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::steps(2)

2
sprout/compost/formats/right_channel.hpp
View file

@ -25,7 +25,7 @@ namespace sprout {
//
template<typename Range, typename T>
inline SPROUT_CONSTEXPR auto
operator|(Range&& lhs, right_channel_forwarder const& rhs)
operator|(Range&& lhs, right_channel_forwarder const&)
-> decltype(
sprout::forward<Range>(lhs)
| sprout::adaptors::steps(2, 1)

36
sprout/compost/utility/iir_filter.hpp
View file

@ -30,7 +30,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_lpf_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_lpf_impl_2(T const&, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -82,7 +82,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_hpf_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_hpf_impl_2(T const&, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -134,7 +134,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_bpf_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_bpf_impl_2(T const&, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -152,9 +152,9 @@ namespace sprout {
}
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_bpf_impl_1(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2) {
iir_bpf_impl_1(T const& fc1, A const& a, B const& b, T const& x, T const& x2) {
return sprout::compost::detail::iir_bpf_impl_2<Result>(
fc, q, a, b,
fc1, a, b,
x, x2, 1 + x + x2
);
}
@ -162,7 +162,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR Result
iir_bpf_impl(T const& fc1, T const& fc2, A const& a, B const& b) {
return sprout::compost::detail::iir_bpf_impl_1<Result>(
fc1, fc2, a, b,
fc1, a, b,
sprout::math::two_pi<T>() * (fc2 - fc1),
sprout::math::four_pi<T>() * fc1 * fc2
);
@ -190,7 +190,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_bef_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_bef_impl_2(T const&, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -208,9 +208,9 @@ namespace sprout {
}
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_bef_impl_1(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2) {
iir_bef_impl_1(T const& fc1, A const& a, B const& b, T const& x, T const& x2) {
return sprout::compost::detail::iir_bef_impl_2<Result>(
fc, q, a, b,
fc1, a, b,
x, x2, 1 + x + x2
);
}
@ -218,7 +218,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR Result
iir_bef_impl(T const& fc1, T const& fc2, A const& a, B const& b) {
return sprout::compost::detail::iir_bef_impl_1<Result>(
fc1, fc2, a, b,
fc1, a, b,
sprout::math::two_pi<T>() * (fc2 - fc1),
sprout::math::four_pi<T>() * fc1 * fc2
);
@ -246,7 +246,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_resonator_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_resonator_impl_2(T const&, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -298,7 +298,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_notch_impl_2(T const& fc, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_notch_impl_2(T const&, T const& q, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -350,7 +350,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_low_shelving_impl_2(T const& fc, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y, T const& g_) {
iir_low_shelving_impl_2(T const&, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y, T const& g_) {
return Result(
sprout::remake<A>(
a, 3,
@ -379,7 +379,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR Result
iir_low_shelving_impl(T const& fc, T const& q, T const& g, A const& a, B const& b) {
return sprout::compost::detail::iir_low_shelving_impl_1<Result>(
fc, q, a, b,
fc, q, g, a, b,
sprout::math::two_pi<T>() * fc
);
}
@ -406,7 +406,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_high_shelving_impl_2(T const& fc, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y, T const& g_) {
iir_high_shelving_impl_2(T const&, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y, T const& g_) {
return Result(
sprout::remake<A>(
a, 3,
@ -435,7 +435,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR Result
iir_high_shelving_impl(T const& fc, T const& q, T const& g, A const& a, B const& b) {
return sprout::compost::detail::iir_high_shelving_impl_1<Result>(
fc, q, a, b,
fc, q, g, a, b,
sprout::math::two_pi<T>() * fc
);
}
@ -462,7 +462,7 @@ namespace sprout {
namespace detail {
template<typename Result, typename T, typename A, typename B>
inline SPROUT_CONSTEXPR Result
iir_peaking_impl_2(T const& fc, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y) {
iir_peaking_impl_2(T const&, T const& q, T const& g, A const& a, B const& b, T const& x, T const& x2, T const& y) {
return Result(
sprout::remake<A>(
a, 3,
@ -490,7 +490,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR Result
iir_peaking_impl(T const& fc, T const& q, T const& g, A const& a, B const& b) {
return sprout::compost::detail::iir_peaking_impl_1<Result>(
fc, q, a, b,
fc, q, g, a, b,
sprout::math::two_pi<T>() * fc
);
}

4
sprout/compressed_pair.hpp
View file

@ -213,7 +213,7 @@ namespace sprout {
SPROUT_CONSTEXPR second_const_reference second() const {
return *this;
}
void swap(compressed_pair_impl& other) {}
void swap(compressed_pair_impl&) {}
};
template<typename T1, typename T2>
class compressed_pair_impl<T1, T2, 4>
@ -252,7 +252,7 @@ namespace sprout {
SPROUT_CONSTEXPR second_const_reference second() const {
return second_;
}
void swap(compressed_pair_impl& other) {}
void swap(compressed_pair_impl&) {}
};
template<typename T1, typename T2>
class compressed_pair_impl<T1, T2, 5>

6
sprout/container/container_construct_traits.hpp
View file

@ -47,7 +47,7 @@ namespace sprout {
sprout::is_fixed_container<Container>::value,
typename sprout::container_construct_traits<Container>::copied_type
>::type
default_remake_container(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, Args&&... args) {
default_remake_container(Cont&&, typename sprout::container_traits<Container>::difference_type, Args&&... args) {
return sprout::container_construct_traits<Container>::make(sprout::forward<Args>(args)...);
}
template<typename Container, typename Cont, typename... Args>
@ -57,7 +57,7 @@ namespace sprout {
,
typename sprout::container_construct_traits<Container>::copied_type
>::type
default_remake_container(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, Args&&... args) {
default_remake_container(Cont&&, typename sprout::container_traits<Container>::difference_type, Args&&... args) {
return sprout::container_construct_traits<Container>::make(sprout::forward<Args>(args)...);
}
template<typename Container, typename Cont, typename InputIterator>
@ -65,7 +65,7 @@ namespace sprout {
!sprout::is_fixed_container<Container>::value,
typename sprout::container_construct_traits<Container>::copied_type
>::type
default_remake_container(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, InputIterator first, InputIterator last) {
default_remake_container(Cont&& cont, typename sprout::container_traits<Container>::difference_type, InputIterator first, InputIterator last) {
typedef typename sprout::container_construct_traits<Container>::copied_type copied_type;
return copied_type(
sprout::make_remake_iterator(

8
sprout/cstdlib/str_to_float.hpp
View file

@ -45,8 +45,7 @@ namespace sprout {
FloatType number = FloatType(),
std::size_t num_digits = 0,
std::size_t num_decimals = 0,
long exponent = 0,
long n = 0
long exponent = 0
)
{
return exponent >= std::numeric_limits<FloatType>::min_exponent
@ -91,8 +90,7 @@ namespace sprout {
number,
num_digits,
num_decimals,
negative ? exponent + n : exponent - n,
n
negative ? exponent + n : exponent - n
)
;
}
@ -259,7 +257,7 @@ namespace sprout {
std::is_floating_point<FloatType>::value,
FloatType
>::type
str_to_float(Char const* str, std::nullptr_t endptr) {
str_to_float(Char const* str, std::nullptr_t) {
return sprout::detail::str_to_float<FloatType>(str);
}

2
sprout/cstdlib/str_to_int.hpp
View file

@ -129,7 +129,7 @@ namespace sprout {
std::is_integral<IntType>::value,
IntType
>::type
str_to_int(Char const* str, std::nullptr_t endptr, int base = 10) {
str_to_int(Char const* str, std::nullptr_t, int base = 10) {
return sprout::detail::str_to_int<IntType>(str, base);
}

2
sprout/cstdlib/strtod.hpp
View file

@ -16,7 +16,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR double
strtod(Char const* str, std::nullptr_t endptr) {
strtod(Char const* str, std::nullptr_t) {
return sprout::str_to_float<double>(str);
}
template<typename Char>

2
sprout/cstdlib/strtof.hpp
View file

@ -16,7 +16,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR float
strtof(Char const* str, std::nullptr_t endptr) {
strtof(Char const* str, std::nullptr_t) {
return sprout::str_to_float<float>(str);
}
template<typename Char>

2
sprout/cstdlib/strtol.hpp
View file

@ -20,7 +20,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR long
strtol(Char const* str, std::nullptr_t endptr, int base = 10) {
strtol(Char const* str, std::nullptr_t, int base = 10) {
return sprout::str_to_int<long>(str, base);
}
template<typename Char>

2
sprout/cstdlib/strtold.hpp
View file

@ -16,7 +16,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR long double
strtold(Char const* str, std::nullptr_t endptr) {
strtold(Char const* str, std::nullptr_t) {
return sprout::str_to_float<long double>(str);
}
template<typename Char>

2
sprout/cstdlib/strtoll.hpp
View file

@ -20,7 +20,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR long long
strtoll(Char const* str, std::nullptr_t endptr, int base = 10) {
strtoll(Char const* str, std::nullptr_t, int base = 10) {
return sprout::str_to_int<long long>(str, base);
}
template<typename Char>

2
sprout/cstdlib/strtoul.hpp
View file

@ -20,7 +20,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR unsigned long
strtoul(Char const* str, std::nullptr_t endptr, int base = 10) {
strtoul(Char const* str, std::nullptr_t, int base = 10) {
return sprout::str_to_int<unsigned long>(str, base);
}
template<typename Char>

2
sprout/cstdlib/strtoull.hpp
View file

@ -20,7 +20,7 @@ namespace sprout {
}
template<typename Char>
inline SPROUT_CONSTEXPR unsigned long long
strtoull(Char const* str, std::nullptr_t endptr, int base = 10) {
strtoull(Char const* str, std::nullptr_t, int base = 10) {
return sprout::str_to_int<unsigned long long>(str, base);
}
template<typename Char>

2
sprout/darkroom/objects/polygon/triangle.hpp
View file

@ -56,7 +56,7 @@ namespace sprout {
}
template<typename Ray>
SPROUT_CONSTEXPR typename intersection<Ray>::type
intersect_5(Ray const& ray, int hit_side, bool does_intersect, unit_type distance) const {
intersect_5(Ray const& ray, int /*hit_side*/, bool does_intersect, unit_type distance) const {
return typename intersection<Ray>::type(
does_intersect,
distance,

6
sprout/darkroom/objects/sphere.hpp
View file

@ -61,7 +61,7 @@ namespace sprout {
private:
template<typename Ray>
SPROUT_CONSTEXPR zwo_type
zweitens_2(Ray const& ray, unit_type const& i1, unit_type const& i2, int hit_side, bool does_intersect) const {
zweitens_2(Ray const&, unit_type const& i1, unit_type const& i2, int hit_side, bool does_intersect) const {
return zwo_type(
hit_side,
does_intersect,
@ -94,7 +94,7 @@ namespace sprout {
}
template<typename Ray>
SPROUT_CONSTEXPR drei_type
drittens_1(Ray const& ray, typename sprout::darkroom::access::unit<Ray>::type point_of_intersection) const {
drittens_1(Ray const&, typename sprout::darkroom::access::unit<Ray>::type point_of_intersection) const {
return drei_type(
point_of_intersection,
sprout::darkroom::coords::normalize(
@ -115,7 +115,7 @@ namespace sprout {
}
template<typename Ray, typename Vec>
SPROUT_CONSTEXPR typename intersection<Ray>::type
intersect_6(Ray const& ray, zwo_type const& zwo, drei_type const& drei, Vec const& normal) const {
intersect_6(Ray const&, zwo_type const& zwo, drei_type const& drei, Vec const& normal) const {
return typename intersection<Ray>::type(
sprout::tuples::get<zw::does_intersect>(zwo),
sprout::tuples::get<zw::distance>(zwo),

2
sprout/darkroom/textures/texture.hpp
View file

@ -61,7 +61,7 @@ namespace sprout {
pixels_type pixels_;
public:
template<typename... Elems>
SPROUT_CONSTEXPR image_type(info_type const& info, Elems const&... elems)
SPROUT_CONSTEXPR image_type(info_type const&, Elems const&... elems)
: pixels_{{
color_type(
static_cast<color_component_type>((elems >> 16) & 0xFF) / 0xFF,

2
sprout/detail/algorithm/search_one.hpp
View file

@ -15,7 +15,7 @@ namespace sprout {
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR RandomAccessIterator1
search_one_impl_ra(
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2 last2, BinaryPredicate pred
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2, BinaryPredicate pred
)
{
return sprout::mismatch(first1, last1, first2, pred).first == last1 ? first1

2
sprout/detail/container_complate.hpp
View file

@ -33,7 +33,7 @@ namespace sprout {
>::type
container_complate_1(
Result const& result,
typename sprout::container_traits<Result>::difference_type remain,
typename sprout::container_traits<Result>::difference_type,
Args const&... args
)
{

2
sprout/detail/container_complate_backward.hpp
View file

@ -33,7 +33,7 @@ namespace sprout {
>::type
container_complate_backward_1(
Result const& result,
typename sprout::container_traits<Result>::difference_type remain,
typename sprout::container_traits<Result>::difference_type,
Args const&... args
)
{

4
sprout/detail/param_at.hpp
View file

@ -12,7 +12,7 @@ namespace sprout {
sizeof...(Values) == 0,
R
>::type
param_at(std::size_t n, T const& v, Values const&... values) {
param_at(std::size_t, T const& v, Values const&...) {
return v;
}
template<typename R, typename T, typename... Values>
@ -29,7 +29,7 @@ namespace sprout {
sizeof...(Values) == 0,
R
>::type
param_seq_at(std::size_t n, std::size_t m, T const& v, Values const&... values) {
param_seq_at(std::size_t, std::size_t m, T const& v, Values const&...) {
return v[m];
}
template<typename R, typename T, typename... Values>

4
sprout/endian_traits.hpp
View file

@ -21,7 +21,7 @@ namespace sprout {
static SPROUT_CONSTEXPR std::size_t size() {
return sizeof(type);
}
static SPROUT_CONSTEXPR unsigned char get_byte(type const& t, std::size_t i) {
static SPROUT_CONSTEXPR unsigned char get_byte(type const& t, std::size_t) {
return static_cast<unsigned char>(t);
}
};
@ -57,7 +57,7 @@ namespace sprout {
static SPROUT_CONSTEXPR std::size_t size() {
return sizeof(type);
}
static SPROUT_CONSTEXPR unsigned char get_byte(type const& t, std::size_t i) {
static SPROUT_CONSTEXPR unsigned char get_byte(type const& t, std::size_t) {
return static_cast<unsigned char>(t);
}
};

2
sprout/io.hpp
View file

@ -265,7 +265,7 @@ namespace sprout {
);
}
template<sprout::io::flags::fmtflags Flag, sprout::io::flags::fmtflags Mask>
SPROUT_CONSTEXPR format_settings flags(sprout::io::flags::field_flag<Flag, Mask> flag) const {
SPROUT_CONSTEXPR format_settings flags(sprout::io::flags::field_flag<Flag, Mask>) const {
return format_settings(
*this,
static_cast<sprout::io::flags::fmtflags>(

6
sprout/iterator/back_insert_iterator.hpp
View file

@ -111,7 +111,7 @@ namespace sprout {
private:
template<typename Cont, typename InputIterator>
static SPROUT_CONSTEXPR copied_type
remake_impl(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, InputIterator first, InputIterator last) {
remake_impl(Cont&& cont, InputIterator first, InputIterator last) {
return sprout::make<copied_type>(
sprout::make_insert_range_iterator(
sprout::internal_begin(cont), sprout::end(cont),
@ -136,8 +136,8 @@ namespace sprout {
}
template<typename Cont, typename... Args>
static SPROUT_CONSTEXPR copied_type
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, Args&&... args) {
return remake_impl(sprout::get_internal(sprout::forward<Cont>(cont)), size, sprout::forward<Args>(args)...);
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type, Args&&... args) {
return remake_impl(sprout::get_internal(sprout::forward<Cont>(cont)), sprout::forward<Args>(args)...);
}
};

6
sprout/iterator/front_insert_iterator.hpp
View file

@ -111,7 +111,7 @@ namespace sprout {
private:
template<typename Cont, typename InputIterator>
static SPROUT_CONSTEXPR copied_type
remake_impl(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, InputIterator first, InputIterator last) {
remake_impl(Cont&& cont, InputIterator first, InputIterator last) {
return sprout::make<copied_type>(
sprout::make_insert_range_iterator(
sprout::internal_begin(cont), sprout::begin(cont),
@ -136,8 +136,8 @@ namespace sprout {
}
template<typename Cont, typename... Args>
static SPROUT_CONSTEXPR copied_type
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, Args&&... args) {
return remake_impl(sprout::get_internal(sprout::forward<Cont>(cont)), size, sprout::forward<Args>(args)...);
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type, Args&&... args) {
return remake_impl(sprout::get_internal(sprout::forward<Cont>(cont)), sprout::forward<Args>(args)...);
}
};

6
sprout/iterator/insert_iterator.hpp
View file

@ -120,7 +120,7 @@ namespace sprout {
private:
template<typename Iterator, typename Cont, typename InputIterator>
static SPROUT_CONSTEXPR copied_type
remake_impl(Iterator pos, Cont&& cont, typename sprout::container_traits<Container>::difference_type size, InputIterator first, InputIterator last) {
remake_impl(Iterator pos, Cont&& cont, InputIterator first, InputIterator last) {
return sprout::make<copied_type>(
sprout::make_insert_range_iterator(
sprout::internal_begin(cont), pos,
@ -145,8 +145,8 @@ namespace sprout {
}
template<typename Cont, typename... Args>
static SPROUT_CONSTEXPR copied_type
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type size, Args&&... args) {
return remake_impl(cont.position(), sprout::get_internal(sprout::forward<Cont>(cont)), size, sprout::forward<Args>(args)...);
remake(Cont&& cont, typename sprout::container_traits<Container>::difference_type, Args&&... args) {
return remake_impl(cont.position(), sprout::get_internal(sprout::forward<Cont>(cont)), sprout::forward<Args>(args)...);
}
};

2
sprout/iterator/value_iterator.hpp
View file

@ -126,7 +126,7 @@ namespace sprout {
temp.swap(*this);
return *this;
}
SPROUT_CONSTEXPR reference operator[](difference_type n) const {
SPROUT_CONSTEXPR reference operator[](difference_type) const {
return holder_.get();
}
};

4
sprout/math/erf.hpp
View file

@ -24,7 +24,7 @@ namespace sprout {
}
template<typename T>
inline SPROUT_CONSTEXPR T
erf_impl_2_b(T x, T w, T t, int k) {
erf_impl_2_b(T x, T t, int k) {
return sprout::math::detail::erf_impl_3(
x,
T(1) - sprout::detail::pow_n(
@ -109,7 +109,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR T
erf_impl_1(T x, T w) {
return w < T(2.2) ? sprout::math::detail::erf_impl_2_a(x, w, w * w)
: w < T(6.9) ? sprout::math::detail::erf_impl_2_b(x, w, sprout::math::fractional_part(w), sprout::math::itrunc(w) - 2)
: w < T(6.9) ? sprout::math::detail::erf_impl_2_b(x, sprout::math::fractional_part(w), sprout::math::itrunc(w) - 2)
: sprout::math::detail::erf_impl_3(x, T(1))
;
}

4
sprout/math/gcd.hpp
View file

@ -50,7 +50,7 @@ namespace sprout {
}
template<int D, typename BuiltInUnsigned, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK(D)>
inline SPROUT_CONSTEXPR BuiltInUnsigned
gcd_binary_2_2(unsigned shifts, sprout::array<BuiltInUnsigned, 2> const& r, unsigned which) {
gcd_binary_2_2(unsigned, sprout::array<BuiltInUnsigned, 2> const&, unsigned) {
return sprout::throw_recursive_function_template_instantiation_exeeded();
}
template<int D, typename BuiltInUnsigned, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_CONTINUE_DECL(D)>
@ -81,7 +81,7 @@ namespace sprout {
}
template<int D, typename BuiltInUnsigned, SPROUT_RECURSIVE_FUNCTION_TEMPLATE_BREAK_DECL(D)>
inline SPROUT_CONSTEXPR BuiltInUnsigned
gcd_binary_2_1(unsigned shifts, sprout::array<BuiltInUnsigned, 2> const& r, unsigned which) {
gcd_binary_2_1(unsigned, sprout::array<BuiltInUnsigned, 2> const&, unsigned) {
return sprout::throw_recursive_function_template_instantiation_exeeded();
}
#else

16
sprout/math/lgamma.hpp
View file

@ -43,7 +43,7 @@ namespace sprout {
}
template<typename T>
inline SPROUT_CONSTEXPR T
lgamma_impl_2_c_1(T x, T w, T t, int k) {
lgamma_impl_2_c_1(T x, T t, int k) {
return sprout::math::detail::lgamma_impl_3(
x,
k == 0 ? (((((((((((
@ -81,11 +81,11 @@ namespace sprout {
template<typename T>
inline SPROUT_CONSTEXPR T
lgamma_impl_2_c(T x, T w, int k) {
return sprout::math::detail::lgamma_impl_2_c_1(x, w, w - (static_cast<T>(k) + 3.5), k);
return sprout::math::detail::lgamma_impl_2_c_1(x, w - (static_cast<T>(k) + 3.5), k);
}
template<typename T>
inline SPROUT_CONSTEXPR T
lgamma_impl_2_b_2(T x, T w, T t, int k) {
lgamma_impl_2_b_2(T x, T t, int k) {
return sprout::math::detail::lgamma_impl_3(
x,
k == 0 ? ((((((((((((
@ -134,13 +134,13 @@ namespace sprout {
}
template<typename T>
inline SPROUT_CONSTEXPR T
lgamma_impl_2_b_1(T x, T w, T t, int k) {
return sprout::math::detail::lgamma_impl_2_b_2(x, w, t - (static_cast<T>(k) - T(3.5)), k);
lgamma_impl_2_b_1(T x, T t, int k) {
return sprout::math::detail::lgamma_impl_2_b_2(x, t - (static_cast<T>(k) - T(3.5)), k);
}
template<typename T>
inline SPROUT_CONSTEXPR T
lgamma_impl_2_b(T x, T w, T t) {
return sprout::math::detail::lgamma_impl_2_b_1(x, w, t, sprout::math::itrunc(t) + 4);
lgamma_impl_2_b(T x, T t) {
return sprout::math::detail::lgamma_impl_2_b_1(x, t, sprout::math::itrunc(t) + 4);
}
template<typename T>
inline SPROUT_CONSTEXPR T
@ -166,7 +166,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR T
lgamma_impl_1(T x, T w) {
return w < T(0.5) ? sprout::math::detail::lgamma_impl_2_a(x, w, w < T(0.25) ? 0 : 1)
: w < T(3.5) ? sprout::math::detail::lgamma_impl_2_b(x, w, w - T(4.5) / (w + T(0.5)))
: w < T(3.5) ? sprout::math::detail::lgamma_impl_2_b(x, w - T(4.5) / (w + T(0.5)))
: w < T(8) ? sprout::math::detail::lgamma_impl_2_c(x, w, sprout::math::itrunc(w) - 3)
: sprout::math::detail::lgamma_impl_2_d(x, w, T(1) / w)
;

7
sprout/numeric/dft/detail/dft_element_gen.hpp
View file

@ -85,12 +85,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::iterator_traits<InputIterator>::value_type
dft_element_gen(
InputIterator first, InputIterator last,
typename std::iterator_traits<InputIterator>::value_type::value_type arg,
typename std::iterator_traits<InputIterator>::difference_type k = 0,
typename std::iterator_traits<InputIterator>::value_type value
= typename std::iterator_traits<InputIterator>::value_type(),
typename std::iterator_traits<InputIterator>::value_type::value_type theta
= typename std::iterator_traits<InputIterator>::value_type::value_type()
typename std::iterator_traits<InputIterator>::value_type::value_type arg
)
{
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;

3
sprout/numeric/dft/dft_element.hpp
View file

@ -19,8 +19,7 @@ namespace sprout {
typedef typename std::iterator_traits<InputIterator>::value_type value_type;
typedef typename value_type::value_type elem_type;
return sprout::detail::dft_element_gen(
first,
last,
first, last,
-(sprout::math::two_pi<elem_type>() * i / size)
);
}

6
sprout/numeric/dft/fixed/amplitude_spectrum.hpp
View file

@ -22,7 +22,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
amplitude_spectrum_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator first, RandomAccessIterator, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -59,8 +59,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
amplitude_spectrum_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator, ForwardIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

6
sprout/numeric/dft/fixed/dft.hpp
View file

@ -59,9 +59,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
dft_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator first_, typename sprout::container_traits<Result>::difference_type i,
ForwardIterator, ForwardIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
ForwardIterator, typename sprout::container_traits<Result>::difference_type,
Args const&... args
)
{

6
sprout/numeric/dft/fixed/idft.hpp
View file

@ -59,9 +59,9 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
idft_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator first_, typename sprout::container_traits<Result>::difference_type i,
ForwardIterator, ForwardIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
ForwardIterator, typename sprout::container_traits<Result>::difference_type,
Args const&... args
)
{

6
sprout/numeric/dft/fixed/phase_spectrum.hpp
View file

@ -22,7 +22,7 @@ namespace sprout {
template<typename RandomAccessIterator, typename Result, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
phase_spectrum_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, Result const& result,
RandomAccessIterator first, RandomAccessIterator, Result const& result,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
@ -59,8 +59,8 @@ namespace sprout {
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
phase_spectrum_impl(
ForwardIterator first, ForwardIterator last, Result const& result,
typename sprout::container_traits<Result>::size_type size,
ForwardIterator, ForwardIterator, Result const& result,
typename sprout::container_traits<Result>::size_type,
Args const&... args
)
{

3
sprout/numeric/dft/idft_element.hpp
View file

@ -19,8 +19,7 @@ namespace sprout {
typedef typename std::iterator_traits<InputIterator>::value_type value_type;
typedef typename value_type::value_type elem_type;
return sprout::detail::dft_element_gen(
first,
last,
first, last,
sprout::math::two_pi<elem_type>() * i / size
)
/ static_cast<elem_type>(size)

Some files were not shown because too many files have changed in this diff Show more