adambard/learnxinyminutes-docs
1
1
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-11-26 09:21:00 +03:00
Code Issues Projects Releases Wiki Activity

Break some long lines in OCaml tutorial to avoid horizontal scrolling.

Browse Source
This commit is contained in:
Daniil Baturin 2014-09-12 19:42:50 +07:00
parent 962d58d013
commit 3995be4f4b
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
ocaml.html.markdown
View File

@ -81,7 +81,8 @@ let foo = 1 ;;
let foo' = foo * 2 ;; let foo' = foo * 2 ;;
(* Since OCaml compiler infers types automatically, you normally don't need to (* Since OCaml compiler infers types automatically, you normally don't need to
specify argument types explicitly. However, you can do it if you want or need to. *) specify argument types explicitly. However, you can do it if
you want or need to. *)
let inc_int (x: int) = x + 1 ;; let inc_int (x: int) = x + 1 ;;
(* You need to mark recursive function definitions as such with "rec" keyword. *) (* You need to mark recursive function definitions as such with "rec" keyword. *)
@ -285,8 +286,8 @@ let l = Cons (1, EmptyList) ;;
languages, but offers a lot more expressive power. languages, but offers a lot more expressive power.
Even though it may look complicated, it really boils down to matching Even though it may look complicated, it really boils down to matching
an argument against an exact value, a predicate, or a type constructor. The type system an argument against an exact value, a predicate, or a type constructor.
is what makes it so powerful. *) The type system is what makes it so powerful. *)
(** Matching exact values. **) (** Matching exact values. **)
@ -328,8 +329,8 @@ say (Cat "Fluffy") ;; (* "Fluffy says meow". *)
(* Recursive types can be traversed with pattern matching easily. (* Recursive types can be traversed with pattern matching easily.
Let's see how we can traverse a datastructure of the built-in list type. Let's see how we can traverse a datastructure of the built-in list type.
Even though the built-in cons ("::") looks like an infix operator, it's actually Even though the built-in cons ("::") looks like an infix operator,
a type constructor and can be matched like any other. *) it's actually a type constructor and can be matched like any other. *)
let rec sum_list l = let rec sum_list l =
match l with match l with
| [] -> 0 | [] -> 0