/** Performs the cache operations for the given key. */ private void process(long key) { IntPriorityQueue times = accessTimes.get(key); int lastAccess = times.dequeueInt(); boolean found = data.remove(lastAccess); if (times.isEmpty()) { data.add(infiniteTimestamp--); accessTimes.remove(key); } else { data.add(times.firstInt()); } if (found) { policyStats.recordHit(); } else { policyStats.recordMiss(); if (data.size() > maximumSize) { evict(); } } }
public void addFixer(final DataFix fix) { final int version = DataFixUtils.getVersion(fix.getVersionKey()); if (version > dataVersion) { LOGGER.warn("Ignored fix registered for version: {} as the DataVersion of the game is: {}", version, dataVersion); return; } globalList.add(fix); fixerVersions.add(fix.getVersionKey()); }
private void remove(final int index) { this.members[index] = null; this.free.add(index); }
protected void removeLeaf(final Octant octant) { int id = octant.leafId; leaves[id] = null; leavesCount--; garbageQueue.add(id); octant.leafId = NULL_ID; }
public Integer remove(K k) { checkK(k); Integer id = timeSortedMap.get(k); if (id != null) { if (--countMap[id] == 0) { garbageQueue.add(id); timeSortedMap.remove(k); } } return id; }
/** Sets the indexed fields to those provided (default: all fields, but see {@link #indexedFields}). * * <p>This is a utility method that provides a way to set {@link #indexedFields} in a chainable way. * * @param field a list of fields to be indexed, that will <em>replace</em> the current values in {@link #indexedFields}. * @return this index builder. * @see IndexBuilder#indexedFields */ public IndexBuilder indexedFields( int... field ) { indexedFields.clear(); for( int f: field ) indexedFields.add( f ); return this; }
/** Sets the indexed fields to those provided (default: all fields, but see {@link #indexedFields}). * * <p>This is a utility method that provides a way to set {@link #indexedFields} in a chainable way. * * @param field a list of fields to be indexed, that will <em>replace</em> the current values in {@link #indexedFields}. * @return this index builder. * @see IndexBuilder#indexedFields */ public IndexBuilder indexedFields( int... field ) { indexedFields.clear(); for( int f: field ) indexedFields.add( f ); return this; }
/** Sets the indexed fields to those provided (default: all fields, but see {@link #indexedFields}). * * <p>This is a utility method that provides a way to set {@link #indexedFields} in a chainable way. * * @param field a list of fields to be indexed, that will <em>replace</em> the current values in {@link #indexedFields}. * @return this index builder. * @see IndexBuilder#indexedFields */ public IndexBuilder indexedFields( int... field ) { indexedFields.clear(); for( int f: field ) indexedFields.add( f ); return this; }
/** Sets the indexed fields to those provided (default: all fields, but see {@link #indexedFields}). * * <p>This is a utility method that provides a way to set {@link #indexedFields} in a chainable way. * * @param field a list of fields to be indexed, that will <em>replace</em> the current values in {@link #indexedFields}. * @return this index builder. * @see IndexBuilder#indexedFields */ public IndexBuilder indexedFields( int... field ) { indexedFields.clear(); for( int f: field ) indexedFields.add( f ); return this; }
public Integer remove(K k) { checkK(k); Integer id = timeSortedMap.get(k); if (id != null) { if (--countMap[id] == 0) { garbageQueue.add(id); timeSortedMap.remove(k); } } return id; }
protected void removeView(final GraphViewImpl view) { checkViewExist(view); int id = view.storeId; views[id] = null; garbageQueue.add(id); view.storeId = NULL_VIEW; view.destroyAllObservers(); // Check if not visible view if (visibleView == view) { visibleView = graphStore.mainGraphView; } }
protected void removeView(final GraphViewImpl view) { checkViewExist(view); int id = view.storeId; views[id] = null; garbageQueue.add(id); view.storeId = NULL_VIEW; view.destroyAllObservers(); // Check if not visible view if (visibleView == view) { visibleView = graphStore.mainGraphView; } }
private GraphViewStore deserializeViewStore(final DataInput is) throws IOException, ClassNotFoundException { GraphViewStore viewStore = model.store.viewStore; int length = (Integer) deserialize(is); Object[] views = (Object[]) deserialize(is); int[] garbages = (int[]) deserialize(is); viewStore.length = length; viewStore.views = new GraphViewImpl[views.length]; System.arraycopy(views, 0, viewStore.views, 0, views.length); for (int i = 0; i < garbages.length; i++) { viewStore.garbageQueue.add(garbages[i]); } return viewStore; }
private GraphViewStore deserializeViewStore(final DataInput is) throws IOException, ClassNotFoundException { GraphViewStore viewStore = model.store.viewStore; int length = (Integer) deserialize(is); Object[] views = (Object[]) deserialize(is); int[] garbages = (int[]) deserialize(is); viewStore.length = length; viewStore.views = new GraphViewImpl[views.length]; System.arraycopy(views, 0, viewStore.views, 0, views.length); for (int i = 0; i < garbages.length; i++) { viewStore.garbageQueue.add(garbages[i]); } return viewStore; }
public void addRow(int indexNum, int rowNum) { IntSortedSet rowNums = comprisedRows.get(indexNum); if (rowNums == null) { rowNums = new IntRBTreeSet(); comprisedRows.put(indexNum, rowNums); } rowNums.add(rowNum); }
/** Performs the cache operations for the given key. */ private void process(long key) { IntPriorityQueue times = accessTimes.get(key); int lastAccess = times.dequeueInt(); boolean found = data.remove(lastAccess); if (times.isEmpty()) { data.add(infiniteTimestamp--); accessTimes.remove(key); } else { data.add(times.firstInt()); } if (found) { policyStats.recordHit(); } else { policyStats.recordMiss(); if (data.size() > maximumSize) { evict(); } } }
private TimestampIndexStore deserializeTimestampIndexStore(final DataInput is) throws IOException, ClassNotFoundException { TimestampIndexStore timestampIndexStore; Class cls = (Class) deserialize(is); if (cls.equals(Node.class)) { timestampIndexStore = (TimestampIndexStore) model.store.timeStore.nodeIndexStore; } else { timestampIndexStore = (TimestampIndexStore) model.store.timeStore.edgeIndexStore; } int length = (Integer) deserialize(is); double[] doubles = (double[]) deserialize(is); int[] ints = (int[]) deserialize(is); int[] garbage = (int[]) deserialize(is); int[] counts = (int[]) deserialize(is); timestampIndexStore.length = length; for (int i : garbage) { timestampIndexStore.garbageQueue.add(i); } Double2IntMap m = timestampIndexStore.getMap(); for (int i = 0; i < ints.length; i++) { m.put(doubles[i], ints[i]); } timestampIndexStore.countMap = counts; return timestampIndexStore; }
@SuppressWarnings("unchecked") public int nextInt() { if ( !hasNext() ) throw new NoSuchElementException(); ObjectList<Scan.VirtualDocumentFragment> vdf; try { vdf = (ObjectList<VirtualDocumentFragment>)cachedDocument.content( virtualField ); } catch ( IOException exc1 ) { throw new RuntimeException( exc1 ); } succ.clear(); resolver.context( cachedDocument ); ObjectIterator<VirtualDocumentFragment> it = vdf.iterator(); while ( it.hasNext() ) { int successor = resolver.resolve( it.next().documentSpecifier() ); if ( successor >= 0 ) succ.add( successor ); } cachedSuccessors = succ.toIntArray(); // Get ready for the next request try { cachedDocument.close(); cachedDocument = documentIterator.nextDocument(); } catch ( IOException e ) { throw new RuntimeException( e ); } return cachedDocumentNumber++; }
private IntervalIndexStore deserializeIntervalIndexStore(final DataInput is) throws IOException, ClassNotFoundException { IntervalIndexStore intervalIndexStore; Class cls = (Class) deserialize(is); if (cls.equals(Node.class)) { intervalIndexStore = (IntervalIndexStore) model.store.timeStore.nodeIndexStore; } else { intervalIndexStore = (IntervalIndexStore) model.store.timeStore.edgeIndexStore; } int length = (Integer) deserialize(is); int mapSize = (Integer) deserialize(is); Interval2IntTreeMap map = intervalIndexStore.getMap(); for (int i = 0; i < mapSize; i++) { Interval key = (Interval) deserialize(is); Integer value = (Integer) deserialize(is); map.put(key, value); } int[] garbage = (int[]) deserialize(is); int[] counts = (int[]) deserialize(is); intervalIndexStore.length = length; for (int i : garbage) { intervalIndexStore.garbageQueue.add(i); } intervalIndexStore.countMap = counts; return intervalIndexStore; }
private IntervalIndexStore deserializeIntervalIndexStore(final DataInput is) throws IOException, ClassNotFoundException { IntervalIndexStore intervalIndexStore; Class cls = (Class) deserialize(is); if (cls.equals(Node.class)) { intervalIndexStore = (IntervalIndexStore) model.store.timeStore.nodeIndexStore; } else { intervalIndexStore = (IntervalIndexStore) model.store.timeStore.edgeIndexStore; } int length = (Integer) deserialize(is); int mapSize = (Integer) deserialize(is); Interval2IntTreeMap map = intervalIndexStore.getMap(); for (int i = 0; i < mapSize; i++) { Interval key = (Interval) deserialize(is); Integer value = (Integer) deserialize(is); map.put(key, value); } int[] garbage = (int[]) deserialize(is); int[] counts = (int[]) deserialize(is); intervalIndexStore.length = length; for (int i : garbage) { intervalIndexStore.garbageQueue.add(i); } intervalIndexStore.countMap = counts; return intervalIndexStore; }