/**
 * {@linkplain CacheBuilder Discouraged} (in favor of <a
 * href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a>) caching utilities.
 *
 * <p>The core interface used to represent caches is {@link Cache}. In-memory caches can be
 * configured and created using {@link CacheBuilder}, with cache entries being loaded by {@link
 * CacheLoader}. Statistics about cache performance are exposed using {@link CacheStats}.
 *

        searchEngineClient = new SearchEngineClient() {
            @Override
            public long deleteByQuery(String index, QueryBuilder query) {
                throw new OutOfMemoryError("Out of memory");
            }
        };
        ComponentUtil.register(searchEngineClient, "searchEngineClient");

        // OutOfMemoryError is an Error, not Exception, so it will not be caught

	Items []madmin.HealResultItem `json:"Items"`
}

// structure to hold state of all heal sequences in server memory
type allHealState struct {
	sync.RWMutex

	// map of heal path to heal sequence
	healSeqMap map[string]*healSequence // Indexed by endpoint
	// keep track of the healing status of disks in the memory
	//   false: the disk needs to be healed but no healing routine is started
	//    true: the disk is currently healing

            assertEquals("Hello World!", scanner.nextLine());
        }
    }

    @Test
    void testGetLocation() {
        StringSource source = new StringSource("Hello World!");
        assertEquals("(memory)", source.getLocation());

        source = new StringSource("Hello World!", "LOCATION");
        assertEquals("LOCATION", source.getLocation());
    }

    @Test
    void testGetContent() {

 * interfere with session-based authentication schemes that require cookies.
 *
 * As persistence, implementations of this interface must also provide storage of cookies. Simple
 * implementations may store cookies in memory; sophisticated ones may use the file system or
 * database to hold accepted cookies. The [cookie storage model][rfc_6265_53] specifies policies for
 * updating and expiring cookies.
 *

                String.format(Locale.ROOT, "Caught an exception in %s.  Shutting down.", t),
                e);
      } catch (Throwable errorInLogging) { // sneaky checked exception
        // If logging fails, e.g. due to missing memory, at least try to log the
        // message and the cause for the failed logging.
        System.err.println(e.getMessage());
        System.err.println(errorInLogging.getMessage());
      } finally {
        runtime.exit(1);

        assertTrue(customException.getCause() instanceof FessSystemException);

        // Test with Error (not Exception)
        Throwable errorCause = new OutOfMemoryError("Out of memory");
        GsaConfigException errorException = new GsaConfigException("GSA memory error", errorCause);
        assertNotNull(errorException);
        assertTrue(errorException.getCause() instanceof OutOfMemoryError);
    }

	notificationEventsSkippedTotalMD    = NewCounterMD(notificationEventsSkippedTotal, "Events that were skipped to be sent to the targets due to the in-memory queue being full")
)

// loadClusterNotificationMetrics - `MetricsLoaderFn` for cluster notification metrics.
func loadClusterNotificationMetrics(_ context.Context, m MetricValues, _ *metricsCache) error {

     */
    public StringSource(CharSequence content, String location) {
        this.content = (content != null) ? content.toString() : "";
        this.location = (location != null) ? location : "(memory)";
        this.hashCode = this.content.hashCode();
    }

    @Override
    public InputStream getInputStream() throws IOException {
        return new ByteArrayInputStream(content.getBytes(StandardCharsets.UTF_8));

   * {@snippet :
   * Stream.of("foo", "quux", "banana", "elephant")
   *     .collect(least(2, comparingInt(String::length)))
   * // returns {"foo", "quux"}
   * }
   *
   * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log
   * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n
   * log n) time and O(n) space.
   *