scottming

Big-O Time Complexities for Elixir data structures

Map [1]

Operation	Time Complexity
Access	O(log n)
Search	O(log n)
Insertion	O(n) for <= 32 elements, O(log n) for > 32 elements [2]
Deletion	O(n) for <= 32 elements, O(log n) for > 32 elements

scottming

:net_kernel.start([:"[email protected]"])
:erlang.set_cookie(:cook)
{:ok, peer, peername} =
   :peer.start(%{connection: 0, name: :peer, host: ~C'127.0.0.1'})
:peer.call(peer, :erlang, :set_cookie, [:cook])
Node.connect(peername)

# add code paths
:rpc.call(peername, :code, :add_paths, [:code.get_path()])