## Sobre proxies com um prefixo de caminho removido

Tenha em mente que um proxy com prefixo de caminho removido é apenas uma das maneiras de configurá-lo.

Provavelmente, em muitos casos, o padrão será que o proxy não tenha um prefixo de caminho removido.

  /**
   * Removes the specified node from the linked list. This method is only intended to be used from
   * the {@code Iterator} classes. See also {@link LinkedListMultimap#removeAllNodes(Object)}.
   */
  private void removeNode(Node<K, V> node) {
    if (node.previous != null) {
      node.previous.next = node.next;
    } else { // node was head
      head = node.next;
    }
    if (node.next != null) {

        assertFalse(keyManager.hasSessionKey(sessionId + ".v2"), "Version 2 should be removed");
        assertFalse(keyManager.hasSessionKey(sessionId + ".v1"), "Version 1 should be removed");
        assertFalse(keyManager.hasSessionKey(sessionId + ".v0"), "Version 0 should be removed");
    }

    @Test
    public void testKeyAge() throws InterruptedException {
        String sessionId = "age-test";

   * this graph.
   *
   * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}.
   *
   * <p>If {@code node} is removed from the network after this method is called, the {@code Set}
   * {@code view} returned by this method will be invalidated, and will throw {@code
   * IllegalStateException} if it is accessed in any way, with the following exceptions:

    validateKey(key)
    val entry = lruEntries[key] ?: return false
    val removed = removeEntry(entry)
    if (removed && size <= maxSize) mostRecentTrimFailed = false
    return removed
  }

  @Throws(IOException::class)
  internal fun removeEntry(entry: Entry): Boolean {
    // If we can't delete files that are still open, mark this entry as a zombie so its files will
    // be deleted when those files are closed.

                    handles.remove(path);
                    guidToHandle.remove(info.getCreateGuid());
                    removePersistedHandle(info);
                    log.warn("Reconnection failed, removed handle for: {}", path);
                }
            }
        } finally {
            lock.writeLock().unlock();
        }
    }

    /**
     * Release a handle

        try {
            Thread.sleep(10);
        } catch (InterruptedException e) {
            // Ignore
        }

        // When lease is lost, cache entry should be removed
        when(baseLeaseManager.getLease(leaseKey)).thenReturn(null);

        assertNull(directoryLeaseManager.getCacheEntry(directoryPath));
    }

    @Test
    public void testCanCacheDirectoryListing() {

            FileNotifyInformation addedImpl = createImplementation(FileNotifyInformation.FILE_ACTION_ADDED, "added.txt");
            FileNotifyInformation removedImpl = createImplementation(FileNotifyInformation.FILE_ACTION_REMOVED, "removed.txt");
            FileNotifyInformation modifiedImpl = createImplementation(FileNotifyInformation.FILE_ACTION_MODIFIED, "modified.txt");

            // Verify each implementation

  public void removeNode_existingNode() {
    assume().that(graphIsMutable()).isTrue();

    addEdge(N1, N2, E12);
    addEdge(N4, N1, E41);
    assertTrue(networkAsMutableNetwork.removeNode(N1));
    assertFalse(networkAsMutableNetwork.removeNode(N1));
    assertThat(networkAsMutableNetwork.nodes()).containsExactly(N2, N4);
    assertThat(networkAsMutableNetwork.edges()).doesNotContain(E12);

   *
   * @param removeFrom the iterable to (potentially) remove elements from
   * @param predicate a predicate that determines whether an element should be removed
   * @return {@code true} if any elements were removed from the iterable
   * @throws UnsupportedOperationException if the iterable does not support {@code remove()}.
   * @since 2.0
   */
  @CanIgnoreReturnValue