This is the complete list of members for syten::BTT::State, including all inherited members.
aIdx | syten::BTT::State | static |
aInt | syten::BTT::State | static |
allocSize() const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
anorm_node(Ptr ptr, Truncation trunc=Truncation(), DropNorm const dropN=DropNorm::Yes, DropUnmatched const dropU=DropUnmatched::Yes) | syten::BTT::State | |
bIdx | syten::BTT::State | static |
bInt | syten::BTT::State | static |
bnorm_node(Ptr ptr, Truncation trunc=Truncation(), DropNorm const dropN=DropNorm::Yes, DropUnmatched const dropU=DropUnmatched::Yes) | syten::BTT::State | |
cache(const Ptr ptr) const | syten::BTT::State | |
cache() | syten::BTT::State | |
dirs | syten::BTT::State | static |
drop_all() | syten::BTT::State | |
drop_unmatched(Ptr ptr, DropUnmatched const dropU) | syten::BTT::State | |
drop_unmatched(Ptr ptr, BinaryTree::NodeType const type, DropUnmatched const dropU) | syten::BTT::State | |
drop_unmatched() | syten::BTT::State | |
drop_unmatched_a(Ptr ptr, DropUnmatched const dropU) | syten::BTT::State | |
drop_unmatched_b(Ptr ptr, DropUnmatched const dropU) | syten::BTT::State | |
drop_unmatched_r(Ptr ptr, DropUnmatched const dropU) | syten::BTT::State | |
drop_unmatched_rec(Ptr ptr) | syten::BTT::State | |
DropNorm enum name | syten::BTT::State | |
DropUnmatched enum name | syten::BTT::State | |
first_nonfork(Ptr leaf) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
go_down(Node *ptr, Index steps) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
history | syten::BTT::State | |
last_fork(Ptr leaf) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
leaf(Index const which) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
load(Archive &ar, const unsigned int in_version) | syten::BTT::State | inline |
load_node(Archive &ar, Ptr ptr, const unsigned int v) | syten::BTT::State | inline |
maybeCache(const Ptr ptr) const | syten::BTT::State | |
maybeCache() | syten::BTT::State | |
Node typedef | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | |
normalise() | syten::BTT::State | |
operator()(std::string const &coordinate) | syten::BTT::State | |
operator()(std::string const &coordinate) const | syten::BTT::State | |
operator+=(State const &other) | syten::BTT::State | |
operator=(State const &other)=default | syten::BTT::State | |
operator=(State &&other)=default | syten::BTT::State | |
Tree< Cached< Tensor< 4 > > >::operator=(Tree const &other) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
Tree< Cached< Tensor< 4 > > >::operator=(Tree &&other) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
operator[](std::string const &coordinate) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
operator[](std::array< Index, 2 > const &coordinate) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
operator[](std::initializer_list< Index > list) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
pIdx | syten::BTT::State | static |
pInt | syten::BTT::State | static |
pleaseCache | syten::BTT::State | |
Ptr typedef | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | |
r | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | |
rIdx | syten::BTT::State | static |
rInt | syten::BTT::State | static |
rnorm(DropNorm const dropN=DropNorm::Yes, DropUnmatched const dropU=DropUnmatched::Yes) | syten::BTT::State | |
rnorm_node(Ptr ptr, Truncation trunc=Truncation(), DropNorm const dropN=DropNorm::Yes, DropUnmatched const dropU=DropUnmatched::Yes) | syten::BTT::State | |
save(Archive &ar, const unsigned int in_version) const | syten::BTT::State | inline |
save_node(Archive &ar, Ptr ptr, const unsigned int v) | syten::BTT::State | inline |
serialize(Archive &ar, unsigned int const in_version) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
setMaybeCache(bool pc) | syten::BTT::State | |
State()=default | syten::BTT::State | |
State(State const &other)=default | syten::BTT::State | |
State(State &&other)=default | syten::BTT::State | |
state_add_rec(Ptr tptr, const Ptr optr, bool cachet, bool cacheo) | syten::BTT::State | |
Tree() | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
Tree(Args... args) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
Tree(Tree &&other) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
Tree(Tree const &other) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
truncate(Truncation const &trunc=Truncation(), DropNorm const dropN=DropNorm::Yes) | syten::BTT::State | |
truncate_rec(Ptr ptr, Truncation const &trunc, DropNorm const dropN) | syten::BTT::State | |
truncateKeepNorm(Truncation const &trunc=Truncation()) | syten::BTT::State | |
truncateKN2Conv(Truncation const &trunc=Truncation()) | syten::BTT::State | |
uncache(const Ptr ptr) const | syten::BTT::State | |
uncache() | syten::BTT::State | |
uuid | syten::BTT::State | static |
Value typedef | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | |
version | syten::BTT::State | static |
visit_bottom(Func &&f, typename std::result_of< Func(Ptr)>::type initial, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom(Func &&f, typename std::result_of< Func(const Ptr)>::type initial, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom(Func &&f, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom(Func &&f, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom(Func &&f, typename std::result_of< Func(Value &)>::type initial, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom(Func &&f, typename std::result_of< Func(Value const &)>::type initial, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_bottom_rec(Func &&f, typename std::result_of< Func(PtrType)>::type initial, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
visit_bottom_rec(Func &&f, typename std::result_of< Func(ValueType &)>::type initial, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
visit_bottom_rec(Func &&f, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
visit_top(Func &&f, typename std::result_of< Func(Ptr)>::type initial, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top(Func &&f, typename std::result_of< Func(Ptr)>::type initial, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top(Func &&f, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top(Func &&f, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top(Func &&f, typename std::result_of< Func(Value &)>::type initial, IterFirst const dir=IterFirst::Left) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top(Func &&f, typename std::result_of< Func(Value const &)>::type initial, IterFirst const dir=IterFirst::Left) const | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |
visit_top_rec(Func &&f, typename std::result_of< Func(PtrType)>::type initial, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
visit_top_rec(Func &&f, typename std::result_of< Func(ValueType &)>::type initial, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
visit_top_rec(Func &&f, IterFirst const dir, PtrType ptr) | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inlinestatic |
~Tree() | syten::BinaryTree::Tree< Cached< Tensor< 4 > > > | inline |