public long getActiveMinProcId() { Map.Entry<Long, BitSetNode> entry = map.firstEntry(); return entry == null ? Procedure.NO_PROC_ID : entry.getValue().getActiveMinProcId(); }
public void dump() { System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(), getActiveMinProcId(), getActiveMaxProcId()); System.out.println("Modified:"); for (int i = 0; i < modified.length; ++i) { for (int j = 0; j < BITS_PER_WORD; ++j) { System.out.print((modified[i] & (1L << j)) != 0 ? "1" : "0"); } System.out.println(" " + i); } System.out.println(); System.out.println("Delete:"); for (int i = 0; i < deleted.length; ++i) { for (int j = 0; j < BITS_PER_WORD; ++j) { System.out.print((deleted[i] & (1L << j)) != 0 ? "1" : "0"); } System.out.println(" " + i); } System.out.println(); }
@Test public void testGetActiveMaxMinProcId() { BitSetNode node = new BitSetNode(5L, false); assertEquals(5L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.insertOrUpdate(10L); assertEquals(5L, node.getActiveMinProcId()); assertEquals(10L, node.getActiveMaxProcId()); node.insertOrUpdate(1L); assertEquals(1L, node.getActiveMinProcId()); assertEquals(10L, node.getActiveMaxProcId()); node.delete(10L); assertEquals(1L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.delete(1L); assertEquals(5L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.delete(5L); assertEquals(Procedure.NO_PROC_ID, node.getActiveMinProcId()); assertEquals(Procedure.NO_PROC_ID, node.getActiveMaxProcId()); }
public long getActiveMinProcId() { Map.Entry<Long, BitSetNode> entry = map.firstEntry(); return entry == null ? Procedure.NO_PROC_ID : entry.getValue().getActiveMinProcId(); }
public void dump() { System.out.printf("%06d:%06d min=%d max=%d%n", getStart(), getEnd(), getActiveMinProcId(), getActiveMaxProcId()); System.out.println("Modified:"); for (int i = 0; i < modified.length; ++i) { for (int j = 0; j < BITS_PER_WORD; ++j) { System.out.print((modified[i] & (1L << j)) != 0 ? "1" : "0"); } System.out.println(" " + i); } System.out.println(); System.out.println("Delete:"); for (int i = 0; i < deleted.length; ++i) { for (int j = 0; j < BITS_PER_WORD; ++j) { System.out.print((deleted[i] & (1L << j)) != 0 ? "1" : "0"); } System.out.println(" " + i); } System.out.println(); }
@Test public void testGetActiveMaxMinProcId() { BitSetNode node = new BitSetNode(5L, false); assertEquals(5L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.insertOrUpdate(10L); assertEquals(5L, node.getActiveMinProcId()); assertEquals(10L, node.getActiveMaxProcId()); node.insertOrUpdate(1L); assertEquals(1L, node.getActiveMinProcId()); assertEquals(10L, node.getActiveMaxProcId()); node.delete(10L); assertEquals(1L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.delete(1L); assertEquals(5L, node.getActiveMinProcId()); assertEquals(5L, node.getActiveMaxProcId()); node.delete(5L); assertEquals(Procedure.NO_PROC_ID, node.getActiveMinProcId()); assertEquals(Procedure.NO_PROC_ID, node.getActiveMaxProcId()); }