public interface LCharSingle extends LTuple<Object>
Exact equivalent of input parameters used in LCharConsumer.
| Modifier and Type | Interface and Description |
|---|---|
static class |
LCharSingle.AbstractCharSingle |
static interface |
LCharSingle.ComparableCharSingle |
static class |
LCharSingle.ImmCharSingle
Immutable, non-comparable tuple.
|
static class |
LCharSingle.ImmCompCharSingle
Immutable, comparable tuple.
|
static class |
LCharSingle.MutCharSingle
Mutable, non-comparable tuple.
|
static class |
LCharSingle.MutCompCharSingle
Mutable, comparable tuple.
|
LTuple.Void| Modifier and Type | Field and Description |
|---|---|
static int |
SIZE |
| Modifier and Type | Method and Description |
|---|---|
static boolean |
argEquals(char a,
char b)
Static equals() implementation that takes same arguments (doubled) as fields of the LCharSingle and checks if all values are equal.
|
static boolean |
argEquals(LCharSingle the,
Object that)
Static equals() implementation that takes two tuples asnd checks if they are equal.
|
static int |
argHashCode(char a)
Static hashCode() implementation method that takes same arguments as fields of the LCharSingle and calculates hash from it.
|
default char |
first() |
default Object |
get(int index) |
default Iterator<Object> |
iterator() |
default int |
size()
Tuple size
|
char |
value() |
static final int SIZE
char value()
default char first()
default Object get(int index)
static int argHashCode(char a)
Static hashCode() implementation method that takes same arguments as fields of the LCharSingle and calculates hash from it.
static boolean argEquals(char a,
char b)
Static equals() implementation that takes same arguments (doubled) as fields of the LCharSingle and checks if all values are equal.
static boolean argEquals(LCharSingle the, Object that)
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.
Copyright © 2019. All rights reserved.