Code Review Stack Exchange is a question and answer site for peer programmer code reviews. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have to read a line of strings and split it for whitespace:

ArrayList<HashSet<String>> setOfStrings = new ArrayList<HashSet<String>>();
while ((currentLine = bufferedReader.readLine()) != null) {
        String[] tokens = currentLine.split(" ");
        for (int i = 0; i < tokens.length; i++) {
        setOfStrings.add(new HashSet<String>(Arrays.asList(tokens[i])));

i have to do this ,and for this reason i need for each tokens a new hashSet

i need to make operations on tokens like

[afaf] -> one hashset in first position inside the arrayList
[bafafa] -> one hashset in second position inside the arrayList

with your solution ,to make a unique hashset for the tokens, i can't do separate operations for each tokens.

How can I improve the split of the currentLine and the insertion into the arrayList? As I did it, it's very slow because I first have to split and then iterate on the array of tokens. How can I optimize this operation?

share|improve this question
Why not a List for the tokens? – Marco Acierno Jun 9 '14 at 0:04
up vote 5 down vote accepted

Is the use of a Set for storing the tokens deliberate? That's because you can only have unique elements in the Set, and the output of the following code snippet will be 1, not 2:

System.out.println( new HashSet<>( Arrays.asList( "a a".split( " " ) ) ).size() );

Also, what you are doing is to store one token into a new List via Arrays.asList(), this is then iterated for elements to be stored into a new HashSet, which is finally added to setOfStrings. May we know what exactly are you trying to do here? I'll attempt to illustrate the output for the following:


a b c
d e f


    new HashSet [ "a" ]
    new HashSet [ "b" ]
    new HashSet [ "c" ]
    new HashSet [ "d" ]
    new HashSet [ "e" ]
    new HashSet [ "f" ]


After reading your comment, I think what you're looking for is this:

while ((currentLine = bufferedReader.readLine()) != null) {
    String[] tokens = currentLine.split(" ");
    setOfStrings.add(new HashSet<String>(Arrays.asList(tokens)));

You do not have to iterate through tokens... Alternative suggestion relying on the utility method from the Collections class:

while ((currentLine = bufferedReader.readLine()) != null) {
    Set<String> hashSet = new HashSet<>();
    Collections.addAll( hashSet, currentLine.split( " " ) );

Do pay attention to its Javadoc: "The behavior of this convenience method is identical to that of c.addAll(Arrays.asList(elements)), but this method is likely to run significantly faster under most implementations." :)

share|improve this answer
i need to do this,i know that the hashset can only have unique value,i want that!,i need to insert each token in a new hashset,how i can improve this operation? you didn't answer that. – OiRc Jun 9 '14 at 6:48
If that's the case then you should be looking at adding all your tokens from a line into a single HashSet instance, not to create a HashSet instance per token. – h.j.k. Jun 9 '14 at 6:53
so for example u suggest to do this setOfStrings.add(new HashSet<String>(Arrays.asList(tokens))); ? is there a way to add the tokens without converting them into an array with this Arrays.asList(tokens)) – OiRc Jun 9 '14 at 6:58
please see question update. – OiRc Jun 9 '14 at 7:20
Just to be sure we're clear on each other definitions, a line "a a" will yield two tokens after split(), and there will only be one unique value a, is that your understanding too? – h.j.k. Jun 9 '14 at 7:26

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.