P-Index

P

parse(Node) - Method in interface kkchengaf.EnchantmentOrder.EnchantStep: This function will be called every combine (step) in anvil,
node.isItem(): boolean, whether this node represents an item,
node.getValue(): NodeValue, contains the information of this node,
node.getValue().getCost(): Integer, the enchantment cost of this node,
node.getValue().getPrior(): Integer, the prior work penalty of this node,
node.getValue().getEnchant(): HashMap Integer, Integer , the enchantments dict of this node
parseTree(ArrayList<Integer>, HashMap<Integer, Integer>) - Method in class kkchengaf.EnchantmentOrder.BinaryTree: Assign and updates NodeValues to the tree nodes
parseTree(HashMap<Integer, Integer>) - Method in class kkchengaf.EnchantmentOrder.SearchResult: Wrapper to tree.parseTree(arrayList, hashmap)
parseTreeString(HashMap<String, Integer>) - Method in class kkchengaf.EnchantmentOrder.SearchResult: String version of searchResult.parseTree,
Wrapper to tree.parseTree(arrayList, hashmap)
printResult() - Method in class kkchengaf.EnchantmentOrder.SearchResult: Override this function as you like, or just call this.traversal(f)