A naive approach to finding the nearest value in an Elm list

```
closest: Int -> List Int -> Int
closest size sizes =
  sizes
      |> List.sort
      |> List.filter (\s -> s < size)
      |> List.reverse
      |> List.head
      |> Maybe.withDefault 0
```

This example is not meant to be exhaustive nor performant.

nickciolpan
20 Jul 2020