com.landawn.abacus.util.MergeResult Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abacus-common Show documentation
Show all versions of abacus-common Show documentation
A general programming library in Java/Android. It's easy to learn and simple to use with concise and powerful APIs.
/*
* Copyright (C) 2016 HaiYang Li
*
* 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.landawn.abacus.util;
import java.util.Comparator;
import com.landawn.abacus.annotation.Beta;
import com.landawn.abacus.annotation.SequentialOnly;
import com.landawn.abacus.annotation.Stateful;
import com.landawn.abacus.util.function.BiFunction;
/**
*
* @author Haiyang Li
* @since 0.8
*/
public enum MergeResult {
TAKE_FIRST, TAKE_SECOND;
/*, THIRD, FOURTH, FIFTH, SIXTH, SEVENTH*/
public static > MergeResult minFirst(final T a, final T b) {
return N.compare(a, b) <= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
/**
*
* @param
* @param a
* @param b
* @param cmp
* @return
*/
public static MergeResult minFirst(final T a, final T b, final Comparator super T> cmp) {
return cmp.compare(a, b) <= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
/**
*
* @param
* @param a
* @param b
* @return
*/
public static > MergeResult maxFirst(final T a, final T b) {
return N.compare(a, b) >= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
/**
*
* @param
* @param a
* @param b
* @param cmp
* @return
*/
public static MergeResult maxFirst(final T a, final T b, final Comparator super T> cmp) {
return cmp.compare(a, b) >= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
@SuppressWarnings("rawtypes")
private static final BiFunction MIN_FIRST_BF = (a, b) -> N.compare(a, b) <= 0 ? MergeResult.TAKE_FIRST
: MergeResult.TAKE_SECOND;
@SuppressWarnings("rawtypes")
public static BiFunction minFirst() {
return (BiFunction) MIN_FIRST_BF;
}
public static BiFunction minFirst(final Comparator super T> cmp) {
N.checkArgNotNull(cmp, "cmp");
return (a, b) -> cmp.compare(a, b) <= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
@SuppressWarnings("rawtypes")
private static final BiFunction MAX_FIRST_BF = (a, b) -> N.compare(a, b) >= 0 ? MergeResult.TAKE_FIRST
: MergeResult.TAKE_SECOND;
@SuppressWarnings("rawtypes")
public static BiFunction maxFirst() {
return (BiFunction) MAX_FIRST_BF;
}
public static BiFunction maxFirst(final Comparator super T> cmp) {
N.checkArgNotNull(cmp, "cmp");
return (a, b) -> cmp.compare(a, b) >= 0 ? MergeResult.TAKE_FIRST : MergeResult.TAKE_SECOND;
}
/**
* Returns a stateful {@code BiFunction}. Don't save or cache for reuse or use it in parallel stream.
*
* @param
* @return
* @deprecated Use {@link Fn#switchOnNext()} instead
*/
@Deprecated
@Beta
@SequentialOnly
@Stateful
public static BiFunction switchOnNext() {
return Fn.switchOnNext();
}
}