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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T11:48:53+00:00 2026-05-22T11:48:53+00:00

in any dictionary data structure there is an add_to_ds function which receives the data

  • 0

in any dictionary data structure there is an add_to_ds function which receives the data
needed to insert as a parameter.
the question is this:should the add_to_ds get the object it self (type T) and do the memory allocation,or should the add_to_ds get a pointer to object and just insert the pointer (type T*,whoever uses the DS does the memory allocation).

what is the right way do do it,and why ?

  • 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-22T11:48:54+00:00Added an answer on May 22, 2026 at 11:48 am

    There isn’t any generally right / wrong way to do it. If you trust the caller not to modify the memory, you’re fine storing a pointer. If, however you don’t specify this in your interface, you’ll have to duplicate the memory.

    • If you let them enter pointers, they
      will be responsible with freeing memory, not touching it etc
    • If you don’t trust them, you’ll have to free memory, you’ll have to return copies to stored items (otherwise if you return your pointer they might free it / alter it)
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Is there any data structure in C# that is like a dictionary but that
Are there any dictionary classes in the .NET base class library which allow duplicate
Lot of googling did not help me! Are there any good dictionary web based
Are there any alternatives to The CMU Pronouncing Dictionary , commercial or open source?
I need a dictionary-like data structure that stores information as follows: key [value 1]
Is TRIE the most recommended data structure while designing something like a dictionary for
I have a dictionary which I need to keep updated with incoming data, after
is there any difference between: lock((IDictionary) _collection).SyncRoot) or lock(_collection)
Wanted to write a program to implement a dictionary of words using Tries Data
I need a data structure that acts like a SortedDictionary<int, double> but is sorted

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.