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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T04:14:43+00:00 2026-06-15T04:14:43+00:00

I create two standard vector of unique_ptr: std::vector<std::unique_ptr<Student>> students; std::vector<std::unique_ptr<Teacher>> teachers; Then, I create

  • 0

I create two standard vector of unique_ptr:

std::vector<std::unique_ptr<Student>> students;
std::vector<std::unique_ptr<Teacher>> teachers;

Then, I create a new object and put it in the vector:

students.push_back(std::unique_ptr<Student> (new Student()));
teachers.push_back(std::unique_ptr<Teacher> (new Teacher()));

After all the operation I have to do, how can I delete the vector?

Whitout unique_ptr I had to do a loop and delete each object:

while (!students.empty())
{
    delete students.back();
    students.pop_back();
}

Now with unique_ptr what have I to do?

I know I have to use unique_ptr::reset (I think).

  • 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-15T04:14:45+00:00Added an answer on June 15, 2026 at 4:14 am

    It’s simple:

    students.clear();
    

    That’s what smart pointers (like unique_ptr) are for – they take care of destroying the object pointed to when appropriate.

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

Sidebar

Related Questions

Ok , I know the two standard ways to create a new thread and
Is there a standard method to create a new array from a two dimensional
I'm new to C++/CX. I want to create a Vector class with two properties
I'm trying to create a standard two-column form, where the first column is a
I can create and use dynamic two dimensional array in Fortran (in 77 standard).
Trying to create two clients; one is pub/sub, the other is a standard connection.
Everyone knows two of the ways to create an empty array: Array.new and []
The standard way to create an object in Objective-C looks like this: MyClass* object
I have two vectors of predicates: typedef std::function<bool(int)> pred; vector<pred> v1; vector<pred> v2; I
I noticed that if I create a standard two-button AlertDialog using the builder 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.