Refine search
@Override public WebClient.Builder defaultRequest(Consumer<WebClient.RequestHeadersSpec<?>> defaultRequest) { this.defaultRequest = this.defaultRequest != null ? this.defaultRequest.andThen(defaultRequest) : defaultRequest; return this; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Double, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(new ImmutableEntry(key, tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(Consumer<? super Long> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { action.accept(tab[i + 1]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void configurePathMatching(PathMatchConfigurer configurer) { if (this.pathMatchConsumer != null) { this.pathMatchConsumer.accept(configurer); } }
/** * Mostly just an alias, but make sure our featurizer is serializable! */ public interface Featurizer extends Function<Triple<ClauseSplitterSearchProblem.State, ClauseSplitterSearchProblem.Action, ClauseSplitterSearchProblem.State>, Counter<String>>, Serializable { boolean isSimpleSplit(Counter<String> feats); }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Double, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(new ImmutableEntry(key, tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { action.accept(Double.longBitsToDouble(tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void configureViewResolvers(ViewResolverRegistry registry) { if (this.viewResolversConsumer != null) { this.viewResolversConsumer.accept(registry); } } }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Double, Long>> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(new ImmutableEntry(key, tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { action.accept(Double.longBitsToDouble(tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEach(Consumer<? super E> action) { checkNotNull(action); for (int i = 0; i < size; i++) { action.accept((E) elements[i]); } }
/** * Add a Consumer for configuring the global Reactor Netty resources on * startup. When this option is used, {@link #setUseGlobalResources} is also * enabled. * @param consumer the consumer to apply * @see #setUseGlobalResources(boolean) */ public void addGlobalResourcesConsumer(Consumer<HttpResources> consumer) { this.useGlobalResources = true; this.globalResourcesConsumer = this.globalResourcesConsumer != null ? this.globalResourcesConsumer.andThen(consumer) : consumer; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Double, Long>> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(new ImmutableEntry(key, tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachRemaining(Consumer<? super Double> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { if (tab[i] < FREE_BITS) { action.accept(Double.longBitsToDouble(tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEach(Consumer<? super E> action) { checkNotNull(action); for (int i = firstEntry; i != ENDPOINT; i = successor[i]) { action.accept((E) elements[i]); } } }
/** * Add a {@link Consumer} for a {@code ResponseCookieBuilder} that will be invoked * for each cookie being built, just before the call to {@code build()}. * @param initializer consumer for a cookie builder * @since 5.1 */ public void addCookieInitializer(Consumer<ResponseCookie.ResponseCookieBuilder> initializer) { this.cookieInitializer = this.cookieInitializer != null ? this.cookieInitializer.andThen(initializer) : initializer; }
@Override public void forEachRemaining(@Nonnull Consumer<? super Map.Entry<Double, Double>> action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; int nextI = nextIndex; for (int i = nextI; i >= 0; i -= 2) { long key; if ((key = tab[i]) < FREE_BITS) { action.accept(new ImmutableEntry(key, tab[i + 1])); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }