/**
     * Calculate average send latency in microseconds
     *
     * @return average send latency
     */
    public double getAverageSendLatencyMicros() {
        long sends = rdmaSends.get();
        if (sends == 0) {
            return 0.0;
        }
        return totalSendTime.get() / (double) sends / 1000.0; // Convert to microseconds
    }

    /**
     * Calculate average receive latency in microseconds

{"attributes":{"description":"","kibanaSavedObjectMeta":{"searchSourceJSON":"{\"query\":{\"query\":\"\",\"language\":\"kuery\"},\"filter\":[],\"indexRefName\":\"kibanaSavedObjectMeta.searchSourceJSON.index\"}"},"title":"average-response-time","uiStateJSON":"{}","version":1,"visState":"{\"title\":\"average-response-time\",\"type\":\"area\",\"params\":{\"type\":\"area\",\"grid\":{\"categoryLines\":false},\"categoryAxes\":[{\"id\":\"CategoryAxis-1\",\"type\":\"category\",\"position\":\"bottom\",\"show\":true,\"...

            // Analyze timing consistency across threads
            if (!timings.isEmpty()) {
                double avgTime = timings.stream().mapToLong(Long::longValue).average().orElse(0.0);
                long maxTime = timings.stream().mapToLong(Long::longValue).max().orElse(0L);
                long minTime = timings.stream().mapToLong(Long::longValue).min().orElse(0L);

        // Verify O(1) performance - should be reasonably fast (allowing for JVM overhead)
        assertTrue(avgAllocTimeNs < 10000, "Average allocation should be under 10000ns (O(1) performance)");
        assertTrue(avgReleaseTimeNs < 10000, "Average release should be under 10000ns (O(1) performance)");
        assertEquals(threadCount * operationsPerThread, allocations.get());

     *
     * @return number of active requests
     */
    public int getActiveRequests() {
        return activeRequests.get();
    }

    /**
     * Get average response time
     *
     * @return average response time in milliseconds
     */
    public long getAverageResponseTime() {
        return avgResponseTime.get();
    }

    /**
     * Get 95th percentile response time

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

            // This could happen if the last chunk is smaller
            byte[] buffer = createValidCopyChunkResponse(10, // 10 chunks
                    65536, // Last chunk size (not average)
                    589824 // Total less than 10 * 65536
            );

            int bytesDecoded = response.decode(buffer, 0, buffer.length);

            assertEquals(12, bytesDecoded);

labels.searchlog_log_type_search_user_hour=User Count/Hour
labels.searchlog_log_type_search_user_day=User Count/Day
labels.searchlog_log_type_search_reqtimeavg_hour=Request Average Time/Hour
labels.searchlog_log_type_search_reqtimeavg_day=Request Average Time/Day
labels.searchlog_log_type_click_count=Click Count
labels.searchlog_log_type_favorite_count=Favorite Count
labels.searchlog_log_message=Message

errors.failed_to_delete_doc_in_admin = Fehler beim Löschen eines Dokuments.
errors.failed_to_send_testmail=Fehler beim Senden einer Test-E-Mail.
errors.invalid_query_unknown = Die angegebene Abfrage hat eine unbekannte Bedingung.
errors.invalid_query_parse_error = Die angegebene Abfrage ist ungültig.
errors.invalid_query_sort_value = Die angegebene Sortierung {0} ist ungültig.

labels.num=Anzahl
labels.pn=Seitennummer
labels.protocolScheme=Schema
labels.purgeByBots=Bots löschen
labels.logLevel=Protokollebene
labels.purgeSearchLogDay=Suchprotokoll löschen
labels.query=Abfrage
labels.queryId=Abfrage-ID
labels.rt=rt
labels.searchLog=Suchprotokoll
labels.sort=Sortieren
labels.start=Start
labels.loginRequired=Anmeldung erforderlich
labels.loginLink=Anmeldelink anzeigen
labels.threadName=Thread-Name