aboutsummaryrefslogtreecommitdiff
path: root/src/Utils.elm
blob: 62286969b987032f62840df714fa306ffe03da15 (plain)
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
{-
   - This file is part of `typers`.
   -
   - `typers` is free software: you can redistribute it and/or modify
   - it under the terms of the GNU Affero Public License as published by
   - the Free Software Foundation, either version 3 of the License, or
   - (at your option) any later version.
   -
   - `typers` is distributed in the hope that it will be useful,
   - but WITHOUT ANY WARRANTY; without even the implied warranty of
   - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   - GNU Affero Public License for more details.
   -
   - You should have received a copy of the GNU Affero Public License
   - along with `typers`.  If not, see <https://www.gnu.org/licenses/>.
-}


module Utils exposing (..)

import Array as A exposing (..)
import Base exposing (Word, WordStatus(..))
import Time exposing (Posix, posixToMillis)


isNothing : Maybe a -> Bool
isNothing p =
    case p of
        Nothing ->
            True

        Just a ->
            False


isJust : Maybe a -> Bool
isJust p =
    not (isNothing p)


flip : (a -> b -> c) -> (b -> a -> c)
flip f =
    \x y -> f y x


diffDuration : Posix -> Posix -> Float
diffDuration t1 t2 =
    let
        m1 =
            posixToMillis t1

        m2 =
            posixToMillis t2
    in
    toFloat (m2 - m1) / 1000


wordCountWith : Array Word -> (WordStatus -> Bool) -> Int
wordCountWith words predicate =
    words |> A.map .status |> A.filter predicate |> A.length


triple : a -> b -> c -> ( a, b, c )
triple a b c =
    ( a, b, c )


listIdx : List a -> Int -> Maybe a
listIdx ls idx =
    List.head (List.drop idx ls)