Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Associative containers

Known as: Set, Std::multimap, STL map 
In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A novel numerical scheme is proposed in the hybrid numerical method, combining the conformal time-domain finite integral theorem… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2013
Highly Cited
2013
Preserving the integrity of application data across updates is difficult if power outages and system crashes may occur during… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
2008
2008
Gore and Nguyen have recently given the first optimal and sound method for global caching for the description (modal) logic… Expand
  • table 1
  • table 2
  • table 3
2007
2007
The Standard Template Adaptive Parallel Library ( stapl ) is a parallel programming framework that extends C++ and stl with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2007
2007
The Standard Template Library (STL) is a collection of generic algo- rithms and data structures that is part of the standard run… Expand
  • figure 1
2006
2006
The methods of Discrete Exterior Calculus (DEC) have given birth to many new algorithms applicable to areas such as fluid… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2003
2003
In this paper we would like to present a very short (possibly the shortest) self-interpreter, based on a simplistic Turing… Expand
2000
2000
The paper presents a novel approach to the automatic identification of objects/classes from a system specification. The… Expand
  • figure 1
  • table 1
Highly Cited
1996
Highly Cited
1996
Within the object-oriented technology community, much recent work on design reuse has focused on role-based collaborations… Expand
  • figure 1
  • figure 5
  • figure 7
1992
1992
As we have seen, the ideal Binary Search Tree has height approximately equal to log n, where n is the number of values stored in… Expand