limited:
    assuredConcurrencyShares: 1
    borrowingLimitPercent: 4
    lendablePercent: 3
    limitResponse:
      queuing:
        handSize: 2
        queueLengthLimit: 3
        queues: 1
      type: typeValue
  type: typeValue
status:
  conditions:
  - lastTransitionTime: "2003-01-01T01:01:01Z"
    message: messageValue
    reason: reasonValue
    status: statusValue

      }
    ]
  },
  "spec": {
    "type": "typeValue",
    "limited": {
      "assuredConcurrencyShares": 1,
      "limitResponse": {
        "type": "typeValue",
        "queuing": {
          "queues": 1,
          "handSize": 2,
          "queueLengthLimit": 3
        }
      },
      "lendablePercent": 3,
      "borrowingLimitPercent": 4
    },
    "exempt": {
      "nominalConcurrencyShares": 1,

  limited:
    assuredConcurrencyShares: 1
    borrowingLimitPercent: 4
    lendablePercent: 3
    limitResponse:
      queuing:
        handSize: 2
        queueLengthLimit: 3
        queues: 1
      type: typeValue
  type: typeValue
status:
  conditions:
  - lastTransitionTime: "2003-01-01T01:01:01Z"
    message: messageValue
    reason: reasonValue
    status: statusValue

      }
    ]
  },
  "spec": {
    "type": "typeValue",
    "limited": {
      "assuredConcurrencyShares": 1,
      "limitResponse": {
        "type": "typeValue",
        "queuing": {
          "queues": 1,
          "handSize": 2,
          "queueLengthLimit": 3
        }
      },
      "lendablePercent": 3,
      "borrowingLimitPercent": 4
    },
    "exempt": {
      "nominalConcurrencyShares": 1,

type QueuingConfiguration struct {
	// `queues` is the number of queues for this priority level. The
	// queues exist independently at each apiserver. The value must be
	// positive.  Setting it to 1 effectively precludes
	// shufflesharding and thus makes the distinguisher method of
	// associated flow schemas irrelevant.  This field has a default
	// value of 64.
	// +optional

type QueuingConfiguration struct {
	// `queues` is the number of queues for this priority level. The
	// queues exist independently at each apiserver. The value must be
	// positive.  Setting it to 1 effectively precludes
	// shufflesharding and thus makes the distinguisher method of
	// associated flow schemas irrelevant.  This field has a default
	// value of 64.
	// +optional

  repeated PriorityLevelConfigurationCondition conditions = 1;
}

// QueuingConfiguration holds the configuration parameters for queuing
message QueuingConfiguration {
  // `queues` is the number of queues for this priority level. The
  // queues exist independently at each apiserver. The value must be
  // positive.  Setting it to 1 effectively precludes
  // shufflesharding and thus makes the distinguisher method of

        endpoint1.take(messages1)
        endpoint2.take(messages2)

        then:
        messages1 == [message1, message3]
        messages2 == [message2]
    }

    def "forwards broadcast message to all channel queues"() {
        def id1 = new ChannelIdentifier("channel1")
        def id2 = new ChannelIdentifier("channel2")
        def message1 = new ChannelMessage(id1, "message 1")
        def message2 = broadcast()

        given:

// Copyright 2011 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

// Test for select: Issue 2075
// A bug in select corrupts channel queues of failed cases
// if there are multiple waiters on those channels and the
// select is the last in the queue. If further waits are made
// on the channel without draining it first then those waiters

    final L listener;
    final Executor executor;

    @GuardedBy("this")
    final Queue<ListenerCallQueue.Event<L>> waitQueue = Queues.newArrayDeque();

    @GuardedBy("this")
    final Queue<Object> labelQueue = Queues.newArrayDeque();

    @GuardedBy("this")
    boolean isThreadScheduled;

    PerListenerQueue(L listener, Executor executor) {