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

  • Home
  • SEARCH
  • 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 6006009
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T01:28:43+00:00 2026-05-23T01:28:43+00:00

I wrote this function in C++ as part of a bigger program: Object Single_list<Object>::pop_front()

  • 0

I wrote this function in C++ as part of a bigger program:

Object Single_list<Object>::pop_front() {
    //Single_node<Object> *tmp_front;  
    //Object hold;
    if (empty()) {
        throw underflow();
    } 

    Single_node<Object> first_node = front();
    Single_node<Object> *ptr = list_head;                                                            
    list_head = list_head->next();  
    delete ptr;
    return first_node.retrieve();
}

However, when I try and use this function I get the following message:

WARNING: calling delete twice on the same memory location: 0x100100160

I am really confused, I am not deleting the pointer (assuming that’s what is causing the problem?) twice.

Any advice will be appreciated.

As requested, here is the constructor and retrieve function for the Single_Node, although I am not sure how helpful this will be to the error regarding deletion that I am getting:

template <typename Object>
Single_node<Object>::Single_node( const Object &e, Single_node<Object> *n ):element( e ), next_node( n )
{
    // empty constructor
}

template <typename Object>
Object Single_node<Object>::retrieve() const
{
    return element;
}

template <typename Object>
Single_node<Object> *Single_node<Object>::next() const
{ 
    return next_node;
}
  • 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-23T01:28:44+00:00Added an answer on May 23, 2026 at 1:28 am

    Building on Mankarse’s comment, try the following:

    Object Single_list<Object>::pop_front() {
    
        if (empty()) {
            throw underflow();
        } 
    
        Object result = front().retrieve();
    
        Single_node<Object> *ptr = list_head;
        list_head = list_head->next();  
        delete ptr;
        return result;
    }
    

    This grabs the result from the first node before it gets deleted.

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

Sidebar

Related Questions

I want to convert function object to function. I wrote this code, but it
I wrote this function that's supposed to do StringPadRight("Hello", 10, "0") -> "Hello00000" .
I have this Array i wrote a function MostFreq that takes an array of
I wrote this code I have these errors Cannot implicitly convert type x.Program.TreeNode' to
I copied a part of a bigger project i'm working on, I didn't wrote
I wrote this code: function get_feed(){ // Get RSS Feed(s) include_once(ABSPATH . WPINC .
I wrote this small program today and I was blown away by the results.
I wrote the following function as a part of a jQuery plugin I am
I'm trying to figure out how to write this function: template <typename Bound> Bound::result_type
I would like to write this as a user defined function: private double Score(Story

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.