API and allow overriding
default behaviour.
PR includes an example. The PR has been rejected (see discussion).
Would it be possible to discuss an acceptable implementation for
resolving the issue described above ?
Best regards,
--
Jean Parpaillon
--
Senior Developper KBRW Adventure
Director @ OW2
One of the most important reason when choosing a data structure over
another is the cost of operations, if not, there is no interest in
choosing, for instance, a Map over a Proplist.
Of course there is a cost in sorting a map, and it is not insignificant.
Why not just adding a Map.sort/1
.
Would you be interested in including this library in mainstream elixir ? It
would complete the Record module for better erlang / elixir compatibility.
Best regards,
Jean Parpaillon
--
You received this message because you are subscribed to the Google Groups
"elixir-lang-core&q
Hello,
I think you're looking for `.get_lazy/3` functions.
Best regards,
Jean
Le mardi 26 janvier 2021 à 00:47 -0800, Paweł Urbanek a écrit :
> Looks like get does not evaluate the fallback function:
>
> Keyword.get([{:a, 1}], :b, fn () -> 2 + 2 end) =>
> #Function<45.97283095/0 in
+1 for first..second..last
Jean
Le lundi 22 mars 2021 à 06:52 -0500, Amos King a écrit :
> What about something closer to Haskell’s ranges? [first,
> second..last] is their syntax and the step in inferred by the
> difference between first and second. 1..2..n would step by one.
> 1..3..n is step
