random_access_list

0.1.0

A random access list is a list data structure that has O(log n) time lookups and updates, while maintaining a constant time for cons, tail and head operations.

HexDocs

Current section

Files

Jump to

Readme 1 Version 0 Dependencies Dependants Files Activity

random_access_list lib complete_binary_tree leaf.ex

Raw

6 files

lib
- complete_binary_tree
  
  complete_binary_tree.ex
  
  leaf.ex
  
  node.ex
- random_access_list.ex
README.md
mix.exs

lib/complete_binary_tree/leaf.ex

defmodule CompleteBinaryTree.Leaf do
  defstruct [:value]

  def new(value) do
    struct(__MODULE__, value: value)
  end
end

Search filters

Type any of these into the search box. They can be combined with free text which searches package names and descriptions.

Operator	Description	Example
name:	Match package name. Supports * wildcards and repo/package form	name:phx* or name:hexpm/phoenix
description:	Full-text search of package descriptions	description:auth
depends:	Packages depending on a given package. Supports repo:package form	depends:ecto or depends:hexpm:ecto
build_tool:	Filter by build tool	build_tool:mix
updated_after:	Packages updated after an ISO8601 datetime	updated_after:2025-01-01T00:00:00Z
extra:	Match custom metadata (key,value). Nested keys are separated by commas	extra:license,MIT

Wrap values in double quotes to include spaces, e.g. name:"my package".