Uses of Interface
org.cicirello.util.Copyable
Package
Description
This package includes core data structures used by other of our libraries and projects.
This package includes classes and interfaces that serve some useful utility purpose.
-
Uses of Copyable in org.cicirello.ds
Modifier and TypeClassDescriptionfinal class
BinaryHeap<E>
An implementation of a Binary Heap.final class
An implementation of a Binary Heap.final class
Disjoint sets of integers from [0, n) implemented with a disjoint set forest.final class
An implementation of a Fibonacci Heap.final class
An implementation of a Fibonacci Heap.class
An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values also of type int.class
An implementation of a Binary Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.class
An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type int.class
An implementation of a Fibonacci Heap of (element, priority) pairs, such that the elements are distinct integers in the interval [0, n), and with priority values of type double.static final class
An instance of this class encapsulates an (element, priority) pair for a double valued priority.static final class
An instance of this class encapsulates an (element, priority) pair for an integer valued priority.final class
An implementation of a Binary Heap.final class
An implementation of a Binary Heap.final class
An implementation of a Fibonacci Heap.final class
An implementation of a Fibonacci Heap. -
Uses of Copyable in org.cicirello.util
Modifier and TypeInterfaceDescriptioninterface
A simple interface for objects that can be copied.Modifier and TypeClassDescriptionfinal class
This class is an implementation of a partially-filled array of primitive double values.final class
This class is an implementation of a partially-filled array of primitive int values.