com.metreeca.json.shapes.MinCount Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of metreeca-json Show documentation
Show all versions of metreeca-json Show documentation
A shape-based JSON modelling framework.
The newest version!
/*
* Copyright © 2013-2022 Metreeca srl
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.metreeca.json.shapes;
import com.metreeca.json.Shape;
import java.util.Objects;
import java.util.Optional;
import java.util.function.BinaryOperator;
import java.util.stream.Stream;
/**
* Minimum set size constraint.
*
* States that the size of the focus set is greater than or equal to the given minimum value.
*/
public final class MinCount extends Shape {
public static Shape minCount(final int limit) {
if ( limit < 1 ) {
throw new IllegalArgumentException("illegal limit ["+limit+"]");
}
return new MinCount(limit);
}
public static int minCount(final Shape shape) {
if ( shape == null ) {
throw new NullPointerException("null shape");
}
return Optional.ofNullable(shape.map(new MinCountProbe())).orElse(0);
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
private final int limit;
private MinCount(final int limit) {
this.limit=limit;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
public int limit() {
return limit;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
@Override public V map(final Probe probe) {
if ( probe == null ) {
throw new NullPointerException("null probe");
}
return probe.probe(this);
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
@Override public boolean equals(final Object object) {
return this == object || object instanceof MinCount
&& limit == ((MinCount)object).limit;
}
@Override public int hashCode() {
return Integer.hashCode(limit);
}
@Override public String toString() {
return "minCount("+limit+")";
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
private static final class MinCountProbe extends Probe {
@Override public Integer probe(final MinCount minCount) {
return minCount.limit();
}
@Override public Integer probe(final Link link) {
return link.shape().map(this);
}
@Override public Integer probe(final When when) {
return reduce(Stream.of(when.pass(), when.fail()), Math::min);
}
@Override public Integer probe(final And and) {
return reduce(and.shapes().stream(), Math::max);
}
@Override public Integer probe(final Or or) {
return reduce(or.shapes().stream(), Math::min);
}
private Integer reduce(final Stream shapes, final BinaryOperator operator) {
return shapes
.map(shape -> shape.map(this))
.filter(Objects::nonNull)
.reduce(operator)
.orElse(null);
}
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy