About: Peek (data type operation)

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Peek (data type operation) Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:MilitaryConflict, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPeek_%28data_type_operation%29

In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns the value of the top ("front") of the collection without removing the element from the collection. It thus returns the same value as operations such as "pop" or "dequeue", but does not modify the data.

Attributes	Values
rdf:type	military conflict
rdfs:label	Peek (data type operation) (en)
rdfs:comment	In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns the value of the top ("front") of the collection without removing the element from the collection. It thus returns the same value as operations such as "pop" or "dequeue", but does not modify the data. (en)
dcterms:subject	Abstract data types
Wikipage page ID	37875328 (xsd:integer)
Wikipage revision ID	916256835 (xsd:integer)
Link from a Wikipage to another Wikipage	Queue (abstract data type) Binary heap Dereference operator Double-ended priority queue Double-ended queue Stack (abstract data type) Computer science Priority queue Heap (data structure) Abstract data type Reference (computer science) Abstract data types Collection (abstract data type) Vienna Development Method Self-balancing binary search tree
sameAs	Peek (data type operation) Peek (data type operation) Peek (data type operation)
dbp:wikiPageUsesTemplate	dbt:Refbegin dbt:Refend dbt:Reflist dbt:Data_structures
has abstract	In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns the value of the top ("front") of the collection without removing the element from the collection. It thus returns the same value as operations such as "pop" or "dequeue", but does not modify the data. The name "peek" is similar to the basic "push" and "pop" operations on a stack, but the name for this operation varies depending on data type and language. Peek is generally considered an inessential operation, compared with the more basic operations of adding and removing data, and as such is not included in the basic definition of these data types. However, since it is a useful operation and generally easily implemented, it is frequently included in practices, and in some definitions peek is included as basic, with pop (or analog) defined in terms of peek; see . (en)
gold:hypernym	Operation
prov:wasDerivedFrom	wikipedia-en:Peek_(data_type_operation)?oldid=916256835&ns=0
page length (characters) of wiki page	5436 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Peek_(data_type_operation)
is Link from a Wikipage to another Wikipage of	Queue (abstract data type) Double-ended queue Glossary of computer science Stack (abstract data type) Peek Priority queue Heap (data structure)
is Wikipage disambiguates of	Peek
is foaf:primaryTopic of	wikipedia-en:Peek_(data_type_operation)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 55 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software