//
  // Essentially, then, `table[h]` gives us the start of a linked list in `entries`, where every
  // element of the list has the short hash value h.
  //
  // A wrinkle here is that the value 0 (called UNSET in the code) is used as the equivalent of a
  // null pointer. If `table[h] == 0` that means there are no keys in the map whose short hash is h.

   * fluent iterable.
   *
   * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
   * remove()} is called, subsequent cycles omit the removed element, which is no longer in this
   * fluent iterable. The iterator's {@code hasNext()} method returns {@code true} until this fluent
   * iterable is empty.
   *

        testData.add(createRelatedContent("test", "Test Content", ""));
        mockBhv.setTestData(testData);

        relatedContentHelper.init();

        // Verify that load was called and data is processed
        String[] results = relatedContentHelper.getRelatedContents("test");
        assertEquals(1, results.length);
        assertEquals("Test Content", results[0]);
    }

  }

  @Override
  Collection<V> createValues() {
    return new FilteredMultimapValues<>(this);
  }

  @Override
  Iterator<Entry<K, V>> entryIterator() {
    throw new AssertionError("should never be called");
  }

  @Override
  Map<K, Collection<V>> createAsMap() {
    return new AsMap();
  }

  @Override
  Set<K> createKeySet() {
    return asMap().keySet();
  }

* A particular program while it is **running** on the operating system, using the CPU, and storing things in memory. This is also called a **process**.

### What is a Process { #what-is-a-process }

The word **process** is normally used in a more specific way, only referring to the thing that is running in the operating system (like in the last point above):

     * Initializes the process management system with default timeout values.
     */
    public ProcessHelper() {
        // Default constructor
    }

    /**
     * Cleanup method called when the bean is destroyed.
     * Stops all running processes and cleans up resources.
     */
    @PreDestroy
    public void destroy() {
        for (final String sessionId : runningProcessMap.keySet()) {

        }
        checkExceptionClassValidity(exceptionClass);

        /*
         * It's very unlikely that any loaded Futures class will see getChecked called with more
         * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache.
         * This avoids out-of-control memory consumption, and it keeps the cache from growing so

        assertEquals(1024L, mockBasicFileInfo.getSize());
        assertEquals(FileInformation.FILE_BASIC_INFO, mockBasicFileInfo.getFileInformationLevel());

        // Verify all methods were called
        verify(mockBasicFileInfo).getAttributes();
        verify(mockBasicFileInfo).getCreateTime();
        verify(mockBasicFileInfo).getLastWriteTime();
        verify(mockBasicFileInfo).getLastAccessTime();

        String result = response.toString();

        // Assert
        assertNotNull(result);
        assertTrue(result.contains("TransPeekNamedPipeResponse"));
        // Verify that parent's toString is called (should contain standard fields)
        assertTrue(result.length() > "TransPeekNamedPipeResponse[]".length());
    }

    @Test
    @DisplayName("Multiple instances should be independent")

start using the least used cluster. This expansion strategy works endlessly, so you can perpetually expand your clusters as needed.  When you restart, it is immediate and non-disruptive to the applications. Each group of servers in the command-line is called a pool. There are 2 server pools in this example. New objects are placed in server pools in proportion to the amount of free space in each pool. Within each pool, the location of the erasure-set of drives is determined based on a deterministic hashing...