Commit 5cd2f3d6 authored by Andrei Paskevich's avatar Andrei Paskevich

verifythis_fm2012_treedel: rename "loc" back to "pointer" in comments

parent 58d81b49
......@@ -12,7 +12,7 @@ Iterative deletion in a binary search tree - 90 minutes
VERIFICATION TASK
-----------------
Given: a loc t to the root of a non-empty binary search tree (not
Given: a pointer t to the root of a non-empty binary search tree (not
necessarily balanced). Verify that the following procedure removes the
node with the minimal key from the tree. After removal, the data
structure should again be a binary search tree.
......@@ -38,7 +38,7 @@ Note: When implementing in a garbage-collected language, the call to
dispose() is superfluous.
*)
(* Why3 has no loc data structures, so we model the heap *)
(* Why3 has no pointer data structures, so we model the heap *)
module Memory
use export map.Map
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment