Java MutableInteger.set方法代码示例

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;
  }
}
 

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;
  }
}
 

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;
    }
  }
}
 

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;
    }
  }
}
 

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;
  }
}
 

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;
    }
  }
}
 

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;
    }
  }
}
 

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;
}
 

import edu.stanford.nlp.util.MutableInteger; //导入方法依赖的package包/类
private boolean leftCharEdge(Tree node, MutableInteger i) {
  if (this == node) {
    return true;
  } else if (isLeaf()) {
    i.set(i.intValue() + value().length());
    return false;
  } else {
    for (Tree child : children()) {
      if (child.leftCharEdge(node, i)) {
        return true;
      }
    }
    return false;
  }
}
 

import edu.stanford.nlp.util.MutableInteger; //导入方法依赖的package包/类
private boolean rightCharEdge(Tree node, MutableInteger i) {
  if (this == node) {
    return true;
  } else if (isLeaf()) {
    i.set(i.intValue() - label().value().length());
    return false;
  } else {
    for (int j = children().length - 1; j >= 0; j--) {
      if (children()[j].rightCharEdge(node, i)) {
        return true;
      }
    }
    return false;
  }
}