mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-23 21:25:49 +00:00
update README
This commit is contained in:
parent
5a9b2e4f7d
commit
dacba801a6
1 changed files with 13 additions and 1 deletions
14
README
14
README
|
@ -45,7 +45,15 @@ constexpr 乱数 (Random numbers)
|
||||||
sprout/random.hpp
|
sprout/random.hpp
|
||||||
sprout/random/unique_seed.hpp
|
sprout/random/unique_seed.hpp
|
||||||
|
|
||||||
constexpr 関数オブジェクト (functors)
|
constexpr 数学関数 (Mathematical functions)
|
||||||
|
sprout/math/functions.hpp
|
||||||
|
sprout/math/common_factor.hpp
|
||||||
|
|
||||||
|
constexpr 複素数/有理数 (Complex numbers, Rational numbers)
|
||||||
|
sprout/complex.hpp
|
||||||
|
sprout/rational.hpp
|
||||||
|
|
||||||
|
constexpr 関数オブジェクト (Functors)
|
||||||
sprout/functional.hpp
|
sprout/functional.hpp
|
||||||
|
|
||||||
constexpr ハッシュ関数 (Hash functions)
|
constexpr ハッシュ関数 (Hash functions)
|
||||||
|
@ -120,6 +128,10 @@ constexpr レイトレーシング (Ray tracing)
|
||||||
(When this macro is defined, you use the CEL - ConstExpr Library as an implementation detail.)
|
(When this macro is defined, you use the CEL - ConstExpr Library as an implementation detail.)
|
||||||
https://github.com/sscrisk/CEL---ConstExpr-Library
|
https://github.com/sscrisk/CEL---ConstExpr-Library
|
||||||
|
|
||||||
|
#define SPROUT_CONFIG_DISABLE_BUILTIN_CMATH_FUNCTION
|
||||||
|
このマクロが定義されているとき、数学関数の実装にビルトイン関数を使用しない。
|
||||||
|
(When this macro is defined, does not use the built-in function to the implementation of mathematical functions.)
|
||||||
|
|
||||||
#define SPROUT_CONFIG_DISABLE_SUPPORT_TEMPORARY_CONTAINER_ITERATION
|
#define SPROUT_CONFIG_DISABLE_SUPPORT_TEMPORARY_CONTAINER_ITERATION
|
||||||
このマクロが定義されているとき、アルゴリズムへのコンテナの一時オブジェクト渡しをサポートしない。
|
このマクロが定義されているとき、アルゴリズムへのコンテナの一時オブジェクト渡しをサポートしない。
|
||||||
(When this macro is defined, does not support passing a temporary object of the container to the algorithm.)
|
(When this macro is defined, does not support passing a temporary object of the container to the algorithm.)
|
||||||
|
|
Loading…
Reference in a new issue