Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7579299
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T17:38:35+00:00 2026-05-30T17:38:35+00:00

I’m using queue’s and priority queues, through which I plan on pumping a lot

  • 0

I’m using queue’s and priority queues, through which I plan on pumping a lot of data quite quickly.

Therefore, I want my q’s and pq’s to be responsive to additions and subtractions.

What are the relative merits of using a vector, list, or deque as the underlying container?

Update:
At the time of writing, both Mike Seymour and Steve Townsend’s answers below are worth reading. Thanks both!

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-30T17:38:37+00:00Added an answer on May 30, 2026 at 5:38 pm

    The only way to be sure how the choice effects performance is to measure it, in a situation similar to your expected use cases. That said, here are some observations:

    For std::queue:

    • std::deque is usually the best choice; it supports all the necessary operations in constant time, and allocates memory in chunks as it grows.
    • std::list also supports the necessary operations, but may be slower due to more memory allocations; in special circumstances, you might be able to get good results by allocating from a dedicated object pool, but that’s not entirely straightforward.
    • std::vector can’t be used as it doesn’t have a pop_front() operation; such an operation would be slow, as it would have to move all the remaining elements.

    A potentially faster, but less flexible, alternative is to implement a circular buffer over a fixed-size array (e.g. std::array, or a std::vector that you don’t resize). You’ll need to deal with the case of it filling up, either by reporting an error, or allocating a larger buffer and copying all the data.

    For std::priority_queue:

    • std::vector is usually the best choice; it grows exponentially (reducing the number of memory allocations), and is a simple data structure that’s very fast to access – an iterator can be implemented simply as a wrapper around a pointer.
    • std::deque may be slower as it typically grows linearly (requiring more memory allocation), and access is more complicated than with a vector.
    • std::list can’t be used as it doesn’t provide random access.

    To summarise – the defaults are usually the best choice, but if speed really is important, then measure the alternatives.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I want to construct a data frame in an Rcpp function, but when I
I'm new to using the Perl treebuilder module for HTML parsing and can't figure
That's pretty much it. I'm using Nokogiri to scrape a web page what has
link Im having trouble converting the html entites into html characters, (&# 8217;) i
I want to count how many characters a certain string has in PHP, but
I am trying to understand how to use SyndicationItem to display feed which is
I used javascript for loading a picture on my website depending on which small
I am reading a book about Javascript and jQuery and using one of the
I have a string like this: La Torre Eiffel paragonata all’Everest What PHP function
I'm using v2.0 of ClassTextile.php, with the following call: $testimonial_text = $textile->TextileRestricted($_POST['testimonial']); ... and

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.