diff options
| author | Hugo Herbelin | 2017-05-29 21:01:23 +0200 |
|---|---|---|
| committer | Hugo Herbelin | 2017-06-04 19:25:22 +0200 |
| commit | 62012e2d412d8586bd62b60beeb0b4005a66151f (patch) | |
| tree | 53c3f21b2f972a383c4b603bcae11bd13d257a6f /lib | |
| parent | b91f5d1adbd039809e31b5311d06b376829de1fc (diff) | |
A few typos.
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/cEphemeron.ml | 4 | ||||
| -rw-r--r-- | lib/cEphemeron.mli | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/lib/cEphemeron.ml b/lib/cEphemeron.ml index a38ea11e10..890e02dc4e 100644 --- a/lib/cEphemeron.ml +++ b/lib/cEphemeron.ml @@ -35,10 +35,10 @@ end) would make the key always reachable) *) let values : Obj.t HT.t = HT.create 1001 -(* To avoid a race contidion between the finalization function and +(* To avoid a race condition between the finalization function and get/create on the values hashtable, the finalization function just enqueues in an imperative list the item to be collected. Being the list - imperative, even if the Gc enqueue an item while run_collection is operating, + imperative, even if the Gc enqueues an item while run_collection is operating, the tail of the list is eventually set to Empty on completion. Kudos to the authors of Why3 that came up with this solution for their implementation of weak hash tables! *) diff --git a/lib/cEphemeron.mli b/lib/cEphemeron.mli index 1200e4e208..76cd7a5a8a 100644 --- a/lib/cEphemeron.mli +++ b/lib/cEphemeron.mli @@ -26,7 +26,7 @@ Proposed solution: Turn all occurrences of [bad] into [bad key] in your data structure. - Use [crate bad_val] to obtain a unique key [k] for [bad_val], and store + Use [create bad_val] to obtain a unique key [k] for [bad_val], and store [k] in the data structure. Use [get k] to obtain [bad_val]. An ['a key] can always be marshalled. When marshalled, a key loses its |