function LeafOp(properties) {
        if (properties)
            for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)
                if (properties[keys[i]] != null)
                    this[keys[i]] = properties[keys[i]];
    }
/**
     * Constructs a new LeafOp.
     * @exports LeafOp
     * @classdesc LeafOp represents the raw key-value data we wish to prove, and
     * must be flexible to represent the internal transformation from
     * the original key-value pairs into the basis hash, for many existing
     * merkle trees.
     * 
     * key and value are passed in. So that the signature of this operation is:
     * leafOp(key, value) -> output
     * 
     * To process this, first prehash the keys and values if needed (ANY means no hash
     * in this case): hkey = prehashKey(key) hvalue = prehashValue(value)
     * 
     * Then combine the bytes, and hash it
     * output = hash(prefix || length(hkey) || hkey || length(hvalue) || hvalue)
     * @implements ILeafOp
     * @constructor
     * @param {ILeafOp=} [properties] Properties to set
     */
Constructs a new LeafOp.
@exports LeafOp
@classdesc LeafOp represents the raw key-value data we wish to prove, and
must be flexible to represent the internal transformation from
the original key-value pairs into the basis hash, for many existing
merkle trees.

key and value are passed in. So that the signature of this operation is:
leafOp(key, value) -> output

To process this, first prehash the keys and values if needed (ANY means no hash
in this case): hkey = prehashKey(key) hvalue = prehashValue(value)


Constructs a new LeafOp . @exports LeafOp @classdesc LeafOp represents the raw key - value data we wish to prove and must be flexible to represent the internal transformation from the original key - value pairs into the basis hash for many existing merkle trees . key and value are passed in . So that the signature of this operation is : leafOp ( key value ) - > output To process this first prehash the keys and values if needed ( ANY means no hash in this case ) : hkey = prehashKey ( key ) hvalue = prehashValue ( value )
function LeafOp(properties) {
        if (properties)
            for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)
                if (properties[keys[i]] != null)
                    this[keys[i]] = properties[keys[i]];
    }
function LeafOp ( properties ) { if ( properties ) for ( var keys = Object . keys ( properties ) , i = 0 ; i < keys . length ; ++ i ) if ( properties [ keys [ i ] ] != null ) this [ keys [ i ] ] = properties [ keys [ i ] ] ; }
Constructs a new LeafOp.
Constructs a new LeafOp .