org.calrissian.mango.hash.tree

Class MerkleTree<T extends HashLeaf>

java.lang.Object

org.calrissian.mango.hash.tree.MerkleTree<T>

All Implemented Interfaces:

Serializable

public class MerkleTree<T extends HashLeaf>
extends Object
implements Serializable

A standard MerkleTree that takes a collection of @link{Hashable} objects and creates a tree, aggregating the hashes as it moves up the levels of the tree. The root (or Top Hash) represents the hashes of the entire tree.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
MerkleTree()
MerkleTree(List<T> leaves) Creates Merkle Tree with default dimension with the given leaves
MerkleTree(List<T> leaves, int dimensions) Creates Merkle Tree with specified dimension with the given leaves

Method Summary

Modifier and Type	Method and Description
List<T>	diff(MerkleTree other) Diff current tree against another using depth-first.
boolean	equals(Object o)
Integer	getDimensions()
Integer	getNumLeaves()
Node	getTopHash() Accessor for the root of the tree
int	hashCode()
String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

MerkleTree

public MerkleTree()

MerkleTree

public MerkleTree(List<T> leaves)
           throws IllegalStateException

Creates Merkle Tree with default dimension with the given leaves

Parameters:

leaves -

Throws:

IllegalStateException

MerkleTree

public MerkleTree(List<T> leaves,
                  int dimensions)
           throws IllegalStateException

Creates Merkle Tree with specified dimension with the given leaves

Parameters:

leaves -

dimensions -

Throws:

IllegalStateException

Method Detail

getTopHash

public Node getTopHash()

Accessor for the root of the tree

Returns:

getDimensions

public Integer getDimensions()

getNumLeaves

public Integer getNumLeaves()

diff

public List<T> diff(MerkleTree other)

Diff current tree against another using depth-first. The resulting list contains nodes in the current tree that differ from the other tree. As a property of successfully comparing two merkle trees, it's important that both trees have the same dimension AND number of leaves.

Parameters:

other -

Returns:

toString

public String toString()

Overrides:

toString in class Object

equals

public boolean equals(Object o)

Overrides:

equals in class Object

hashCode

public int hashCode()

Overrides:

hashCode in class Object