public void setIndices(TIntList indices) { this.indices.clear(); this.indices.addAll(indices); }
/** * Empties the set. */ @Override public void clear() { super.clear(); order.clear(); }
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
protected List<String> getTotalLines() { int w = xSize - border.w * 2 + 2; if(!slider.isHidden()) { w -= slider.width + 3; } w = (int) ((float) w / textScale); List<String> lines = Lists.newLinkedList(); tooltipLines.clear(); for(String line : text) { tooltipLines.add(lines.size()); // empty line if(line == null || line.isEmpty()) { lines.add(""); continue; } lines.addAll(fontRenderer.listFormattedStringToWidth(line, w)); } return lines; }
/** * Empties the set. */ @Override public void clear() { super.clear(); order.clear(); }
/** * Empties the set. */ @Override public void clear() { super.clear(); order.clear(); }
/** * Clears all the vertex data. */ public void clear() { indices.clear(); attributes.clear(); nameToIndex.clear(); }
private void addLowestDistance(DictionaryItem item, String word, int wordNr, String fragment) { int indexedDistance = item.suggestions.size() > 0 ? wordlist.get(item.suggestions.get(0)).length() - fragment.length() : -1; int fragmentDistance = word.length() - fragment.length(); // remove all existing suggestions (of higher distance) if this word has // a lower distance (only at recallLevel < 2) if ((accuracyLevel.ordinal() < 2) && (indexedDistance > fragmentDistance)) { item.suggestions.clear(); } // if recall level is 2, add this word anyways // otherwise only add it if it has a similar or lower distance // then the indexed words if ((accuracyLevel.ordinal() == 2) || (item.suggestions.size() == 0) || (indexedDistance >= fragmentDistance)) { item.suggestions.add(wordNr); } }
@Override public void onSolution() { int n = decisionVars.length; ps.clear(); for (int i = 0; i < n; i++) { ps.add(SatSolver.negated(png.Literal(decisionVars[i], decisionVars[i].getValue(), true))); } png.addLearnt(ps.toArray()); }
@Override public Decision<IntVar> getDecision() { IntVar best = null; bests.clear(); double bestVal = -1.0d; for (int i = 0; i < vars.length; i++) { int ds = vars[i].getDomainSize(); if (ds > 1) { double a = A[v2i.get(vars[i].getId())] / ds; if (a > bestVal) { bests.clear(); bests.add(i); bestVal = a; } else if (a == bestVal) { bests.add(i); } } } if (bests.size() > 0) { currentVar = bests.get(random.nextInt(bests.size())); best = vars[currentVar]; } return computeDecision(best); }
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
/** * Expands the set to accommodate new values. * * @param newCapacity an <code>int</code> value */ @Override @SuppressWarnings("unchecked") protected void rehash(int newCapacity) { TIntLinkedList oldOrder = new TIntLinkedList(order); int oldSize = size(); Object oldSet[] = _set; order.clear(); _set = new Object[newCapacity]; Arrays.fill(_set, FREE); for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) { int i = iterator.next(); E o = (E) oldSet[i]; if (o == FREE || o == REMOVED) { throw new IllegalStateException("Iterating over empty location while rehashing"); } if (o != FREE && o != REMOVED) { int index = insertKey(o); if (index < 0) { // everyone pays for this because some people can't RTFM throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet); } if (!order.add(index)) throw new IllegalStateException("Order not changed after insert"); } } }
private void resetConnectedEnderCrystals() { for(int connectedEnderCrystal : connectedCrystalsIds.toArray()) { EntityEnderCrystal entityEnderCrystal = (EntityEnderCrystal) getWorld().getEntityByID(connectedEnderCrystal); if(entityEnderCrystal != null && getPos().equals(entityEnderCrystal.getBeamTarget())) { //on removal, reset ender crystal beam location so somebody can use it entityEnderCrystal.setBeamTarget(null); } } connectedCrystalsIds.clear(); }
); writer.writeRow(row); packedDest.clear();
private void updateConnectedCrystals() { this.connectedCrystalsIds.clear(); final double maxDistance = 64 * 64; List<EntityEnderCrystal> enderCrystals = Arrays.stream(BiomeEndDecorator.getSpikesForWorld(getWorld()))
indices.clear(); for (Vector2i edge : edges) { indices.add(edge.getX());