King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Code Issues Releases Wiki Activity

operation/set.hpp 追加

Browse source 
random/shuffle_order.hpp 追加
This commit is contained in:
bolero-MURAKAMI 2011-10-18 17:13:16 +09:00
parent 6e6c515704
commit 01a0ce4380
9 changed files with 356 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
sprout/operation/fit.hpp
View file

@ -21,5 +21,6 @@
#include <sprout/operation/fit/append.hpp>
#include <sprout/operation/fit/append_back.hpp>
#include <sprout/operation/fit/append_front.hpp>
#include <sprout/operation/fit/set.hpp>
#endif // #ifndef SPROUT_OPERATION_FIT_HPP

63
sprout/operation/fit/set.hpp Normal file
View file

@ -0,0 +1,63 @@
#ifndef SPROUT_OPERATION_FIT_SET_HPP
#define SPROUT_OPERATION_FIT_SET_HPP
#include <cstddef>
#include <sprout/config.hpp>
#include <sprout/fixed_container/traits.hpp>
#include <sprout/fixed_container/functions.hpp>
#include <sprout/operation/fixed/set.hpp>
#include <sprout/sub_array.hpp>
namespace sprout {
namespace fit {
namespace result_of {
//
// set
//
template<typename Container, typename T>
struct set {
public:
typedef sprout::sub_array<
typename sprout::fixed_container_traits<
typename sprout::fixed::result_of::set<Container, T>::type
>::internal_type
> type;
};
} // namespace result_of
//
// set
//
template<typename Container, typename T>
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::set<Container, T>::type set(
Container const& cont,
typename sprout::fixed_container_traits<Container>::const_iterator pos,
T const& v
)
{
return sprout::sub_copy(
sprout::get_fixed(sprout::fixed::set(cont, pos, v)),
sprout::fixed_begin_offset(cont),
sprout::fixed_end_offset(cont)
);
}
//
// set
//
template<typename Container, typename T>
SPROUT_CONSTEXPR inline typename sprout::fit::result_of::set<Container, T>::type set(
Container const& cont,
typename sprout::fixed_container_traits<Container>::difference_type pos,
T const& v
)
{
return sprout::sub_copy(
sprout::get_fixed(sprout::fixed::set(cont, pos, v)),
sprout::fixed_begin_offset(cont),
sprout::fixed_end_offset(cont)
);
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_OPERATION_FIT_SET_HPP

1
sprout/operation/fixed.hpp
View file

@ -21,5 +21,6 @@
#include <sprout/operation/fixed/append.hpp>
#include <sprout/operation/fixed/append_back.hpp>
#include <sprout/operation/fixed/append_front.hpp>
#include <sprout/operation/fixed/set.hpp>
#endif // #ifndef SPROUT_OPERATION_FIXED_HPP

2
sprout/operation/fixed/realign.hpp
View file

@ -17,7 +17,7 @@ namespace sprout {
template<typename Container>
struct realign {
public:
typedef Container type;
typedef typename sprout::fixed_container_traits<Container>::clone_type type;
};
} // namespace result_of

87
sprout/operation/fixed/set.hpp Normal file
View file

@ -0,0 +1,87 @@
#ifndef SPROUT_OPERATION_FIXED_SET_HPP
#define SPROUT_OPERATION_FIXED_SET_HPP
#include <cstddef>
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/fixed_container/traits.hpp>
#include <sprout/fixed_container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT_DETAIL
namespace sprout {
namespace fixed {
namespace result_of {
//
// set
//
template<typename Container, typename T>
struct set {
public:
typedef typename sprout::fixed_container_traits<Container>::clone_type type;
};
} // namespace result_of
namespace detail {
template<typename Result, typename Container, typename T, std::ptrdiff_t... Indexes>
SPROUT_CONSTEXPR inline Result set_impl(
Container const& cont,
sprout::index_tuple<Indexes...>,
typename sprout::fixed_container_traits<Container>::difference_type pos,
T const& v
)
{
return sprout::remake_clone<Result, Container>(
cont,
sprout::size(cont),
(Indexes != pos
? *sprout::next(sprout::fixed_begin(cont), Indexes)
: v
)...
);
}
} // namespace detail
//
// set
//
template<typename Container, typename T>
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::set<Container, T>::type set(
Container const& cont,
typename sprout::fixed_container_traits<Container>::const_iterator pos,
T const& v
)
{
return sprout::fixed::detail::set_impl<typename sprout::fixed::result_of::set<Container, T>::type>(
cont,
typename sprout::index_range<0, sprout::fixed_container_traits<typename sprout::fixed::result_of::set<Container, T>::type>::fixed_size>::type(),
NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(sprout::fixed_begin(cont), pos),
v
);
}
//
// set
//
template<typename Container, typename T>
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::set<Container, T>::type set(
Container const& cont,
typename sprout::fixed_container_traits<Container>::difference_type pos,
T const& v
)
{
return sprout::fixed::detail::set_impl<typename sprout::fixed::result_of::set<Container, T>::type>(
cont,
typename sprout::index_range<0, sprout::fixed_container_traits<typename sprout::fixed::result_of::set<Container, T>::type>::fixed_size>::type(),
NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(sprout::fixed_begin(cont), sprout::next(sprout::begin(cont), pos)),
v
);
}
} // namespace fixed
namespace result_of {
using sprout::fixed::result_of::set;
} // namespace result_of
using sprout::fixed::set;
} // namespace sprout
#endif // #ifndef SPROUT_OPERATION_FIXED_SET_HPP

8
sprout/operation/set.hpp Normal file
View file

@ -0,0 +1,8 @@
#ifndef SPROUT_OPERATION_SET_HPP
#define SPROUT_OPERATION_SET_HPP
#include <sprout/config.hpp>
#include <sprout/operation/fixed/set.hpp>
#include <sprout/operation/fit/set.hpp>
#endif // #ifndef SPROUT_OPERATION_SET_HPP

1
sprout/random.hpp
View file

@ -3,6 +3,7 @@
#include <sprout/config.hpp>
#include <sprout/random/linear_congruential.hpp>
#include <sprout/random/shuffle_order.hpp>
#include <sprout/random/mersenne_twister.hpp>
#include <sprout/random/uniform_smallint.hpp>
#include <sprout/random/uniform_int_distribution.hpp>

2
sprout/random/linear_congruential.hpp
View file

@ -95,7 +95,7 @@ namespace sprout {
)
{
IntType x;
if(lhs >> x) {
if (lhs >> x) {
if(arg_check_nothrow(x)) {
rhs.x_ = x;
} else {

193
sprout/random/shuffle_order.hpp Normal file
View file

@ -0,0 +1,193 @@
#ifndef SPROUT_RANDOM_SHUFFLE_ORDER_HPP
#define SPROUT_RANDOM_SHUFFLE_ORDER_HPP
#include <cstddef>
#include <cstdint>
#include <limits>
#include <utility>
#include <ios>
#include <istream>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/array.hpp>
#include <sprout/operation/fixed/set.hpp>
#include <sprout/random/random_result.hpp>
#include <sprout/random/linear_congruential.hpp>
#include <sprout/random/detail/signed_unsigned_tools.hpp>
namespace sprout {
namespace random {
namespace detail {
template<typename UniformRandomNumberGenerator, std::size_t k>
class shuffle_order_engine_member {
protected:
typedef UniformRandomNumberGenerator base_type;
typedef typename base_type::result_type result_type;
public:
base_type rng_;
sprout::array<result_type, k> v_;
result_type y_;
};
} // namespace detail
//
// shuffle_order_engine
//
template<typename UniformRandomNumberGenerator, std::size_t k>
class shuffle_order_engine
: private sprout::random::detail::shuffle_order_engine_member<UniformRandomNumberGenerator, k>
{
private:
typedef sprout::random::detail::shuffle_order_engine_member<UniformRandomNumberGenerator, k> member_type;
public:
typedef UniformRandomNumberGenerator base_type;
typedef typename base_type::result_type result_type;
private:
struct private_constructor_tag {};
public:
SPROUT_STATIC_CONSTEXPR std::size_t buffer_size = k;
SPROUT_STATIC_CONSTEXPR std::size_t table_size = k;
public:
static_assert(std::numeric_limits<result_type>::is_integer, "std::numeric_limits<result_type>::is_integer");
static_assert(k > 0, "k > 0");
private:
template<typename Random, typename... Args>
static SPROUT_CONSTEXPR typename std::enable_if<
sizeof...(Args) == k,
member_type
>::type init_member_1(Random const& rnd, Args const&... args) {
return member_type{
rnd.engine(),
sprout::array<result_type, k>{{args...}},
rnd.result()
};
}
template<typename Random, typename... Args>
static SPROUT_CONSTEXPR typename std::enable_if<
sizeof...(Args) < k,
member_type
>::type init_member_1(Random const& rnd, Args const&... args) {
return init_member_1(rnd(), args..., rnd.result());
}
static SPROUT_CONSTEXPR member_type init_member(base_type const& rng) {
return init_member_1(rng());
}
private:
using member_type::rng_;
using member_type::v_;
using member_type::y_;
private:
SPROUT_CONSTEXPR shuffle_order_engine(
base_type const& rng,
sprout::array<result_type, k> const& v,
result_type const& y,
private_constructor_tag
)
: member_type{rng, v, y}
{}
template<typename Random, typename BaseUnsigned>
SPROUT_CONSTEXPR sprout::random::random_result<shuffle_order_engine> generate_1(Random const& rnd, BaseUnsigned j) const {
return sprout::random::random_result<shuffle_order_engine>(
v_[j],
shuffle_order_engine(
rnd.engine(),
sprout::fixed::set(v_, j, rnd.result()),
v_[j],
private_constructor_tag()
)
);
}
template<typename BaseUnsigned>
SPROUT_CONSTEXPR sprout::random::random_result<shuffle_order_engine> generate(BaseUnsigned brange, BaseUnsigned off) const {
return generate_1(
rng_(),
k == 1 ? BaseUnsigned(0)
: brange < std::numeric_limits<BaseUnsigned>::max() / k ? BaseUnsigned(k * off / (brange + 1))
: brange < std::numeric_limits<std::uintmax_t>::max() / k ? static_cast<BaseUnsigned>(static_cast<std::uintmax_t>(off) * k / (static_cast<std::uintmax_t>(brange) + 1))
: /*static_cast<BaseUnsigned>(sprout::random::detail::muldiv(off, k, static_cast<std::uintmax_t>(brange) + 1))*/throw "Sorry, not implemented."
);
}
public:
SPROUT_CONSTEXPR shuffle_order_engine()
: member_type(init_member(base_type()))
{}
SPROUT_CONSTEXPR explicit shuffle_order_engine(result_type const& s)
: member_type(init_member(base_type(s)))
{}
SPROUT_CONSTEXPR explicit shuffle_order_engine(base_type const& rng)
: member_type(init_member(rng))
{}
SPROUT_CONSTEXPR result_type min() const {
return rng_.min();
}
SPROUT_CONSTEXPR result_type max() const {
return rng_.max();
}
SPROUT_CONSTEXPR sprout::random::random_result<shuffle_order_engine> operator()() const {
typedef typename std::make_unsigned<result_type>::type base_unsigned;
return generate(
base_unsigned(sprout::random::detail::subtract<result_type>()(max(), min())),
base_unsigned(sprout::random::detail::subtract<result_type>()(y_, min()))
);
}
friend SPROUT_CONSTEXPR bool operator==(shuffle_order_engine const& lhs, shuffle_order_engine const& rhs) {
return lhs.rng_ == rhs.rng_ && lhs.y_ == rhs.y_ && lhs.v_ == rhs.v_;
}
friend SPROUT_CONSTEXPR bool operator!=(shuffle_order_engine const& lhs, shuffle_order_engine const& rhs) {
return !(lhs == rhs);
}
template<typename Elem, typename Traits>
friend std::basic_istream<Elem, Traits>& operator>>(
std::basic_istream<Elem, Traits>& lhs,
shuffle_order_engine& rhs
)
{
using std::swap;
base_type rng;
sprout::array<result_type, k> v;
result_type y;
lhs >> rng;
for (std::size_t i = 0; i < k; ++i) {
lhs >> std::ws >> v[i];
}
lhs >> std::ws >> y;
if (lhs) {
swap(rhs.rng_, rng);
swap(rhs.v_, v);
swap(rhs.y_, y);
}
return lhs;
}
template<typename Elem, typename Traits>
friend std::basic_ostream<Elem, Traits>& operator<<(
std::basic_ostream<Elem, Traits>& lhs,
shuffle_order_engine const& rhs
)
{
lhs << rhs.rng_;
for (std::size_t i = 0; i < k; ++i) {
lhs << ' ' << rhs.v_[i];
}
lhs << ' ' << rhs.y_;
return lhs;
}
};
template<typename UniformRandomNumberGenerator, std::size_t k>
SPROUT_CONSTEXPR std::size_t sprout::random::shuffle_order_engine<UniformRandomNumberGenerator, k>::buffer_size;
template<typename UniformRandomNumberGenerator, std::size_t k>
SPROUT_CONSTEXPR std::size_t sprout::random::shuffle_order_engine<UniformRandomNumberGenerator, k>::table_size;
//
// knuth_b
//
typedef shuffle_order_engine<sprout::random::minstd_rand0, 256> knuth_b;
//
// kreutzer1986
//
typedef sprout::random::shuffle_order_engine<sprout::random::linear_congruential_engine<std::uint32_t, 1366, 150889, 714025>, 97> kreutzer1986;
} // namespace random
using sprout::random::knuth_b;
using sprout::random::kreutzer1986;
} // namespace sprout
#endif // #ifndef SPROUT_RANDOM_SHUFFLE_ORDER_HPP