本文整理汇总了Java中it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap类的典型用法代码示例。如果您正苦于以下问题:Java Int2LongOpenHashMap类的具体用法?Java Int2LongOpenHashMap怎么用?Java Int2LongOpenHashMap使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
Int2LongOpenHashMap类属于it.unimi.dsi.fastutil.ints包,在下文中一共展示了Int2LongOpenHashMap类的11个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: phase3
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
public void phase3(int id) {
Map<Integer, Int2LongMap> h = JCL_FacadeImpl.GetHashMap(String.valueOf(id));
Int2LongMap result = new Int2LongOpenHashMap();
for (Int2LongMap m : h.values()) {
for (int i : m.keySet()) {
if (result.containsKey(i)) {
long j = m.get(i) + result.get(i);
result.put(i, j);
} else {
result.put(i, m.get(i));
}
}
m.clear();
}
long freqT = 0;
for (Long v : result.values())
freqT += v;
System.err.println("ID: " + id + " size: " + result.size() + " freqT: " + freqT);
h.clear();
h.put(id, result);
// result.clear();
// result = null;
}
开发者ID:AndreJCL,项目名称:JCL,代码行数:25,代码来源:Sorting.java
示例2: findParent
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
/**
* Find the parent entity for each.
*
* @param parents Parent counter map
* @param parent Parent storage (output)
* @param cnt Count storage (output)
*/
private void findParent(Int2LongOpenHashMap[] parents, int[] parent, long[] cnt) {
parent[0] = 0;
cnt[0] = Long.MAX_VALUE;
for(int i = 1; i < parents.length; i++) {
int best = i;
long total = 0, bcount = -1;
for(Int2LongMap.Entry p : parents[i].int2LongEntrySet()) {
final long c = p.getLongValue();
total += c;
if(c > bcount || (c == bcount && c < best)) {
bcount = c;
best = p.getIntKey();
}
}
cnt[i] = total;
parent[i] = best;
}
}
开发者ID:kno10,项目名称:reversegeocode,代码行数:26,代码来源:BuildLayeredIndexSliced.java
示例3: FFMStringFeatureMapModel
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
public FFMStringFeatureMapModel(@Nonnull FFMHyperParameters params) {
super(params);
this._w0 = 0.f;
this._map = new Int2LongOpenHashMap(DEFAULT_MAPSIZE);
_map.defaultReturnValue(-1L);
this._buf = new HeapBuffer(HeapBuffer.DEFAULT_CHUNK_SIZE);
this._freelistW = new LongArrayList();
this._freelistV = new LongArrayList();
this._initV = true;
this._removedV = new RoaringBitmap();
this._numFields = params.numFields;
this._entrySizeW = entrySize(1, _useFTRL, _useAdaGrad);
this._entrySizeV = entrySize(_factor, _useFTRL, _useAdaGrad);
}
开发者ID:apache,项目名称:incubator-hivemall,代码行数:15,代码来源:FFMStringFeatureMapModel.java
示例4: buildInputDataPartitionSchema
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
private String buildInputDataPartitionSchema(List<JCL_result> r, int numOfJCLThreads){
IntSet sorted = new IntAVLTreeSet();
long totalF=0;
Int2LongMap map = new Int2LongOpenHashMap();
for(JCL_result oneR:r){
try{
@SuppressWarnings("unchecked")
List<String> l = (List<String>) oneR.getCorrectResult();
for(String s : l){
String[] args = s.split(":");
int key = Integer.parseInt(args[0]); long freq = Long.parseLong(args[1]);
sorted.add(key);
if(map.containsKey(key)){
freq+=map.get(key);
totalF+=map.get(key);
} else totalF+=freq;
map.put(key, freq);
}
}catch(Exception e){}
}
long load=0; int b; String result = "";
for(int ac:sorted){
load += map.get(ac);
if(load > (totalF/(numOfJCLThreads))){
b=ac;
result += b + ":";
load=0;
}
}
return result;
}
开发者ID:AndreJCL,项目名称:JCL,代码行数:41,代码来源:Main.java
示例5: flatten
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
/**
* Flatten another layers onto a slice.
*
* @param slice Output slice
* @param layer Input layer
* @param parents Parents map
* @param meta Reduce metadata
* @param viewport Viewport
*/
private void flatten(int[][] slice, int[][] layer, Int2LongOpenHashMap[] parents, Viewport viewport) {
// Count the most frequent parent for each entity.
for(int y = 0; y < viewport.height; y++) {
final int[] rowy = layer[y], outy = slice[y];
for(int x = 0; x < viewport.width; x++) {
int id = rowy[x] & 0x00FF_FFFF; // top byte is alpha!
if(id == 0) {
continue;
}
parents[id].addTo(outy[x], 1);
outy[x] = id;
}
}
}
开发者ID:kno10,项目名称:reversegeocode,代码行数:24,代码来源:BuildLayeredIndexSliced.java
示例6: createSplitsGreedy
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
void createSplitsGreedy(Map<String, Set<OneBlockInfo>> nodeToBlocks,
Map<OneBlockInfo, String[]> blockToNodes,
Map<String, List<OneBlockInfo>> rackToBlocks,
long totLength,
int num,
long minSizeNode,
long minSizeRack,
List<InputSplit> splits) {
List<OneBlockInfo> blocks = new ArrayList<>(blockToNodes.keySet());
Collections.sort(blocks, new Comparator<OneBlockInfo>() {
@Override
public int compare(OneBlockInfo o1, OneBlockInfo o2) {
return -(int) (o1.length - o2.length);
}
});
Int2LongOpenHashMap loads = new Int2LongOpenHashMap();
Map<Integer, ArrayList<OneBlockInfo>> parts = new HashMap<>();
Map<Integer, Set<String>> locations = new HashMap<>();
// long num = totLength / maxSize;
for (int i = 0; i < num; i ++) {
parts.put(i, new ArrayList<OneBlockInfo>());
locations.put(i, new HashSet<String>());
}
for (OneBlockInfo blockInfo : blocks) {
long min = Long.MAX_VALUE;
int selectPart = -1;
for (int s = 0; s < num; s ++) {
if (loads.get(s) < min) {
min = loads.get(s);
selectPart = s;
}
}
loads.addTo(selectPart, blockInfo.length);
parts.get(selectPart).add(blockInfo);
for (String host : blockInfo.hosts)
locations.get(selectPart).add(host);
}
for (Map.Entry<Integer, ArrayList<OneBlockInfo>> entry: parts.entrySet()) {
addCreatedSplit(splits, locations.get(entry.getKey()), entry.getValue());
}
}
开发者ID:Tencent,项目名称:angel,代码行数:50,代码来源:BalanceInputFormat.java
示例7: phase1
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
public List<String> phase1(int id, String name, int numJCLThreads) {
Int2LongMap values = new Int2LongOpenHashMap(1000000);
long totalF = 0;
System.err.println("file: " + name);
try {
File f = new File("../" + name + "/" + name + ".bin");
InputStream in = new BufferedInputStream(new FileInputStream(f));
FastBufferedInputStream fb = new FastBufferedInputStream(in);
byte[] i = new byte[4];
while (fb.read(i) == 4) {
int k = java.nio.ByteBuffer.wrap(i).getInt();
if (!values.containsKey(k))
values.put(k, 1);
else {
long aux = values.get(k);
aux++;
values.put(k, aux);
}
totalF++;
}
fb.close();
in.close();
// primeira modificacao
//for (long v : values.values())
// totalF += v;
IntSet sorted = new IntAVLTreeSet(values.keySet());
long acumula = 0;
int b = 0;
List<String> result = new LinkedList<>();
long blinha = 0;
int last = 0;
for (int ac : sorted) {
blinha = values.get(ac);
acumula += blinha;
if (acumula > (totalF / (numJCLThreads))) {
b = ac;
result.add(b + ":" + acumula);
acumula = 0;
}
last = ac;
}
// segunda modificacao
if(acumula != 0) result.add(last + ":" + acumula);
JCL_facade jcl = JCL_FacadeImpl.getInstanceLambari();
jcl.instantiateGlobalVar(id, values);
sorted.clear();
sorted = null;
return result;
} catch (Exception e) {
e.printStackTrace();
return null;
}
}
开发者ID:AndreJCL,项目名称:JCL,代码行数:59,代码来源:Sorting.java
示例8: phase2
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
public void phase2(int id, int numJCLThreads, String schema) {
JCL_facade jcl = JCL_FacadeImpl.getInstanceLambari();
Int2LongMap sorted = (Int2LongMap) jcl.getValue(id).getCorrectResult();
jcl.deleteGlobalVar(id);
String[] chunks = schema.split(":");
int i = 0;
Int2LongMap[] finais = new Int2LongMap[numJCLThreads];
for (int r = 0; r < numJCLThreads; r++)
finais[r] = new Int2LongOpenHashMap();
for (int ii : sorted.keySet()) {
i = 0;
if (ii >= Integer.parseInt(chunks[chunks.length - 1]))
finais[numJCLThreads - 1].put(ii, sorted.get(ii));
else {
if (ii < Integer.parseInt(chunks[0]))
finais[0].put(ii, sorted.get(ii));
else {
tag: {
for (int k = 1; k < chunks.length; k++) {
if (Integer.parseInt(chunks[i]) <= ii && ii < Integer.parseInt(chunks[k])) {
finais[i + 1].put(ii, sorted.get(ii));
break tag;
}
i++;
}
}
}
}
}
for (int r = 0; r < numJCLThreads; r++) {
if(!finais[r].isEmpty()) {
JCL_map<Integer, Int2LongMap> h = new JCLHashMap<>(String.valueOf(r));
h.put(id, finais[r]);
long fT = 0;
for (long kk : finais[r].values())
fT += kk;
System.err.println(finais[r].size() + ":" + fT + " phase 2 putting in jcl - thread id " + r);
finais[r].clear();
finais[r] = null;
}
}
sorted.clear();
sorted = null;
chunks = null;
}
开发者ID:AndreJCL,项目名称:JCL,代码行数:47,代码来源:Sorting.java
示例9: int2LongMap
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
public static Int2LongMap int2LongMap() {
return new Int2LongOpenHashMap();
// return new Int2LongAVLTreeMap();
}
开发者ID:besil,项目名称:AuroraGraphManager,代码行数:5,代码来源:MapFactory.java
示例10: LongVector
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
/**
* Create a new vector with default size.
*/
public LongVector() {
initialize(Int2LongOpenHashMap.DEFAULT_INITIAL_SIZE);
}
开发者ID:renato2099,项目名称:giraph-gora,代码行数:7,代码来源:LongVector.java
示例11: initialize
import it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap; //导入依赖的package包/类
/**
* Initialize the values of the vector. The default value is 0.0
*
* @param size the size of the vector
*/
private void initialize(int size) {
entries = new Int2LongOpenHashMap(size);
entries.defaultReturnValue(0L);
}
开发者ID:renato2099,项目名称:giraph-gora,代码行数:10,代码来源:LongVector.java
注:本文中的it.unimi.dsi.fastutil.ints.Int2LongOpenHashMap类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论