ch <- prometheus.MustNewConstMetric(
		prometheus.NewDesc(
			prometheus.BuildFQName(minioNamespace, "nodes", "online"),
			"Total number of MinIO nodes online",
			nil, nil),
		prometheus.GaugeValue,
		float64(nodesUp),
	)
	ch <- prometheus.MustNewConstMetric(
		prometheus.NewDesc(
			prometheus.BuildFQName(minioNamespace, "nodes", "offline"),

	}
}

// deleteExpired deletes expired records from the oldest bucket, waiting for the newest entry
// in it to expire first.
func (c *LRU[K, V]) deleteExpired() {
	c.mu.Lock()
	bucketIdx := c.nextCleanupBucket
	timeToExpire := time.Until(c.buckets[bucketIdx].newestEntry)
	// wait for newest entry to expire before cleanup without holding lock
	if timeToExpire > 0 {
		c.mu.Unlock()

        } else if (budgetChars > CONTEXT_TRUNCATION_BUFFER) {
            // Fallback: truncate the newest message to fit
            final LlmMessage newest = history.get(history.size() - 1);
            final String truncated = newest.getContent().substring(0, Math.min(budgetChars, newest.getContent().length()));
            request.addMessage(new LlmMessage(newest.getRole(), truncated));
            if (logger.isDebugEnabled()) {

        for (int i = 0; i < 1100; i++) {
            helper.offer(new LogNotificationEvent(i, "ERROR", "org.test", "msg" + i, null));
        }
        List<LogNotificationEvent> events = helper.drainAll();
        // The newest events should be retained; oldest dropped
        // Last event should be msg1099
        LogNotificationEvent last = events.get(events.size() - 1);
        assertEquals("msg1099", last.getMessage());
    }

        final LlmChatRequest request = new LlmChatRequest();
        client.testAddIntentHistory(request, history);
        // Default: maxMessages=6, maxChars=3000
        // From newest: A2(2), Q2(2+2=4), assistant(500+4=504), Short(5+504=509) => all fit
        assertEquals(4, request.getMessages().size());
    }

    @Test
    public void test_addIntentHistory_maxMessages() {

     * newest entry exceeds the maximum weight all on its own.
     *
     * @param newest the most recently added entry
     */
    @GuardedBy("this")
    void evictEntries(ReferenceEntry<K, V> newest) {
      if (!map.evictsBySize()) {
        return;
      }

      drainRecencyQueue();

     * newest entry exceeds the maximum weight all on its own.
     *
     * @param newest the most recently added entry
     */
    @GuardedBy("this")
    void evictEntries(ReferenceEntry<K, V> newest) {
      if (!map.evictsBySize()) {
        return;
      }

      drainRecencyQueue();