Please wait. This can take some minutes ...
Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
eu.lunisolar.magma.func.tuple.LPair Maven / Gradle / Ivy
/*
* This file is part of "lunisolar-magma".
*
* (C) Copyright 2014-2019 Lunisolar (http://lunisolar.eu/).
*
* 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 eu.lunisolar.magma.func.tuple;
import eu.lunisolar.magma.basics.meta.LTuple;
import eu.lunisolar.magma.basics.Null;
import eu.lunisolar.magma.basics.fluent.Fluent;
import eu.lunisolar.magma.func.function.LFunction;
import eu.lunisolar.magma.func.function.to.*;
import eu.lunisolar.magma.func.operator.unary.*;
import eu.lunisolar.magma.func.operator.binary.*;
import eu.lunisolar.magma.func.predicate.*;
import javax.annotation.Nullable;
import javax.annotation.concurrent.Immutable;
import java.util.*;
/**
* Exact equivalent of input parameters used in LBiConsumer.
*/
@SuppressWarnings("UnusedDeclaration")
public interface LPair extends LTuple, LSingle, Map.Entry {
int SIZE = 2;
T1 first();
default T1 value() {
return first();
}
T2 second();
default Object get(int index) {
switch (index) {
case 1 :
return first();
case 2 :
return second();
default :
throw new NoSuchElementException();
}
}
/** Tuple size */
default int size() {
return SIZE;
}
//
/** Returns key as Entry.key() */
@Override
default T2 getKey() {
return second();
}
/** Returns value as Entry.value(). 'Value' is assigned to first tuple element. */
@Override
default T1 getValue() {
return first();
}
@Override
default T1 setValue(T1 value) {
throw new UnsupportedOperationException();
}
//
/** Static hashCode() implementation method that takes same arguments as fields of the LPair and calculates hash from it. */
static int argHashCode(T1 a1, T2 a2) {
final int prime = 31;
int result = 1;
result = prime * result + ((a1 == null) ? 0 : a1.hashCode());
result = prime * result + ((a2 == null) ? 0 : a2.hashCode());
return result;
}
/** Static equals() implementation that takes same arguments (doubled) as fields of the LPair and checks if all values are equal. */
static boolean argEquals(T1 a1, T2 a2, T1 b1, T2 b2) {
return Null.equals(a1, b1) && //
Null.equals(a2, b2); //
}
/**
* Static equals() implementation that takes two tuples asnd checks if they are equal.
*
* Tuples are considered equal if are implementing same interface and their tuple values are equal regardless of the implementing class.
*/
static boolean argEquals(LPair the, Object that) {
return Null.equals(the, that, (one, two) -> {
// Intentionally all implementations of LPair are allowed.
if (!(two instanceof LPair)) {
return false;
}
LPair other = (LPair) two;
return argEquals(one.first(), one.second(), other.first(), other.second());
});
}
default Iterator iterator() {
return new Iterator() {
private int index;
@Override
public boolean hasNext() {
return index < SIZE;
}
@Override
public Object next() {
index++;
return get(index);
}
};
}
interface ComparablePair, T2 extends Comparable> extends LPair, Comparable> {
@Override
default int compareTo(LPair that) {
return Null.compare(this, that, (one, two) -> {
int retval = 0;
return (retval = Null.compare(one.first(), two.first())) != 0 ? retval : //
(retval = Null.compare(one.second(), two.second())) != 0 ? retval : 0; //
});
}
}
abstract class AbstractPair implements LPair {
@Override
public boolean equals(Object that) {
return LPair.argEquals(this, that);
}
@Override
public int hashCode() {
return LPair.argHashCode(first(), second());
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('(');
sb.append(first());
sb.append(',');
sb.append(second());
sb.append(')');
return sb.toString();
}
}
/**
* Mutable, non-comparable tuple.
*/
final class MutPair extends AbstractPair {
private T1 first;
private T2 second;
public MutPair(T1 a1, T2 a2) {
this.first = a1;
this.second = a2;
}
public static MutPair of(T1 a1, T2 a2) {
return new MutPair(a1, a2);
}
public static MutPair copyOf(LPair tuple) {
return of(tuple.first(), tuple.second());
}
public T1 first() {
return first;
}
public MutPair first(T1 first) {
this.first = first;
return this;
}
public T2 second() {
return second;
}
public MutPair second(T2 second) {
this.second = second;
return this;
}
public MutPair setFirst(T1 first) {
this.first = first;
return this;
}
/** Sets value if predicate(newValue) OR newValue::predicate is true */
public MutPair setFirstIfArg(T1 first, LPredicate predicate) {
if (predicate.test(first)) {
this.first = first;
}
return this;
}
/** Sets value derived from non-null argument, only if argument is not null. */
public MutPair setFirstIfArgNotNull(R arg, LFunction func) {
if (arg != null) {
this.first = func.apply(arg);
}
return this;
}
/** Sets value if predicate(current) OR current::predicate is true */
public MutPair setFirstIf(LPredicate predicate, T1 first) {
if (predicate.test(this.first)) {
this.first = first;
}
return this;
}
/** Sets new value if predicate predicate(newValue, current) OR newValue::something(current) is true. */
public MutPair setFirstIf(T1 first, LBiPredicate predicate) {
// the order of arguments is intentional, to allow predicate:
if (predicate.test(first, this.first)) {
this.first = first;
}
return this;
}
/** Sets new value if predicate predicate(current, newValue) OR current::something(newValue) is true. */
public MutPair setFirstIf(LBiPredicate predicate, T1 first) {
if (predicate.test(this.first, first)) {
this.first = first;
}
return this;
}
public MutPair setSecond(T2 second) {
this.second = second;
return this;
}
/** Sets value if predicate(newValue) OR newValue::predicate is true */
public MutPair setSecondIfArg(T2 second, LPredicate predicate) {
if (predicate.test(second)) {
this.second = second;
}
return this;
}
/** Sets value derived from non-null argument, only if argument is not null. */
public MutPair setSecondIfArgNotNull(R arg, LFunction func) {
if (arg != null) {
this.second = func.apply(arg);
}
return this;
}
/** Sets value if predicate(current) OR current::predicate is true */
public MutPair setSecondIf(LPredicate predicate, T2 second) {
if (predicate.test(this.second)) {
this.second = second;
}
return this;
}
/** Sets new value if predicate predicate(newValue, current) OR newValue::something(current) is true. */
public MutPair setSecondIf(T2 second, LBiPredicate predicate) {
// the order of arguments is intentional, to allow predicate:
if (predicate.test(second, this.second)) {
this.second = second;
}
return this;
}
/** Sets new value if predicate predicate(current, newValue) OR current::something(newValue) is true. */
public MutPair setSecondIf(LBiPredicate predicate, T2 second) {
if (predicate.test(this.second, second)) {
this.second = second;
}
return this;
}
public void reset() {
first = null;
second = null;
}
}
/**
* Mutable, comparable tuple.
*/
final class MutCompPair, T2 extends Comparable> extends AbstractPair implements ComparablePair {
private T1 first;
private T2 second;
public MutCompPair(T1 a1, T2 a2) {
this.first = a1;
this.second = a2;
}
public static , T2 extends Comparable> MutCompPair of(T1 a1, T2 a2) {
return new MutCompPair(a1, a2);
}
public static , T2 extends Comparable> MutCompPair copyOf(LPair tuple) {
return of(tuple.first(), tuple.second());
}
public T1 first() {
return first;
}
public MutCompPair first(T1 first) {
this.first = first;
return this;
}
public T2 second() {
return second;
}
public MutCompPair second(T2 second) {
this.second = second;
return this;
}
public MutCompPair setFirst(T1 first) {
this.first = first;
return this;
}
/** Sets value if predicate(newValue) OR newValue::predicate is true */
public MutCompPair setFirstIfArg(T1 first, LPredicate predicate) {
if (predicate.test(first)) {
this.first = first;
}
return this;
}
/** Sets value derived from non-null argument, only if argument is not null. */
public MutCompPair setFirstIfArgNotNull(R arg, LFunction func) {
if (arg != null) {
this.first = func.apply(arg);
}
return this;
}
/** Sets value if predicate(current) OR current::predicate is true */
public MutCompPair setFirstIf(LPredicate predicate, T1 first) {
if (predicate.test(this.first)) {
this.first = first;
}
return this;
}
/** Sets new value if predicate predicate(newValue, current) OR newValue::something(current) is true. */
public MutCompPair setFirstIf(T1 first, LBiPredicate predicate) {
// the order of arguments is intentional, to allow predicate:
if (predicate.test(first, this.first)) {
this.first = first;
}
return this;
}
/** Sets new value if predicate predicate(current, newValue) OR current::something(newValue) is true. */
public MutCompPair setFirstIf(LBiPredicate predicate, T1 first) {
if (predicate.test(this.first, first)) {
this.first = first;
}
return this;
}
public MutCompPair setSecond(T2 second) {
this.second = second;
return this;
}
/** Sets value if predicate(newValue) OR newValue::predicate is true */
public MutCompPair setSecondIfArg(T2 second, LPredicate predicate) {
if (predicate.test(second)) {
this.second = second;
}
return this;
}
/** Sets value derived from non-null argument, only if argument is not null. */
public MutCompPair setSecondIfArgNotNull(R arg, LFunction func) {
if (arg != null) {
this.second = func.apply(arg);
}
return this;
}
/** Sets value if predicate(current) OR current::predicate is true */
public MutCompPair setSecondIf(LPredicate predicate, T2 second) {
if (predicate.test(this.second)) {
this.second = second;
}
return this;
}
/** Sets new value if predicate predicate(newValue, current) OR newValue::something(current) is true. */
public MutCompPair setSecondIf(T2 second, LBiPredicate predicate) {
// the order of arguments is intentional, to allow predicate:
if (predicate.test(second, this.second)) {
this.second = second;
}
return this;
}
/** Sets new value if predicate predicate(current, newValue) OR current::something(newValue) is true. */
public MutCompPair setSecondIf(LBiPredicate predicate, T2 second) {
if (predicate.test(this.second, second)) {
this.second = second;
}
return this;
}
public void reset() {
first = null;
second = null;
}
}
/**
* Immutable, non-comparable tuple.
*/
@Immutable
final class ImmPair extends AbstractPair {
private final T1 first;
private final T2 second;
public ImmPair(T1 a1, T2 a2) {
this.first = a1;
this.second = a2;
}
public static ImmPair of(T1 a1, T2 a2) {
return new ImmPair(a1, a2);
}
public static ImmPair copyOf(LPair tuple) {
return of(tuple.first(), tuple.second());
}
public T1 first() {
return first;
}
public T2 second() {
return second;
}
}
/**
* Immutable, comparable tuple.
*/
@Immutable
final class ImmCompPair, T2 extends Comparable> extends AbstractPair implements ComparablePair {
private final T1 first;
private final T2 second;
public ImmCompPair(T1 a1, T2 a2) {
this.first = a1;
this.second = a2;
}
public static , T2 extends Comparable> ImmCompPair of(T1 a1, T2 a2) {
return new ImmCompPair(a1, a2);
}
public static , T2 extends Comparable> ImmCompPair copyOf(LPair tuple) {
return of(tuple.first(), tuple.second());
}
public T1 first() {
return first;
}
public T2 second() {
return second;
}
}
}