summaryrefslogtreecommitdiff
path: root/tests/fstar/betree_back_stateful/BetreeMain.Funs.fst
blob: 196f120c239c8002362666bafef3e3a3448fd175 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [betree_main]: function definitions *)
module BetreeMain.Funs
open Primitives
include BetreeMain.Types
include BetreeMain.FunsExternal
include BetreeMain.Clauses

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

(** [betree_main::betree::load_internal_node]:
    Source: 'src/betree.rs', lines 36:0-36:52 *)
let betree_load_internal_node
  (id : u64) (st : state) :
  result (state & (betree_List_t (u64 & betree_Message_t)))
  =
  betree_utils_load_internal_node id st

(** [betree_main::betree::store_internal_node]:
    Source: 'src/betree.rs', lines 41:0-41:60 *)
let betree_store_internal_node
  (id : u64) (content : betree_List_t (u64 & betree_Message_t)) (st : state) :
  result (state & unit)
  =
  let* (st1, _) = betree_utils_store_internal_node id content st in
  Return (st1, ())

(** [betree_main::betree::load_leaf_node]:
    Source: 'src/betree.rs', lines 46:0-46:44 *)
let betree_load_leaf_node
  (id : u64) (st : state) : result (state & (betree_List_t (u64 & u64))) =
  betree_utils_load_leaf_node id st

(** [betree_main::betree::store_leaf_node]:
    Source: 'src/betree.rs', lines 51:0-51:52 *)
let betree_store_leaf_node
  (id : u64) (content : betree_List_t (u64 & u64)) (st : state) :
  result (state & unit)
  =
  let* (st1, _) = betree_utils_store_leaf_node id content st in
  Return (st1, ())

(** [betree_main::betree::fresh_node_id]:
    Source: 'src/betree.rs', lines 55:0-55:48 *)
let betree_fresh_node_id (counter : u64) : result (u64 & u64) =
  let* counter1 = u64_add counter 1 in Return (counter, counter1)

(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::new]:
    Source: 'src/betree.rs', lines 206:4-206:20 *)
let betree_NodeIdCounter_new : result betree_NodeIdCounter_t =
  Return { next_node_id = 0 }

(** [betree_main::betree::{betree_main::betree::NodeIdCounter}::fresh_id]:
    Source: 'src/betree.rs', lines 210:4-210:36 *)
let betree_NodeIdCounter_fresh_id
  (self : betree_NodeIdCounter_t) : result (u64 & betree_NodeIdCounter_t) =
  let* i = u64_add self.next_node_id 1 in
  Return (self.next_node_id, { next_node_id = i })

(** [betree_main::betree::upsert_update]:
    Source: 'src/betree.rs', lines 234:0-234:70 *)
let betree_upsert_update
  (prev : option u64) (st : betree_UpsertFunState_t) : result u64 =
  begin match prev with
  | None ->
    begin match st with
    | Betree_UpsertFunState_Add v -> Return v
    | Betree_UpsertFunState_Sub _ -> Return 0
    end
  | Some prev1 ->
    begin match st with
    | Betree_UpsertFunState_Add v ->
      let* margin = u64_sub core_u64_max prev1 in
      if margin >= v then u64_add prev1 v else Return core_u64_max
    | Betree_UpsertFunState_Sub v ->
      if prev1 >= v then u64_sub prev1 v else Return 0
    end
  end

