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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T04:41:50+00:00 2026-05-27T04:41:50+00:00

If I were to use something like this in C++, struct socket_t { sockaddr_in

  • 0

If I were to use something like this in C++,

struct socket_t {
    sockaddr_in address;
    char buffer[2048];
    int FD;
}

socket_t *clients[256];
memset(clients, 0, 256);

and then create objects in it,

socket_t **free = (socket_t**) memchr(clients, 0, 256);
*free = new socket_t;

and then use delete on some of the elements,

delete clients[index];

would all members be safely freed (especially the buffer)?

I don’t want to waste 2 KiB on each item I create.

I’m asking this because I noticed sizeof returns the amount of bytes used when an array is declared with type[2048] but the size of the pointer if it’s declared with type*.

  • 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-27T04:41:51+00:00Added an answer on May 27, 2026 at 4:41 am

    The array in your struct is an automatic object, whose life-time is tied with the instance of struct. So yes, when you delete an instance of the struct, the memory of the array is also automatically freed. This is true for all non-pointer members.

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

Sidebar

Related Questions

Given that I have something like this: int val; struct node *mhm; int val;
Right now we just use something like this stopWatch.Start(); try { method(); } finally
Is it possible to use something like this wrapper with fluent configuration? http://jeffreypalermo.com/blog/use-this-nhibernate-wrapper-to-keep-your-repository-classes-simple/ If
Hay guys, i want to use something like this users = User.objects.all() but i
I have some folder with different files. I want to use something like this:
Should I use something like maven for this? Or would finding them as they
What Swing class can I use to implement something like this? Add To List
I use a pattern that looks something like this often. I'm wondering if this
I would like to do something like this i.e., use wild card characters in
This should be a elementary question but why is better to use something like

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.