Home/ Questions/Q 7599319
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-30T22:37:57+00:00

I have a stemming algorithm in Java which requires a static final HashMap<String, String>

  • 0

I have a stemming algorithm in Java which requires a static final HashMap<String, String> pre-filled with about 30 000 records.

I need the map to keep records in the same order they are inserted (I got a hint I could use LinkedHashMap?).

I thought I could manually insert the values in the Java class file since this is the quickest way to load them in RAM (time / productivity is very important for this project) by using 30 000 calls like

map.put("Key", "Value");

The problem is, that java (or at least eclipse) allows only 65kb of code in any segment / method etc. So I ended up extending 11 classes and putting 65kb of .puts in a constructor or a static { }.

Everything was fine, but when I run it the order is scrambled. For so many rows I cannot track where did things go wrong, in the extending order or in the map.

So, please tell me what is the best way you would fill a final map in java with regards to performance.

P.S.: Loading and parsing the records from a file is far too slow…

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Everything was fine, but when I run it the order is scrambled. For so
    many rows I cannot track where did things go wrong, in the extending
    order or in the map.

    a) A HashMap doesn’t preserve insertion order. Use a LinkedHashMap instead.
    Or, since you will use it as a constant, consider a Guava ImmutableMap. It preserves insertion oder, is immutable and provides a builder object for constructing it with many values.

    b)

    P.S.: Loading the records from a file is far too slow…

    Why? It would only be done once, during class load time. And 35K String / String pairs is really not a lot of data for a modern machine.

    • 0