private var nextQueueName = 10000
  private var coordinatorWaiting = false
  private var coordinatorWakeUpAt = 0L

  /**
   * When we need a new thread to run tasks, we call [Backend.execute]. A few microseconds later we
   * expect a newly-started thread to call [Runnable.run]. We shouldn't request new threads until
   * the already-requested ones are in service, otherwise we might create more threads than we need.
   *

abstract class InterruptibleTask<T extends @Nullable Object>
    extends AtomicReference<@Nullable Runnable> implements Runnable {
  static {
    // Prevent rare disastrous classloading in first call to LockSupport.park.
    // See: https://bugs.openjdk.org/browse/JDK-8074773
    @SuppressWarnings("unused")
    Class<?> ensureLoaded = LockSupport.class;
  }

 *
 * <p>In contrast, <i>wall time</i> is a reading of "now" as given by a method like
 * {@link System#currentTimeMillis()}, best represented as an {@link java.time.Instant}. Such values
 * <i>can</i> be subtracted to obtain a {@link Duration} (such as by {@link Duration#between}), but
 * doing so does <i>not</i> give a reliable measurement of elapsed time, because wall time readings

        group = LifecycleBasePlugin.BUILD_GROUP
        description = "Checks status of NullAway support in this project. Call unqualified to get summary for all projects."
    }

    @TaskAction
    fun action() {
        val nullawayIncompatibleDeps = nullawayAwareDeps.get().filter { it.hasNullAwayDisabled }
        val service = statusService.get()

            .build()

        val exchange = call.interceptorScopedExchange
        val followUp = followUpRequest(response, exchange, chain)

        if (followUp == null) {
          if (exchange != null && exchange.isDuplex) {
            call.timeoutEarlyExit()
          }
          closeActiveExchange = false
          call.eventListener.followUpDecision(call, response, null)
          return response
        }

/**
 * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
 * matches the insertion order. All optional operations (adding and removing) are supported. All
 * elements, including {@code null}, are permitted.
 *
 * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
 * constant time operations. Expected in the hashtable sense (depends on the hash function doing a

/**
 * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that
 * matches the insertion order. All optional operations (adding and removing) are supported. All
 * elements, including {@code null}, are permitted.
 *
 * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
 * constant time operations. Expected in the hashtable sense (depends on the hash function doing a

  val certificateChainCleaner: CertificateChainCleaner?,
) : Interceptor.Chain {
  internal constructor(
    call: RealCall,
    interceptors: List<Interceptor>,
    index: Int,
    exchange: Nothing?,
    request: Request,
    client: OkHttpClient = call.client,
  ) : this(
    call = call,
    interceptors = interceptors,
    index = index,
    exchange = exchange,
    request = request,

# o sqlPackage: (NotRequired - Default all packages)
#
# *The line that starts with '#' means comment-out.
#
map:{
    # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    # o isGenerateProcedureParameterBean: (NotRequired - Default false)
    #   [true]
    #     The parameter beans for procedure are auto-generated.
    #     If you call the procedure from DBFlute, you should specify 'true'!
    #

        case 14:
          k2 ^= (long) toUnsignedInt(bb.get(13)) << 40; // fall through
        case 13:
          k2 ^= (long) toUnsignedInt(bb.get(12)) << 32; // fall through
        case 12:
          k2 ^= (long) toUnsignedInt(bb.get(11)) << 24; // fall through
        case 11:
          k2 ^= (long) toUnsignedInt(bb.get(10)) << 16; // fall through
        case 10: