About: Set (abstract data type)

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

About: Set (abstract data type) Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. A multiset is a special kind of set in which an element can figure several times.

Attributes	Values
rdfs:label	Set (abstract data type) (en)
rdfs:comment	In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. A multiset is a special kind of set in which an element can figure several times. (en)
sameAs	Set (abstract data type) Set (abstract data type)
dbp:wikiPageUsesTemplate	dbt:Definition_needed dbt:Efn dbt:Main dbt:More_citations_needed dbt:Notelist dbt:Reflist dbt:Data_structures dbt:Data_types
Subject	Abstract data types Composite data types Data types
gold:hypernym	Type
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Set_(abstract_data_type)?oldid=1070152456&ns=0
Wikipage page ID	201127 (xsd:integer)
page length (characters) of wiki page	25057 (xsd:nonNegativeInteger)
Wikipage revision ID	1070152456 (xsd:integer)
has abstract	In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. Some set data structures are designed for static or frozen sets that do not change after they are constructed. Static sets allow only query operations on their elements — such as checking whether a given value is in the set, or enumerating the values in some arbitrary order. Other variants, called dynamic or mutable sets, allow also the insertion and deletion of elements from the set. A multiset is a special kind of set in which an element can figure several times. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Set_(abstract_data_type)
is Wikipage redirect of	Frozen set TreeSet HashSet Set (computer science) Set (computing) Set (data structure) Set data structure Language support for set data structures Multiset (abstract data type) SortedSet
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Non-blocking algorithm Nondeterministic finite automaton Normalized Google distance Abstract data type Aggregate function Allocator (C++) Apache Spark Binary search algorithm Binary search tree Bit array Bloom filter Boolean data type Bucket queue Glossary of computer science Dijkstra's algorithm Java (programming language) Object composition Object–relational impedance mismatch Claire (programming language) Classifier (UML) Cuckoo filter List (abstract data type) List comprehension List of data structures Closest pair of points problem Collection (abstract data type) Comparison of object–relational database management systems Complement (set theory) Connectionism Container (abstract data type) Core Foundation Dynamic set High-level assembler Data definition language Data type Frozen set Graph (abstract data type) Icon (programming language) FP (programming language) Hash function Hash table Hash tree (persistent data structure) Join-based tree algorithms Map (higher-order function) Lua (programming language) HashSet Language support for set data structures Lightweight Directory Access Protocol Multimap Multiset (abstract data type)

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software