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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T18:38:47+00:00 2026-05-13T18:38:47+00:00

I have class with a List<int> member. If I want to clone an instance

  • 0

I have class with a List<int> member. If I want to clone an instance of this class, do I need a deep copy or the MemberwiseClone() shallow copy is enough?

We need a deep copy if at least one member is a reference to an object, right? Does that mean having List, DateTime, String, MyClass, …, will need a deep copy?

  • 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-13T18:38:47+00:00Added an answer on May 13, 2026 at 6:38 pm

    This entirely depends on how you plan to use the copy.

    If you do a shallow copy like

    List<int> x = new List<int>() { 1, 2, 3, 4, 5 };
    List<int> y = x;
    y[2] = 4;
    

    Then x will contain {1, 2, 4, 4, 5 }

    If you do a deep copy of the list:

    List<int> x = new List<int> { 1, 2, 3, 4, 5 };
    List<int> y = new List<int>(x);
    y[2] = 4;
    

    Then x will contain { 1, 2, 3, 4, 5 } and y will contain { 1, 2, 4, 4, 5 }

    How you plan on using the copy really determines whether you use shallow or deep copies.

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

Sidebar

Related Questions

Consider this simplified example: #include <list> typedef std::list<int> IntList; class KindaIntList { public: IntList::const_iterator
I have a class with member functions that require a boost::unique_lock be acquired on
I believe this is an AutoMapper basics question: I have an single article Entity
suppose you have a class Product, with members that are declared as nested type
I have created the following type using implicit type construction: open System type Matrix(sourceMatrix:double[,])
I'm experimenting with CUDA and I ran into a very strange bug. I have
i'm new to c++ and have been trying to implement the bellman ford algorithm,
Sorry, if the question does not clarify exactly what i need....Please read ahead for
Is this possible? If so, I can't seem to get the syntax right. (C++
I haven't used pointers in over 3 years and I am very rusty on

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.