*       hand, is multiple-use, and does implement {@link Iterable}.
 *   <li>Streams offer many features not found here, including {@code min/max}, {@code distinct},
 *       {@code reduce}, {@code sorted}, the very powerful {@code collect}, and built-in support for
 *       parallelizing stream operations.
 *   <li>{@code FluentIterable} contains several features not available on {@code Stream}, which are
 *       noted in the method descriptions below.

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect.testing.features;

import com.google.common.annotations.GwtCompatible;
import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import java.util.Set;

/**

constraints.DecimalMax.message = {item} must be less than {value}.
constraints.DecimalMin.message = {item} must be greater than {value}.
constraints.Digits.message = {item} must be a number. (expected: <number>.<number>)
constraints.Future.message = {item} must be a future value.
constraints.Max.message = {item} must be less than or equal to {value}.
constraints.Min.message = {item} must be greater than or equal to {value}.
constraints.NotNull.message = {item} is required.

constraints.DecimalMax.message = {item} must be less than {value}.
constraints.DecimalMin.message = {item} must be greater than {value}.
constraints.Digits.message = {item} must be a number. (expected: <number>.<number>)
constraints.Future.message = {item} must be a future value.
constraints.Max.message = {item} must be less than or equal to {value}.
constraints.Min.message = {item} must be greater than or equal to {value}.
constraints.NotNull.message = {item} is required.

 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.collect.testing.features;

import com.google.common.annotations.GwtCompatible;
import java.lang.annotation.Documented;
import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;

 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.collect.testing.features;

import com.google.common.annotations.GwtCompatible;
import java.lang.annotation.Documented;
import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;

   *
   * <p>If the order is non-deterministic, as with {@link java.util.HashSet}, this method can return
   * its input unmodified. Provided that the test suite is built without {@link
   * com.google.common.collect.testing.features.CollectionFeature#KNOWN_ORDER}, the tests will look
   * only at the returned contents without regard for order.
   */
  Iterable<E> order(List<E> insertionOrder);

   * of tasks submitted by {@code invokeAll} or {@code invokeAny}, tasks will run serially on the
   * calling thread. Tasks are run to completion before a {@code Future} is returned to the caller
   * (unless the executor has been shutdown).
   *
   * <p>The returned executor is backed by the executor returned by {@link

constraints.DecimalMax.message = {item} musi być mniejsze niż {value}.
constraints.DecimalMin.message = {item} musi być większe niż {value}.
constraints.Digits.message = {item} musi być liczbą. (Oczekiwano: <liczba>.<liczba>)
constraints.Future.message = {item} musi być wartością przyszłą.
constraints.Max.message = {item} musi być mniejsze lub równe {value}.
constraints.Min.message = {item} musi być większe lub równe {value}.

   * worker, and then the first thread's call to delegate.execute() returns. Without this counter,
   * it would observe the QUEUING state and set it to QUEUED, and the worker would never be
   * scheduled again for future submissions.
   */
  @GuardedBy("queue")
  private long workerRunCount = 0;

  @RetainedWith private final QueueWorker worker = new QueueWorker();

  /** Use {@link MoreExecutors#newSequentialExecutor} */