Crate sliding_tree

Sliding Tree

This crate is a Rust library which provides a sliding tree structure that grows from the leaves and recedes from the root. It is intended to be suitable for implementing game tree search. It uses a queue of allocation buffers under the hood to manage memory.

Dependency

[dependencies]
sliding-tree = "0.2"

Usage

An example demonstrating how to use the crate to implement Monte Carlo Tree Search for a simple game is provided in tests/mcts.rs.

Licence

This crate is licensed under the Apache License, Version 2.0 (see LICENCE-APACHE or http://www.apache.org/licenses/LICENSE-2.0) or the MIT licence (see LICENCE-MIT or http://opensource.org/licenses/MIT), at your option.

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Structs

Node

A node in the tree, containing user data and child nodes.

NodeChildrenMut

A mutable reference to the children of a node.

NodeIterMut

An iterator over a slice of mutable node references.

NodeMut

A mutable reference to a node in the tree.

SlidingBuffers

A specialised arena allocator which can recycle memory.

SlidingTree

A tree that grows from the leaves and recedes from the root.

Traits

HasChildren

A trait for types that have child nodes.

HasChildrenMut

A trait for types that have mutable child nodes.