本文整理汇总了Java中gnu.trove.TIntLongHashMap类的典型用法代码示例。如果您正苦于以下问题:Java TIntLongHashMap类的具体用法?Java TIntLongHashMap怎么用?Java TIntLongHashMap使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
TIntLongHashMap类属于gnu.trove包,在下文中一共展示了TIntLongHashMap类的7个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: guessSeparator
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]);
}
示例2: clone
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
}
}
示例3: readExternal
import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
public void readExternal(ObjectInput in)
throws IOException, ClassNotFoundException {
// VERSION
in.readByte();
// MAP
_map = (TIntLongHashMap) in.readObject();
}
示例4: TIntLongHashMapDecorator
import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
* Creates a wrapper that decorates the specified primitive map.
*/
public TIntLongHashMapDecorator(TIntLongHashMap map) {
super();
this._map = map;
}
示例5: getMap
import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
* Returns a reference to the map wrapped by this decorator.
*/
public TIntLongHashMap getMap() {
return _map;
}
示例6: TIntLongHashMapDecorator
import gnu.trove.TIntLongHashMap; //导入依赖的package包/类
/**
* Creates a wrapper that decorates the specified primitive map.
*/
public TIntLongHashMapDecorator(TIntLongHashMap map) {
super();
this._map = map;
}
示例7: guessSeparator
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]);
}