Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q4809579> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- Q4809579 subject Q6465220.
- Q4809579 subject Q8272677.
- Q4809579 abstract "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, each element of the list is searched in turn, starting at the head, until the key is found. Duplicate keys that appear later in the list are ignored. It is a simple way of implementing an associative array.".
- Q4809579 wikiPageWikiLink Q132874.
- Q4809579 wikiPageWikiLink Q1777473.
- Q4809579 wikiPageWikiLink Q179551.
- Q4809579 wikiPageWikiLink Q187560.
- Q4809579 wikiPageWikiLink Q207440.
- Q4809579 wikiPageWikiLink Q212587.
- Q4809579 wikiPageWikiLink Q269878.
- Q4809579 wikiPageWikiLink Q34010.
- Q4809579 wikiPageWikiLink Q623818.
- Q4809579 wikiPageWikiLink Q6465220.
- Q4809579 wikiPageWikiLink Q7003418.
- Q4809579 wikiPageWikiLink Q80006.
- Q4809579 wikiPageWikiLink Q80585.
- Q4809579 wikiPageWikiLink Q8272677.
- Q4809579 wikiPageWikiLink Q935944.
- Q4809579 comment "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, each element of the list is searched in turn, starting at the head, until the key is found. Duplicate keys that appear later in the list are ignored.".
- Q4809579 label "Association list".