Package smile.util
package smile.util
Primitive data collections, string, date and time facilities, and miscellaneous utility classes.
-
ClassDescriptionIterative algorithm status.2-dimensional array of doubles.AutoScope allows for predictable, deterministic resource deallocation.Byte string.Date and time utility functions.A resizeable, array-backed list of double primitives.A resizeable, array-backed list of float primitives.Immutable sequence used for indexing.2-dimensional array of integers.A resizeable, array-backed list of integer primitives.
HashMap<int, double>
for primitive types.HashSet<int>
for primitive types.A tuple of 2 integer elements.A set of integers.A controller for iterative algorithms.A mutable int wrapper.PairingHeap<E extends Comparable<E>>A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance.Priority Queue for index items.Regular expression patterns.Sparse array of double values.The entry in a sparse array of double values.Sparse array of integers.The entry in a sparse array of double values.String utility functions.Tuple2<T1,T2> A tuple of 2 elements.