L - R - public class Difference<L,R> extends Object
N.difference(Collection, Collection),
N.differentSet(Collection, Collection),
N.symmetricDifference(Collection, Collection),
N.symmetricDifferentSet(Collection, Collection),
N.excludeAll(Collection, Collection),
N.excludeAllToSet(Collection, Collection),
N.removeAll(Collection, Collection),
N.intersection(Collection, Collection),
N.commonSet(Collection, Collection)| Modifier and Type | Class and Description |
|---|---|
static class |
Difference.MapDifference<L,R,D>
The Class MapDifference.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
areEqual() |
L |
inCommon() |
static <T1,T2,L extends List<T1>,R extends List<T2>> |
of(Collection<? extends T1> a,
Collection<? extends T2> b) |
static <T1,T2,L extends List<T1>,R extends List<T2>> |
of(T1[] a,
T2[] b) |
L |
onLeftOnly()
On left only.
|
R |
onRightOnly()
On right only.
|
String |
toString() |
public static <T1,T2,L extends List<T1>,R extends List<T2>> Difference<L,R> of(T1[] a, T2[] b)
T1 - T2 - L - R - a - b - N.difference(Collection, Collection),
N.differentSet(Collection, Collection),
N.symmetricDifference(Collection, Collection),
N.symmetricDifferentSet(Collection, Collection),
N.excludeAll(Collection, Collection),
N.excludeAllToSet(Collection, Collection),
N.removeAll(Collection, Collection),
N.intersection(Collection, Collection),
N.commonSet(Collection, Collection)public static <T1,T2,L extends List<T1>,R extends List<T2>> Difference<L,R> of(Collection<? extends T1> a, Collection<? extends T2> b)
T1 - T2 - L - R - a - b - N.difference(Collection, Collection),
N.differentSet(Collection, Collection),
N.symmetricDifference(Collection, Collection),
N.symmetricDifferentSet(Collection, Collection),
N.excludeAll(Collection, Collection),
N.excludeAllToSet(Collection, Collection),
N.removeAll(Collection, Collection),
N.intersection(Collection, Collection),
N.commonSet(Collection, Collection)public L inCommon()
public L onLeftOnly()
public R onRightOnly()
public boolean areEqual()
Copyright © 2021. All rights reserved.