import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
private static String guessSeparator(final ResourceBundleImpl resourceBundle) {
  final TIntLongHashMap charCounts = new TIntLongHashMap();
  for (PropertiesFile propertiesFile : resourceBundle.getPropertiesFiles()) {
    if (propertiesFile == null) continue;
    List<IProperty> properties = propertiesFile.getProperties();
    for (IProperty property : properties) {
      String key = property.getUnescapedKey();
      if (key == null) continue;
      for (int i =0; i<key.length(); i++) {
        char c = key.charAt(i);
        if (!Character.isLetterOrDigit(c)) {
          charCounts.put(c, charCounts.get(c) + 1);
        }
      }
    }
  }

  final char[] mostProbableChar = new char[]{'.'};
  charCounts.forEachKey(new TIntProcedure() {
    long count = -1;
    public boolean execute(int ch) {
      long charCount = charCounts.get(ch);
      if (charCount > count) {
        count = charCount;
        mostProbableChar[0] = (char)ch;
      }
      return true;
    }
  });
  if (mostProbableChar[0] == 0) {
    mostProbableChar[0] = '.';
  }
  return Character.toString(mostProbableChar[0]);
}
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
 * Clones the underlying trove collection and returns the clone wrapped in a new
 * decorator instance.  This is a shallow clone except where primitives are
 * concerned.
 *
 * @return a copy of the receiver
 */
public TIntLongHashMapDecorator clone() {
    try {
        TIntLongHashMapDecorator copy = (TIntLongHashMapDecorator) super.clone();
        copy._map = (TIntLongHashMap)_map.clone();
        return copy;
    } catch (CloneNotSupportedException e) {
        // assert(false);
        throw new InternalError(); // we are cloneable, so this does not happen
    }
}
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
public void readExternal(ObjectInput in)
    throws IOException, ClassNotFoundException {

    // VERSION
    in.readByte();

    // MAP
    _map = (TIntLongHashMap) in.readObject();
}
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
 * Creates a wrapper that decorates the specified primitive map.
 */
public TIntLongHashMapDecorator(TIntLongHashMap map) {
    super();
    this._map = map;
}
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
 * Returns a reference to the map wrapped by this decorator.
 */
public TIntLongHashMap getMap() {
    return _map;
}
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
    * Creates a wrapper that decorates the specified primitive map.
    */
   public TIntLongHashMapDecorator(TIntLongHashMap map) {
super();
this._map = map;
   }
 

import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
private static String guessSeparator(final Project project, final VirtualFile file) {
  Collection<PropertiesFile> files;
  if (file instanceof ResourceBundleAsVirtualFile) {
    files = ((ResourceBundleAsVirtualFile)file).getResourceBundle().getPropertiesFiles(project);
  }
  else {
    PsiManager psiManager = PsiManager.getInstance(project);
    final FileViewProvider provider = psiManager.findViewProvider(file);
    files = new SmartList<PropertiesFile>();
    if (provider != null) {
      ContainerUtil.addIfNotNull((PropertiesFile)provider.getPsi(PropertiesLanguage.INSTANCE), files);
    }
  }
  final TIntLongHashMap charCounts = new TIntLongHashMap();
  for (PropertiesFile propertiesFile : files) {
    if (propertiesFile == null) continue;
    List<IProperty> properties = propertiesFile.getProperties();
    for (IProperty property : properties) {
      String key = property.getUnescapedKey();
      if (key == null) continue;
      for (int i =0; i<key.length(); i++) {
        char c = key.charAt(i);
        if (!Character.isLetterOrDigit(c)) {
          charCounts.put(c, charCounts.get(c) + 1);
        }
      }
    }
  }

  final char[] mostProbableChar = new char[]{'.'};
  charCounts.forEachKey(new TIntProcedure() {
    long count = -1;
    public boolean execute(int ch) {
      long charCount = charCounts.get(ch);
      if (charCount > count) {
        count = charCount;
        mostProbableChar[0] = (char)ch;
      }
      return true;
    }
  });
  if (mostProbableChar[0] == 0) {
    mostProbableChar[0] = '.';
  }
  return Character.toString(mostProbableChar[0]);
}