All Classes and Interfaces
Class
Description
The underlying tree structure of a search result,
it stores a reference to the result data after constructor,
buildTree(): Node, build the tree structure for later traversal,
parseTree(inputHashMap): Integer, assign the data to all the tree nodes,
traversal(node, callback): Boolean, post-order traversal and callback non leaf node
it stores a reference to the result data after constructor,
buildTree(): Node, build the tree structure for later traversal,
parseTree(inputHashMap): Integer, assign the data to all the tree nodes,
traversal(node, callback): Boolean, post-order traversal and callback non leaf node
static class of searching the optimal order
Utility class to:
convert enchantment id from/to String and Integer,
get the enchantment weight of a X level enchantment
convert enchantment id from/to String and Integer,
get the enchantment weight of a X level enchantment
The function that is passed to tree traversal,
invoke parse(Node) every non leaf node
invoke parse(Node) every non leaf node
Utility to load json file
Main Entry Point
The Node Class that maintains the optimal combining structure,
left, right: the items in anvil to be combined,
value: object of NodeValue that stores the information of a tree node
left, right: the items in anvil to be combined,
value: object of NodeValue that stores the information of a tree node
Class that store information of a tree node,
cost: the cost of enchantment weight,
prior: the cost of prior work penalty,
enchant: the mapping of id:lv of the enchantments of this node
cost: the cost of enchantment weight,
prior: the cost of prior work penalty,
enchant: the mapping of id:lv of the enchantments of this node
A class that store the Search Result,
Extends this class as you like
Extends this class as you like