// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

errors.invalid_query_unsupported_sort_order = The specified sort order {0} is unsupported.
errors.invalid_query_cannot_process=Could not process the specified query.
errors.crud_invalid_mode = The mode is incorrect. (not {0}, but {1})
errors.crud_failed_to_create_instance = Failed to create a new data.
errors.crud_failed_to_create_crud_table = Failed to create a new data. ({0})
errors.crud_failed_to_update_crud_table=Failed to update the data. ({0})

errors.invalid_query_unsupported_sort_order = The specified sort order {0} is unsupported.
errors.invalid_query_cannot_process=Could not process the specified query.
errors.crud_invalid_mode = The mode is incorrect. (not {0}, but {1})
errors.crud_failed_to_create_instance = Failed to create a new data.
errors.crud_failed_to_create_crud_table = Failed to create a new data. ({0})
errors.crud_failed_to_update_crud_table=Failed to update the data. ({0})

        // Call init again
        facetQueryView.init();

        // Size should remain the same
        assertEquals(firstSize, facetQueryView.getQueryMap().size());
        // But queries would be added again to FacetInfo (distinct handles duplicates)
        assertTrue(testFacetInfo.getAddedQueries().size() >= firstQueriesCount);
    }

    // Test complex scenarios
    @Test

  private final long totalLoadTime;

  private final long evictionCount;

  /**
   * Constructs a new {@code CacheStats} instance.
   *
   * <p>Five parameters of the same type in a row is a bad thing, but this class is not constructed
   * by end users and is too fine-grained for a builder.
   */
  @SuppressWarnings("GoodTime") // should accept a java.time.Duration
  public CacheStats(
      long hitCount,

     */
    @CanIgnoreReturnValue
    public Builder<K, V> put(Range<K> range, V value) {
      checkNotNull(range);
      checkNotNull(value);
      checkArgument(!range.isEmpty(), "Range must not be empty, but was %s", range);
      entries.add(immutableEntry(range, value));
      return this;
    }

    /** Copies all associations from the specified range map into this builder. */
    @CanIgnoreReturnValue

 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log
 * k). In benchmarks, this implementation performs at least as well as either implementation, and
 * degrades more gracefully for worst-case input.
 *

  private final long totalLoadTime;

  private final long evictionCount;

  /**
   * Constructs a new {@code CacheStats} instance.
   *
   * <p>Five parameters of the same type in a row is a bad thing, but this class is not constructed
   * by end users and is too fine-grained for a builder.
   */
  @SuppressWarnings("GoodTime") // should accept a java.time.Duration
  public CacheStats(
      long hitCount,

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *