path: root/tests/fstar/hashmap/Hashmap.Funs.fst

(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [hashmap]: function definitions *)
module Hashmap.Funs
open Primitives
include Hashmap.Types
include Hashmap.Clauses

#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"

(** [hashmap::hash_key]: forward function *)
let hash_key_fwd (k : usize) : result usize =
  Return k

(** [hashmap::HashMap::{0}::allocate_slots]: loop 0: forward function *)
let rec hash_map_allocate_slots_loop_fwd
  (t : Type0) (slots : vec (list_t t)) (n : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_allocate_slots_loop_decreases t slots n))
  =
  if n > 0
  then
    let* slots0 = vec_push_back (list_t t) slots ListNil in
    let* n0 = usize_sub n 1 in
    hash_map_allocate_slots_loop_fwd t slots0 n0
  else Return slots

(** [hashmap::HashMap::{0}::allocate_slots]: forward function *)
let hash_map_allocate_slots_fwd
  (t : Type0) (slots : vec (list_t t)) (n : usize) : result (vec (list_t t)) =
  hash_map_allocate_slots_loop_fwd t slots n

(** [hashmap::HashMap::{0}::new_with_capacity]: forward function *)
let hash_map_new_with_capacity_fwd
  (t : Type0) (capacity : usize) (max_load_dividend : usize)
  (max_load_divisor : usize) :
  result (hash_map_t t)
  =
  let v = vec_new (list_t t) in
  let* slots = hash_map_allocate_slots_fwd t v capacity in
  let* i = usize_mul capacity max_load_dividend in
  let* i0 = usize_div i max_load_divisor in
  Return
    {
      hash_map_num_entries = 0;
      hash_map_max_load_factor = (max_load_dividend, max_load_divisor);
      hash_map_max_load = i0;
      hash_map_slots = slots
    }

(** [hashmap::HashMap::{0}::new]: forward function *)
let hash_map_new_fwd (t : Type0) : result (hash_map_t t) =
  hash_map_new_with_capacity_fwd t 32 4 5

(** [hashmap::HashMap::{0}::clear]: loop 0: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let rec hash_map_clear_loop_fwd_back
  (t : Type0) (slots : vec (list_t t)) (i : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_clear_loop_decreases t slots i))
  =
  let i0 = vec_len (list_t t) slots in
  if i < i0
  then
    let* i1 = usize_add i 1 in
    let* slots0 = vec_index_mut_back (list_t t) slots i ListNil in
    hash_map_clear_loop_fwd_back t slots0 i1
  else Return slots

