| Package | Description |
|---|---|
| it.unimi.dsi.fastutil | |
| it.unimi.dsi.fastutil.booleans |
Provides type-specific classes for boolean elements or keys.
|
| it.unimi.dsi.fastutil.bytes |
Provides type-specific classes for byte elements or keys.
|
| it.unimi.dsi.fastutil.chars |
Provides type-specific classes for character elements or keys.
|
| it.unimi.dsi.fastutil.doubles |
Provides type-specific classes for double elements or keys.
|
| it.unimi.dsi.fastutil.floats |
Provides type-specific classes for float elements or keys.
|
| it.unimi.dsi.fastutil.ints |
Provides type-specific classes for integer elements or keys.
|
| it.unimi.dsi.fastutil.longs |
Provides type-specific classes for long elements or keys.
|
| it.unimi.dsi.fastutil.objects |
Provides type-specific classes for object elements or keys.
|
| it.unimi.dsi.fastutil.shorts |
Provides type-specific classes for short elements or keys.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| BigSwapper
An object that can swap elements whose positions is specified by longs.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| IndirectPriorityQueues.EmptyIndirectPriorityQueue
An immutable class representing the empty indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| PriorityQueues.EmptyPriorityQueue
An immutable class representing the empty priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Swapper
An object that can swap elements whose position is specified by integers
|
| Class and Description |
|---|
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
| Class and Description |
|---|
| AbstractIndirectPriorityQueue
An abstract class providing basic methods for implementing the
IndirectPriorityQueue interface. |
| AbstractPriorityQueue
An abstract class providing basic methods for implementing the
PriorityQueue interface. |
| AbstractStack
An abstract class providing basic methods for implementing the
Stack interface. |
| BidirectionalIterator
A bidirectional
Iterator. |
| BigList
A list with big (i.e., 64-bit) indices.
|
| BigListIterator
A list iterator over a
BigList. |
| Function
A function mapping keys into values.
|
| Hash
Basic data for all hash-based classes.
|
| Hash.Strategy
A generic hash strategy.
|
| IndirectPriorityQueue
An indirect priority queue.
|
| PriorityQueue
A priority queue.
|
| Size64
An interface for data structures whose size can exceed
Integer.MAX_VALUE. |
| Stack
A stack.
|
Copyright © 2013. All Rights Reserved.