Access for Keywords are already O(n), just like access on lists would be.
Tuples would probably be O(1).
On Monday, June 27, 2016 at 5:27:32 PM UTC+2, Louis Pop wrote:
>
> Hey
>
> I think adding the Access protocol to lists would imply that list
> indexing is efficient. We should be careful to
First of I'd like you to thank you Bram for looking into potential security
issues and starting discussions about what you find. We need more people
doing that.
Also, your discussions with the core team and your blog post made me find
this issue https://github.com/hexpm/hex/issues/243 in the Hex c
Hi,
The other day I wrote a post on security best-practices around dependencies
(https://blog.voltone.net/post/5). One of the issues I raised was the risk
of unexpected code execution when pulling in dependencies from Git
repositories: "mix deps.get" recursively installs any sub-dependencies, a
Hey
I think adding the Access protocol to lists would imply that list
indexing is efficient. We should be careful to steer new users away
from techniques that are inefficient or not idiomatic.
Cheers,
Louis
On 27 June 2016 at 16:22, Filip Haglund wrote:
> Would it hurt to add it?
>
> On Sunday,
Would it hurt to add it?
On Sunday, June 26, 2016 at 6:16:19 PM UTC+2, Filip Haglund wrote:
>
> Why aren't lists and tuples implementing `Access`?
>
> {:a, :b, :c}[1] == :b
>
>
>
--
You received this message because you are subscribed to the Google Groups
"elixir-lang-core" group.
To unsubscri