@Override public void clear() { set.clear(); }
@Override public void readFields(DataInput in) throws IOException { long size = in.readLong(); set.clear(); trim(size); for (long i = 0; i < size; ++i) { set.add(in.readInt()); } } }
public void set( IntCollection indices ) { if ( !hSet.isEmpty( ) ) { hSet.clear( ); hSetChanged = true; } if ( hSet.addAll( indices ) ) { hSetChanged = true; } }
public void set(List<Integer> readIndicesForwardStrandList, List<Integer> readIndicesReverseStrandList) { readIndices.clear(); readIndices.addAll(readIndicesForwardStrandList); readIndices.addAll(readIndicesReverseStrandList); }
@Nullable synchronized MessageCanvasUpdate getUpdateMessage() { List<BaseObject> changed = null; for (BaseObject object : objects.values()) { if (object.pollDirty()) { if (changed == null) changed = new ArrayList<>(); changed.add(object); } } if (changed == null && removed.size() == 0) return null; if (changed == null) changed = Collections.emptyList(); MessageCanvasUpdate message = new MessageCanvasUpdate( canvasId, changed, removed.toIntArray() ); removed.clear(); return message; }
protected void update(boolean sparse) { IntSet s = sparse ? sparse_updated_indices : dense_updated_indices; MajorVector w = weight_vector.getMajorVector(sparse); MajorVector d = diagonals .getMajorVector(sparse); MajorVector g = gradients .getMajorVector(sparse); int[] indices = s.toIntArray(); Arrays.sort(indices); updateDiagonals(d, g, indices); updateWeights (w, g, indices, sparse); clearGraidents (g, indices); s.clear(); }
protected void update(boolean sparse) { IntSet s = sparse ? sparse_updated_indices : dense_updated_indices; MajorVector w = weight_vector.getMajorVector(sparse); MajorVector d = diagonals .getMajorVector(sparse); MajorVector g = gradients .getMajorVector(sparse); int[] indices = s.toIntArray(); Arrays.sort(indices); updateDiagonals(d, g, indices); updateWeights (w, g, indices, sparse); clearGraidents (g, indices); s.clear(); }
localNextMustBeChecked.clear();
downKeys.clear(); Gdx.input.setInputProcessor(inputAdapter);
dSet.clear( ); dSet.addAll( hSet ); hSetChanged = false;
borderCells.clear(); // clear the set if (borderCells.add(refNode.getId())) { List<Node> resultNodes = borderPixelMap.get(refNode.getId());
@Override public Vertex<IntWritable, FloatWritable, NullWritable> getCurrentVertex() throws IOException, InterruptedException { Vertex<IntWritable, FloatWritable, NullWritable> vertex = getConf().createVertex(); int vertexId = startingVertexId + verticesRead; OutEdges<IntWritable, NullWritable> edges = getConf().createOutEdges(); edges.initialize(edgesPerVertex); destVertices.clear(); for (int i = 0; i < edgesPerVertex; ++i) { int destVertexId; do { destVertexId = localEdgesHelper.generateDestVertex(vertexId, rand); } while (!destVertices.add(destVertexId)); Edge<IntWritable, NullWritable> edge = (reusableEdge == null) ? getConf().createEdge() : reusableEdge; edge.getTargetVertexId().set(destVertexId); edges.add(edge); } vertex.initialize( new IntWritable(vertexId), new FloatWritable(1.0f), edges); ++verticesRead; return vertex; }
IntSet borderCells = new IntOpenHashSet(); for (int i = 0; i < nodeCount; i++) { borderCells.clear();
Edge edge = currentNode.findEdge(firstNeighborNode); if (edge == null) { borderCells.clear(); // clear the set int boundary = 0; if (borderCells.add(currentNode.getId())) {
if (currentNode != x) { final IntSet succSet = new IntOpenHashSet(); succSet.clear();
dec += 1; if (dec == min) { toRemove.clear(); for (ObjectIterator<Int2ObjectMap.Entry<MutableInteger>> it = hMap.int2ObjectEntrySet().fastIterator(); it.hasNext(); ) {