![]() |
Cadabra
Computer algebra system for field theory problems
|
Public Member Functions | |
| Rules (size_t max_size_=1000, size_t cleanup_threshold_=100) | |
| void | store (Ex &rules, std::map< iterator, bool > &lhs_contains_dummies, std::map< iterator, bool > &rhs_contains_dummies) |
| bool | is_present (Ex &rules) const |
| void | retrieve (Ex &rules, std::map< iterator, bool > &lhs_contains_dummies, std::map< iterator, bool > &rhs_contains_dummies) const |
| size_t | size () const |
| void | cleanup () |
Private Attributes | |
| LRUcache< std::weak_ptr< Ex >, std::pair< std::map< iterator, bool >, std::map< iterator, bool > >, std::owner_less< std::weak_ptr< Ex > > > | properties |
| size_t | max_size |
| size_t | cleanup_threshold |
|
inline |
| void substitute::Rules::cleanup | ( | ) |
| bool substitute::Rules::is_present | ( | Ex & | rules | ) | const |
| void substitute::Rules::retrieve | ( | Ex & | rules, |
| std::map< iterator, bool > & | lhs_contains_dummies, | ||
| std::map< iterator, bool > & | rhs_contains_dummies ) const |
| size_t substitute::Rules::size | ( | ) | const |
| void substitute::Rules::store | ( | Ex & | rules, |
| std::map< iterator, bool > & | lhs_contains_dummies, | ||
| std::map< iterator, bool > & | rhs_contains_dummies ) |
|
private |
|
private |
|
mutableprivate |