, including all inherited members.
| AddGameResult(const SgUctNode &node, const SgUctNode *father, SgUctValue eval) | SgUctTree | |
| AddGameResults(const SgUctNode &node, const SgUctNode *father, SgUctValue eval, SgUctValue count) | SgUctTree | |
| AddRaveValue(const SgUctNode &node, SgUctValue value, SgUctValue weight) | SgUctTree | |
| AddVirtualLoss(const SgUctNode &node) | SgUctTree | |
| Allocator(std::size_t i) | SgUctTree | [private] |
| Allocator(std::size_t i) const | SgUctTree | [private] |
| ApplyFilter(std::size_t allocatorId, const SgUctNode &node, const std::vector< SgMove > &rootFilter) | SgUctTree | |
| CheckConsistency() const | SgUctTree | |
| Clear() | SgUctTree | |
| Contains(const SgUctNode &node) const | SgUctTree | |
| CopyPruneLowCount(SgUctTree &target, SgUctValue minCount, bool warnTruncate, double maxTime=std::numeric_limits< double >::max()) const | SgUctTree | |
| CopySubtree(SgUctTree &target, SgUctNode &targetNode, const SgUctNode &node, SgUctValue minCount, std::size_t ¤tAllocatorId, bool warnTruncate, bool &abort, SgTimer &timer, double maxTime, bool alwaysKeepProven) const | SgUctTree | [private] |
| CreateAllocators(std::size_t nuThreads) | SgUctTree | |
| CreateChildren(std::size_t allocatorId, const SgUctNode &node, const std::vector< SgUctMoveInfo > &moves) | SgUctTree | |
| DumpDebugInfo(std::ostream &out) const | SgUctTree | |
| ExtractSubtree(SgUctTree &target, const SgUctNode &node, bool warnTruncate, double maxTime=std::numeric_limits< double >::max(), SgUctValue minCount=0) const | SgUctTree | |
| HasCapacity(std::size_t allocatorId, std::size_t n) const | SgUctTree | |
| InitializeRaveValue(const SgUctNode &node, SgUctValue value, SgUctValue count) | SgUctTree | |
| InitializeValue(const SgUctNode &node, SgUctValue value, SgUctValue count) | SgUctTree | |
| m_allocators | SgUctTree | [private] |
| m_maxNodes | SgUctTree | [private] |
| m_root | SgUctTree | [private] |
| MaxNodes() const | SgUctTree | |
| MergeChildren(std::size_t allocatorId, const SgUctNode &node, const std::vector< SgUctMoveInfo > &moves, bool deleteChildTrees) | SgUctTree | |
| NuAllocators() const | SgUctTree | |
| NuNodes() const | SgUctTree | |
| NuNodes(std::size_t allocatorId) const | SgUctTree | |
| operator=(const SgUctTree &tree) | SgUctTree | [private] |
| RemoveGameResult(const SgUctNode &node, const SgUctNode *father, SgUctValue eval) | SgUctTree | |
| RemoveGameResults(const SgUctNode &node, const SgUctNode *father, SgUctValue eval, SgUctValue count) | SgUctTree | |
| RemoveRaveValue(const SgUctNode &node, SgUctValue value, SgUctValue weight) | SgUctTree | |
| RemoveVirtualLoss(const SgUctNode &node) | SgUctTree | |
| Root() const | SgUctTree | |
| SetChildren(std::size_t allocatorId, const SgUctNode &node, const vector< SgMove > &moves) | SgUctTree | |
| SetKnowledgeCount(const SgUctNode &node, SgUctValue count) | SgUctTree | |
| SetMaxNodes(std::size_t maxNodes) | SgUctTree | |
| SetPosCount(const SgUctNode &node, SgUctValue posCount) | SgUctTree | |
| SetProvenType(const SgUctNode &node, SgUctProvenType type) | SgUctTree | |
| SgUctChildIterator class | SgUctTree | [friend] |
| SgUctTree() | SgUctTree | |
| Swap(SgUctTree &tree) | SgUctTree | |
| ThrowConsistencyError(const std::string &message) const | SgUctTree | [private] |