return target.ID().String()
}

// Store returns any underlying store if set.
func (target *NSQTarget) Store() event.TargetStore {
	return target.store
}

// IsActive - Return true if target is up and active
func (target *NSQTarget) IsActive() (bool, error) {
	if err := target.init(); err != nil {
		return false, err
	}
	return target.isActive()
}

func (target *NSQTarget) isActive() (bool, error) {

    // (1) "Reversal", the one we have here.
    // (2) "Dolphin". If we're rotating an array a of size n by a distance of d, then element a[0]
    //     ends up at a[d], which in turn ends up at a[2d], and so on until we get back to a[0].
    //     (All indices taken mod n.) If d and n are mutually prime, all elements will have been

    limiter.setRate(2.0);
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    assertEvents(
        "R0.00", // First comes the saved-up burst, which defaults to a 1-second burst (2 requests).
        "R0.00", "R0.00", // Now comes the free request.
        "R0.50", // Now it's 0.5 seconds per request.
        "R0.50");

  public static ImmutableLongArray of(long e0, long e1, long e2, long e3, long e4, long e5) {
    return new ImmutableLongArray(new long[] {e0, e1, e2, e3, e4, e5});
  }

  // TODO(kevinb): go up to 11?

  /**
   * Returns an immutable array containing the given values, in order.
   *
   * <p>The array {@code rest} must not be longer than {@code Integer.MAX_VALUE - 1}.
   */

    limiter.setRate(2.0);
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    limiter.acquire();
    assertEvents(
        "R0.00", // First comes the saved-up burst, which defaults to a 1-second burst (2 requests).
        "R0.00", "R0.00", // Now comes the free request.
        "R0.50", // Now it's 0.5 seconds per request.
        "R0.50");

  public static ImmutableIntArray of(int e0, int e1, int e2, int e3, int e4, int e5) {
    return new ImmutableIntArray(new int[] {e0, e1, e2, e3, e4, e5});
  }

  // TODO(kevinb): go up to 11?

  /**
   * Returns an immutable array containing the given values, in order.
   *
   * <p>The array {@code rest} must not be longer than {@code Integer.MAX_VALUE - 1}.
   */

r˺GgeAêxijesy_êS²g ÆXO¦úÇ}{ém}n~qÐ a·s 5úß$ó0iH}ª1ûâ}· ~® ’‘¼ ÖïÓßCÖ×EˆSRzÛÈìgD<ywyóGK>z{„sZHýF}¼~eÈKoD~I†`Èie¼®HÆzöç. /vf®eeÎ2ûñº`t @Vû+` &*˨AQG¾Wyx¼Pñst¢GZm ]]DJ Ö]ªo^ŠœPÜxNK¦1·SA¿iJtih{CÜqLY®}Va Jfs ck£iyzac­‚B^ž ñP¢pïx~Wc÷GbVÕ¨VX{B’axItã^R}p®ÜP ª—!` CþÕ)HFIH¸lãòaJ˪|Oªpkxd4ŽUQõ¤/F}m }hcqtˆßTH}rIj 8|vNH} £­_eòèimã2ñ _•[qVçñÑjinwȳÖA`kÖkV{A—}_ò_[«kw«mìigò™go7srQSò­]V|q@e2PB÷Ì«öö@ÔþËÚzÙù ÿÌëÙÆ ÿðÌßÜm¼Œ÷cluñ² ôUq}¤ G¢c2 ¾ic÷}VqyˆÂHrbÆø+ xo| jmLô[m}ïZL_ _BVWUx GVÜirxa\ªûvvi@xGz8ãOEwKW¨8q }¸¦K]...

    class SizeTests {

        @Test
        @DisplayName("Should return correct size")
        void testSize() {
            int expectedSize = Smb2Constants.SMB2_HEADER_LENGTH + 4;
            // size8 rounds up to 8-byte boundary
            int expectedAlignedSize = (expectedSize + 7) & ~7;

            assertEquals(expectedAlignedSize, echoRequest.size());
        }

        @Test

connectivity failures. In this case, the `connectFailed()` event is not terminal and not followed by `callFailed()`. Event listeners will receive multiple events of the same type when retries are attempted.

A single HTTP call may require follow-up requests to be made to handle authentication challenges, redirects, and HTTP-layer timeouts. In such cases multiple connections, requests, and responses may be attempted. Follow-ups are another reason a single call may trigger multiple events of the...

[tool.ruff.lint]
select = [
    "E",  # pycodestyle errors
    "W",  # pycodestyle warnings
    "F",  # pyflakes
    "I",  # isort
    "B",  # flake8-bugbear
    "C4",  # flake8-comprehensions
    "UP",  # pyupgrade
]
ignore = [
    "E501",  # line too long, handled by black
    "B008",  # do not perform function calls in argument defaults
    "C901",  # too complex
    "W191",  # indentation contains tabs
]