Uses of Class
specialized_checkers.collection.CheckerTree

Packages that use CheckerTree

Package	Description
specialized_checkers.collection
util

Uses of CheckerTree in specialized_checkers.collection

Subclasses with type arguments of type CheckerTree in specialized_checkers.collection

Modifier and Type	Class	Description
class	CheckerTree<T>	A specialized checker for Tree data structures, providing a fluent API to assert various properties and invariants about a tree.

Methods in specialized_checkers.collection that return CheckerTree

Modifier and Type	Method	Description
static <T> CheckerTree<T>	CheckerTree.check(T rootValue)	Creates a CheckerTree from a root value with a default name.
static <T> CheckerTree<T>	CheckerTree.check(T rootValue, String name)	Creates a CheckerTree from a root value and assigns a custom name.
static <T> CheckerTree<T>	CheckerTree.check(T rootValue, Map<T,List<T>> childrenMap)	Creates a CheckerTree from a root value and a map of children, with a default name.
static <T> CheckerTree<T>	CheckerTree.check(T rootValue, Map<T,List<T>> childrenMap, String name)	Creates a CheckerTree from a root value and a map of children, and assigns a custom name.
static <T> CheckerTree<T>	CheckerTree.check(Tree<T> tree)	Creates a CheckerTree for the given tree with a default name.
static <T> CheckerTree<T>	CheckerTree.check(Tree<T> tree, String name)	Creates a CheckerTree for the given tree and assigns a custom name.
CheckerTree<T>	CheckerTree.inRangeDepth(int min, int max)	Checks if the tree's depth is within the specified range (inclusive).
CheckerTree<T>	CheckerTree.inRangeDiamenter(int min, int max)	Checks if the tree's diameter is within the specified range (inclusive).
CheckerTree<T>	CheckerTree.inRangeLeaves(int min, int max)	Checks if the number of leaves in the tree is within the specified range (inclusive).
CheckerTree<T>	CheckerTree.isBinaryTree()	Checks if the tree is a binary tree (each node has at most two children).
CheckerTree<T>	CheckerTree.isEmpty()	Checks if the tree is empty.
CheckerTree<T>	CheckerTree.isFull()	Checks if the tree is full (every node has 0 or 2 children).
CheckerTree<T>	CheckerTree.isSymmetric()	Checks if the tree is symmetric (mirror image around its center).
CheckerTree<T>	CheckerTree.maxDepth(int max)	Checks if the tree's depth is at most the specified maximum.
CheckerTree<T>	CheckerTree.maxDiamenter(int max)	Checks if the tree's diameter is at most the specified maximum.
CheckerTree<T>	CheckerTree.maxLeaves(int max)	Checks if the number of leaves in the tree is at most the specified maximum.
CheckerTree<T>	CheckerTree.minDepth(int min)	Checks if the tree's depth is at least the specified minimum.
CheckerTree<T>	CheckerTree.minDiamenter(int min)	Checks if the tree's diameter is at least the specified minimum.
CheckerTree<T>	CheckerTree.minLeaves(int min)	Checks if the number of leaves in the tree is at least the specified minimum.
protected CheckerTree<T>	CheckerTree.self()	Returns this instance (for fluent API).

Uses of CheckerTree in util

Methods in util that return CheckerTree

Modifier and Type	Method	Description
<T> CheckerTree<T>	Checker.isTree(T rootValue)	Creates a CheckerTree for the given root value.
<T> CheckerTree<T>	Checker.isTree(T rootValue, Map<T,List<T>> childrenMap)	Creates a CheckerTree for the given root value and children map.