Sets and maps over integers implemented as Patricia trees

From: Jean-Christophe Filliatre (filliatr@csl.sri.com)
Date: Fri May 12 2000 - 19:46:06 MET DST

  • Next message: Jean-Christophe Filliatre: "Re: Suggestion: Print more error messages?"

    Hello ocamlers,

    I recently implemented sets and maps over integers as Patricia trees,
    following a paper by Chris Okasaki.
    (http://www.cs.columbia.edu/~cdo/papers.html#ml98maps)

    These are much more efficient than the standard library AVLs regarding
    accesses and merges. (Only a sequential insertion of elements is
    slower, actually.)

    The code is available here, under LGPL:

        http://www.lri.fr/~filliatr/software.en.html

    == francais ================================================================

    Je mets à disposition une implantation efficace d'ensembles et de
    dictionnaires sur le type int, réalisée à partir d'arbres de Patricia,
    selon un papier de Chris Okasaki.
    (http://www.cs.columbia.edu/~cdo/papers.html#ml98maps)

    Le code, distribué sous licence LGPL, est disponible ici:

        http://www.lri.fr/~filliatr/software.fr.html 

    -- 
Jean-Christophe Filliatre    
  Computer Science Laboratory   Phone (650) 859-5173
  SRI International             FAX   (650) 859-2844
  333 Ravenswood Ave.           email  filliatr@csl.sri.com
  Menlo Park, CA 94025, USA     web    http://www.csl.sri.com/~filliatr

    This archive was generated by hypermail 2b29 : Sat May 13 2000 - 11:40:45 MET DST