Association list
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value. The association list is said to associate the value with the key. In order to find the value associated with a given key, a sequential search is used: each element of the list is searched in turn, starting at the head, until the key is found. Associative lists provide a simple way of implementing an associative array, but are efficient only when the number of keys is very small.
A-list (disambiguation)Associative arrayAutoLISPCanonical S-expressionsComparison of programming languages (associative array)Control tableData packFexprHTML elementList of data structuresList of terms relating to algorithms and data structuresMcCarthy FormalismScope (computer science)Semantic network
Link from a Wikipage to another Wikipage
primaryTopic
Association list
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value. The association list is said to associate the value with the key. In order to find the value associated with a given key, a sequential search is used: each element of the list is searched in turn, starting at the head, until the key is found. Associative lists provide a simple way of implementing an associative array, but are efficient only when the number of keys is very small.
has abstract
In computer programming and pa ...... number of keys is very small.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,003,604,073
Link from a Wikipage to another Wikipage
delete avg
O
@en
delete worst
O
@en
insert avg
O
@en
insert worst
O
@en
name
Association list
@en
search avg
O
@en
search worst
O
@en
space avg
O
@en
space worst
O
@en
wikiPageUsesTemplate
hypernym
comment
In computer programming and pa ...... number of keys is very small.
@en
label
Association list
@en