nav[aria-label="Primary Navigation"] { padding: 0; & ul { list-style: none; width: 100%; display: flex; flex-direction: row; justify-content: start; align-items: start; gap: 30px; padding: 0; & li { margin: 0; } & ul li { list-style: none; } } }

Child Item

Java code question

Pelvis

Can someone perhaps explain the following to me? My confusion is mainly around the else statement, in that it initialises an empty HashSet and adds this HashSet to the Map, but calling values.add(sToAdd) after the fact seems to updated the entries map anyway?

import java.util.Collections;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;

public class Entries {
	
	private Map<Integer, Set<String>> entries = null;
	
	Entries(){ 
		this.entries = Collections.synchronizedMap(new TreeMap<Integer, Set<String>>());
		}
	
	final void add(String sToAdd){
		
		Set<String> values;
		if (this.entries.containsKey(1)) {
			values = this.entries.get(1);
		} else {
			values = new HashSet<String>();
			this.entries.put(1, values);
		}
		values.add(sToAdd);
	}
	
	public static void main(String[] args) {
		
		Entries e = new Entries();

		e.add("First entry");
		
		System.out.println(e.entries.toString());
	}

}

Find more posts tagged with

Quick Links

Comments

Rulmeq

They have a Map that contains sets that use an integer as the key.

To add a value to the set, they first need to check if the set already exist for that key, if it does they update that (they could do this inline instaed of declaring the set outside the block, but each to their own style). If it does not exist, then they create a new set, put the value into that, and then add that new set to the map using the key.

Not sure why they are doing any of this though, because they only ever use one key 1, so there's no benefit to having a map at all.

Pelvis

I wrote the code myself but it's based on a class I was reviewing that was confusing me, so just wanted my own version to run through it. I was using 1 as a key just to see if it would overwrite an existing value with the new value. (it doesn't).

Rulmeq wrote: »

If it does not exist, then they create a new set, put the value into that, and then add that new set to the map using the key.

This is the bit that confuses me, as from my reading of the code, it adds the newly created set to the entries map, before putting the value into it. The value is added after, but yet entries is still updated. It doesn't make sense to me.

if (this.entries.containsKey(1)) {
	values = this.entries.get(1);
} else {
	values = new HashSet<String>();
	this.entries.put(1, values); [B]//values is empty???[/B]
}
values.add(sToAdd);[B] //string is added to the new set here, AFTER calling entries.put(). [/B]

Rulmeq

Pelvis wrote: »

This is the bit that confuses me, as from my reading of the code, it adds the newly created set to the entries map, before putting the value into it. The value is added after, but yet entries is still updated. It doesn't make sense to me.

Ah, so you need to back up the horse a little bit here. You need to understand how java references objects.

Maybe start here (although this isn't quite what you're asking, if you grok it, it should give you the basis of your answer)

https://javaranch.com/campfire/StoryCups.jsp
https://javaranch.com/campfire/StoryPassBy.jsp

Pelvis

I'm an idiot! Thanks