如何在Java中使用共享数据创建两个数组

Question

First the reason I need to do this is because of the API in Apache's Commons StringUtils method:

StringUtils.replaceEach(String text, String[] searchList, String[] replacementList) 

What I want to do is replace all the HTML special character encodings with the actual special character, which means that the searchList and replacementList arrays will be pretty large. How can I do this in an easy to read and maintain way?

Yes I could create two arrays but if I do this then it will be very easy to make mistakes. How do I know I'm not missing a special encoding, that I have the right position, etc. I would much rather have code where the encoding and the character are side by side to avoid any errors. I looked at a HashMap but then you can only get the keys (encodings) and have to loop through to get the character values, which is not very performant, especially not if it's going to be run a lot. The same is true with a two dimensional array that you have to split each run.

Answer 1

What type of performance are you aiming for? If you're looking to replace HTML special characters, can you not cache the result of splitting a HashMap of encodings to special characters in two static final variables of some sort? This will still require you to commit to the overhead of processing a HashMap, but saving the result prevents you from running the procedure every call. Something like this:

import java.util.HashMap;
import java.util.Map;

class MyStringReplaceCLass {
  private static final String[] encodings;
  private static final String[] specialCharacters;

  static {
      HashMap<String, String> characterEncoding = new HashMap<String, String>();
      characterEncoding.put("...", "...");
      characterEncoding.put("...", "...");

      // Put other encodings here as necessary

      encodings = new String[characterEncoding.size()];
      specialCharacters = new String[characterEncoding.size()];

      Map.Entry<String, String>[] entries = characterEncoding.entrySet();

      for (int i = 0; i < entries.length; i++) {
          encodings[i] = entries[i].getKey();
          specialCharacters[i] = entries[i].getValue();
      }
  }

  public String replaceEachEncoding(String text) {
      return StringUtils.replaceEach(String text, String[] searchList, String[] replacementList);
  }
}

From here, you can call

MyStringReplaceClass.replaceEachEncoding(myText)

I'm not entirely sure if this meets your requirements exactly, but I feel a map of some sort with light processing would be the cleanest solution.

Answer 2

Say for text length of N, number of special characters M, searchList length of K. With HashMap, numbers of compares=N*K and number of exchanges M.

For performance, 1. you may create a Tag for your search/replacement list. Then scan though text and Tag each entry (record the indices). N compares. 2. Now you have M indices to replace with K possible characters. Compares = M K. Exchanges M. Compares N + M K < N*K. Exchanges M

Hope it helps!