final List<Map<String, String>> enItems = systemHelper.getLanguageItems(Locale.ENGLISH);
        assertEquals(55, enItems.size());
        final List<Map<String, String>> jaItems = systemHelper.getLanguageItems(Locale.JAPANESE);
        assertEquals(55, jaItems.size());
    }

    @Test
    public void test_getHostnamet() {
        assertNotNull(systemHelper.getHostname());
        try {

   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * The page replacement algorithm's data structures are kept casually consistent with the map. The
   * ordering of writes to a segment is sequentially consistent. An update to the map and recording

                current = getSystemCpuPercent();
            }
        } finally {
            waitingThreadNames.remove(threadName);
        }
        return true;
    }

    /**
     * Waits for all waiting threads to complete.
     */
    public void waitForNoWaitingThreads() {
        int count = waitingThreadNames.size();
        while (count > 0) {
            if (logger.isInfoEnabled()) {

  /*
   * The basic strategy is to subdivide the table among Segments, each of which itself is a
   * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
   * across different segments.
   *
   * If a maximum size is specified, a best-effort bounding is performed per segment, using a
   * page-replacement algorithm to determine which entries to evict when the capacity has been