1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-10-05 13:00:00 +00:00

fix coding styles

This commit is contained in:
bolero-MURAKAMI 2013-03-22 14:24:19 +09:00
commit e3e130f58d
80 changed files with 255 additions and 255 deletions

View file

@ -4,4 +4,4 @@
#include <sprout/math/gcd.hpp>
#include <sprout/math/lcm.hpp>
#endif // SPROUT_MATH_COMMON_FACTOR_HPP
#endif // SPROUT_MATH_COMMON_FACTOR_HPP

View file

@ -16,7 +16,7 @@ namespace sprout {
inline SPROUT_CONSTEXPR sprout::pair<T, T>
frac_int_impl(T x, T ipart) {
typedef sprout::pair<T, T> type;
return x == std::numeric_limits<T>::infinity() || x == -std::numeric_limits<T>::infinity() ? type(T(0), ipart)
return x == std::numeric_limits<T>::infinity() || x == -std::numeric_limits<T>::infinity() ? type(T(0), ipart)
: x == std::numeric_limits<T>::quiet_NaN() ? type(std::numeric_limits<T>::quiet_NaN(), ipart)
: type(x - ipart, ipart)
;

View file

@ -210,7 +210,7 @@ namespace sprout {
gcd_optimal(T const& a, T const& b) {
return sprout::math::detail::gcd_optimal_evaluator<T>().operator()(a, b);
}
} // namespace detail
} // namespace detail
//
// gcd_evaluator
@ -245,7 +245,7 @@ namespace sprout {
gcd(IntType const& a, IntType const& b) {
return sprout::math::gcd_evaluator<IntType>().operator()(a, b);
}
} // namespace math
} // namespace boost
} // namespace math
} // namespace boost
#endif // SPROUT_MATH_GCD_HPP
#endif // #ifndef SPROUT_MATH_GCD_HPP

View file

@ -69,7 +69,7 @@ namespace sprout {
lcm_optimal(T const& a, T const& b) {
return sprout::math::detail::lcm_optimal_evaluator<T>().operator()(a, b);
}
} // namespace detail
} // namespace detail
//
// lcm_evaluator
@ -104,7 +104,7 @@ namespace sprout {
lcm(IntType const& a, IntType const& b) {
return sprout::math::lcm_evaluator<IntType>().operator()(a, b);
}
} // namespace math
} // namespace boost
} // namespace math
} // namespace boost
#endif // SPROUT_MATH_LCM_HPP
#endif // #ifndef SPROUT_MATH_LCM_HPP