Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
How TreeMap does what it does.
I just tried to use the new version of TreeMap. Frustrated until I figured out that value V is a shallow copy. In my example, the problem cleared up when I used a different explicitly constructed iterator. In the same example, keyword K was a string literal inside each TreeMap.put(). This is not the way I will use in my intended "real" program. Is Keyword K also a shallow copy?
TIA,
Re: How TreeMap does what it does.
Map's don't hold copies, they hold references to the objects placed within the Map. I recommend you post an SSCCE demonstrating the problem you are experiencing and the behavior you want to shed more light on the subject.
Re: How TreeMap does what it does.
The 'new version' of TreeMap?
Reply With Quote
Related threads:
