本文整理汇总了Java中edu.stanford.nlp.util.MutableInteger类的典型用法代码示例。如果您正苦于以下问题:Java MutableInteger类的具体用法?Java MutableInteger怎么用?Java MutableInteger使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
MutableInteger类属于edu.stanford.nlp.util包,在下文中一共展示了MutableInteger类的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: toString
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
@SuppressWarnings("unchecked")
public String toString(NumberFormat nf, String preAppend, String postAppend, String keyValSeparator, String itemSeparator) {
StringBuilder sb = new StringBuilder();
sb.append(preAppend);
List<E> list = new ArrayList<E>(map.keySet());
try {
Collections.sort((List)list); // see if it can be sorted
} catch (Exception e) {
}
for (Iterator<E> iter = list.iterator(); iter.hasNext();) {
Object key = iter.next();
MutableInteger d = map.get(key);
sb.append(key + keyValSeparator);
sb.append(nf.format(d));
if (iter.hasNext()) {
sb.append(itemSeparator);
}
}
sb.append(postAppend);
return sb.toString();
}
示例2: leftEdge
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static boolean leftEdge(Tree t, Tree t1, MutableInteger i) {
if (t == t1) {
return true;
} else if (t1.isLeaf()) {
int j = t1.yield().size(); // so that empties don't add size
i.set(i.intValue() + j);
return false;
} else {
Tree[] kids = t1.children();
for (int j = 0, n = kids.length; j < n; j++) {
if (leftEdge(t, kids[j], i)) {
return true;
}
}
return false;
}
}
示例3: rightEdge
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static boolean rightEdge(Tree t, Tree t1, MutableInteger i) {
if (t == t1) {
return true;
} else if (t1.isLeaf()) {
int j = t1.yield().size(); // so that empties don't add size
i.set(i.intValue() - j);
return false;
} else {
Tree[] kids = t1.children();
for (int j = kids.length - 1; j >= 0; j--) {
if (rightEdge(t, kids[j], i)) {
return true;
}
}
return false;
}
}
示例4: getTerminal
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static Tree getTerminal(Tree tree, MutableInteger i, int n) {
if (i.intValue() == n) {
if (tree.isLeaf()) {
return tree;
} else {
return getTerminal(tree.children()[0], i, n);
}
} else {
if (tree.isLeaf()) {
i.set(i.intValue() + tree.yield().size());
return null;
} else {
Tree[] kids = tree.children();
for (int j = 0; j < kids.length; j++) {
Tree result = getTerminal(kids[j], i, n);
if (result != null) {
return result;
}
}
return null;
}
}
}
示例5: getPreTerminal
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static Tree getPreTerminal(Tree tree, MutableInteger i, int n) {
if (i.intValue() == n) {
if (tree.isPreTerminal()) {
return tree;
} else {
return getPreTerminal(tree.children()[0], i, n);
}
} else {
if (tree.isPreTerminal()) {
i.set(i.intValue() + tree.yield().size());
return null;
} else {
Tree[] kids = tree.children();
for (int j = 0; j < kids.length; j++) {
Tree result = getPreTerminal(kids[j], i, n);
if (result != null) {
return result;
}
}
return null;
}
}
}
示例6: indexSpans
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
/**
* Assigns span indices (BeginIndexAnnotation and EndIndexAnnotation) to all nodes in a tree.
* The beginning index is equivalent to the IndexAnnotation of the first leaf in the constituent.
* The end index is equivalent to the first integer after the IndexAnnotation of the last leaf in the constituent.
* @param startIndex Begin indexing at this value
*/
public Pair<Integer, Integer> indexSpans(MutableInteger startIndex) {
int start = Integer.MAX_VALUE;
int end = Integer.MIN_VALUE;
if(isLeaf()){
start = startIndex.intValue();
end = startIndex.intValue() + 1;
startIndex.incValue(1);
} else {
for (Tree kid : children()) {
Pair<Integer, Integer> span = kid.indexSpans(startIndex);
if(span.first < start) start = span.first;
if(span.second > end) end = span.second;
}
}
CoreMap afl = (CoreMap) label();
afl.set(BeginIndexAnnotation.class, start);
afl.set(EndIndexAnnotation.class, end);
return new Pair<Integer, Integer>(start, end);
}
示例7: getTerminal
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static Tree getTerminal(Tree tree, MutableInteger i, int n) {
if (i.intValue() == n) {
if (tree.isLeaf()) {
return tree;
} else {
return getTerminal(tree.children()[0], i, n);
}
} else {
if (tree.isLeaf()) {
i.set(i.intValue() + tree.yield().size());
return null;
} else {
for (Tree kid : tree.children()) {
Tree result = getTerminal(kid, i, n);
if (result != null) {
return result;
}
}
return null;
}
}
}
示例8: getPreTerminal
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static Tree getPreTerminal(Tree tree, MutableInteger i, int n) {
if (i.intValue() == n) {
if (tree.isPreTerminal()) {
return tree;
} else {
return getPreTerminal(tree.children()[0], i, n);
}
} else {
if (tree.isPreTerminal()) {
i.set(i.intValue() + tree.yield().size());
return null;
} else {
for (Tree kid : tree.children()) {
Tree result = getPreTerminal(kid, i, n);
if (result != null) {
return result;
}
}
return null;
}
}
}
示例9: indexSpans
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
/**
* Assigns span indices (BeginIndexAnnotation and EndIndexAnnotation) to all nodes in a tree.
* The beginning index is equivalent to the IndexAnnotation of the first leaf in the constituent.
* The end index is equivalent to the first integer after the IndexAnnotation of the last leaf in the constituent.
* @param startIndex Begin indexing at this value
*/
public Pair<Integer, Integer> indexSpans(MutableInteger startIndex) {
int start = Integer.MAX_VALUE;
int end = Integer.MIN_VALUE;
if(isLeaf()){
start = startIndex.intValue();
end = startIndex.intValue() + 1;
startIndex.incValue(1);
} else {
for (Tree kid : children()) {
Pair<Integer, Integer> span = kid.indexSpans(startIndex);
if(span.first < start) start = span.first;
if(span.second > end) end = span.second;
}
}
CoreLabel afl = (CoreLabel) label();
afl.set(CoreAnnotations.BeginIndexAnnotation.class, start);
afl.set(CoreAnnotations.EndIndexAnnotation.class, end);
return new Pair<Integer, Integer>(start, end);
}
示例10: indexSpans
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
/**
* Assigns span indices (BeginIndexAnnotation and EndIndexAnnotation) to all nodes in a tree.
* The beginning index is equivalent to the IndexAnnotation of the first leaf in the constituent.
* The end index is equivalent to the first integer after the IndexAnnotation of the last leaf in the constituent.
* @param startIndex Begin indexing at this value
*/
public Pair<Integer, Integer> indexSpans(MutableInteger startIndex) {
int start = Integer.MAX_VALUE;
int end = Integer.MIN_VALUE;
if(isLeaf()){
start = startIndex.intValue();
end = startIndex.intValue() + 1;
startIndex.incValue(1);
} else {
for (Tree kid : children()) {
Pair<Integer, Integer> span = kid.indexSpans(startIndex);
if(span.first < start) start = span.first;
if(span.second > end) end = span.second;
}
}
CoreLabel afl = (CoreLabel) label();
afl.set(BeginIndexAnnotation.class, start);
afl.set(EndIndexAnnotation.class, end);
return new Pair<Integer, Integer>(start, end);
}
示例11: leftEdge
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
static boolean leftEdge(Tree t, Tree t1, MutableInteger i) {
if (t == t1) {
return true;
} else if (t1.isLeaf()) {
int j = t1.yield().size(); // so that empties don't add size
i.set(i.intValue() + j);
return false;
} else {
for (Tree kid : t1.children()) {
if (leftEdge(t, kid, i)) {
return true;
}
}
return false;
}
}
示例12: toString
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
@SuppressWarnings("unchecked")
public String toString(NumberFormat nf) {
StringBuilder sb = new StringBuilder();
sb.append("{");
List<E> list = new ArrayList<E>(map.keySet());
try {
Collections.sort((List)list); // see if it can be sorted
} catch (Exception e) {
}
for (Iterator<E> iter = list.iterator(); iter.hasNext();) {
Object key = iter.next();
MutableInteger d = map.get(key);
sb.append(key + "=");
sb.append(nf.format(d));
if (iter.hasNext()) {
sb.append(", ");
}
}
sb.append("}");
return sb.toString();
}
示例13: setFutureCosts
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
private double[] setFutureCosts(int sourceInputId, Derivation<TK, FV> hyp,
FeatureExtractor<TK, FV> featurizer, Scorer<FV> scorer) {
// Do we clear the cache of future cost?
MutableInteger lastId = tlTranslationId.get();
@SuppressWarnings("rawtypes")
Map<SegId, Double> fcCache = tlCache.get();
if (lastId.intValue() != sourceInputId) {
fcCache.clear();
lastId.set(sourceInputId);
}
DTURule<TK> opt = (DTURule<TK>) concreteOpt.abstractRule;
double[] fc = new double[opt.dtus.length];
assert (segmentIdx == 0);
for (int i = segmentIdx + 1; i < opt.dtus.length; ++i) {
SegId<TK> id = new SegId<TK>(opt, i);
Double score = fcCache.get(id);
if (score == null) {
Featurizable<TK, FV> f = new DTUFeaturizable<TK, FV>(
hyp.sourceSequence, hyp.sourceInputProperties, concreteOpt, sourceInputId, i);
List<FeatureValue<FV>> phraseFeatures = featurizer
.ruleFeaturize(f);
score = scorer.getIncrementalScore(phraseFeatures);
fcCache.put(id, score);
}
fc[i] = score;
// System.err.printf("Future cost: id=%d phrase={%s} features=%s fc=%.3f\n",
// translationId, opt.dtus[i], phraseFeatures, fc[i]);
}
return fc;
}
示例14: getIntCount
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
/**
* Returns the current count for the given key, which is 0 if it hasn't
* been
* seen before. This is a convenient version of <code>get</code> that casts
* and extracts the primitive value.
*/
public int getIntCount(E key) {
MutableInteger count = map.get(key);
if (count == null) {
return defaultValue; // haven't seen this object before -> 0 count
}
return count.intValue();
}
示例15: remove
import edu.stanford.nlp.util.MutableInteger; //导入依赖的package包/类
/**
* Removes the given key from this Counter. Its count will now be 0 and it
* will no longer be considered previously seen.
*/
public double remove(E key) {
totalCount -= getCount(key); // subtract removed count from total (may be 0)
MutableInteger val = map.remove(key);
if (val == null) {
return Double.NaN;
} else {
return val.doubleValue();
}
}