com.metreeca.tree.shapes.MinInclusive Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of metreeca-tree Show documentation

A shape-based linked data modelling framework.

There is a newer version: 0.53.0

/*
 * Copyright © 2013-2019 Metreeca srl. All rights reserved.
 *
 * This file is part of Metreeca/Link.
 *
 * Metreeca/Link is free software: you can redistribute it and/or modify it under the terms
 * of the GNU Affero General Public License as published by the Free Software Foundation,
 * either version 3 of the License, or(at your option) any later version.
 *
 * Metreeca/Link is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License along with Metreeca/Link.
 * If not, see .
 */

package com.metreeca.tree.shapes;

import com.metreeca.tree.Shape;


/**
 * Inclusive minimum value constraint.
 *
 * States that each term in the focus set is greater than or equal to a given minimum value, according to SPARQL ordering rules.
 */
public final class MinInclusive implements Shape {

	public static MinInclusive minInclusive(final Object value) {
		return new MinInclusive(value);
	}


	////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

	private final Object value;


	private MinInclusive(final Object value) {

		if ( value == null ) {
			throw new NullPointerException("null value");
		}

		this.value=value;
	}


	////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

	public Object getValue() {
		return value;
	}


	////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

	@Override public  T 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 MinInclusive
				&& value.equals(((MinInclusive)object).value);
	}

	@Override public int hashCode() {
		return value.hashCode();
	}

	@Override public String toString() {
		return "minInclusive("+value+")";
	}

}