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

The Archive Base Latest Questions

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

I have a region of memory, which will be used for multiple queues. For

  • 0

I have a region of memory, which will be used for multiple queues. For example, I allocate 1024 bytes of memory and I need two queues. The first queue will occupy the first 512 bytes and the second the next 512 bytes.

However, my queue is represented by a C++ class. Using the placement new operator, how can I construct each queue object. Is the following approach correct?

Queue *q1, *q2;
void *mem = malloc( 1024 );

*q1 = new (mem) Queue;
*q2 = new (mem+512)Queue;
  • 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:24:44+00:00Added an answer on June 2, 2026 at 12:24 am

    I would do the following:

    Queue* mem = static_cast<Queue*>(malloc(2 * sizeof(Queue));
    Queue* q1 = new (mem) Queue;
    Queue* q2 = new (mem+1) Queue;
    

    If it’s important that the two queues are exactly 512 bytes from each other your original suggestion is almost correct:

    char* mem = static_cast<char*>(malloc(1024));
    Queue* q1 = new (mem) Queue;
    Queue* q2 = new (mem+512) Queue;
    

    This assumes sizeof(Queue) <= 512. The reason for the cast to char* is that pointer arithmetic with void* is illegal in C++.

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

Sidebar

Related Questions

I'm building an application which will have dynamic allocated objects of type A each
I need to have a dynamic array, so I need to allocate the necessary
I have a char device which enables access to an external SPI memory, and
I have a PHP script which is used to resize images in a user's
I have a function which is passed two structures by reference. These structures are
I have two arrays of type Region , both of size 1000, and at
I have a coordinate region that I have determined contains the limits of what
I am using NHibernate and have a cache region specified in my NHibernate configuration:
I'm using Oracle APEX and I have a report region in a page that
I have the following query: DECLARE @Region VARCHAR(MAX) SET @Region = '' SELECT @Region

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.