This HTML5 document contains 64 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-kkhttp://kk.dbpedia.org/resource/
n19https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Association_list
rdf:type
yago:Cognition100023271 yago:Abstraction100002137 yago:Arrangement105726596 yago:Arrangement107938773 yago:Array107939382 yago:WikicatAssociativeArrays yago:PsychologicalFeature100023100 yago:DataStructure105728493 yago:Group100031264 yago:Structure105726345
rdfs:label
Association list
rdfs: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, 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.
dbp:name
Association list
dcterms:subject
dbc:Associative_arrays dbc:Linked_lists
dbo:wikiPageID
394077
dbo:wikiPageRevisionID
1003604073
dbo:wikiPageWikiLink
dbr:Hash_table dbr:Node_(computer_science) dbr:Scheme_(programming_language) dbr:Associative_array dbr:Local_variables dbr:Linked_list dbr:Free_variables_and_bound_variables dbc:Associative_arrays dbr:Big_O_notation dbr:Attribute–value_pair dbr:Property_list dbr:Standard_library dbr:Computer_programming dbr:Sequential_search dbr:OCaml dbr:Stack_(abstract_data_type) dbc:Linked_lists dbr:Abstract_data_type dbr:Binary_search_tree dbr:Haskell_(programming_language) dbr:Lisp_(programming_language) dbr:Self-organizing_list dbr:Variable_shadowing
owl:sameAs
wikidata:Q4809579 dbpedia-kk:Ассоциативтік_тізім freebase:m.09gdv91 yago-res:Association_list n19:4TQed
dbp:spaceAvg
O
dbp:spaceWorst
O
dbp:wikiPageUsesTemplate
dbt:Math dbt:Infobox_data_structure dbt:Data_structures dbt:Reflist dbt:Mvar
dbp:type
dbr:Associative_array
dbo: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, 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.
dbp:deleteAvg
O
dbp:deleteWorst
O
dbp:insertAvg
O
dbp:insertWorst
O
dbp:searchAvg
O
dbp:searchWorst
O
gold:hypernym
dbr:List
prov:wasDerivedFrom
wikipedia-en:Association_list?oldid=1003604073&ns=0
dbo:wikiPageLength
7780
foaf:isPrimaryTopicOf
wikipedia-en:Association_list