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 7798487
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 2, 20262026-06-02T00:01:16+00:00 2026-06-02T00:01:16+00:00

How do you resize a std::deque from the front instead of the back? (Yes,

  • 0

How do you resize a std::deque from the front instead of the back?

(Yes, of course I can push_front a dummy value thousands of times, but is there a better/more efficient way?)

  • 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-06-02T00:01:17+00:00Added an answer on June 2, 2026 at 12:01 am

    There is an overload of insert that inserts N elements:

    std::deque<int> c;
    
    std::size_t new_size = get_new_desired_size();
    
    c.insert(c.begin(), new_size - c.size(), int());
    

    (This example requires that new_size >= c.size())

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

Sidebar

Related Questions

I am thinking of how I can implement std::vector from the ground up. How
I have some std::vector and I have to resize it with some default value.
How can I initialize an std::array from a range (as defined by a pair
I need to resize and crop to exactly 60x80px from various size and aspect
Lets we have std::vector <std::vector <int>> myVec; myVec.resize(100); myVec[0].push_back(1); myVec[0].push_back(2); When I break the
Let's we have std::vector <std::vector <unsigned short int>> face; face.resize(nElm); Its OK to resize()
There is a vector of vectors: std::vector <std::vector <float> > VoV; VoV.resize(num); // num
Since there is no .resize() member function in C++ std::map I was wondering, how
When invoking the method push_back from std::vector , its size is incremented by one,
If I allocated an std::vector to a certain size and capacity using resize() 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.