static <E> Queue<E> discardingQueue() {
    return (Queue) DISCARDING_QUEUE;
  }

  /*
   * Note: All of this duplicate code sucks, but it saves a lot of memory. If only Java had mixins!
   * To maintain this code, make a change for the strong reference type. Then, cut and paste, and

    return s.charAt(rand.nextInt(s.length()));
  }

  /**
   * Provides samples on a random distribution derived from the web.
   *
   * <p>Adapted from data provided by Mark Davis.
   *
   * @author Christopher Swenson
   */
  static class CharSamples {

    static {
      populateProb1();
      populateProb2();
      populateChars1();
      populateChars2();
    }

  static <E> Queue<E> discardingQueue() {
    return (Queue) DISCARDING_QUEUE;
  }

  /*
   * Note: All of this duplicate code sucks, but it saves a lot of memory. If only Java had mixins!
   * To maintain this code, make a change for the strong reference type. Then, cut and paste, and

    return s.charAt(rand.nextInt(s.length()));
  }

  /**
   * Provides samples on a random distribution derived from the web.
   *
   * <p>Adapted from data provided by Mark Davis.
   *
   * @author Christopher Swenson
   */
  static class CharSamples {

    static {
      populateProb1();
      populateProb2();
      populateChars1();
      populateChars2();
    }