Radix.take

You're seeing just the function take, go back to Radix module for more information.
Link to this function

take(tree, keys, opts \\ [])

View Source

Specs

take(tree(), [key()], keyword()) :: tree()

Returns a new tree with all the key,value-pairs whose key are in keys.

If a key in keys does not exist in tree, it is ignored.

By default keys are matched exactly, use the option match: :lpm to use longest prefix matching.

Examples

iex> new([{<<>>, nil}, {<<0>>, 0}, {<<1>>, 1}, {<<128>>, 128}, {<<255>>, 255}])
...> |> take([<<>>, <<1>>, <<255>>])
...> |> to_list()
[{<<>>, nil}, {<<1>>, 1}, {<<255>>, 255}]

# using longest prefix match
iex> new([{<<>>, nil}, {<<0>>, 0}, {<<1>>, 1}, {<<128>>, 128}, {<<255>>, 255}])
...> |> take([<<2, 2, 2, 2>>, <<1, 1, 1, 1>>, <<255, 255, 0, 0>>], match: :lpm)
...> |> to_list()
[{<<>>, nil}, {<<1>>, 1}, {<<255>>, 255}]