book chapter · Apress eBooks · 2014

STL’s Stack and Queue

Bruce Sutherland

Cited by 0Abstract and details only

Abstract

The STL containers you have seen so far have all provided options for storing and retrieving values and are suited to different circumstances. The stack and queue containers are designed for different reasons. Although they do store values, their behavior is much more important. I'll show you exactly how these containers behave in this chapter. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Cite this paper

APA 7

Sutherland, B. (2014). STL’s Stack and Queue. Apress eBooks, 177–180. https://doi.org/10.1007/978-1-4302-6458-3_17

MLA 9

Sutherland, Bruce. “STL’s Stack and Queue.” Apress eBooks, 2014, pp. 177–80, https://doi.org/10.1007/978-1-4302-6458-3_17.

Chicago

Sutherland, Bruce. 2014. “STL’s Stack and Queue.” Apress eBooks: 177–80. https://doi.org/10.1007/978-1-4302-6458-3_17.

Harvard

Sutherland, B. (2014) ‘STL’s Stack and Queue’, Apress eBooks, pp. 177–180. Available at: https://doi.org/10.1007/978-1-4302-6458-3_17.

BibTeX

@incollection{sutherland2014stack,
  title = {{STL’s Stack and Queue}},
  author = {Sutherland, Bruce},
  booktitle = {Apress eBooks},
  pages = {177--180},
  year = {2014},
  doi = {10.1007/978-1-4302-6458-3_17}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

STL’s Stack and Queue

Abstract

Cite this paper

Stacks and Queues

Stack and queue

Container Adapters

Using Sequence Containers

Stacks, Queues, and Deques

Chapter 7: The STL Containers

ADTs, Queues and Stacks

Stack und Queue

Abstract

Cite this paper

Related papers