IMetered

// ===============================================================
// Algorithm M requires a fixed amount of storage, so we will
// analyze only the time required to perform it. To do this, we
// will count the number of times each step is executed.
//
//              - KNUTH (The Art of Computer Programming 1 1.2.10)
// ===============================================================

interface IMetered {
  boolean tick();
  long unitsCounted();
  long timeConsumed();
}