_:vb6906374	<http://www.w3.org/1999/02/22-rdf-syntax-ns#value>	"(computing) A data structure in which objects are added to one end, called the tail, and removed from the other, called the head (in the case of a FIFO queue). The term can also refer to a LIFO queue or stack where these ends coincide. [from 20th c.]"@en .
<http://kaiko.getalp.org/dbnary/eng/__ws_3_queue__Noun__1>	<http://kaiko.getalp.org/dbnary#senseNumber>	"3" .
_:vb6906375	<http://www.w3.org/1999/02/22-rdf-syntax-ns#value>	"Queue implementations are commonly based on insertion order as in first-in, first-out (FIFO) queues or last-in, first-out queues (LIFO queues are also known as stacks)."@en .
<http://kaiko.getalp.org/dbnary/eng/__ws_3_queue__Noun__1>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://www.w3.org/ns/lemon/ontolex#LexicalSense> .
<http://kaiko.getalp.org/dbnary/eng/__ws_3_queue__Noun__1>	<http://www.w3.org/2004/02/skos/core#example>	_:vb6906375 .
<http://kaiko.getalp.org/dbnary/eng/__ws_3_queue__Noun__1>	<http://www.w3.org/2004/02/skos/core#definition>	_:vb6906374 .
_:vb6906375	<http://purl.org/dc/terms/bibliographicCitation>	"2005, David Flanagan, Java in a Nutshell, p. 234,"@en .