[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2006-03-31 (12:42) |
From: | Christian Lindig <lindig@c...> |
Subject: | Re: [Caml-list] efficient binary relations? |
On Mar 31, 2006, at 2:21 PM, skaller wrote: > On Fri, 2006-03-31 at 13:56 +0200, Christian Lindig wrote: >> I am looking for an efficient representation of binary relations in >> OCaml. I have used bitvectors in the past but would like to use a more >> high-level and less imperative data structure. > > You have said nothing about the type of elements and their > distribution.. The typical case will be strings or other small tokens as elements but I'd like to keep this as a (functor) parameter or have a polymorphic data structure. Relations are typically sparsely populated but can be large (1000x1000). Sorry, but I don't have hard numbers. -- Christian