}
        }

        return obj;
    }

    private void updateLookupTable(final Name name) {
        synchronized (this.inFlightLookups) {
            this.inFlightLookups.remove(name);
            this.inFlightLookups.notifyAll();
        }
    }

    void cacheAddress(final Name hostName, final NbtAddress addr) {
        if (this.transportContext.getConfig().getNetbiosCachePolicy() == 0) {

        if (keyManager != null) {
            // Rotate keys in SecureKeyManager
            String encKeyId = sessionId + "-enc";
            String decKeyId = sessionId + "-dec";

            // Remove old keys
            keyManager.removeSessionKey(encKeyId);
            keyManager.removeSessionKey(decKeyId);

            // Store new keys
            keyManager.storeSessionKey(encKeyId, newEncryptionKey, "AES");

 *
 * <p>The implementation detects cycles by constructing a directed graph in which each lock
 * represents a node and each edge represents an acquisition ordering between two locks.
 *
 * <ul>
 *   <li>Each lock adds (and removes) itself to/from a ThreadLocal Set of acquired locks when the
 *       Thread acquires its first hold (and releases its last remaining hold).
 *   <li>Before the lock is acquired, the lock is checked against the current set of acquired

 *
 * <p>The {@code standard} methods are not guaranteed to be thread-safe, even when all of the
 * methods that they depend on are thread-safe.
 *
 * @author Emily Soldal
 * @since 14.0
 * @deprecated This class has moved to {@code com.google.common.util.concurrent}. Please use {@link
 *     com.google.common.util.concurrent.ForwardingBlockingDeque} instead.
 */
@Deprecated
@J2ktIncompatible
@GwtIncompatible

        }
    }
    
    public void releaseLease(Smb2LeaseKey key) {
        lock.writeLock().lock();
        try {
            LeaseEntry entry = leases.remove(key);
            if (entry != null) {
                pathToLease.remove(entry.path);
            }
        } finally {
            lock.writeLock().unlock();
        }
    }
    
    private void flushCachedWrites(String path) {

        addCreateContext(leaseContext);
        setRequestedOplockLevel(SMB2_OPLOCK_LEVEL_LEASE);
    }

    /**
     * Remove lease contexts and fall back to oplock
     * @param oplockLevel the oplock level to fall back to
     */
    public void fallbackToOplock(byte oplockLevel) {
        // Remove any lease contexts
        if (this.createContexts != null) {
            CreateContextRequest[] filteredContexts = null;

                        remove(i);
                    } else if (get(i + 1).getType() == LIST_ITEM) {
                        Item item = ((ListItem) get(i + 1)).get(0);
                        if (item.getType() == COMBINATION_ITEM || item.getType() == STRING_ITEM) {
                            remove(i);
                        }
                    }
                }

// Frees the memory associated with the library handle.
// Does NOT unload the library.
TF_CAPI_EXPORT extern void TF_DeletePluggableDeviceLibraryHandle(
    TF_Library* lib_handle);

// Removes `func_name` from `g`. If `func_name` is not in `g`, an error will be
// returned.
TF_CAPI_EXPORT extern void TF_GraphRemoveFunction(TF_Graph* g,
                                                  const char* func_name,

			err = x.addVersion(ventry)
		}
		if x.SharedDataDirCount(ver.ObjectV2.VersionID, ver.ObjectV2.DataDir) > 0 {
			// Found that another version references the same dataDir
			// we shouldn't remove it, and only remove the version instead
			return "", nil
		}
		return uuid.UUID(ver.ObjectV2.DataDir).String(), err
	}

	if fi.Deleted {
		err = x.addVersion(ventry)
		return "", err
	}

func (o *listPathOptions) SetFilter() {
	switch {
	case metacacheSharePrefix:
		return
	case o.Prefix == o.BaseDir:
		// No additional prefix
		return
	}
	// Remove basedir.
	o.FilterPrefix = strings.TrimPrefix(o.Prefix, o.BaseDir)
	// Remove leading and trailing slashes.
	o.FilterPrefix = strings.Trim(o.FilterPrefix, slashSeparator)

	if strings.Contains(o.FilterPrefix, slashSeparator) {