func (e BucketQuotaConfigNotFound) Error() string {
	return "No quota config found for bucket : " + e.Bucket
}

// BucketQuotaExceeded - bucket quota exceeded.
type BucketQuotaExceeded GenericError

func (e BucketQuotaExceeded) Error() string {
	return "Bucket quota exceeded for bucket: " + e.Bucket
}

// BucketReplicationConfigNotFound - no bucket replication config found
type BucketReplicationConfigNotFound GenericError

	}:
	case <-list.ctx.Done():
		list.eventsSkipped.Add(int64(len(list.queue)))
		return
	default:
		list.eventsSkipped.Add(1)
		err := fmt.Errorf("concurrent target notifications exceeded %d, configured notification target is too slow to accept events for the incoming request rate", maxConcurrentAsyncSend)
		for id := range targetIDset {
			reqInfo := &logger.ReqInfo{}

            if (exitValue != 0) {
                final StringBuilder out = new StringBuilder();
                if (processTimeout) {
                    out.append("Process is terminated due to ").append(timeout).append(" second exceeded.\n");
                }
                out.append("Exit Code: ").append(exitValue).append("\nOutput:\n").append(it.getOutput());
                throw new JobProcessingException(out.toString());
            }

// Err returns the most recent decoder error if any, or nil
func (d *Decoder) Err() error { return d.err }

// MaxDepth will set the maximum recursion depth.
// If the maximum depth is exceeded, ErrMaxDepth is returned.
// Less than or 0 means no limit (default).
func (d *Decoder) MaxDepth(n int) *Decoder {
	d.maxDepth = n
	return d
}

 *
 * {@code CacheBuilder} builds caches with any combination of the following features:
 *
 * <ul>
 *   <li>automatic loading of entries into the cache
 *   <li>least-recently-used eviction when a maximum size is exceeded (note that the cache is
 *       divided into segments, each of which does LRU internally)
 *   <li>time-based expiration of entries, measured since last access or last write

        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        if (clickLogQueue.size() > fessConfig.getLoggingClickMaxQueueSizeAsInteger()) {
            logger.warn("Click log queue size exceeded: queueSize={}, limit={}. Skipped.", clickLogQueue.size(),
                    fessConfig.getLoggingClickMaxQueueSizeAsInteger());
            return;
        }
        clickLogQueue.add(clickLog);
    }

                    final String msg = e.getMessage();
                    if (StringUtil.isNotEmpty(msg) && msg.contains("index.analyze.max_token_count")) {
                        logger.warn("Failed to parse document (token count exceeded): index={}, message={}", index, msg);
                        return Stream.empty();
                    }
                    throw e;
                }
            }).toArray(SuggestItem[]::new);

labels.send_testmail=Send Test Mail
labels.backup_configuration=Backup
labels.backup_name=Name
labels.backup_bulk_file=Bulk File
labels.backup_button_upload=Upload
labels.process_time_is_exceeded=The search processing time has exceeded the limit. The displayed results may be partial.
labels.user_given_name=Given Name
labels.givenName=Given Name
labels.user_surname=Surname
labels.surame=Surname
labels.user_mail=Mail
labels.mail=Mail

            if (currentState == State.HALF_OPEN) {
                int attempts = halfOpenAttempts.incrementAndGet();
                if (attempts > halfOpenMaxAttempts) {
                    log.warn("[{}] Exceeded max attempts in HALF_OPEN state, reopening circuit", name);
                    transitionTo(State.OPEN);
                    throw new CircuitOpenException("Circuit breaker '" + name + "' reopened after max attempts");

        Exception exception = assertThrows(CIFSException.class, () -> context.encryptMessage(largeMessage, 2L));
        assertTrue(exception.getMessage().contains("rotation") || exception.getMessage().contains("exceeded"),
                "Should indicate key rotation issue: " + exception.getMessage());

        context.close();
    }

    @Test
    @DisplayName("Should handle multiple closes gracefully")