package preface

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Source file stream.ml

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
type 'a t = C of 'a * 'a t Lazy.t

let stream a l = C (a, l)

let rec pure x = C (x, lazy (pure x))

let repeat = pure

let cons x s = C (x, lazy s)

let hd = function C (x, _) -> x

let tl = function C (_, xs) -> Lazy.force xs

let rec map f = function C (x, xs) -> C (f x, lazy (map f @@ Lazy.force xs))

module Functor = Preface_make.Functor.Via_map (struct
  type nonrec 'a t = 'a t

  let map = map
end)

module Applicative = Preface_make.Applicative.Via_apply (struct
  type nonrec 'a t = 'a t

  let pure = pure

  let rec apply stream1 stream2 =
    let f g x = g x in
    match (stream1, stream2) with
    | (C (x, xs), C (y, ys)) ->
      C (f x y, lazy (apply (Lazy.force xs) (Lazy.force ys)))
  ;;
end)

module Monad = Preface_make.Monad.Via_map_and_join (struct
  type nonrec 'a t = 'a t

  let return = pure

  let map = map

  let rec join = function
    | C (first, second) ->
      let tail = lazy (map tl @@ Lazy.force second) in
      C (hd first, lazy (join @@ Lazy.force tail))
  ;;
end)

module Comonad = Preface_make.Comonad.Via_map_and_duplicate (struct
  type nonrec 'a t = 'a t

  let extract = hd

  let rec duplicate = function
    | C (a, s) -> C (C (a, s), lazy (duplicate @@ Lazy.force s))
  ;;

  let rec map f = function C (a, s) -> C (f a, lazy (map f @@ Lazy.force s))
end)

let at i s =
  let open Try.Monad.Syntax in
  let* index = Exn.check_position i in
  let rec aux_at i s =
    if i = 0 then Try.ok (hd s) else aux_at (pred i) (tl s)
  in
  aux_at index s
;;

let drop i s =
  let open Try.Monad.Syntax in
  let* index = Exn.check_position i in
  let rec aux_drop i s = if i = 0 then Try.ok s else aux_drop (pred i) (tl s) in
  aux_drop index s
;;

let take i s =
  let open Try.Monad.Syntax in
  let* index = Exn.check_position i in
  let rec aux_take acc i s =
    if i = 0
    then Stdlib.List.rev acc
    else aux_take (hd s :: acc) (pred i) (tl s)
  in
  Try.ok (aux_take [] index s)
;;

let take_while predicate stream =
  let rec take_aux acc = function
    | C (x, xs) ->
      if predicate x
      then take_aux (x :: acc) (Lazy.force xs)
      else Stdlib.List.rev acc
  in
  take_aux [] stream
;;

let drop_while predicate stream =
  let rec drop_aux = function
    | C (x, xs) as stream ->
      if predicate x then drop_aux (Lazy.force xs) else stream
  in
  drop_aux stream
;;

module Infix = struct
  let ( <:> ) = cons

  let ( .%[] ) s i = at i s
end

include Infix
OCaml

Innovation. Community. Security.