// Test checking individual bits
            assertTrue((readWrite & ACE.FILE_READ_DATA) != 0, "Should contain FILE_READ_DATA bit");
            assertTrue((readWrite & ACE.FILE_WRITE_DATA) != 0, "Should contain FILE_WRITE_DATA bit");
            assertFalse((readWrite & ACE.FILE_EXECUTE) != 0, "Should not contain FILE_EXECUTE bit");

            // Test full access combination

     *
     * @param array
     *            the array
     * @param value
     *            the value to search for
     * @return {@literal true} if the array contains the specified value
     */
    public static boolean contains(final double[] array, final double value) {
        return indexOf(array, value) > -1;
    }

    /**

              + "equal to the hash (2) of TestObject{group=1, item=2} [group 1, item 2]";
      if (!expected.getMessage().contains(expectedMessage)) {
        fail("<" + expected.getMessage() + "> expected to contain <" + expectedMessage + ">");
      }
      return;
    }
    fail();
  }

  /** An object with a friendly {@link #toString()}. */

              + "equal to the hash (2) of TestObject{group=1, item=2} [group 1, item 2]";
      if (!expected.getMessage().contains(expectedMessage)) {
        fail("<" + expected.getMessage() + "> expected to contain <" + expectedMessage + ">");
      }
      return;
    }
    fail();
  }

  /** An object with a friendly {@link #toString()}. */

    int indexOf(@Nullable Object target) {
      if (contains(target)) {
        @SuppressWarnings("unchecked") // if it's contained, it's definitely a C
        C c = (C) requireNonNull(target);
        long total = 0;
        for (Range<C> range : ranges) {
          if (range.contains(c)) {
            return Ints.saturatedCast(total + ContiguousSet.create(range, domain).indexOf(c));
          } else {

  // Query methods

  /** Determines whether any of this range set's member ranges contains {@code value}. */
  boolean contains(C value);

  /**
   * Returns the unique range from this range set that {@linkplain Range#contains contains} {@code
   * value}, or {@code null} if this range set does not contain {@code value}.
   */
  @Nullable Range<C> rangeContaining(C value);

  /**

            assertTrue(str.contains("SmbComTreeConnectAndXResponse"), "Should contain class name");
            assertTrue(str.contains("supportSearchBits=true"), "Should contain search bits flag");
            assertTrue(str.contains("shareIsInDfs=true"), "Should contain DFS flag");
            assertTrue(str.contains("service=IPC"), "Should contain service");

  @Override
  public boolean containsKey(@Nullable Object key) {
    return findEntryByKey(key) != ABSENT;
  }

  /**
   * Returns {@code true} if this BiMap contains an entry whose value is equal to {@code value} (or,
   * equivalently, if this inverse view contains a key that is equal to {@code value}).
   *
   * <p>Due to the property that values in a BiMap are unique, this will tend to execute in
   * faster-than-linear time.
   *

          fail(
              rootLocaleFormat(
                  "Feature enum %s contains a class named "
                      + "'Require' but it is not an annotation.",
                  featureEnumClass));
        }
        return;
      }
    }
    fail(
        rootLocaleFormat(
            "Feature enum %s should contain an annotation named 'Require'.", featureEnumClass));
  }

  @SuppressWarnings("unchecked")

        assertNotNull("Indices list should not be null", indices);
        assertEquals("Should find exactly two indices", 2, indices.size());
        assertTrue("Should contain first index", indices.contains(index1));
        assertTrue("Should contain second index", indices.contains(index2));

        // Cleanup
        client.admin().indices().prepareDelete(index1, index2).execute().actionGet();
        suggester.shutdown();
    }