package datalog

You can search for identifiers within the package.

in-package search v0.2.0

An in-memory datalog implementation for OCaml

Install

Dune Dependency

github.com Readme Edit opam file Versions (8)

Authors

S

Simon Cruanes

Maintainers

S

simon.cruanes.2007@m4x.org

Sources

v0.6.tar.gz

md5=4a2d12d630a5edd694968675a84a3ef5

sha512=685c0e186705837cb3ac66df6e8011d9f6a9629484b3a813b767df95348d5a41f37301f3e199ed6c91a42a87d1563e8355377269176785b123eb297a5ad022d7

doc/datalog.caml_interface/Datalog_caml_interface/Logic/Index/argument-1-Data/index.html

Parameter `Index.Data`

type t

The type of the hashtable keys.

val equal : t -> t -> bool

The equality predicate used to compare keys.

val hash : t -> int

A hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include

((=), hash) for comparing objects by structure (provided objects do not contain floats)
((fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly
((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).