(** [hashmap::HashMap::{0}::clear]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_clear_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let* v = hash_map_clear_loop_fwd_back t self.hash_map_slots 0 in
  Return { self with hash_map_num_entries = 0; hash_map_slots = v }

(** [hashmap::HashMap::{0}::len]: forward function *)
let hash_map_len_fwd (t : Type0) (self : hash_map_t t) : result usize =
  Return self.hash_map_num_entries

(** [hashmap::HashMap::{0}::insert_in_list]: loop 0: forward function *)
let rec hash_map_insert_in_list_loop_fwd
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_insert_in_list_loop_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return false
    else hash_map_insert_in_list_loop_fwd t key value tl
  | ListNil -> Return true
  end

(** [hashmap::HashMap::{0}::insert_in_list]: forward function *)
let hash_map_insert_in_list_fwd
  (t : Type0) (key : usize) (value : t) (ls : list_t t) : result bool =
  hash_map_insert_in_list_loop_fwd t key value ls

(** [hashmap::HashMap::{0}::insert_in_list]: loop 0: backward function 0 *)
let rec hash_map_insert_in_list_loop_back
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_insert_in_list_loop_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return (ListCons ckey value tl)
    else
      let* tl0 = hash_map_insert_in_list_loop_back t key value tl in
      Return (ListCons ckey cvalue tl0)
  | ListNil -> let l = ListNil in Return (ListCons key value l)
  end

(** [hashmap::HashMap::{0}::insert_in_list]: backward function 0 *)
let hash_map_insert_in_list_back
  (t : Type0) (key : usize) (value : t) (ls : list_t t) : result (list_t t) =
  hash_map_insert_in_list_loop_back t key value ls

(** [hashmap::HashMap::{0}::insert_no_resize]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_insert_no_resize_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* inserted = hash_map_insert_in_list_fwd t key value l in
  if inserted
  then
    let* i0 = usize_add self.hash_map_num_entries 1 in
    let* l0 = hash_map_insert_in_list_back t key value l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return { self with hash_map_num_entries = i0; hash_map_slots = v }
  else
    let* l0 = hash_map_insert_in_list_back t key value l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return { self with hash_map_slots = v }

(** [core::num::u32::{8}::MAX] *)
let core_num_u32_max_body : result u32 = Return 4294967295
let core_num_u32_max_c : u32 = eval_global core_num_u32_max_body

(** [hashmap::HashMap::{0}::move_elements_from_list]: loop 0: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let rec hash_map_move_elements_from_list_loop_fwd_back
  (t : Type0) (ntable : hash_map_t t) (ls : list_t t) :
  Tot (result (hash_map_t t))
  (decreases (hash_map_move_elements_from_list_loop_decreases t ntable ls))
  =
  begin match ls with
  | ListCons k v tl ->
    let* ntable0 = hash_map_insert_no_resize_fwd_back t ntable k v in
    hash_map_move_elements_from_list_loop_fwd_back t ntable0 tl
  | ListNil -> Return ntable
  end

(** [hashmap::HashMap::{0}::move_elements_from_list]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_move_elements_from_list_fwd_back
  (t : Type0) (ntable : hash_map_t t) (ls : list_t t) : result (hash_map_t t) =
  hash_map_move_elements_from_list_loop_fwd_back t ntable ls

(** [hashmap::HashMap::{0}::move_elements]: loop 0: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let rec hash_map_move_elements_loop_fwd_back
  (t : Type0) (ntable : hash_map_t t) (slots : vec (list_t t)) (i : usize) :
  Tot (result ((hash_map_t t) & (vec (list_t t))))
  (decreases (hash_map_move_elements_loop_decreases t ntable slots i))
  =
  let i0 = vec_len (list_t t) slots in
  if i < i0
  then
    let* l = vec_index_mut_fwd (list_t t) slots i in
    let ls = mem_replace_fwd (list_t t) l ListNil in
    let* ntable0 = hash_map_move_elements_from_list_fwd_back t ntable ls in
    let* i1 = usize_add i 1 in
    let l0 = mem_replace_back (list_t t) l ListNil in
    let* slots0 = vec_index_mut_back (list_t t) slots i l0 in
    hash_map_move_elements_loop_fwd_back t ntable0 slots0 i1
  else Return (ntable, slots)

(** [hashmap::HashMap::{0}::move_elements]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_move_elements_fwd_back
  (t : Type0) (ntable : hash_map_t t) (slots : vec (list_t t)) (i : usize) :
  result ((hash_map_t t) & (vec (list_t t)))
  =
  hash_map_move_elements_loop_fwd_back t ntable slots i

(** [hashmap::HashMap::{0}::try_resize]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_try_resize_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let* max_usize = scalar_cast U32 Usize core_num_u32_max_c in
  let capacity = vec_len (list_t t) self.hash_map_slots in
  let* n1 = usize_div max_usize 2 in
  let (i, i0) = self.hash_map_max_load_factor in
  let* i1 = usize_div n1 i in
  if capacity <= i1
  then
    let* i2 = usize_mul capacity 2 in
    let* ntable = hash_map_new_with_capacity_fwd t i2 i i0 in
    let* (ntable0, _) =
      hash_map_move_elements_fwd_back t ntable self.hash_map_slots 0 in
    Return
      {
        ntable0
          with
          hash_map_num_entries = self.hash_map_num_entries;
          hash_map_max_load_factor = (i, i0)
      }
  else Return { self with hash_map_max_load_factor = (i, i0) }

(** [hashmap::HashMap::{0}::insert]: merged forward/backward function
    (there is a single backward function, and the forward function returns ()) *)
let hash_map_insert_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  let* self0 = hash_map_insert_no_resize_fwd_back t self key value in
  let* i = hash_map_len_fwd t self0 in
  if i > self0.hash_map_max_load
  then hash_map_try_resize_fwd_back t self0
  else Return self0

(** [hashmap::HashMap::{0}::contains_key_in_list]: loop 0: forward function *)
let rec hash_map_contains_key_in_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_contains_key_in_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    then Return true
    else hash_map_contains_key_in_list_loop_fwd t key tl
  | ListNil -> Return false
  end

(** [hashmap::HashMap::{0}::contains_key_in_list]: forward function *)
let hash_map_contains_key_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) : result bool =
  hash_map_contains_key_in_list_loop_fwd t key ls

(** [hashmap::HashMap::{0}::contains_key]: forward function *)
let hash_map_contains_key_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result bool =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_contains_key_in_list_fwd t key l

(** [hashmap::HashMap::{0}::get_in_list]: loop 0: forward function *)
let rec hash_map_get_in_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result t) (decreases (hash_map_get_in_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return cvalue
    else hash_map_get_in_list_loop_fwd t key tl
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_in_list]: forward function *)
let hash_map_get_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) : result t =
  hash_map_get_in_list_loop_fwd t key ls

(** [hashmap::HashMap::{0}::get]: forward function *)
let hash_map_get_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_get_in_list_fwd t key l

(** [hashmap::HashMap::{0}::get_mut_in_list]: loop 0: forward function *)
let rec hash_map_get_mut_in_list_loop_fwd
  (t : Type0) (ls : list_t t) (key : usize) :
  Tot (result t) (decreases (hash_map_get_mut_in_list_loop_decreases t ls key))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return cvalue
    else hash_map_get_mut_in_list_loop_fwd t tl key
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_mut_in_list]: forward function *)
let hash_map_get_mut_in_list_fwd
  (t : Type0) (ls : list_t t) (key : usize) : result t =
  hash_map_get_mut_in_list_loop_fwd t ls key

(** [hashmap::HashMap::{0}::get_mut_in_list]: loop 0: backward function 0 *)
let rec hash_map_get_mut_in_list_loop_back
  (t : Type0) (ls : list_t t) (key : usize) (ret : t) :
  Tot (result (list_t t))
  (decreases (hash_map_get_mut_in_list_loop_decreases t ls key))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return (ListCons ckey ret tl)
    else
      let* tl0 = hash_map_get_mut_in_list_loop_back t tl key ret in
      Return (ListCons ckey cvalue tl0)
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_mut_in_list]: backward function 0 *)
let hash_map_get_mut_in_list_back
  (t : Type0) (ls : list_t t) (key : usize) (ret : t) : result (list_t t) =
  hash_map_get_mut_in_list_loop_back t ls key ret