(** [betree_main::betree::{betree_main::betree::List<T>#1}::len]:
    Source: 'src/betree.rs', lines 276:4-276:24 *)
let rec betree_List_len
  (t : Type0) (self : betree_List_t t) :
  Tot (result u64) (decreases (betree_List_len_decreases t self))
  =
  begin match self with
  | Betree_List_Cons _ tl -> let* i = betree_List_len t tl in u64_add 1 i
  | Betree_List_Nil -> Return 0
  end

(** [betree_main::betree::{betree_main::betree::List<T>#1}::split_at]:
    Source: 'src/betree.rs', lines 284:4-284:51 *)
let rec betree_List_split_at
  (t : Type0) (self : betree_List_t t) (n : u64) :
  Tot (result ((betree_List_t t) & (betree_List_t t)))
  (decreases (betree_List_split_at_decreases t self n))
  =
  if n = 0
  then Return (Betree_List_Nil, self)
  else
    begin match self with
    | Betree_List_Cons hd tl ->
      let* i = u64_sub n 1 in
      let* p = betree_List_split_at t tl i in
      let (ls0, ls1) = p in
      Return (Betree_List_Cons hd ls0, ls1)
    | Betree_List_Nil -> Fail Failure
    end

(** [betree_main::betree::{betree_main::betree::List<T>#1}::push_front]:
    Source: 'src/betree.rs', lines 299:4-299:34 *)
let betree_List_push_front
  (t : Type0) (self : betree_List_t t) (x : t) : result (betree_List_t t) =
  let (tl, _) = core_mem_replace (betree_List_t t) self Betree_List_Nil in
  Return (Betree_List_Cons x tl)

(** [betree_main::betree::{betree_main::betree::List<T>#1}::pop_front]:
    Source: 'src/betree.rs', lines 306:4-306:32 *)
let betree_List_pop_front
  (t : Type0) (self : betree_List_t t) : result (t & (betree_List_t t)) =
  let (ls, _) = core_mem_replace (betree_List_t t) self Betree_List_Nil in
  begin match ls with
  | Betree_List_Cons x tl -> Return (x, tl)
  | Betree_List_Nil -> Fail Failure
  end

(** [betree_main::betree::{betree_main::betree::List<T>#1}::hd]:
    Source: 'src/betree.rs', lines 318:4-318:22 *)
let betree_List_hd (t : Type0) (self : betree_List_t t) : result t =
  begin match self with
  | Betree_List_Cons hd _ -> Return hd
  | Betree_List_Nil -> Fail Failure
  end

(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::head_has_key]:
    Source: 'src/betree.rs', lines 327:4-327:44 *)
let betree_ListTupleU64T_head_has_key
  (t : Type0) (self : betree_List_t (u64 & t)) (key : u64) : result bool =
  begin match self with
  | Betree_List_Cons hd _ -> let (i, _) = hd in Return (i = key)
  | Betree_List_Nil -> Return false
  end

(** [betree_main::betree::{betree_main::betree::List<(u64, T)>#2}::partition_at_pivot]:
    Source: 'src/betree.rs', lines 339:4-339:73 *)
let rec betree_ListTupleU64T_partition_at_pivot
  (t : Type0) (self : betree_List_t (u64 & t)) (pivot : u64) :
  Tot (result ((betree_List_t (u64 & t)) & (betree_List_t (u64 & t))))
  (decreases (betree_ListTupleU64T_partition_at_pivot_decreases t self pivot))
  =
  begin match self with
  | Betree_List_Cons hd tl ->
    let (i, x) = hd in
    if i >= pivot
    then Return (Betree_List_Nil, Betree_List_Cons (i, x) tl)
    else
      let* p = betree_ListTupleU64T_partition_at_pivot t tl pivot in
      let (ls0, ls1) = p in
      Return (Betree_List_Cons (i, x) ls0, ls1)
  | Betree_List_Nil -> Return (Betree_List_Nil, Betree_List_Nil)
  end

(** [betree_main::betree::{betree_main::betree::Leaf#3}::split]:
    Source: 'src/betree.rs', lines 359:4-364:17 *)
let betree_Leaf_split
  (self : betree_Leaf_t) (content : betree_List_t (u64 & u64))
  (params : betree_Params_t) (node_id_cnt : betree_NodeIdCounter_t)
  (st : state) :
  result (state & (betree_Internal_t & betree_NodeIdCounter_t))
  =
  let* p = betree_List_split_at (u64 & u64) content params.split_size in
  let (content0, content1) = p in
  let* p1 = betree_List_hd (u64 & u64) content1 in
  let (pivot, _) = p1 in
  let* (id0, nic) = betree_NodeIdCounter_fresh_id node_id_cnt in
  let* (id1, nic1) = betree_NodeIdCounter_fresh_id nic in
  let* (st1, _) = betree_store_leaf_node id0 content0 st in
  let* (st2, _) = betree_store_leaf_node id1 content1 st1 in
  let n = Betree_Node_Leaf { id = id0; size = params.split_size } in
  let n1 = Betree_Node_Leaf { id = id1; size = params.split_size } in
  Return (st2, ({ id = self.id; pivot = pivot; left = n; right = n1 }, nic1))

(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_for_key]:
    Source: 'src/betree.rs', lines 789:4-792:34 *)
let rec betree_Node_lookup_first_message_for_key
  (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
  Tot (result ((betree_List_t (u64 & betree_Message_t)) & (betree_List_t (u64 &
    betree_Message_t) -> result (betree_List_t (u64 & betree_Message_t)))))
  (decreases (betree_Node_lookup_first_message_for_key_decreases key msgs))
  =
  begin match msgs with
  | Betree_List_Cons x next_msgs ->
    let (i, m) = x in
    if i >= key
    then Return (Betree_List_Cons (i, m) next_msgs, Return)
    else
      let* (l, lookup_first_message_for_key_back) =
        betree_Node_lookup_first_message_for_key key next_msgs in
      let back_'a =
        fun ret ->
          let* next_msgs1 = lookup_first_message_for_key_back ret in
          Return (Betree_List_Cons (i, m) next_msgs1) in
      Return (l, back_'a)
  | Betree_List_Nil -> Return (Betree_List_Nil, Return)
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_in_bindings]:
    Source: 'src/betree.rs', lines 636:4-636:80 *)
let rec betree_Node_lookup_in_bindings
  (key : u64) (bindings : betree_List_t (u64 & u64)) :
  Tot (result (option u64))
  (decreases (betree_Node_lookup_in_bindings_decreases key bindings))
  =
  begin match bindings with
  | Betree_List_Cons hd tl ->
    let (i, i1) = hd in
    if i = key
    then Return (Some i1)
    else if i > key then Return None else betree_Node_lookup_in_bindings key tl
  | Betree_List_Nil -> Return None
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_upserts]:
    Source: 'src/betree.rs', lines 819:4-819:90 *)
let rec betree_Node_apply_upserts
  (msgs : betree_List_t (u64 & betree_Message_t)) (prev : option u64)
  (key : u64) (st : state) :
  Tot (result (state & (u64 & (betree_List_t (u64 & betree_Message_t)))))
  (decreases (betree_Node_apply_upserts_decreases msgs prev key st))
  =
  let* b = betree_ListTupleU64T_head_has_key betree_Message_t msgs key in
  if b
  then
    let* (msg, l) = betree_List_pop_front (u64 & betree_Message_t) msgs in
    let (_, m) = msg in
    begin match m with
    | Betree_Message_Insert _ -> Fail Failure
    | Betree_Message_Delete -> Fail Failure
    | Betree_Message_Upsert s ->
      let* v = betree_upsert_update prev s in
      betree_Node_apply_upserts l (Some v) key st
    end
  else
    let* (st1, v) = core_option_Option_unwrap u64 prev st in
    let* l =
      betree_List_push_front (u64 & betree_Message_t) msgs (key,
        Betree_Message_Insert v) in
    Return (st1, (v, l))

(** [betree_main::betree::{betree_main::betree::Internal#4}::lookup_in_children]:
    Source: 'src/betree.rs', lines 395:4-395:63 *)
let rec betree_Internal_lookup_in_children
  (self : betree_Internal_t) (key : u64) (st : state) :
  Tot (result (state & ((option u64) & betree_Internal_t)))
  (decreases (betree_Internal_lookup_in_children_decreases self key st))
  =
  if key < self.pivot
  then
    let* (st1, (o, n)) = betree_Node_lookup self.left key st in
    Return (st1, (o, { self with left = n }))
  else
    let* (st1, (o, n)) = betree_Node_lookup self.right key st in
    Return (st1, (o, { self with right = n }))

(** [betree_main::betree::{betree_main::betree::Node#5}::lookup]:
    Source: 'src/betree.rs', lines 709:4-709:58 *)
and betree_Node_lookup
  (self : betree_Node_t) (key : u64) (st : state) :
  Tot (result (state & ((option u64) & betree_Node_t)))
  (decreases (betree_Node_lookup_decreases self key st))
  =
  begin match self with
  | Betree_Node_Internal node ->
    let* (st1, msgs) = betree_load_internal_node node.id st in
    let* (pending, lookup_first_message_for_key_back) =
      betree_Node_lookup_first_message_for_key key msgs in
    begin match pending with
    | Betree_List_Cons p l ->
      let (k, msg) = p in
      if k <> key
      then
        let* (st2, (o, i)) = betree_Internal_lookup_in_children node key st1 in
        let* _ =
          lookup_first_message_for_key_back (Betree_List_Cons (k, msg) l) in
        Return (st2, (o, Betree_Node_Internal i))
      else
        begin match msg with
        | Betree_Message_Insert v ->
          let* _ =
            lookup_first_message_for_key_back (Betree_List_Cons (k,
              Betree_Message_Insert v) l) in
          Return (st1, (Some v, Betree_Node_Internal node))
        | Betree_Message_Delete ->
          let* _ =
            lookup_first_message_for_key_back (Betree_List_Cons (k,
              Betree_Message_Delete) l) in
          Return (st1, (None, Betree_Node_Internal node))
        | Betree_Message_Upsert ufs ->
          let* (st2, (v, i)) = betree_Internal_lookup_in_children node key st1
            in
          let* (st3, (v1, l1)) =
            betree_Node_apply_upserts (Betree_List_Cons (k,
              Betree_Message_Upsert ufs) l) v key st2 in
          let* msgs1 = lookup_first_message_for_key_back l1 in
          let* (st4, _) = betree_store_internal_node i.id msgs1 st3 in
          Return (st4, (Some v1, Betree_Node_Internal i))
        end
    | Betree_List_Nil ->
      let* (st2, (o, i)) = betree_Internal_lookup_in_children node key st1 in
      let* _ = lookup_first_message_for_key_back Betree_List_Nil in
      Return (st2, (o, Betree_Node_Internal i))
    end
  | Betree_Node_Leaf node ->
    let* (st1, bindings) = betree_load_leaf_node node.id st in
    let* o = betree_Node_lookup_in_bindings key bindings in
    Return (st1, (o, Betree_Node_Leaf node))
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::filter_messages_for_key]:
    Source: 'src/betree.rs', lines 674:4-674:77 *)
let rec betree_Node_filter_messages_for_key
  (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
  Tot (result (betree_List_t (u64 & betree_Message_t)))
  (decreases (betree_Node_filter_messages_for_key_decreases key msgs))
  =
  begin match msgs with
  | Betree_List_Cons p l ->
    let (k, m) = p in
    if k = key
    then
      let* (_, l1) =
        betree_List_pop_front (u64 & betree_Message_t) (Betree_List_Cons (k, m)
          l) in
      betree_Node_filter_messages_for_key key l1
    else Return (Betree_List_Cons (k, m) l)
  | Betree_List_Nil -> Return Betree_List_Nil
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_first_message_after_key]:
    Source: 'src/betree.rs', lines 689:4-692:34 *)
let rec betree_Node_lookup_first_message_after_key
  (key : u64) (msgs : betree_List_t (u64 & betree_Message_t)) :
  Tot (result ((betree_List_t (u64 & betree_Message_t)) & (betree_List_t (u64 &
    betree_Message_t) -> result (betree_List_t (u64 & betree_Message_t)))))
  (decreases (betree_Node_lookup_first_message_after_key_decreases key msgs))
  =
  begin match msgs with
  | Betree_List_Cons p next_msgs ->
    let (k, m) = p in
    if k = key
    then
      let* (l, lookup_first_message_after_key_back) =
        betree_Node_lookup_first_message_after_key key next_msgs in
      let back_'a =
        fun ret ->
          let* next_msgs1 = lookup_first_message_after_key_back ret in
          Return (Betree_List_Cons (k, m) next_msgs1) in
      Return (l, back_'a)
    else Return (Betree_List_Cons (k, m) next_msgs, Return)
  | Betree_List_Nil -> Return (Betree_List_Nil, Return)
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_internal]:
    Source: 'src/betree.rs', lines 521:4-521:89 *)
let betree_Node_apply_to_internal
  (msgs : betree_List_t (u64 & betree_Message_t)) (key : u64)
  (new_msg : betree_Message_t) :
  result (betree_List_t (u64 & betree_Message_t))
  =
  let* (msgs1, lookup_first_message_for_key_back) =
    betree_Node_lookup_first_message_for_key key msgs in
  let* b = betree_ListTupleU64T_head_has_key betree_Message_t msgs1 key in
  if b
  then
    begin match new_msg with
    | Betree_Message_Insert i ->
      let* l = betree_Node_filter_messages_for_key key msgs1 in
      let* l1 =
        betree_List_push_front (u64 & betree_Message_t) l (key,
          Betree_Message_Insert i) in
      lookup_first_message_for_key_back l1
    | Betree_Message_Delete ->
      let* l = betree_Node_filter_messages_for_key key msgs1 in
      let* l1 =
        betree_List_push_front (u64 & betree_Message_t) l (key,
          Betree_Message_Delete) in
      lookup_first_message_for_key_back l1
    | Betree_Message_Upsert s ->
      let* p = betree_List_hd (u64 & betree_Message_t) msgs1 in
      let (_, m) = p in
      begin match m with
      | Betree_Message_Insert prev ->
        let* v = betree_upsert_update (Some prev) s in
        let* (_, l) = betree_List_pop_front (u64 & betree_Message_t) msgs1 in
        let* l1 =
          betree_List_push_front (u64 & betree_Message_t) l (key,
            Betree_Message_Insert v) in
        lookup_first_message_for_key_back l1
      | Betree_Message_Delete ->
        let* (_, l) = betree_List_pop_front (u64 & betree_Message_t) msgs1 in
        let* v = betree_upsert_update None s in
        let* l1 =
          betree_List_push_front (u64 & betree_Message_t) l (key,
            Betree_Message_Insert v) in
        lookup_first_message_for_key_back l1
      | Betree_Message_Upsert _ ->
        let* (msgs2, lookup_first_message_after_key_back) =
          betree_Node_lookup_first_message_after_key key msgs1 in
        let* l =
          betree_List_push_front (u64 & betree_Message_t) msgs2 (key,
            Betree_Message_Upsert s) in
        let* msgs3 = lookup_first_message_after_key_back l in
        lookup_first_message_for_key_back msgs3
      end
    end
  else
    let* l =
      betree_List_push_front (u64 & betree_Message_t) msgs1 (key, new_msg) in
    lookup_first_message_for_key_back l

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_internal]:
    Source: 'src/betree.rs', lines 502:4-505:5 *)
let rec betree_Node_apply_messages_to_internal
  (msgs : betree_List_t (u64 & betree_Message_t))
  (new_msgs : betree_List_t (u64 & betree_Message_t)) :
  Tot (result (betree_List_t (u64 & betree_Message_t)))
  (decreases (betree_Node_apply_messages_to_internal_decreases msgs new_msgs))
  =
  begin match new_msgs with
  | Betree_List_Cons new_msg new_msgs_tl ->
    let (i, m) = new_msg in
    let* l = betree_Node_apply_to_internal msgs i m in
    betree_Node_apply_messages_to_internal l new_msgs_tl
  | Betree_List_Nil -> Return msgs
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::lookup_mut_in_bindings]:
    Source: 'src/betree.rs', lines 653:4-656:32 *)
let rec betree_Node_lookup_mut_in_bindings
  (key : u64) (bindings : betree_List_t (u64 & u64)) :
  Tot (result ((betree_List_t (u64 & u64)) & (betree_List_t (u64 & u64) ->
    result (betree_List_t (u64 & u64)))))
  (decreases (betree_Node_lookup_mut_in_bindings_decreases key bindings))
  =
  begin match bindings with
  | Betree_List_Cons hd tl ->
    let (i, i1) = hd in
    if i >= key
    then Return (Betree_List_Cons (i, i1) tl, Return)
    else
      let* (l, lookup_mut_in_bindings_back) =
        betree_Node_lookup_mut_in_bindings key tl in
      let back_'a =
        fun ret ->
          let* tl1 = lookup_mut_in_bindings_back ret in
          Return (Betree_List_Cons (i, i1) tl1) in
      Return (l, back_'a)
  | Betree_List_Nil -> Return (Betree_List_Nil, Return)
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_to_leaf]:
    Source: 'src/betree.rs', lines 460:4-460:87 *)
let betree_Node_apply_to_leaf
  (bindings : betree_List_t (u64 & u64)) (key : u64)
  (new_msg : betree_Message_t) :
  result (betree_List_t (u64 & u64))
  =
  let* (bindings1, lookup_mut_in_bindings_back) =
    betree_Node_lookup_mut_in_bindings key bindings in
  let* b = betree_ListTupleU64T_head_has_key u64 bindings1 key in
  if b
  then
    let* (hd, l) = betree_List_pop_front (u64 & u64) bindings1 in
    begin match new_msg with
    | Betree_Message_Insert v ->
      let* l1 = betree_List_push_front (u64 & u64) l (key, v) in
      lookup_mut_in_bindings_back l1
    | Betree_Message_Delete -> lookup_mut_in_bindings_back l
    | Betree_Message_Upsert s ->
      let (_, i) = hd in
      let* v = betree_upsert_update (Some i) s in
      let* l1 = betree_List_push_front (u64 & u64) l (key, v) in
      lookup_mut_in_bindings_back l1
    end
  else
    begin match new_msg with
    | Betree_Message_Insert v ->
      let* l = betree_List_push_front (u64 & u64) bindings1 (key, v) in
      lookup_mut_in_bindings_back l
    | Betree_Message_Delete -> lookup_mut_in_bindings_back bindings1
    | Betree_Message_Upsert s ->
      let* v = betree_upsert_update None s in
      let* l = betree_List_push_front (u64 & u64) bindings1 (key, v) in
      lookup_mut_in_bindings_back l
    end

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages_to_leaf]:
    Source: 'src/betree.rs', lines 444:4-447:5 *)
let rec betree_Node_apply_messages_to_leaf
  (bindings : betree_List_t (u64 & u64))
  (new_msgs : betree_List_t (u64 & betree_Message_t)) :
  Tot (result (betree_List_t (u64 & u64)))
  (decreases (betree_Node_apply_messages_to_leaf_decreases bindings new_msgs))
  =
  begin match new_msgs with
  | Betree_List_Cons new_msg new_msgs_tl ->
    let (i, m) = new_msg in
    let* l = betree_Node_apply_to_leaf bindings i m in
    betree_Node_apply_messages_to_leaf l new_msgs_tl
  | Betree_List_Nil -> Return bindings
  end

(** [betree_main::betree::{betree_main::betree::Internal#4}::flush]:
    Source: 'src/betree.rs', lines 410:4-415:26 *)
let rec betree_Internal_flush
  (self : betree_Internal_t) (params : betree_Params_t)
  (node_id_cnt : betree_NodeIdCounter_t)
  (content : betree_List_t (u64 & betree_Message_t)) (st : state) :
  Tot (result (state & ((betree_List_t (u64 & betree_Message_t)) &
    (betree_Internal_t & betree_NodeIdCounter_t))))
  (decreases (
    betree_Internal_flush_decreases self params node_id_cnt content st))
  =
  let* p =
    betree_ListTupleU64T_partition_at_pivot betree_Message_t content self.pivot
    in
  let (msgs_left, msgs_right) = p in
  let* len_left = betree_List_len (u64 & betree_Message_t) msgs_left in
  if len_left >= params.min_flush_size
  then
    let* (st1, p1) =
      betree_Node_apply_messages self.left params node_id_cnt msgs_left st in
    let (n, node_id_cnt1) = p1 in
    let* len_right = betree_List_len (u64 & betree_Message_t) msgs_right in
    if len_right >= params.min_flush_size
    then
      let* (st2, p2) =
        betree_Node_apply_messages self.right params node_id_cnt1 msgs_right
          st1 in
      let (n1, node_id_cnt2) = p2 in
      Return (st2, (Betree_List_Nil, ({ self with left = n; right = n1 },
        node_id_cnt2)))
    else Return (st1, (msgs_right, ({ self with left = n }, node_id_cnt1)))
  else
    let* (st1, p1) =
      betree_Node_apply_messages self.right params node_id_cnt msgs_right st in
    let (n, node_id_cnt1) = p1 in
    Return (st1, (msgs_left, ({ self with right = n }, node_id_cnt1)))

(** [betree_main::betree::{betree_main::betree::Node#5}::apply_messages]:
    Source: 'src/betree.rs', lines 588:4-593:5 *)
and betree_Node_apply_messages
  (self : betree_Node_t) (params : betree_Params_t)
  (node_id_cnt : betree_NodeIdCounter_t)
  (msgs : betree_List_t (u64 & betree_Message_t)) (st : state) :
  Tot (result (state & (betree_Node_t & betree_NodeIdCounter_t)))
  (decreases (
    betree_Node_apply_messages_decreases self params node_id_cnt msgs st))
  =
  begin match self with
  | Betree_Node_Internal node ->
    let* (st1, content) = betree_load_internal_node node.id st in
    let* l = betree_Node_apply_messages_to_internal content msgs in
    let* num_msgs = betree_List_len (u64 & betree_Message_t) l in
    if num_msgs >= params.min_flush_size
    then
      let* (st2, (content1, p)) =
        betree_Internal_flush node params node_id_cnt l st1 in
      let (node1, node_id_cnt1) = p in
      let* (st3, _) = betree_store_internal_node node1.id content1 st2 in
      Return (st3, (Betree_Node_Internal node1, node_id_cnt1))
    else
      let* (st2, _) = betree_store_internal_node node.id l st1 in
      Return (st2, (Betree_Node_Internal node, node_id_cnt))
  | Betree_Node_Leaf node ->
    let* (st1, content) = betree_load_leaf_node node.id st in
    let* l = betree_Node_apply_messages_to_leaf content msgs in
    let* len = betree_List_len (u64 & u64) l in
    let* i = u64_mul 2 params.split_size in
    if len >= i
    then
      let* (st2, (new_node, nic)) =
        betree_Leaf_split node l params node_id_cnt st1 in
      let* (st3, _) = betree_store_leaf_node node.id Betree_List_Nil st2 in
      Return (st3, (Betree_Node_Internal new_node, nic))
    else
      let* (st2, _) = betree_store_leaf_node node.id l st1 in
      Return (st2, (Betree_Node_Leaf { node with size = len }, node_id_cnt))
  end

(** [betree_main::betree::{betree_main::betree::Node#5}::apply]:
    Source: 'src/betree.rs', lines 576:4-582:5 *)
let betree_Node_apply
  (self : betree_Node_t) (params : betree_Params_t)
  (node_id_cnt : betree_NodeIdCounter_t) (key : u64)
  (new_msg : betree_Message_t) (st : state) :
  result (state & (betree_Node_t & betree_NodeIdCounter_t))
  =
  let* (st1, p) =
    betree_Node_apply_messages self params node_id_cnt (Betree_List_Cons (key,
      new_msg) Betree_List_Nil) st in
  let (self1, node_id_cnt1) = p in
  Return (st1, (self1, node_id_cnt1))

(** [betree_main::betree::{betree_main::betree::BeTree#6}::new]:
    Source: 'src/betree.rs', lines 849:4-849:60 *)
let betree_BeTree_new
  (min_flush_size : u64) (split_size : u64) (st : state) :
  result (state & betree_BeTree_t)
  =
  let* node_id_cnt = betree_NodeIdCounter_new in
  let* (id, nic) = betree_NodeIdCounter_fresh_id node_id_cnt in
  let* (st1, _) = betree_store_leaf_node id Betree_List_Nil st in
  Return (st1,
    {
      params = { min_flush_size = min_flush_size; split_size = split_size };
      node_id_cnt = nic;
      root = (Betree_Node_Leaf { id = id; size = 0 })
    })

(** [betree_main::betree::{betree_main::betree::BeTree#6}::apply]:
    Source: 'src/betree.rs', lines 868:4-868:47 *)
let betree_BeTree_apply
  (self : betree_BeTree_t) (key : u64) (msg : betree_Message_t) (st : state) :
  result (state & betree_BeTree_t)
  =
  let* (st1, p) =
    betree_Node_apply self.root self.params self.node_id_cnt key msg st in
  let (n, nic) = p in
  Return (st1, { self with node_id_cnt = nic; root = n })

(** [betree_main::betree::{betree_main::betree::BeTree#6}::insert]:
    Source: 'src/betree.rs', lines 874:4-874:52 *)
let betree_BeTree_insert
  (self : betree_BeTree_t) (key : u64) (value : u64) (st : state) :
  result (state & betree_BeTree_t)
  =
  betree_BeTree_apply self key (Betree_Message_Insert value) st

(** [betree_main::betree::{betree_main::betree::BeTree#6}::delete]:
    Source: 'src/betree.rs', lines 880:4-880:38 *)
let betree_BeTree_delete
  (self : betree_BeTree_t) (key : u64) (st : state) :
  result (state & betree_BeTree_t)
  =
  betree_BeTree_apply self key Betree_Message_Delete st

(** [betree_main::betree::{betree_main::betree::BeTree#6}::upsert]:
    Source: 'src/betree.rs', lines 886:4-886:59 *)
let betree_BeTree_upsert
  (self : betree_BeTree_t) (key : u64) (upd : betree_UpsertFunState_t)
  (st : state) :
  result (state & betree_BeTree_t)
  =
  betree_BeTree_apply self key (Betree_Message_Upsert upd) st

(** [betree_main::betree::{betree_main::betree::BeTree#6}::lookup]:
    Source: 'src/betree.rs', lines 895:4-895:62 *)
let betree_BeTree_lookup
  (self : betree_BeTree_t) (key : u64) (st : state) :
  result (state & ((option u64) & betree_BeTree_t))
  =
  let* (st1, (o, n)) = betree_Node_lookup self.root key st in
  Return (st1, (o, { self with root = n }))

(** [betree_main::main]:
    Source: 'src/betree_main.rs', lines 5:0-5:9 *)
let main : result unit =
  Return ()

(** Unit test for [betree_main::main] *)
let _ = assert_norm (main = Return ())