public void test_emptyNodeVersionTimestamps(){
  final int m=3;
  final int nkeys=0;
  final byte[][] keys=new byte[m][];
  final int spannedTupleCount=0;
  final long[] childAddr=new long[m + 1];
  final long[] childEntryCount=new long[m + 1];
  final boolean hasVersionTimestamps=true;
  final long minimumVersionTimestamp=System.currentTimeMillis();
  final long maximumVersionTimestamp=System.currentTimeMillis() + 20;
  childAddr[0]=12L;
  final INodeData expected=new MockNodeData(new ReadOnlyKeysRaba(nkeys,keys),spannedTupleCount,childAddr,childEntryCount,hasVersionTimestamps,minimumVersionTimestamp,maximumVersionTimestamp);
  doRoundTripTest(expected,coder,new DataOutputBuffer());
}

public void test_emptyNodeVersionTimestamps ( ) { final int m = 3 ; final int nkeys = 0 ; final byte [ ] [ ] keys = new byte [ m ] [ ] ; final int spannedTupleCount = 0 ; final long [ ] childAddr = new long [ m + 1 ] ; final long [ ] childEntryCount = new long [ m + 1 ] ; final boolean hasVersionTimestamps = true ; final long minimumVersionTimestamp = System . currentTimeMillis ( ) ; final long maximumVersionTimestamp = System . currentTimeMillis ( ) + 20 ; childAddr [ 0 ] = 12L ; final INodeData expected = new MockNodeData ( new ReadOnlyKeysRaba ( nkeys , keys ) , spannedTupleCount , childAddr , childEntryCount , hasVersionTimestamps , minimumVersionTimestamp , maximumVersionTimestamp ) ; doRoundTripTest ( expected , coder , new DataOutputBuffer ( ) ) ; }
empty node with version timestamps ( this is not a legal instance since only the root leaf may ever be empty ) .
