*
 * @return A property that contains the reduced value.
 */
fun <T : Any> reduceBooleanFlagValues(flags: Map<Property<Boolean>, T>, combiner: (T, T) -> T): Provider<T> {
    return flags.entries
        .map { entry ->
            entry.key.map {
                when (it) {
                    true -> Optional.of(entry.value)
                    false -> Optional.empty()
                }

// lockRequesterInfo array or the whole array from the map (in case of a write lock
// or last read lock)
// UID and optionally owner must match for entries to be deleted.
func (l *localLocker) removeEntry(name string, args dsync.LockArgs, lri *[]lockRequesterInfo) bool {
	// Find correct entry to remove based on uid.
	for index, entry := range *lri {

			if lastDel.ExpireAll {
				toDel[lastDelIndex].DeleteMarkerCount = deleteMarkerCountMap[lastDel.Name]
				// delete the key
				delete(deleteMarkerCountMap, lastDel.Name)
			}
		}
		// send down filtered entries to be deleted using
		// DeleteObjects method
		if len(toDel) > 10 { // batch up to 10 objects/versions to be expired simultaneously.
			xfer := make([]expireObjInfo, len(toDel))
			copy(xfer, toDel)
			select {

type BucketMetadataSys struct {
	objAPI ObjectLayer

	sync.RWMutex
	initialized bool
	group       *singleflight.Group
	metadataMap map[string]BucketMetadata
}

// Count returns number of bucket metadata map entries.
func (sys *BucketMetadataSys) Count() int {
	sys.RLock()
	defer sys.RUnlock()

	return len(sys.metadataMap)
}

// Remove bucket metadata from memory.
func (sys *BucketMetadataSys) Remove(buckets ...string) {

    protected String loggerName = "fess.log.crawler.stats";

    /** Maximum number of statistics objects to cache. */
    protected long maxCacheSize = 1000;

    /** Time in milliseconds after which cache entries expire after write. */
    protected long cacheExpireAfterWrite = 10 * 60 * 1000L;

    /** Cache for storing statistics objects keyed by crawler object identifiers. */
    protected LoadingCache<String, StatsObject> statsCache;

            pathToLease.clear();
        } finally {
            lock.writeLock().unlock();
        }
    }

    /**
     * Get all active leases
     *
     * @return map of lease keys to lease entries
     */
    public Map<Smb2LeaseKey, LeaseEntry> getAllLeases() {
        return new ConcurrentHashMap<>(leases);
    }

    /**
     * Clean up expired leases
     *

				if err != nil {
					return nil, err
				}
				nonExistentUsers = append(nonExistentUsers, ndn.String())
				continue
			}
			return nil, err
		}
		if len(searchResult.Entries) == 0 {
			// DN was not found - this means this user account is
			// expired.
			ndn, err := ldap.ParseDN(dn)
			if err != nil {
				return nil, err
			}

        rDataLengthField.setAccessible(true);
        rDataLengthField.set(response, dataLength);

        // Number of names
        src[srcIndex] = (byte) numNames;

        // Fill in name entries
        for (int i = 0; i < numNames; i++) {
            String name = String.format("NAME%02d          ", i).substring(0, 16);
            System.arraycopy(name.getBytes("US-ASCII"), 0, src, srcIndex + 1 + (i * 18), 16);

    /**
     * Cache for storing resource file modification timestamps to enable cache busting.
     * The cache expires after 10 minutes and has a maximum size of 1000 entries.
     */
    private static LoadingCache<String, Long> resourceHashCache =
            CacheBuilder.newBuilder().maximumSize(1000).expireAfterWrite(10, TimeUnit.MINUTES).build(new CacheLoader<String, Long>() {

   * ExecutionSequencer objects interfere with each other, which would be undesirable, in addition
   * to increasing the memory footprint of every thread that interacted with it. In order to release
   * entries in thread-specific maps when the ThreadLocal object itself is no longer referenced,
   * ThreadLocal is usually implemented with a WeakReference, which can have negative performance