These are from algebra.Monoid
Seems to work, but experimental and not generic yet
Bucket keys to use for quickly finding other similar items via locality sensitive hashing
Bucket keys to use for quickly finding other similar items via locality sensitive hashing
Decode two signatures into hash values, combine them somehow, and produce a new array
Decode two signatures into hash values, combine them somehow, and produce a new array
Initialize a byte array by generating hash values
Initialize a byte array by generating hash values
Useful for understanding the effects of numBands and numRows
Useful for understanding the effects of numBands and numRows
The number of bytes used for each hash in the signature
The number of bytes used for each hash in the signature
Create a signature for an arbitrary value
Create a signature for an arbitrary value
Create a signature for a single String value
Create a signature for a single String value
Create a signature for a single Long value
Create a signature for a single Long value
Maximum value the hash can take on (not 2*hashSize because of signed types)
Maximum value the hash can take on (not 2*hashSize because of signed types)
For explanation of the "bands" and "rows" see Ullman and Rajaraman
For explanation of the "bands" and "rows" see Ullman and Rajaraman
Set union
Set union
Useful for understanding the effects of numBands and numRows
Useful for understanding the effects of numBands and numRows
Esimate Jaccard similarity (size of union / size of intersection)
Esimate Jaccard similarity (size of union / size of intersection)
Returns an instance of T
calculated by summing all instances in
iter
in one pass.
Returns an instance of T
calculated by summing all instances in
iter
in one pass. Returns None
if iter
is empty, else
Some[T]
.
instances of T
to be combined
None
if iter
is empty, else an option value containing the summed T
Signature for empty set, needed to be a proper Monoid
Signature for empty set, needed to be a proper Monoid