SyTen
syten::BTT::State Member List

This is the complete list of members for syten::BTT::State, including all inherited members.

aIdxsyten::BTT::Statestatic
aIntsyten::BTT::Statestatic
allocSize() constsyten::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
bIdxsyten::BTT::Statestatic
bIntsyten::BTT::Statestatic
bnorm_node(Ptr ptr, Truncation trunc=Truncation(), DropNorm const dropN=DropNorm::Yes, DropUnmatched const dropU=DropUnmatched::Yes)syten::BTT::State
cache(const Ptr ptr) constsyten::BTT::State
cache()syten::BTT::State
dirssyten::BTT::Statestatic
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 namesyten::BTT::State
DropUnmatched enum namesyten::BTT::State
first_nonfork(Ptr leaf) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
go_down(Node *ptr, Index steps) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
historysyten::BTT::State
last_fork(Ptr leaf) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
leaf(Index const which) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
load(Archive &ar, const unsigned int in_version)syten::BTT::Stateinline
load_node(Archive &ar, Ptr ptr, const unsigned int v)syten::BTT::Stateinline
maybeCache(const Ptr ptr) constsyten::BTT::State
maybeCache()syten::BTT::State
Node typedefsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >
normalise()syten::BTT::State
operator()(std::string const &coordinate)syten::BTT::State
operator()(std::string const &coordinate) constsyten::BTT::State
operator+=(State const &other)syten::BTT::State
operator=(State const &other)=defaultsyten::BTT::State
operator=(State &&other)=defaultsyten::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) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
operator[](std::array< Index, 2 > const &coordinate) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
operator[](std::initializer_list< Index > list) constsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
pIdxsyten::BTT::Statestatic
pIntsyten::BTT::Statestatic
pleaseCachesyten::BTT::State
Ptr typedefsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >
rsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >
rIdxsyten::BTT::Statestatic
rIntsyten::BTT::Statestatic
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) constsyten::BTT::Stateinline
save_node(Archive &ar, Ptr ptr, const unsigned int v)syten::BTT::Stateinline
serialize(Archive &ar, unsigned int const in_version)syten::BinaryTree::Tree< Cached< Tensor< 4 > > >inline
setMaybeCache(bool pc)syten::BTT::State
State()=defaultsyten::BTT::State
State(State const &other)=defaultsyten::BTT::State
State(State &&other)=defaultsyten::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) constsyten::BTT::State
uncache()syten::BTT::State
uuidsyten::BTT::Statestatic
Value typedefsyten::BinaryTree::Tree< Cached< Tensor< 4 > > >
versionsyten::BTT::Statestatic
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) constsyten::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) constsyten::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) constsyten::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) constsyten::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) constsyten::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) constsyten::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