Uses of Class
com.landawn.abacus.util.Pair

Packages that use Pair

Package	Description
com.landawn.abacus
com.landawn.abacus.util
com.landawn.abacus.util.stream

Uses of Pair in com.landawn.abacus

Method parameters in com.landawn.abacus with type arguments of type Pair

Modifier and Type	Method and Description
<T,E extends Exception> void	DataSet.divideColumn(String columnName, Tuple.Tuple2<String,String> newColumnNames, Throwables.BiConsumer<T,Pair<Object,Object>,E> output)

Uses of Pair in com.landawn.abacus.util

Methods in com.landawn.abacus.util that return Pair

Modifier and Type	Method and Description
Pair<L,R>	NoCachingNoUpdating.DisposablePair.copy()
Pair<L,R>	Pair.copy()
static <L,R> Pair<L,R>[]	Pair.emptyArray()
static <T,E extends Exception> Pair<u.Nullable<T>,u.Nullable<T>>	Iterables.findFirstAndLast(Collection<? extends T> c, Throwables.Predicate<? super T,E> predicate) Find first and last.
static <T,E extends Exception,E2 extends Exception> Pair<u.Nullable<T>,u.Nullable<T>>	Iterables.findFirstAndLast(Collection<? extends T> c, Throwables.Predicate<? super T,E> predicateForFirst, Throwables.Predicate<? super T,E2> predicateForLast) Find first and last.
static <T,E extends Exception> Pair<u.Nullable<T>,u.Nullable<T>>	Iterables.findFirstAndLast(T[] a, Throwables.Predicate<? super T,E> predicate) Find first and last.
static <T,E extends Exception,E2 extends Exception> Pair<u.Nullable<T>,u.Nullable<T>>	Iterables.findFirstAndLast(T[] a, Throwables.Predicate<? super T,E> predicateForFirst, Throwables.Predicate<? super T,E2> predicateForLast) Find first and last.
static <T,E extends Exception> Pair<u.OptionalInt,u.OptionalInt>	Iterables.findFirstAndLastIndex(Collection<? extends T> c, Throwables.Predicate<? super T,E> predicate) Find first and last index.
static <T,E extends Exception,E2 extends Exception> Pair<u.OptionalInt,u.OptionalInt>	Iterables.findFirstAndLastIndex(Collection<? extends T> c, Throwables.Predicate<? super T,E> predicateForFirst, Throwables.Predicate<? super T,E2> predicateForLast) Find first and last index.
static <T,E extends Exception> Pair<u.OptionalInt,u.OptionalInt>	Iterables.findFirstAndLastIndex(T[] a, Throwables.Predicate<? super T,E> predicate) Find first and last index.
static <T,E extends Exception,E2 extends Exception> Pair<u.OptionalInt,u.OptionalInt>	Iterables.findFirstAndLastIndex(T[] a, Throwables.Predicate<? super T,E> predicateForFirst, Throwables.Predicate<? super T,E2> predicateForLast) Find first and last index.
static <K,V> Pair<K,V>	Pair.from(Map.Entry<K,V> entry)
static Pair<Byte,u.OptionalByte>	Median.of(byte... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Byte,u.OptionalByte>	Median.of(byte[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Character,u.OptionalChar>	Median.of(char... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Character,u.OptionalChar>	Median.of(char[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <T extends Comparable<? super T>> Pair<T,u.Nullable<T>>	Median.of(Collection<T> c)
static <T> Pair<T,u.Nullable<T>>	Median.of(Collection<T> c, Comparator<? super T> cmp)
static Pair<Double,u.OptionalDouble>	Median.of(double... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Double,u.OptionalDouble>	Median.of(double[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Float,u.OptionalFloat>	Median.of(float... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Float,u.OptionalFloat>	Median.of(float[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Integer,u.OptionalInt>	Median.of(int... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Integer,u.OptionalInt>	Median.of(int[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Long,u.OptionalLong>	Median.of(long... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Long,u.OptionalLong>	Median.of(long[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <L,R> Pair<L,R>	Pair.of(L l, R r)
static Pair<Short,u.OptionalShort>	Median.of(short... a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static Pair<Short,u.OptionalShort>	Median.of(short[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <T extends Comparable<? super T>> Pair<T,u.Nullable<T>>	Median.of(T[] a) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <T> Pair<T,u.Nullable<T>>	Median.of(T[] a, Comparator<? super T> cmp) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <T extends Comparable<? super T>> Pair<T,u.Nullable<T>>	Median.of(T[] a, int fromIndex, int toIndex) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
static <T> Pair<T,u.Nullable<T>>	Median.of(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp) Returns a Pair with left is the value at the index of (a.length - 1) / 2 when the array is sorted, and the right is the value at the index of a.length / 2 if the length of array is even.
Pair<R,L>	Pair.reverse() Returns a new instance of Pair<R, L>.
Pair<A,B>[]	BiIterator.toArray()
Pair<T,E>	Result.toPair()
Pair<T1,T2>	Tuple.Tuple2.toPair()
static <T,A,B,E extends Exception> Pair<List<A>,List<B>>	N.unzip(Collection<? extends T> c, Throwables.BiConsumer<? super T,Pair<A,B>,E> unzip)
static <T,A,B,LC extends Collection<A>,RC extends Collection<B>,E extends Exception> Pair<LC,RC>	N.unzip(Collection<? extends T> c, Throwables.BiConsumer<? super T,Pair<A,B>,E> unzip, IntFunction<? extends Collection<?>> supplier)

Methods in com.landawn.abacus.util that return types with arguments of type Pair

Modifier and Type	Method and Description
u.Optional<Pair<List<T>,Integer>>	Multiset.allMaxOccurrences() All max occurrences.
u.Optional<Pair<List<T>,Integer>>	Multiset.allMinOccurrences() All min occurrences.
<U> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.crossJoin(Collection<? extends U> b) The time complexity is O(n * m) : n is the size of this Stream and m is the size of specified collection b.
static <K,V> Map<K,Pair<V,u.Nullable<V>>>	Maps.difference(Map<K,V> map, Map<K,V> map2)
<E extends Exception> u.Optional<Pair<L,R>>	Pair.filter(Throwables.BiPredicate<? super L,? super R,E> predicate)
<E extends Exception> u.Optional<Pair<L,R>>	Pair.filter(Throwables.Predicate<? super Pair<L,R>,E> predicate)
<K> ExceptionalStream<Pair<T,T>,E>	ExceptionalStream.fullJoin(Collection<? extends T> b, Throwables.Function<? super T,? extends K,? extends E> keyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.fullJoin(Collection<? extends U> b, Throwables.BiPredicate<? super T,? super U,? extends E> predicate) Deprecated. The time complexity is O(n * m). You should try fullJoin(Collection, Function, Function) first.
<U,K> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.fullJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<K> ExceptionalStream<Pair<T,List<T>>,E>	ExceptionalStream.groupJoin(Collection<? extends T> b, Throwables.Function<? super T,? extends K,? extends E> keyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U,K> ExceptionalStream<Pair<T,List<U>>,E>	ExceptionalStream.groupJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U,K,A,D> ExceptionalStream<Pair<T,D>,E>	ExceptionalStream.groupJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper, Collector<? super U,A,D> downstream) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U,K> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.groupJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper, Throwables.BinaryOperator<U,? extends E> mergeFunction) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<K> ExceptionalStream<Pair<T,T>,E>	ExceptionalStream.innerJoin(Collection<? extends T> b, Throwables.Function<? super T,? extends K,? extends E> keyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.innerJoin(Collection<? extends U> b, Throwables.BiPredicate<? super T,? super U,? extends E> predicate) Deprecated. The time complexity is O(n * m). You should try innerJoin(Collection, Function, Function) first.
<U,K> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.innerJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
static <T> ObjIterator<Pair<T,Exception>>	Futures.iteratte(Collection<? extends Future<? extends T>> cfs)
static <T> ObjIterator<Pair<T,Exception>>	Futures.iteratte(Collection<? extends Future<? extends T>> cfs, long totalTimeoutForAll, TimeUnit unit)
static <T> ObjIterator<Pair<T,Exception>>	Futures.iteratte(Future<? extends T>... cfs)
static <L,R> Function<Pair<L,R>,L>	Fn.left()
<K> ExceptionalStream<Pair<T,T>,E>	ExceptionalStream.leftJoin(Collection<? extends T> b, Throwables.Function<? super T,? extends K,? extends E> keyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.leftJoin(Collection<? extends U> b, Throwables.BiPredicate<? super T,? super U,? extends E> predicate) Deprecated. The time complexity is O(n * m). You should try leftJoin(Collection, Function, Function) first.
<U,K> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.leftJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
u.Optional<Pair<T,Integer>>	Multiset.maxOccurrences()
u.Optional<Pair<T,Integer>>	Multiset.minOccurrences()
static <CK,K1 extends CK,V1,K2 extends CK,V2> Difference.MapDifference<Map<K1,V1>,Map<K2,V2>,Map<CK,Pair<V1,V2>>>	Difference.MapDifference.of(Map<? extends K1,? extends V1> map1, Map<? extends K2,? extends V2> map2)
static Difference.MapDifference<Map<String,Object>,Map<String,Object>,Map<String,Pair<Object,Object>>>	Difference.MapDifference.of(Object entity1, Object entity2)
static <L,R> BiFunction<L,R,Pair<L,R>>	Fn.pair()
static <L,R,E extends Exception> Throwables.BiFunction<L,R,Pair<L,R>,E>	Fn.Fnn.pair()
static <L,R> Function<Pair<L,R>,R>	Fn.right()
<K> ExceptionalStream<Pair<T,T>,E>	ExceptionalStream.rightJoin(Collection<? extends T> b, Throwables.Function<? super T,? extends K,? extends E> keyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
<U> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.rightJoin(Collection<? extends U> b, Throwables.BiPredicate<? super T,? super U,? extends E> predicate) Deprecated. The time complexity is O(n * m). You should try rightJoin(Collection, Function, Function) first.
<U,K> ExceptionalStream<Pair<T,U>,E>	ExceptionalStream.rightJoin(Collection<? extends U> b, Throwables.Function<? super T,? extends K,? extends E> leftKeyMapper, Throwables.Function<? super U,? extends K,? extends E> rightKeyMapper) The time complexity is O(n + m) : n is the size of this Stream and m is the size of specified collection b.
static <K,V> Map<K,Pair<u.Nullable<V>,u.Nullable<V>>>	Maps.symmetricDifference(Map<K,V> map, Map<K,V> map2)
List<Pair<A,B>>	BiIterator.toList()
static <T> Function<Pair<T,T>,List<T>>	Fn.Pairs.toList()
u.Optional<Pair<L,R>>	Pair.toOptional()
static <T> Function<Pair<T,T>,Set<T>>	Fn.Pairs.toSet()

Methods in com.landawn.abacus.util with parameters of type Pair

Modifier and Type	Method and Description
static <L,R> NoCachingNoUpdating.DisposablePair<L,R>	NoCachingNoUpdating.DisposablePair.wrap(Pair<L,R> p)

Method parameters in com.landawn.abacus.util with type arguments of type Pair

Modifier and Type	Method and Description
<E extends Exception> void	Pair.accept(Throwables.Consumer<? super Pair<L,R>,E> action)
<T,E extends Exception> Builder.DataSetBuilder	Builder.DataSetBuilder.divideColumn(String columnName, Tuple.Tuple2<String,String> newColumnNames, Throwables.BiConsumer<T,Pair<Object,Object>,E> output)
<E extends Exception> u.Optional<Pair<L,R>>	Pair.filter(Throwables.Predicate<? super Pair<L,R>,E> predicate)
void	BiIterator.forEachRemaining(Consumer<? super Pair<A,B>> action) Deprecated.
static <A,B> BiIterator<A,B>	BiIterator.generate(BooleanSupplier hasNext, Consumer<Pair<A,B>> output)
static <A,B> BiIterator<A,B>	BiIterator.generate(Consumer<Pair<A,B>> output) Returns an infinite BiIterator.
static <A,B> BiIterator<A,B>	BiIterator.generate(int fromIndex, int toIndex, IndexedConsumer<Pair<A,B>> output)
<U,E extends Exception> U	Pair.map(Throwables.Function<? super Pair<L,R>,U,E> mapper)
<E extends Exception> boolean	Pair.setIf(L newLeft, R newRight, Throwables.TriPredicate<? super Pair<L,R>,? super L,? super R,E> predicate) Set to the specified newLeft and newRight and returns true if predicate returns true.
<E extends Exception> boolean	Pair.setLeftIf(L newLeft, Throwables.BiPredicate<? super Pair<L,R>,? super L,E> predicate) Set to the specified newLeft and returns true if predicate returns true.
<E extends Exception> boolean	Pair.setRightIf(R newRight, Throwables.BiPredicate<? super Pair<L,R>,? super R,E> predicate) Set to the specified newRight and returns true if predicate returns true.
static <T,A,B> BiIterator<A,B>	Iterators.unzip(Collection<? extends T> c, BiConsumer<? super T,Pair<A,B>> unzip)
static <T,A,B,E extends Exception> Pair<List<A>,List<B>>	N.unzip(Collection<? extends T> c, Throwables.BiConsumer<? super T,Pair<A,B>,E> unzip)
static <T,A,B,LC extends Collection<A>,RC extends Collection<B>,E extends Exception> Pair<LC,RC>	N.unzip(Collection<? extends T> c, Throwables.BiConsumer<? super T,Pair<A,B>,E> unzip, IntFunction<? extends Collection<?>> supplier)
static <T,A,B> BiIterator<A,B>	BiIterator.unzip(Iterator<? extends T> iter, BiConsumer<? super T,Pair<A,B>> unzip)
static <T,A,B> BiIterator<A,B>	Iterators.unzip(Iterator<? extends T> iter, BiConsumer<? super T,Pair<A,B>> unzip)

Uses of Pair in com.landawn.abacus.util.stream

Methods in com.landawn.abacus.util.stream that return types with arguments of type Pair

Modifier and Type	Method and Description
static <T extends Comparable,A,D> Collector<T,?,Pair<u.Optional<T>,D>>	Collectors.maxAlll(Collector<T,A,D> downstream)
static <T,A,D> Collector<T,?,Pair<u.Optional<T>,D>>	Collectors.maxAlll(Comparator<? super T> comparator, Collector<? super T,A,D> downstream)
static <T extends Comparable,A,D> Collector<T,?,Pair<u.Optional<T>,D>>	Collectors.minAlll(Collector<T,A,D> downstream)
static <T,A,D> Collector<T,?,Pair<u.Optional<T>,D>>	Collectors.minAlll(Comparator<? super T> comparator, Collector<? super T,A,D> downstream)
static <T extends Comparable> Collector<T,?,u.Optional<Pair<T,T>>>	Collectors.minMax()
static <T> Collector<T,?,u.Optional<Pair<T,T>>>	Collectors.minMax(Comparator<? super T> comparator)
static <T> Collector<T,?,u.Optional<Pair<T,T>>>	Collectors.minMaxBy(Function<? super T,? extends Comparable> keyMapper)
static <T extends Comparable<? super T>> Collector<T,?,Pair<T,T>>	Collectors.minMaxForNonEmpty()
static <T> Collector<T,?,Pair<T,T>>	Collectors.minMaxForNonEmpty(Comparator<? super T> comparator)

Method parameters in com.landawn.abacus.util.stream with type arguments of type Pair

Modifier and Type	Method and Description
static <T,A,D,R> Collector<T,?,R>	Collectors.maxAlll(Comparator<? super T> comparator, Collector<? super T,A,D> downstream, Function<Pair<u.Optional<T>,D>,R> finisher)
static <T,A,D,R> Collector<T,?,R>	Collectors.minAlll(Comparator<? super T> comparator, Collector<? super T,A,D> downstream, Function<Pair<u.Optional<T>,D>,R> finisher)