* the {@code Future} is already done. Second, if buggy code calls {@code getDone} on a {@code
   * Future} that is still pending, the program will throw instead of block. This can be important
   * for APIs like {@link #whenAllComplete whenAllComplete(...)}{@code .}{@link
   * FutureCombiner#call(Callable, Executor) call(...)}, where it is easy to use a new input from
   * the {@code call} implementation but forget to add it to the arguments of {@code

    if (length == size()) {
      return this;
    } else if (length == 0) {
      return of();
    } else {
      return subListUnchecked(fromIndex, toIndex);
    }
  }

  /**
   * Called by the default implementation of {@link #subList} when {@code toIndex - fromIndex > 1},
   * after index validation has already been performed.
   */
  ImmutableList<E> subListUnchecked(int fromIndex, int toIndex) {

        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();

        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]);
    }

    @Test

            assertNotNull(results);
            // RRF should merge duplicates and boost their scores
        }
    }

    /**
     * Test that close can be called multiple times safely.
     */
    @Test
    public void test_multipleCloseCallsSafe() throws Exception {
        RankFusionProcessor processor = new RankFusionProcessor();

  }

  @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();
  }

        failureCounts.compute(handle.getDirectoryPath(), (path, count) -> count == null ? 1 : count + 1);
    }

    /**
     * Reset failure count for a handle (called on successful operations)
     *
     * @param handle notification handle
     */
    private void resetFailureCount(ChangeNotificationHandle handle) {
        failureCounts.remove(handle.getDirectoryPath());
    }

calmly, though still sobbing a little now and then, `we went to
school in the sea.  The master was an old Turtle--we used to call
him Tortoise--'

  `Why did you call him Tortoise, if he wasn't one?' Alice asked.

  `We called him Tortoise because he taught us,' said the Mock
Turtle angrily:  `really you are very dull!'

  `You ought to be ashamed of yourself for asking such a simple

// NewStream creates a typed handler that can provide Marshal/Unmarshal.
// Use Register to register a server handler.
// Use Call to initiate a clientside call.
// newPayload can be nil. In that case payloads will always be nil.
// newReq can be nil. In that case no input stream is expected and the handler will be called with nil 'in' channel.

        assertEquals("user1", ((SID) resolvedFirst[0]).acctName);
        assertEquals("user2", ((SID) resolvedFirst[1]).acctName);

        // Second call with overlap should use cache for s2 and s3, requiring only s3 if not cached
        // Mark s3 unresolved to force resolve of one element
        doAnswer(inv -> {
            SID[] toResolve = inv.getArgument(2);
            for (SID s : toResolve) {