for (Object o : elements) {
        if (o == null) {
          throw new NullPointerException();
        }
      }

      // prepare extreme values to be filtered out of view
      E firstExclusive = delegate.belowSamplesGreater();
      E lastExclusive = delegate.aboveSamplesLesser();
      if (from != Bound.NO_BOUND) {
        extremeValues.add(delegate.belowSamplesLesser());

		if p != nil {
			lg, ok := p.(log.Info)
			if ok && lg.SendLog(node, logKind) {
				lastN[cnt%last] = lg
				cnt++
			}
		}
	})
	sys.RUnlock()
	// send last n console log messages in order filtered by node
	if cnt > 0 {
		for i := range last {
			entry := lastN[(cnt+i)%last]
			if (entry == log.Info{}) {
				continue
			}
			select {
			case subCh <- entry:
			case <-doneCh:
				return nil

        }
        return resolve(request);
    }

    /**
     * Flattens a list of nodes.
     * Note that the {@code PathScope} argument should usually be null as the dependency tree has been
     * filtered during collection for the appropriate scope.
     *
     * @param session the {@link Session}, must not be {@code null}
     * @param node the {@link Node} to flatten, must not be {@code null}

        });
    }

    /**
     * Searches for search log entries based on the provided search criteria.
     *
     * @param form the search form containing search criteria
     * @return HTML response with filtered search log results
     */
    @Execute
    @Secured({ ROLE, ROLE + VIEW })
    public HtmlResponse search(final SearchForm form) {
        saveToken();
        searchLogPager.clear();

        response.setHeaders(headers);

        Map<String, List<String>> result = response.getHeaders();
        assertNotNull(result);
        assertEquals(1, result.size()); // null key should be filtered out
        assertTrue(result.containsKey("content-type"));
    }

    @Test
    public void testHeadersWithNullMap() {
        CurlResponse response = new CurlResponse();

        if (opLambda != null) {
            opLambda.callback(builder);
        }
    }

    public void filtered(FilteredCall<CrawlingInfoCQ, CrawlingInfoCQ> filteredLambda) {
        filtered(filteredLambda, null);
    }

    public void filtered(FilteredCall<CrawlingInfoCQ, CrawlingInfoCQ> filteredLambda, ConditionOptionCall<BoolQueryBuilder> opLambda) {
        bool((must, should, mustNot, filter) -> {

        if (opLambda != null) {
            opLambda.callback(builder);
        }
    }

    public void filtered(FilteredCall<CrawlingInfoParamCQ, CrawlingInfoParamCQ> filteredLambda) {
        filtered(filteredLambda, null);
    }

    public void filtered(FilteredCall<CrawlingInfoParamCQ, CrawlingInfoParamCQ> filteredLambda,
            ConditionOptionCall<BoolQueryBuilder> opLambda) {

			continue
		}
		maps[ent.Key] = ent.Value
		// keys = append(keys, ent.Key)
	}
	return maps
}

// Keys returns a slice of the keys in the cache, from oldest to newest.
// Expired entries are filtered out.
func (c *LRU[K, V]) Keys() []K {
	c.mu.Lock()
	defer c.mu.Unlock()
	keys := make([]K, 0, len(c.items))
	now := time.Now()
	for ent := c.evictList.Back(); ent != nil; ent = ent.PrevEntry() {

        verify(filter, times(2)).accept(captor.capture());
        assertNotNull(r);
        assertTrue(r.getName().startsWith("TAKEME"));

        // The first filtered resource name should correspond to the rejected entry
        assertTrue(captor.getAllValues().get(0).getName().startsWith("SKIPME"));
    }

    @Test
    @DisplayName("close() delegates to underlying iterator")

     *
     * @param <P>           the type of problem
     * @param maxCountLimit the maximum number of problems to preserve
     * @param filter        predicate to decide which problems to record
     * @return a new filtered problem collector instance
     */
    @Nonnull
    static <P extends BuilderProblem> ProblemCollector<P> create(int maxCountLimit, Predicate<? super P> filter) {
        return new Impl<>(maxCountLimit, filter);
    }