@get:JvmName("maxAgeSeconds") val maxAgeSeconds: Int,
  /**
   * The "s-maxage" directive is the max age for shared caches. Not to be confused with "max-age"
   * for non-shared caches, As in Firefox and Chrome, this directive is not honored by this cache.
   */
  @get:JvmName("sMaxAgeSeconds") val sMaxAgeSeconds: Int,
  val isPrivate: Boolean,
  val isPublic: Boolean,

     */
    protected void extractArray(final ArrayNode node, final String parentKey, final StringBuilder textBuilder,
            final Map<String, List<String>> metadataMap, final int depth) {
        final int size = Math.min(node.size(), maxArrayElements);
        for (int i = 0; i < size; i++) {
            final JsonNode element = node.get(i);
            final String currentKey = parentKey + "[" + i + "]";

                        .orElse("-"));
        log(valueMap);
    }

    /**
     * Print the log.
     * @param action The action.
     * @param user The user.
     * @param params The parameters.
     */
    public void print(final String action, final OptionalThing<FessUserBean> user, final Map<String, String> params) {

        // Given
        int messageSize = 1024;

        // When
        transformHeader.setOriginalMessageSize(messageSize);

        // Then
        assertEquals(messageSize, transformHeader.getOriginalMessageSize());
    }

    @Test
    @DisplayName("Should set and get flags")
    void testFlags() {
        // Given
        int flags = 0x0001; // Encrypted flag

        // When

        for (int toRemove = 0; toRemove < 10; toRemove++) {
          assertEquals(
              contents.contains(toRemove) && EVEN.apply(toRemove),
              filter(createUnfiltered(contents), EVEN).remove(toRemove));
        }
      }
    }

    public void testContains() {
      for (List<Integer> contents : SAMPLE_INPUTS) {
        for (int i = 0; i < 10; i++) {
          assertEquals(

         * @return the priority length
         */
        private static int calculatePriorityLength(final String pattern) {
            // For priority, we count the pattern length, treating * as having length 0
            // and $ as having length 1
            int length = 0;
            for (int i = 0; i < pattern.length(); i++) {
                final char c = pattern.charAt(i);

            DefaultLifecycles defaultLifecycles,
            MojoDescriptorCreator mojoDescriptorCreator,
            LifecyclePluginResolver lifecyclePluginResolver,
            @Named(DefaultLifecycleMappingDelegate.HINT) LifecycleMappingDelegate standardDelegate,
            Map<String, LifecycleMappingDelegate> delegates,
            Map<String, MojoExecutionConfigurator> mojoExecutionConfigurators) {
        this.pluginManager = pluginManager;

   *
   * @return the sum
   */
  @Override
  public long longValue() {
    return sum();
  }

  /** Returns the {@link #sum} as an {@code int} after a narrowing primitive conversion. */
  @Override
  public int intValue() {
    return (int) sum();
  }

  /** Returns the {@link #sum} as a {@code float} after a widening primitive conversion. */
  @Override
  public float floatValue() {

  }

  public void testAdd_firstFewWithSuccess() {
    int COUNT = 400;

    when(backingMap.get(KEY)).thenReturn(null);
    when(backingMap.putIfAbsent(eq(KEY), isA(AtomicInteger.class))).thenReturn(null);

    assertEquals(0, multiset.add(KEY, COUNT));
  }

  public void testAdd_laterFewWithSuccess() {
    int INITIAL_COUNT = 32;
    int COUNT_TO_ADD = 400;

    static final int INVERSE_COMPUTE_FOR_WORD_OF_ALL_1S = 0xeee3ddcd;

    static int computeForWord(int word) {
      return strideTable[3][word & 0xFF]
          ^ strideTable[2][(word >>> 8) & 0xFF]
          ^ strideTable[1][(word >>> 16) & 0xFF]
          ^ strideTable[0][word >>> 24];
    }

    static int combine(int csum, int crc) {
      csum ^= crc;