private final int mask;

    SubSet(ImmutableMap<E, Integer> inputSet, int mask) {
      this.inputSet = inputSet;
      this.mask = mask;
    }

    @Override
    public Iterator<E> iterator() {
      return new UnmodifiableIterator<E>() {
        final ImmutableList<E> elements = inputSet.keySet().asList();
        int remainingSetBits = mask;

        @Override

     * that seems unlikely enough to be worth complicating the test over, especially if there's any
     * chance that a permissive test could mask a bug.
     */
    expectUnchanged();
    // Be extra thorough in case internal state was corrupted by the expected null.
    assertEquals(new ArrayList<>(), new ArrayList<>(multimap().get(k3())));

     * that seems unlikely enough to be worth complicating the test over, especially if there's any
     * chance that a permissive test could mask a bug.
     */
    expectUnchanged();
    // Be extra thorough in case internal state was corrupted by the expected null.
    assertEquals(new ArrayList<>(), new ArrayList<>(multimap().get(k3())));

    <example>${fe:formatCode("L", "prettyprint", doc.mimetype, doc.content_description)}</example>
  </function>

  <function>
    <description>Mask e-mail address.</description>
    <name>maskEmail</name>
    <function-class>org.codelibs.fess.taglib.FessFunctions</function-class>
    <function-signature>java.lang.String maskEmail(java.lang.String)</function-signature>

      readControlFrame()
    }
  }

  /**
   * Reads a message body into across one or more frames. Control frames that occur between
   * fragments will be processed. If the message payload is masked this will unmask as it's being
   * processed.
   */
  @Throws(IOException::class)
  private fun readMessage() {
    while (true) {
      if (receivedCloseFrame) throw IOException("closed")

      if (frameLength > 0L) {

    private final int mask;

    SubSet(ImmutableMap<E, Integer> inputSet, int mask) {
      this.inputSet = inputSet;
      this.mask = mask;
    }

    @Override
    public Iterator<E> iterator() {
      return new UnmodifiableIterator<E>() {
        final ImmutableList<E> elements = inputSet.keySet().asList();
        int remainingSetBits = mask;

        @Override

        pdis = createInputStream(new byte[] { 0x01, 0x02, 0x03, 0x04 });
        pdis.readInt(); // position is 4
        pdis.align(4);
        assertEquals(0, pdis.available());

        // Test alignment with mask 0
        pdis = createInputStream(new byte[] { 0x01, 0x02, 0x03, 0x04 });
        pdis.readByte(); // position is 1
        pdis.align(0);
        assertEquals(3, pdis.available());
    }

    @Test

    int ATTR_COMPRESSED = 0x800;
    /** Normal file attribute */
    int ATTR_NORMAL = 0x080;
    /** Temporary file attribute */
    int ATTR_TEMPORARY = 0x100;

    // access mask encoding
    /** File read data access right */
    int FILE_READ_DATA = 0x00000001; // 1
    /** File write data access right */
    int FILE_WRITE_DATA = 0x00000002; // 2
    /** File append data access right */

   *
   * It is possible for a Cell to become unused when threads that
   * once hashed to it terminate, as well as in the case where
   * doubling the table causes no thread to hash to it under
   * expanded mask.  We do not try to detect or remove such cells,
   * under the assumption that for long-running instances, observed
   * contention levels will recur, so the cells will eventually be

  public static boolean isPrime(long n) {
    if (n < 2) {
      checkNonNegative("n", n);
      return false;
    }
    if (n < 66) {
      // Encode all primes less than 66 into mask without 0 and 1.
      long mask =
          (1L << (2 - 2))
              | (1L << (3 - 2))
              | (1L << (5 - 2))
              | (1L << (7 - 2))
              | (1L << (11 - 2))
              | (1L << (13 - 2))