@Override public Collection<V> values() { return delegate.values(); }
@Override public Collection<V> values() { return delegate.values(); }
/** * trim off excess size dead space. */ final public void trimToSize() { for (GazEntry ge : gaz.values()) { ge.trimToSize(); } }
@Override protected TreePair getMax() { TreePair best = TreePair.MIN_VALUE; //iteration in O(n) for (PriorityQueue<TreePair> treePairs : treeToPairs.values()) { TreePair max = treePairs.peek(); //get local best in O(log(n)) if (max != null && max.compareTo(best) < 0) //Attention the comparator is reverse! best = max; } return best; } }
/** * trim off excess size dead space. */ final public void trimToSize() { for (GazEntry ge : gaz.values()) { ge.trimToSize(); } }
/** * trim off excess size dead space. */ final public void trimToSize() { for (GazEntry ge : gaz.values()) { ge.trimToSize(); } } }
/** * trim off excess size dead space. */ final public void trimToSize() { for (GazEntry ge : gaz.values()) { ge.trimToSize(); } } }
/** * trim off excess size dead space. */ final public void trimToSize() { for (GazEntry ge : gaz.values()) { ge.trimToSize(); } } }
/** * when we are done loading up all the gazetteers, we will trim all the collections down to * size to save memory. */ public void trimToSize() { if (names != null) names.trimToSize(); if (requiredChildren != null) { requiredChildren.trimToSize(); for (GazEntry nextkey : requiredChildren.values()) { nextkey.trimToSize(); } } } }
/** * when we are done loading up all the gazetteers, we will trim all the collections down to * size to save memory. */ public void trimToSize() { if (names != null) names.trimToSize(); if (requiredChildren != null) { requiredChildren.trimToSize(); for (GazEntry nextkey : requiredChildren.values()) { nextkey.trimToSize(); } } } }
/** * when we are done loading up all the gazetteers, we will trim all the collections down to * size to save memory. */ public void trimToSize() { if (names != null) names.trimToSize(); if (requiredChildren != null) { requiredChildren.trimToSize(); for (GazEntry nextkey : requiredChildren.values()) { nextkey.trimToSize(); } } } }
/** * when we are done loading up all the gazetteers, we will trim all the collections down to * size to save memory. */ public void trimToSize() { if (names != null) names.trimToSize(); if (requiredChildren != null) { requiredChildren.trimToSize(); for (GazEntry nextkey : requiredChildren.values()) { nextkey.trimToSize(); } } } }
/** * when we are done loading up all the gazetteers, we will trim all the collections down to * size to save memory. */ public void trimToSize() { if (names != null) names.trimToSize(); if (requiredChildren != null) { requiredChildren.trimToSize(); for (GazEntry nextkey : requiredChildren.values()) { nextkey.trimToSize(); } } } }
for (DbSenseForLabel s:senseHash.values()) mergedSenses.add(s) ;