public interface LDblSingle extends LTuple<Object>
Exact equivalent of input parameters used in LDblConsumer.
| Modifier and Type | Interface and Description |
|---|---|
static class |
LDblSingle.AbstractDblSingle |
static interface |
LDblSingle.ComparableDblSingle |
static class |
LDblSingle.ImmCompDblSingle
Immutable, comparable tuple.
|
static class |
LDblSingle.ImmDblSingle
Immutable, non-comparable tuple.
|
static class |
LDblSingle.MutCompDblSingle
Mutable, comparable tuple.
|
static class |
LDblSingle.MutDblSingle
Mutable, non-comparable tuple.
|
LTuple.Void| Modifier and Type | Field and Description |
|---|---|
static int |
SIZE |
| Modifier and Type | Method and Description |
|---|---|
static boolean |
argEquals(double a,
double b)
Static equals() implementation that takes same arguments (doubled) as fields of the LDblSingle and checks if all values are equal.
|
static boolean |
argEquals(LDblSingle the,
Object that)
Static equals() implementation that takes two tuples asnd checks if they are equal.
|
static int |
argHashCode(double a)
Static hashCode() implementation method that takes same arguments as fields of the LDblSingle and calculates hash from it.
|
default double |
first() |
default Object |
get(int index) |
default Iterator<Object> |
iterator() |
default int |
size()
Tuple size
|
double |
value() |
static final int SIZE
double value()
default double first()
default Object get(int index)
static int argHashCode(double a)
Static hashCode() implementation method that takes same arguments as fields of the LDblSingle and calculates hash from it.
static boolean argEquals(double a,
double b)
Static equals() implementation that takes same arguments (doubled) as fields of the LDblSingle and checks if all values are equal.
static boolean argEquals(LDblSingle 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.