Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Install
Faster access than browser!
 

Unordered associative containers (C++)

Index Unordered associative containers (C++)

In the programming language C++, unordered associative containers are a group of class templates in the C++ Standard Library that implement hash table variants. [1]

15 relations: Associative containers, Boost (C++ libraries), C++, C++ Standard Library, C++ Technical Report 1, C++11, Concept (generic programming), GNU Compiler Collection, Hash table, Iterator, Microsoft Visual C++, Silicon Graphics, Standard Template Library, Template (C++), Well-order.

Associative containers

In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays.

New!!: Unordered associative containers (C++) and Associative containers · See more »

Boost (C++ libraries)

Boost is a set of libraries for the C++ programming language that provide support for tasks and structures such as linear algebra, pseudorandom number generation, multithreading, image processing, regular expressions, and unit testing.

New!!: Unordered associative containers (C++) and Boost (C++ libraries) · See more »

C++

C++ ("see plus plus") is a general-purpose programming language.

New!!: Unordered associative containers (C++) and C++ · See more »

C++ Standard Library

In the C++ programming language, the C++ Standard Library is a collection of classes and functions, which are written in the core language and part of the C++ ISO Standard itself.

New!!: Unordered associative containers (C++) and C++ Standard Library · See more »

C++ Technical Report 1

C++ Technical Report 1 (TR1) is the common name for ISO/IEC TR 19768, C++ Library Extensions, which was a document proposing additions to the C++ standard library for the C++03 language standard.

New!!: Unordered associative containers (C++) and C++ Technical Report 1 · See more »

C++11

C++11 is a version of the standard for the programming language C++.

New!!: Unordered associative containers (C++) and C++11 · See more »

Concept (generic programming)

In generic programming, a concept is a description of supported operations on a type, including syntax and semantics.

New!!: Unordered associative containers (C++) and Concept (generic programming) · See more »

GNU Compiler Collection

The GNU Compiler Collection (GCC) is a compiler system produced by the GNU Project supporting various programming languages.

New!!: Unordered associative containers (C++) and GNU Compiler Collection · See more »

Hash table

In computing, a hash table (hash map) is a data structure that implements an associative array abstract data type, a structure that can map keys to values.

New!!: Unordered associative containers (C++) and Hash table · See more »

Iterator

In computer programming, an iterator is an object that enables a programmer to traverse a container, particularly lists.

New!!: Unordered associative containers (C++) and Iterator · See more »

Microsoft Visual C++

Microsoft Visual C++ (often abbreviated to MSVC) is an integrated development environment (IDE) product from Microsoft for the C, C++, and C++/CLI programming languages.

New!!: Unordered associative containers (C++) and Microsoft Visual C++ · See more »

Silicon Graphics

Silicon Graphics, Inc. (later rebranded SGI, historically known as Silicon Graphics Computer Systems or SGCS) was an American high-performance computing manufacturer, producing computer hardware and software.

New!!: Unordered associative containers (C++) and Silicon Graphics · See more »

Standard Template Library

The Standard Template Library (STL) is a software library for the C++ programming language that influenced many parts of the C++ Standard Library.

New!!: Unordered associative containers (C++) and Standard Template Library · See more »

Template (C++)

Templates are a feature of the C++ programming language that allows functions and classes to operate with generic types.

New!!: Unordered associative containers (C++) and Template (C++) · See more »

Well-order

In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering.

New!!: Unordered associative containers (C++) and Well-order · See more »

Redirects here:

Hash map (C++ class), Hash map (C++), Std::tr1::unordered map, Std::unordered map, Std::unordered multimap, Std::unordered multiset, Std::unordered set, Unordered map (C++ class), Unordered map (C++), Unordered multimap, Unordered multimap (C++), Unordered multiset, Unordered multiset (C++), Unordered set, Unordered set (C++).

References

[1] https://en.wikipedia.org/wiki/Unordered_associative_containers_(C%2B%2B)

OutgoingIncoming
Hey! We are on Facebook now! »