aboutsummaryrefslogtreecommitdiff
path: root/lib/cEphemeron.mli
diff options
context:
space:
mode:
authorHugo Herbelin2017-05-29 21:01:23 +0200
committerHugo Herbelin2017-06-04 19:25:22 +0200
commit62012e2d412d8586bd62b60beeb0b4005a66151f (patch)
tree53c3f21b2f972a383c4b603bcae11bd13d257a6f /lib/cEphemeron.mli
parentb91f5d1adbd039809e31b5311d06b376829de1fc (diff)
A few typos.
Diffstat (limited to 'lib/cEphemeron.mli')
-rw-r--r--lib/cEphemeron.mli2
1 files changed, 1 insertions, 1 deletions
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