HashMap , trying to get the size of the value and NOT the keys.

[Jad_Asmar]

Hello guys , I am asked in my assignment to make a program that accepts a text file as an example a novel and i have to sort each word as a PERSON or ORGANIZATION or LOCATION or O as in Other , example :
Microsoft/ORGANIZATION ,/O Nelly/PERSON !/O '/O
Now we notice that microsoft is and organitzation and "," is Other and Nelly is a person's name and so on ..

Now I am asked to return the numbers of tags in the text which is 4 in our case because we have (ORGANIZATION,PERSON,LOCATION,OTHER)

My question here is my logic true ? And since i made a map of String,String ; Is there any way that i can get the size of the values in our case the values are the organization etc.. ??
Thank you.

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
 
public class NovelDataMining {
 
	/**
	 * @param args
	 * @throws FileNotFoundException
	 */
	public static void main(String[] args) throws FileNotFoundException {
		Scanner console = new Scanner(new File(
				"C:\\Users\\User\\AppData\\Local\\Temp\\novel.txt"));
System.out.println(numberOfTags(console));
 
	}
 
	public static int numberOfTags(Scanner console) {
		Map<String, String> map = new HashMap<String, String>();
		while (console.hasNext()) {
			String nextWord = console.next();
			if(nextWord.substring(nextWord.length()-1, nextWord.length()).equalsIgnoreCase("O"))// Here we are checking if the String is of Other Type
				map.put(nextWord, "O");
			if(nextWord.substring(nextWord.length()-1, nextWord.length()).equalsIgnoreCase("PERSON"))
				map.put(nextWord, "PERSON");
			if(nextWord.substring(nextWord.length()-1, nextWord.length()).equalsIgnoreCase("ORGANIZATION"))
				map.put(nextWord, "ORGANIZATION");
			if(nextWord.substring(nextWord.length()-1, nextWord.length()).equalsIgnoreCase("LOCATION"))
				map.put(nextWord, "LOCATION");
			for (String word : map.keySet()){
 
			}
		}
		return 0;// just to remove the compliation error
	}
 
}

[Norm]

way that i can get the size of the values

What is the "size" of a value?

Should the value returned by the put() method be used?

[Jad_Asmar]

Thank you for your reply,
What I meant is that in my assignment the first question asked is " what is the number of the tags of the novel ?" and by tags i mean " Location " or "Person"...
The keys of the map are the words from the novel , and the value are the tags.
Your text file will look like this :

I/O ,/O am/O a/O table/OBJECT microsoft/ORGANIZATION george/PERSON !/O

I hope you understood what is my question here , let me know if not i will explain more.

[Norm]

Sorry, I still don't understand what you mean by "size". Can you give some examples?
For example:
"adf" has a length of 3
{1, 2, 3, 4} has a length of 4

[Jad_Asmar]

It is very simple , map.size() will give us the length of key from the HashMap , i just want the length of the values not the keys.

Here i sketched this :Untitled.jpg

[Norm]

want the length of the values not the keys.

Are you asking for how many (a count) values there are in a HashMap?
There is one value for each key.
So if you know the number of keys, there will be that number of values.

[Jad_Asmar]

The length of the keys in the picture that i attached is 6 , but the length or ( count ) of the values is 4 .
If you use map.size(); a value of 6 will be returned .
What can i code or what can i do to get the value of 4 ? Should i make a for loop that iterates over the value and increment each time or how ?!
This is getting frustrating I have no other ways of explanation honestly i give up

[Norm]

I think the number of values matches the number of keys. The keys will be unique, but it is possible for there to be duplicate values. In fact all the values could be the same so that there would only be one unique value.
A Map doesn't care about the values. If you want unique values, use a Set.

Can you make a small, simple program that compiles, executes and shows the problem?

[Cornix]

Take a look at this example code:

		Object a = new Object();
		Object b = new Object();
 
		Map<String, Object> map = new HashMap<>();
		map.put("1", a);
		map.put("2", a);
		map.put("3", a);
		map.put("4", a);
		map.put("5", b);
		map.put("6", b);
		map.put("7", b);
		map.put("8", b);
		map.put("9", b);
 
		Set<Object> set = new HashSet<>(map.values());
 
		System.out.println(set.size()); // => 2

This is one way to get the number of unique values inside a map.
There are probably many ways to get this and possibly more effective ways, but this is a very simple solution.

[Jad_Asmar]

Thank you , thank you , thank you.
You sir have made my day !

[Norm]

What about the case where adding a new key replaces an existing key?