Hunt.DocTable.HashedDocTable

A more space efficient substitute for Hunt.Index.Documents and a more flexible implementation than Hunt.Index.CompactDocuments.

DocIds are computed by a hash function, so the inverse map from URIs to DocIds is substituted by the hash function.

MurmurHash2 64-bit is used as the hash function. https://sites.google.com/site/murmurhash/

It is a fast non-cryptographic hash function with good performance and hash distribution properties. http://programmers.stackexchange.com/a/145633

Documents type

newtype Documents e

The DocTable implementation. Maps DocIds to Documents.

Constructors

Documents

A mapping from a document id to the document itself.

Fields

idToDoc :: DocMap e

Instances

Eq e => Eq (Documents e)

Show e => Show (Documents e)

(DocumentWrapper e, Binary e) => Binary (Documents e)

NFData e => NFData (Documents e)

DocumentWrapper e => DocTable (Documents e)

type DValue (Documents e) = e

type DocMap e = DocIdMap e

The table which is used to map a document to an artificial id and vice versa.

Conversion

fromMap :: (DocTable (Documents e), DocumentWrapper e) => (Document -> e) -> DocIdMap Document -> Documents e

Build a DocTable from a DocIdMap (maps DocIds to Documents)