cannam@167: (*
cannam@167:  * Copyright (c) 1997-1999 Massachusetts Institute of Technology
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  *)
cannam@167: 
cannam@167: (*************************************************************
cannam@167:  *    Functional associative table
cannam@167:  *************************************************************)
cannam@167: 
cannam@167: (* 
cannam@167:  * this module implements a functional associative table.  
cannam@167:  * The table is parametrized by an equality predicate and
cannam@167:  * a hash function, with the restriction that (equal a b) ==>
cannam@167:  * hash a == hash b.
cannam@167:  * The table is purely functional and implemented using a binary
cannam@167:  * search tree (not balanced for now)
cannam@167:  *)
cannam@167: 
cannam@167: type ('a, 'b) elem = 
cannam@167:     Leaf 
cannam@167:   | Node of int * ('a, 'b) elem * ('a, 'b) elem * ('a * 'b) list
cannam@167: 
cannam@167: let empty = Leaf
cannam@167: 
cannam@167: let lookup hash equal key table =
cannam@167:   let h = hash key in
cannam@167:   let rec look = function
cannam@167:       Leaf -> None
cannam@167:     | Node (hash_key, left, right, this_list) ->
cannam@167:         if (hash_key < h) then look left
cannam@167:         else if (hash_key > h) then look right
cannam@167:         else let rec loop = function
cannam@167:             [] -> None
cannam@167:           | (a, b) :: rest -> if (equal key a) then Some b else loop rest
cannam@167:         in loop this_list
cannam@167:   in look table
cannam@167: 
cannam@167: let insert hash key value table =
cannam@167:   let h = hash key in
cannam@167:   let rec ins = function
cannam@167:       Leaf -> Node (h, Leaf, Leaf, [(key, value)])
cannam@167:     | Node (hash_key, left, right, this_list) ->
cannam@167:         if (hash_key < h) then 
cannam@167:           Node (hash_key, ins left, right, this_list)
cannam@167:         else if (hash_key > h) then 
cannam@167:           Node (hash_key, left, ins right, this_list)
cannam@167:         else 
cannam@167:           Node (hash_key, left, right, (key, value) :: this_list)
cannam@167:   in ins table