Package | Description |
---|---|
org.apache.sshd.common.util | |
org.apache.sshd.common.util.functors | |
org.apache.sshd.common.util.io |
Modifier and Type | Method and Description |
---|---|
static <T> int |
GenericUtils.findFirstDifferentValueIndex(Iterable<? extends T> c1,
Iterable<? extends T> c2,
UnaryEquator<? super T> equator) |
static <T> int |
GenericUtils.findFirstDifferentValueIndex(Iterator<? extends T> i1,
Iterator<? extends T> i2,
UnaryEquator<? super T> equator) |
static <T> int |
GenericUtils.findFirstDifferentValueIndex(List<? extends T> c1,
List<? extends T> c2,
UnaryEquator<? super T> equator) |
Modifier and Type | Method and Description |
---|---|
default UnaryEquator<T> |
UnaryEquator.and(UnaryEquator<? super T> other)
Returns a composed equator that represents a short-circuiting logical AND of this equator and another.
|
static <T> UnaryEquator<T> |
UnaryEquator.comparing(Comparator<? super T> c)
|
static <T> UnaryEquator<T> |
UnaryEquator.defaultEquality() |
static <T> UnaryEquator<T> |
UnaryEquator.falsum() |
default UnaryEquator<T> |
UnaryEquator.negate() |
default UnaryEquator<T> |
UnaryEquator.or(UnaryEquator<? super T> other)
Returns a composed equator that represents a short-circuiting logical AND of this equator and another.
|
static <T> UnaryEquator<T> |
UnaryEquator.referenceEquality() |
static <T> UnaryEquator<T> |
UnaryEquator.verum() |
Modifier and Type | Method and Description |
---|---|
default UnaryEquator<T> |
UnaryEquator.and(UnaryEquator<? super T> other)
Returns a composed equator that represents a short-circuiting logical AND of this equator and another.
|
default UnaryEquator<T> |
UnaryEquator.or(UnaryEquator<? super T> other)
Returns a composed equator that represents a short-circuiting logical AND of this equator and another.
|
Modifier and Type | Field and Description |
---|---|
static UnaryEquator<Path> |
PathUtils.EQ_CASE_INSENSITIVE_FILENAME |
static UnaryEquator<Path> |
PathUtils.EQ_CASE_SENSITIVE_FILENAME |
Copyright © 2008–2024 The Apache Software Foundation. All rights reserved.