Package smile.util

package smile.util
Primitive data collections, string, date and time facilities, and miscellaneous utility classes.
  • Class
    Description
    AlgoStatus
    Iterative algorithm status.
    Array2D
    2-dimensional array of doubles.
    AutoScope
    AutoScope allows for predictable, deterministic resource deallocation.
    Bytes
    Byte string.
    Cache<K,V>
    An LRU (Least Recently Used) cache with TTL (Time To Live) combines size-based eviction with time-based expiration.
    Dates
    Date and time utility functions.
    DoubleArrayList
    A resizeable, array-backed list of double primitives.
    FloatArrayList
    A resizeable, array-backed list of float primitives.
    HuggingFaceHub
    Utility for downloading files from the Hugging Face Hub with local disk caching.
    HuggingFaceHub.RepoType
    Supported Hugging Face repository types.
    Index
    Immutable sequence used for indexing.
    IntArray2D
    2-dimensional array of integers.
    IntArrayList
    A resizeable, array-backed list of integer primitives.
    IntDoubleHashMap
    HashMap<int, double> for primitive types.
    IntHashSet
    HashSet<int> for primitive types.
    IntPair
    A tuple of 2 integer elements.
    IntSet
    A set of integers.
    IterativeAlgorithmController<T>
    A controller for iterative algorithms.
    LongArrayList
    A resizeable, array-backed list of long primitives.
    LongObjectHashMap<V>
    An open-addressing hash map from primitive long keys to object values.
    MutableInt
    A mutable int wrapper.
    OS
    Operating system utility functions.
    PairingHeap<E extends Comparable<E>>
    A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance.
    PriorityQueue
    Priority Queue for index items.
    Regex
    Regular expression patterns.
    SparseArray
    Sparse array of double values.
    SparseArray.Entry
    The entry in a sparse array of double values.
    SparseIntArray
    Sparse array of integers.
    SparseIntArray.Entry
    The entry in a sparse array of double values.
    Strings
    String utility functions.
    Trie<K,V>
    A trie, also called digital tree or prefix tree, is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings.
    Tuple2<T1,T2>
    A tuple of 2 elements.