package merkletree

import (
	"fmt"

	"github.com/fatih/color"
)

func (mt *MerkleTree) printLevel(parent Hash, iLevel int, maxLevel int) {
	for i := 0; i < iLevel; i++ {
		fmt.Print("	")
	}
	fmt.Print("level ")
	fmt.Print(iLevel)
	fmt.Print(" - ")
	fmt.Print("'" + parent.Hex() + "' = ")
	nodeType, _, nodeBytes, err := mt.Get(parent)
	if err != nil {
		color.Red(err.Error())
	}
	var node treeNode
	if nodeType == byte(normalNodeType) {
		node = parseNodeBytes(nodeBytes)
		color.Blue("'" + node.ChildL.Hex() + "' - '" + node.ChildR.Hex() + "'")
	} else if nodeType == byte(valueNodeType) {
		color.Green("value")
	} else if nodeType == byte(finalNodeType) { //typ==FINAL_NODE
		fmt.Print("[FinalTree]:")
		color.Cyan("final tree node: " + HashBytes(nodeBytes).Hex())
		_, _, leafNodeBytes, err := mt.Get(HashBytes(nodeBytes))
		if err != nil {
			color.Red(err.Error())
		}
		for i := 0; i < iLevel; i++ {
			fmt.Print("	")
		}
		// color.Cyan("					leaf value: 0x" + hex.EncodeToString(leafNodeBytes))
		color.Cyan("					leaf value: " + string(leafNodeBytes))
	} else {
		//EMPTY_NODE
		fmt.Print("[EmptyBranch]:")
		fmt.Println(EmptyNodeValue.Bytes())
	}
	iLevel++
	if len(node.ChildR) > 0 && iLevel < maxLevel && nodeType != byte(EmptyNodeType) && nodeType != byte(finalNodeType) {
		mt.printLevel(node.ChildL, iLevel, maxLevel)
		mt.printLevel(node.ChildR, iLevel, maxLevel)
	}
}

// PrintFullMT prints the tree in the terminal, all the levels with all the nodes
func (mt *MerkleTree) PrintFullMT() {
	mt.printLevel(mt.root, 0, mt.numLevels-1)
	fmt.Print("root: ")
	color.Yellow(mt.Root().Hex())
}

// PrintLevelsMT prints the tree in the terminal until a specified depth
func (mt *MerkleTree) PrintLevelsMT(maxLevel int) {
	mt.printLevel(mt.root, 0, mt.numLevels-1-maxLevel)
	fmt.Print("root: ")
	color.Yellow(mt.Root().Hex())
}