本文整理了Java中gnu.trove.map.TIntIntMap.adjustOrPutValue()
方法的一些代码示例,展示了TIntIntMap.adjustOrPutValue()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TIntIntMap.adjustOrPutValue()
方法的具体详情如下:
包路径:gnu.trove.map.TIntIntMap
类名称:TIntIntMap
方法名:adjustOrPutValue
[英]Adjusts the primitive value mapped to the key if the key is present in the map. Otherwise, the initial_value is put in the map.
[中]如果映射中存在键,则调整映射到该键的基本体值。否则,初始_值将被放入映射中。
代码示例来源:origin: opentripplanner/OpenTripPlanner
public void add (int i) {
count++;
int binVal = bins.adjustOrPutValue(i, 1, 1);
if (binVal > maxVal)
maxVal = binVal;
if (i > maxBin) {
maxBin = i;
}
if (i < minBin) {
minBin = i;
}
}
代码示例来源:origin: alibaba/mdrill
public int adjustOrPutValue( int key, int adjust_amount, int put_amount ) {
synchronized( mutex ) { return m.adjustOrPutValue( key, adjust_amount, put_amount ); }
}
代码示例来源:origin: palantir/atlasdb
private synchronized void incrementReadCount(int clientIndex) {
if (readLockHolders == null) {
readLockHolders = new TIntIntHashMap(1);
}
readLockHolders.adjustOrPutValue(clientIndex, 1, 1);
}
代码示例来源:origin: com.conveyal/r5
public void add (int i) {
count++;
int binVal = bins.adjustOrPutValue(i, 1, 1);
if (binVal > maxVal)
maxVal = binVal;
if (i > maxBin) {
maxBin = i;
}
if (i < minBin) {
minBin = i;
}
}
代码示例来源:origin: conveyal/r5
public void add (int i) {
count++;
int binVal = bins.adjustOrPutValue(i, 1, 1);
if (binVal > maxVal)
maxVal = binVal;
if (i > maxBin) {
maxBin = i;
}
if (i < minBin) {
minBin = i;
}
}
代码示例来源:origin: net.sf.trove4j/trove4j
public int adjustOrPutValue( int key, int adjust_amount, int put_amount ) {
synchronized( mutex ) { return m.adjustOrPutValue( key, adjust_amount, put_amount ); }
}
代码示例来源:origin: com.palantir.patches.sourceforge/trove3
@Override
public int adjustOrPutValue( int key, int adjust_amount, int put_amount ) {
synchronized( mutex ) { return m.adjustOrPutValue( key, adjust_amount, put_amount ); }
}
代码示例来源:origin: hernad/easyrec
public int adjustOrPutValue( int key, int adjust_amount, int put_amount ) {
synchronized( mutex ) { return m.adjustOrPutValue( key, adjust_amount, put_amount ); }
}
代码示例来源:origin: net.sf.trove4j/core
public int adjustOrPutValue( int key, int adjust_amount, int put_amount ) {
synchronized( mutex ) { return m.adjustOrPutValue( key, adjust_amount, put_amount ); }
}
代码示例来源:origin: de.lmu.ifi.dbs.elki/elki
@Override
public void increment(DBIDRef id, int adjust) {
map.adjustOrPutValue(DBIDUtil.asInteger(id), adjust, adjust);
}
代码示例来源:origin: shilad/wikibrain
/**
* Counts words that have not been normalized. I.e. the separators between words
* are those traditionally found in plain text.
*
* @param text
*/
public void countRawText(String text) {
// Count and extract mentions if necessary.
if (containsMentions) {
Matcher m = PATTERN_MENTION.matcher(text);
while (m.find()) {
int wpId = Integer.valueOf(m.group(3));
synchronized (mentionCounts) {
mentionCounts.adjustOrPutValue(wpId, 1, 1);
}
}
text = PATTERN_MENTION.matcher(text).replaceAll("$1 ");
}
countWords(tokenizer.getWords(language, text));
}
代码示例来源:origin: shilad/wikibrain
int wpId = Integer.valueOf(m.group(3));
synchronized (mentionCounts) {
mentionCounts.adjustOrPutValue(wpId, 1, 1);
代码示例来源:origin: shilad/wikibrain
for (KnownSim ks : mostSim) {
if (ks.wpId1 >= 0) {
int n = idCounts.adjustOrPutValue(ks.wpId1, 1, 1);
if (n > maxIdCount) {
maxIdCount = n;
代码示例来源:origin: shilad/wikibrain
@Override
public SRResultList mostSimilar(int pageId, int maxResults, TIntSet validIds) throws DaoException {
TIntIntMap scores = new TIntIntHashMap();
for (int id : getLinks(pageId, true)) {
if (validIds == null || validIds.contains(id)) scores.adjustOrPutValue(id, 1, 1);
}
for (int id : getLinks(pageId, false)) {
if (validIds == null || validIds.contains(id)) scores.adjustOrPutValue(id, 1, 1);
}
Leaderboard leaderboard = new Leaderboard(maxResults);
for (int id : scores.keys()) {
leaderboard.tallyScore(id, scores.get(id) / 2.0);
}
return normalize(leaderboard.getTop());
}
代码示例来源:origin: org.wikibrainapi/wikibrain-pageview
@Override
public TIntIntMap getAllViews(Language language, DateTime startDate, DateTime endDate) throws DaoException {
DSLContext context = getJooq();
Timestamp startTime = new Timestamp(startDate.getMillis());
Timestamp endTime = new Timestamp(endDate.getMillis());
try {
Cursor<Record> result = context.select().
from(Tables.PAGEVIEW).
where(Tables.PAGEVIEW.LANG_ID.eq(language.getId())).
and(Tables.PAGEVIEW.TSTAMP.between(startTime, endTime)).
fetchLazy(getFetchSize());
TIntIntMap views = new TIntIntHashMap(
gnu.trove.impl.Constants.DEFAULT_CAPACITY,
gnu.trove.impl.Constants.DEFAULT_LOAD_FACTOR,
-1, -1);
for (Record record : result){
views.adjustOrPutValue(
record.getValue(Tables.PAGEVIEW.PAGE_ID),
record.getValue(Tables.PAGEVIEW.NUM_VIEWS),
record.getValue(Tables.PAGEVIEW.NUM_VIEWS));
}
return views;
} finally {
freeJooq(context);
}
}
代码示例来源:origin: shilad/wikibrain
@Override
public TIntIntMap getAllViews(Language language, DateTime startDate, DateTime endDate) throws DaoException {
DSLContext context = getJooq();
Timestamp startTime = new Timestamp(startDate.getMillis());
Timestamp endTime = new Timestamp(endDate.getMillis());
try {
Cursor<Record> result = context.select().
from(Tables.PAGEVIEW).
where(Tables.PAGEVIEW.LANG_ID.eq(language.getId())).
and(Tables.PAGEVIEW.TSTAMP.between(startTime, endTime)).
fetchLazy(getFetchSize());
TIntIntMap views = new TIntIntHashMap(
gnu.trove.impl.Constants.DEFAULT_CAPACITY,
gnu.trove.impl.Constants.DEFAULT_LOAD_FACTOR,
-1, -1);
for (Record record : result){
views.adjustOrPutValue(
record.getValue(Tables.PAGEVIEW.PAGE_ID),
record.getValue(Tables.PAGEVIEW.NUM_VIEWS),
record.getValue(Tables.PAGEVIEW.NUM_VIEWS));
}
return views;
} finally {
freeJooq(context);
}
}
代码示例来源:origin: shilad/wikibrain
@Override
public SRResultList mostSimilar(TIntFloatMap query, int maxResults, TIntSet validIds) throws IOException {
TIntIntMap intersections = new TIntIntHashMap();
for (int id1 : query.keys()){
SparseMatrixRow row = transpose.getRow(id1);
for (int i = 0; i < row.getNumCols(); i++) {
int id2 = row.getColIndex(i);
if (validIds == null || validIds.contains(id2)) {
intersections.adjustOrPutValue(id2, 1, 1);
}
}
}
Leaderboard leaderboard = new Leaderboard(maxResults);
for (int id: intersections.keys()) {
double sim = SimUtils.googleSimilarity(query.size(), lengths.get(id),
intersections.get(id), numPages);
leaderboard.tallyScore(id, sim);
}
return leaderboard.getTop();
}
代码示例来源:origin: de.lmu.ifi.dbs.elki/elki
sizes.adjustOrPutValue(it.next(), 1, 1);
内容来源于网络,如有侵权,请联系作者删除!