anchor.diff:  
   The only thing each tailer retains is an index which is composed from:
   
  - - a cycle number. For example, days since epoch, and
  - - a sequence number within that cycle.
  +- a cycle number. For example, days since epoch, and
  +- a sequence number within that cycle.
   +
  -In the case of a `DAILY` cycle, the sequence number is 32 bit and the `index = ((long) cycle << 32) | sequenceNumber`.
  +In the case of a `DAILY` cycle, the sequence number is 32 bit and the `index = ((long) cycle << 32) | sequenceNumber` providing up to 4 billion entries per day.
  +if more messages per day are anticipated, the `XLARGE_DAILY` cycle, for example, provides up 4 trillion entries per day using a 48-bit sequence number.
   +
   Printing the index in hexadecimal is common in our libraries, to make it easier to see these two components.
   
  
positive.code: 
  More in-depth information can be found in the following topics:
  
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/BigDataAndChronicleQueue.adoc[Big Data and Chronicle Queue] - a detailed description of some of the techniques utilised by Chronicle Queue
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/encryption.adoc[Encryption] - describes how to encrypt the contents of a Queue
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/FAQ.adoc[FAQ] - questions asked by customers
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/How_it_works.adoc[How it works] - more depth on how Chronicle Queue is implemented
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/replication.adoc[Replication] - an overview of the replication mechanism
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/timezone_rollover.adoc[Timezone rollover] - describes how to configure file-rolling at a specific time in a given time-zone
     * https://github.com/OpenHFT/Chronicle-Queue/tree/master/docs/utilities.adoc[Utilities] - lists some useful utilities for working with queue files
  
  
negative.code: // a proxy which print each method called on it
  MessageListener processor = ObjectUtils.printAll(MessageListener.class)
  // a queue reader which turns messages into method calls.
  MethodReader reader1 = queue1.createTailer().methodReader(processor);
  
  assertTrue(reader1.readOne());
  assertTrue(reader1.readOne());
  