public void insertOrUpdate(final long procId) { updateState(procId, false); }
public void delete(final long procId) { updateState(procId, true); }
public BitSetNode(long procId, boolean partial) { start = alignDown(procId); int count = 1; modified = new long[count]; deleted = new long[count]; if (!partial) { Arrays.fill(deleted, WORD_MASK); } this.partial = partial; updateState(procId, false); }
/** * This method is used when restarting where we need to rebuild the ProcedureStoreTracker. The * {@link #delete(long)} method above assume that the {@link BitSetNode} exists, but when restart * this is not true, as we will read the wal files in reverse order so a delete may come first. */ public void setDeleted(long procId, boolean isDeleted) { BitSetNode node = getOrCreateNode(procId); assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node; node.updateState(procId, isDeleted); trackProcIds(procId); }
public void insertOrUpdate(final long procId) { updateState(procId, false); }
public void delete(final long procId) { updateState(procId, true); }
public BitSetNode(long procId, boolean partial) { start = alignDown(procId); int count = 1; modified = new long[count]; deleted = new long[count]; if (!partial) { Arrays.fill(deleted, WORD_MASK); } this.partial = partial; updateState(procId, false); }
/** * This method is used when restarting where we need to rebuild the ProcedureStoreTracker. The * {@link #delete(long)} method above assume that the {@link BitSetNode} exists, but when restart * this is not true, as we will read the wal files in reverse order so a delete may come first. */ public void setDeleted(long procId, boolean isDeleted) { BitSetNode node = getOrCreateNode(procId); assert node.contains(procId) : "expected procId=" + procId + " in the node=" + node; node.updateState(procId, isDeleted); trackProcIds(procId); }