Small typos

This commit is contained in:
JPR 2019-05-14 17:11:17 +02:00 committed by Simon Cruanes
parent 05e49a27e7
commit 8e3dc5e006
4 changed files with 8 additions and 8 deletions

View file

@ -519,7 +519,7 @@ others:
- add `CCMap.add_{list,seqe` - add `CCMap.add_{list,seqe`
- add `CCSet.add_{list,seq}` - add `CCSet.add_{list,seq}`
- fix small uglyness in `Map.print` and `Set.print` - fix small ugliness in `Map.print` and `Set.print`
- add `CCFormat.{ksprintf,string_quoted}` - add `CCFormat.{ksprintf,string_quoted}`
- add `CCArray.sort_generic` for sorting over array-like structures in place - add `CCArray.sort_generic` for sorting over array-like structures in place
- add `CCHashtbl.add` mimicking the stdlib `Hashtbl.add` - add `CCHashtbl.add` mimicking the stdlib `Hashtbl.add`
@ -714,7 +714,7 @@ NOTE: use of `containers.io` is deprecated (its only module has moved to `contai
- merged `test_levenshtein` with other tests - merged `test_levenshtein` with other tests
- Add experimental rose tree in `Containers_misc.RoseTree`. - Add experimental rose tree in `Containers_misc.RoseTree`.
- remove a lot of stuff from `containers.misc` (see `_oasis` for details) - remove a lot of stuff from `containers.misc` (see `_oasis` for details)
- `make devel` command, activating most flags, for developpers (see #27) - `make devel` command, activating most flags, for developers (see #27)
- use benchmark 1.4, with the upstreamed tree system - use benchmark 1.4, with the upstreamed tree system
- test `ccvector.iteri` - test `ccvector.iteri`
- add `CCFormat` into core/ - add `CCFormat` into core/
@ -743,7 +743,7 @@ NOTE: use of `containers.io` is deprecated (its only module has moved to `contai
- cleanup: move sub-libraries to their own subdir each; mv everything into `src/` - cleanup: move sub-libraries to their own subdir each; mv everything into `src/`
- `sexp`: - `sexp`:
* `CCSexp` now splitted into `CCSexp` (manipulating expressions) and `CCSexpStream` * `CCSexp` now split into `CCSexp` (manipulating expressions) and `CCSexpStream`
* add `CCSexpM` for a simpler, monadic parser of S-expressions (deprecating `CCSexpStream`) * add `CCSexpM` for a simpler, monadic parser of S-expressions (deprecating `CCSexpStream`)
- `core`: - `core`:
* `CCString.fold` * `CCString.fold`

View file

@ -206,7 +206,7 @@ You will need OCaml `>=` 4.02.0.
### Via opam ### Via opam
The prefered way to install is through [opam](http://opam.ocaml.org/). The preferred way to install is through [opam](http://opam.ocaml.org/).
``` ```
$ opam install containers $ opam install containers
@ -513,7 +513,7 @@ NOTE: you should never let the resource escape the
scope of the `with_resource` call, because it will not be valid outside. scope of the `with_resource` call, because it will not be valid outside.
OCaml's type system doesn't make it easy to forbid that so we rely OCaml's type system doesn't make it easy to forbid that so we rely
on convention here (it would be possible, but cumbersome, using on convention here (it would be possible, but cumbersome, using
a record with an explicitely quantified function type). a record with an explicitly quantified function type).
Now we can read the file again: Now we can read the file again:

View file

@ -166,7 +166,7 @@ module type S = sig
@since 0.16 *) @since 0.16 *)
val decr : ?by:int -> int t -> key -> unit val decr : ?by:int -> int t -> key -> unit
(** Like {!incr} but substract 1 (or the value of [by]). (** Like {!incr} but subtract 1 (or the value of [by]).
If the value reaches 0, the key is removed from the table. If the value reaches 0, the key is removed from the table.
This does nothing if the key is not already present in the table. This does nothing if the key is not already present in the table.
@since 0.16 *) @since 0.16 *)

View file

@ -1,4 +1,4 @@
(* search for first occurence of pat in s *) (* search for first occurrence of pat in s *)
let rec search pat s pos = let rec search pat s pos =
let rec compare i = let rec compare i =
if i >= String.length pat if i >= String.length pat
@ -14,7 +14,7 @@ let rec search pat s pos =
else search pat s (pos+1) else search pat s (pos+1)
;; ;;
(* search all non-overlapping occurences of pat in s *) (* search all non-overlapping occurrences of pat in s *)
let search_all pat s = let search_all pat s =
let rec search_rest acc pos = let rec search_rest acc pos =
let next = let next =