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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 10, 20262026-06-10T00:08:49+00:00 2026-06-10T00:08:49+00:00

The C++ standard seems to be a bit laconic about arrays. Let’s assume that

  • 0

The C++ standard seems to be a bit laconic about arrays.

Let’s assume that I have two distinct data types: T1 and T2. I create arrays of each of them, with both arrays being of the same length N; so I have T1[N] and T2[N].

Now, does sizeof(T1[N]) == sizeof(T2[N]) imply that the successive elements of both arrays will have the same offsets?

Or, in a more practical form: if I (handling the alignment issues) cast a char[sizeof(T1[N])] both to T1* and to T2*, is it guaranteed that T1[0] and T2[1] will not overlap, and the other 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-10T00:08:50+00:00Added an answer on June 10, 2026 at 12:08 am

    Yes.

    Arrays do not have any padding or alignment on the ends, and thus sizeof(T1[N]) always equals sizeof(T1) * N.

    Knowing this, we know that sizeof(T1[N]) == sizeof(T2[N]) implies sizeof(T1) == sizeof(T2) (cancel the N on both sides). Additionally arrays must be contiguous, there is no alignment or padding inside of the array. Thus the answer to your question is yes.

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

Sidebar

Related Questions

It seems that I have more trouble getting standard Unix things to run on
It seems that in a standard Xcode project, the default target automatically updates the
I have been learning NodeJS recently. It seems to be standard in the Node
I have a user control that uses the standard if(!IsPostBack){//initialize myself} paradigm to avoid
I'm reading in binary data that might possibly consist of 64 bit floats (doubles)
XML-RPC unfortunately doesn't support 64-bit ints in the official standard. It seems there are
I am just a bit curious about the new function std::move() that has just
It seems that VS 2008 handles class templates with inheritance a bit differently from
Seems like a standard approach for an ioc when given a scenario like (C#
NHibernate Version: 2.1 I'm using what seems to be a pretty standard HttpModule approach

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.