(** [hashmap::HashMap::{0}::get_mut]: forward function *)
let hash_map_get_mut_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_get_mut_in_list_fwd t l key

(** [hashmap::HashMap::{0}::get_mut]: backward function 0 *)
let hash_map_get_mut_back
  (t : Type0) (self : hash_map_t t) (key : usize) (ret : t) :
  result (hash_map_t t)
  =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* l0 = hash_map_get_mut_in_list_back t l key ret in
  let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
  Return { self with hash_map_slots = v }

(** [hashmap::HashMap::{0}::remove_from_list]: loop 0: forward function *)
let rec hash_map_remove_from_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (option t))
  (decreases (hash_map_remove_from_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    then
      let mv_ls = mem_replace_fwd (list_t t) (ListCons ckey x tl) ListNil in
      begin match mv_ls with
      | ListCons i cvalue tl0 -> Return (Some cvalue)
      | ListNil -> Fail Failure
      end
    else hash_map_remove_from_list_loop_fwd t key tl
  | ListNil -> Return None
  end

(** [hashmap::HashMap::{0}::remove_from_list]: forward function *)
let hash_map_remove_from_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) : result (option t) =
  hash_map_remove_from_list_loop_fwd t key ls

(** [hashmap::HashMap::{0}::remove_from_list]: loop 0: backward function 1 *)
let rec hash_map_remove_from_list_loop_back
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_remove_from_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    then
      let mv_ls = mem_replace_fwd (list_t t) (ListCons ckey x tl) ListNil in
      begin match mv_ls with
      | ListCons i cvalue tl0 -> Return tl0
      | ListNil -> Fail Failure
      end
    else
      let* tl0 = hash_map_remove_from_list_loop_back t key tl in
      Return (ListCons ckey x tl0)
  | ListNil -> Return ListNil
  end

(** [hashmap::HashMap::{0}::remove_from_list]: backward function 1 *)
let hash_map_remove_from_list_back
  (t : Type0) (key : usize) (ls : list_t t) : result (list_t t) =
  hash_map_remove_from_list_loop_back t key ls

(** [hashmap::HashMap::{0}::remove]: forward function *)
let hash_map_remove_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result (option t) =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* x = hash_map_remove_from_list_fwd t key l in
  begin match x with
  | None -> Return None
  | Some x0 ->
    let* _ = usize_sub self.hash_map_num_entries 1 in Return (Some x0)
  end

(** [hashmap::HashMap::{0}::remove]: backward function 0 *)
let hash_map_remove_back
  (t : Type0) (self : hash_map_t t) (key : usize) : result (hash_map_t t) =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* x = hash_map_remove_from_list_fwd t key l in
  begin match x with
  | None ->
    let* l0 = hash_map_remove_from_list_back t key l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return { self with hash_map_slots = v }
  | Some x0 ->
    let* i0 = usize_sub self.hash_map_num_entries 1 in
    let* l0 = hash_map_remove_from_list_back t key l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return { self with hash_map_num_entries = i0; hash_map_slots = v }
  end

(** [hashmap::test1]: forward function *)
let test1_fwd : result unit =
  let* hm = hash_map_new_fwd u64 in
  let* hm0 = hash_map_insert_fwd_back u64 hm 0 42 in
  let* hm1 = hash_map_insert_fwd_back u64 hm0 128 18 in
  let* hm2 = hash_map_insert_fwd_back u64 hm1 1024 138 in
  let* hm3 = hash_map_insert_fwd_back u64 hm2 1056 256 in
  let* i = hash_map_get_fwd u64 hm3 128 in
  if not (i = 18)
  then Fail Failure
  else
    let* hm4 = hash_map_get_mut_back u64 hm3 1024 56 in
    let* i0 = hash_map_get_fwd u64 hm4 1024 in
    if not (i0 = 56)
    then Fail Failure
    else
      let* x = hash_map_remove_fwd u64 hm4 1024 in
      begin match x with
      | None -> Fail Failure
      | Some x0 ->
        if not (x0 = 56)
        then Fail Failure
        else
          let* hm5 = hash_map_remove_back u64 hm4 1024 in
          let* i1 = hash_map_get_fwd u64 hm5 0 in
          if not (i1 = 42)
          then Fail Failure
          else
            let* i2 = hash_map_get_fwd u64 hm5 128 in
            if not (i2 = 18)
            then Fail Failure
            else
              let* i3 = hash_map_get_fwd u64 hm5 1056 in
              if not (i3 = 256) then Fail Failure else Return ()
      end

(** Unit test for [hashmap::test1] *)
let _ = assert_norm (test1_fwd = Return ())