| Package | Description |
|---|---|
| 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 |
|---|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Class and Description |
|---|
| AbstractObject2BooleanFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2BooleanMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2BooleanSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ByteFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ByteMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ByteSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2CharFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2CharMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2CharSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2DoubleFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2DoubleMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2DoubleSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2FloatFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2FloatMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2FloatSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2IntFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2IntMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2IntSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2LongFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2LongMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ReferenceSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObject2ShortFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractObject2ShortMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractObject2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractObjectBidirectionalIterator
An abstract class facilitating the creation of type-specific bidirectional iterators.
|
| AbstractObjectBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractObjectBigListIterator
An abstract class facilitating the creation of type-specific big-list iterators.
|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractObjectListIterator
An abstract class facilitating the creation of type-specific list iterators.
|
| AbstractObjectSet
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractObjectSortedSet
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| AbstractReference2BooleanFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2BooleanMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2BooleanSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ByteFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ByteMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ByteSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2CharFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2CharMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2CharSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2DoubleFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2DoubleMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2DoubleSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2FloatFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2FloatMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2FloatSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2IntFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2IntMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2IntSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2LongFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2LongMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2LongSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ObjectFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ObjectMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ObjectSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ReferenceFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ReferenceMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ReferenceSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReference2ShortFunction
An abstract class providing basic methods for functions implementing a type-specific interface.
|
| AbstractReference2ShortMap
An abstract class providing basic methods for maps implementing a type-specific interface.
|
| AbstractReference2ShortSortedMap
An abstract class providing basic methods for sorted maps implementing a type-specific interface.
|
| AbstractReferenceBigList
An abstract class providing basic methods for big lists implementing a type-specific big list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractReferenceList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceSet
An abstract class providing basic methods for sets implementing a type-specific interface.
|
| AbstractReferenceSortedSet
An abstract class providing basic methods for sorted sets implementing a type-specific interface.
|
| Object2BooleanArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2BooleanAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2BooleanFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2BooleanFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2BooleanFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2BooleanFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2BooleanFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2BooleanLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2BooleanMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2BooleanMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2BooleanMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2BooleanMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2BooleanMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2BooleanMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2BooleanMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2BooleanRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2BooleanSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2BooleanSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2BooleanSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2ByteArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ByteAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ByteFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ByteFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2ByteFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2ByteFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2ByteFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2ByteLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ByteMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ByteMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ByteMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2ByteMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2ByteMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2ByteMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2ByteMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ByteRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ByteSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ByteSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2ByteSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2CharArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2CharAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2CharFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2CharFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2CharFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2CharFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2CharFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2CharLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2CharMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2CharMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2CharMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2CharMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2CharMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2CharMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2CharMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2CharRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2CharSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2CharSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2CharSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2DoubleArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2DoubleAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2DoubleFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2DoubleFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2DoubleFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2DoubleFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2DoubleFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2DoubleLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2DoubleMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2DoubleMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2DoubleMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2DoubleMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2DoubleMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2DoubleMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2DoubleRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2DoubleSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2DoubleSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2DoubleSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2FloatArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2FloatAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2FloatFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2FloatFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2FloatFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2FloatFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2FloatFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2FloatLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2FloatMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2FloatMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2FloatMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2FloatMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2FloatMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2FloatMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2FloatMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2FloatRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2FloatSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2FloatSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2FloatSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2IntAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2IntFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2IntFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2IntFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2IntFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2IntFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2IntLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2IntMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2IntMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2IntMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2IntMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2IntMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2IntMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2IntMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2IntSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2IntSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2IntSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2LongArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2LongAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2LongFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2LongFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2LongFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2LongFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2LongFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2LongLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2LongMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2LongMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2LongMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2LongMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2LongMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2LongMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2LongMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2LongRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2LongSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2LongSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2LongSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ObjectAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ObjectFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2ObjectLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ObjectMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ObjectMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ObjectMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2ObjectOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ObjectRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ObjectSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ReferenceAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ReferenceFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2ReferenceLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ReferenceMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ReferenceMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ReferenceMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2ReferenceOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ReferenceRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ReferenceSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Object2ShortArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Object2ShortAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
|
| Object2ShortFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ShortFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Object2ShortFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Object2ShortFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Object2ShortFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Object2ShortLinkedOpenCustomHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Object2ShortMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Object2ShortMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Object2ShortMap.FastEntrySet
An entry set providing fast iteration.
|
| Object2ShortMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Object2ShortMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Object2ShortMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Object2ShortMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Object2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Object2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Object2ShortRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
|
| Object2ShortSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Object2ShortSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Object2ShortSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| ObjectArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ObjectArraySet
A simple, brute-force implementation of a set based on a backing array.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectBigArrayBigList
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ObjectBigList
A type-specific
BigList ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectBigListIterator
A type-specific
BigListIterator . |
| ObjectBigListIterators.EmptyBigListIterator
A class returning no elements and a type-specific big list iterator interface.
|
| ObjectBigLists.EmptyBigList
An immutable class representing an empty type-specific big list.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectCollections.EmptyCollection
An immutable class representing an empty type-specific collection.
|
| ObjectCollections.SynchronizedCollection
A synchronized wrapper class for collections.
|
| ObjectCollections.UnmodifiableCollection
An unmodifiable wrapper class for collections.
|
| ObjectHeapSemiIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue.
|
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectIterators.EmptyIterator
A class returning no elements and a type-specific iterator interface.
|
| ObjectLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ObjectLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectLists.EmptyList
An immutable class representing an empty type-specific list.
|
| ObjectLists.SynchronizedList
A synchronized wrapper class for lists.
|
| ObjectLists.UnmodifiableList
An unmodifiable wrapper class for lists.
|
| ObjectOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| ObjectOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
| ObjectOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSets.EmptySet
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ObjectSets.Singleton
An immutable class representing a type-specific singleton set.
|
| ObjectSets.SynchronizedSet
A synchronized wrapper class for sets.
|
| ObjectSets.UnmodifiableSet
An unmodifiable wrapper class for sets.
|
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSets.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| Reference2BooleanArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2BooleanFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2BooleanFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2BooleanFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2BooleanFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2BooleanFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2BooleanMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2BooleanMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2BooleanMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2BooleanMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2BooleanMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2BooleanMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2BooleanMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2BooleanSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2BooleanSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2BooleanSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2ByteArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ByteFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ByteFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2ByteFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2ByteFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2ByteFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ByteMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ByteMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ByteMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2ByteMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2ByteMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2ByteMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2ByteMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ByteSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ByteSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2ByteSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2CharArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2CharFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2CharFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2CharFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2CharFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2CharFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2CharMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2CharMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2CharMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2CharMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2CharMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2CharMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2CharMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2CharSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2CharSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2CharSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2DoubleArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2DoubleFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2DoubleFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2DoubleFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2DoubleFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2DoubleFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2DoubleMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2DoubleMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2DoubleMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2DoubleMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2DoubleMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2DoubleMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2DoubleSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2DoubleSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2DoubleSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2FloatArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2FloatFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2FloatFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2FloatFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2FloatFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2FloatFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2FloatMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2FloatMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2FloatMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2FloatMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2FloatMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2FloatMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2FloatMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2FloatSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2FloatSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2FloatSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2IntFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2IntFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2IntFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2IntFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2IntFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2IntMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2IntMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2IntMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2IntMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2IntMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2IntMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2IntMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2IntSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2IntSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2IntSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2LongArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2LongFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2LongFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2LongFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2LongFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2LongFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2LongMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2LongMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2LongMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2LongMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2LongMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2LongMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2LongMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2LongSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2LongSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2LongSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2ObjectArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ObjectFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ObjectFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2ObjectFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2ObjectFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2ObjectFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2ObjectLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ObjectMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ObjectMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ObjectMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2ObjectMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2ObjectMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2ObjectMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2ObjectMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2ObjectOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ObjectOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ObjectSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ObjectSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2ObjectSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2ReferenceArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ReferenceFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2ReferenceFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2ReferenceFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2ReferenceFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2ReferenceLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ReferenceMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ReferenceMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2ReferenceMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2ReferenceMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2ReferenceMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2ReferenceMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2ReferenceOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ReferenceOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ReferenceSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ReferenceSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2ReferenceSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| Reference2ShortArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
|
| Reference2ShortFunction
A type-specific
Function ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ShortFunctions.EmptyFunction
An immutable class representing an empty type-specific function.
|
| Reference2ShortFunctions.Singleton
An immutable class representing a type-specific singleton function.
|
| Reference2ShortFunctions.SynchronizedFunction
A synchronized wrapper class for functions.
|
| Reference2ShortFunctions.UnmodifiableFunction
An unmodifiable wrapper class for functions.
|
| Reference2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
| Reference2ShortMap
A type-specific
Map ; provides some additional methods that use polymorphism to avoid (un)boxing, and handling of a default return value. |
| Reference2ShortMap.Entry
A type-specific
Map.Entry ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| Reference2ShortMap.FastEntrySet
An entry set providing fast iteration.
|
| Reference2ShortMaps.EmptyMap
An immutable class representing an empty type-specific map.
|
| Reference2ShortMaps.Singleton
An immutable class representing a type-specific singleton map.
|
| Reference2ShortMaps.SynchronizedMap
A synchronized wrapper class for maps.
|
| Reference2ShortMaps.UnmodifiableMap
An unmodifiable wrapper class for maps.
|
| Reference2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
| Reference2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
| Reference2ShortSortedMap
A type-specific
SortedMap ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| Reference2ShortSortedMap.FastSortedEntrySet
A sorted entry set providing fast iteration.
|
| Reference2ShortSortedMaps.EmptySortedMap
An immutable class representing an empty type-specific sorted map.
|
| ReferenceArrayList
A type-specific array-based list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ReferenceArraySet
A simple, brute-force implementation of a set based on a backing array.
|
| ReferenceBigArrayBigList
A type-specific big-array-based big list; provides some additional methods that use polymorphism to avoid (un)boxing.
|
| ReferenceBigList
A type-specific
BigList ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceBigLists.EmptyBigList
An immutable class representing an empty type-specific big list.
|
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ReferenceCollections.EmptyCollection
An immutable class representing an empty type-specific collection.
|
| ReferenceCollections.SynchronizedCollection
A synchronized wrapper class for collections.
|
| ReferenceCollections.UnmodifiableCollection
An unmodifiable wrapper class for collections.
|
| ReferenceLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
| ReferenceList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceLists.EmptyList
An immutable class representing an empty type-specific list.
|
| ReferenceLists.SynchronizedList
A synchronized wrapper class for lists.
|
| ReferenceLists.UnmodifiableList
An unmodifiable wrapper class for lists.
|
| ReferenceOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
| ReferenceOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| ReferenceSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSets.EmptySet
An immutable class representing the empty set and implementing a type-specific set interface.
|
| ReferenceSets.Singleton
An immutable class representing a type-specific singleton set.
|
| ReferenceSets.SynchronizedSet
A synchronized wrapper class for sets.
|
| ReferenceSets.UnmodifiableSet
An unmodifiable wrapper class for sets.
|
| ReferenceSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceSortedSets.EmptySet
An immutable class representing the empty sorted set and implementing a type-specific set interface.
|
| Class and Description |
|---|
| AbstractObjectCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| AbstractObjectIterator
An abstract class facilitating the creation of type-specific iterators.
|
| AbstractObjectList
An abstract class providing basic methods for lists implementing a type-specific list interface.
|
| AbstractReferenceCollection
An abstract class providing basic methods for collections implementing a type-specific interface.
|
| ObjectBidirectionalIterator
A type-specific bidirectional iterator; provides an additional method to avoid (un)boxing,
and the possibility to skip elements backwards.
|
| ObjectCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
| ObjectIterable
A type-specific
Iterable that strengthens that specification of Iterable.iterator() . |
| ObjectIterator
A type-specific
Iterator ; provides an additional method to avoid (un)boxing, and
the possibility to skip elements. |
| ObjectList
A type-specific
List ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectListIterator
A type-specific bidirectional iterator that is also a
ListIterator . |
| ObjectSet
A type-specific
Set ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ObjectSortedSet
A type-specific
SortedSet ; provides some additional methods that use polymorphism to avoid (un)boxing. |
| ReferenceCollection
A type-specific
Collection ; provides some additional methods
that use polymorphism to avoid (un)boxing. |
Copyright © 2019. All rights reserved.


| DOSE: T+ 0:00 |
1 line |
insufflated |
Cocaine |
(powder / crystals) |
| T+ 19:00 |
1 line |
insufflated |
Cocaine |
(powder / crystals) |
The first time I did coke, let me tell you. I was 18 and living in California, temporarily transported from the east coast. We were taking a trip to Vegas with friends, for 4 days. Before this, I had only smoked pot and drank. Typical teenager, ya know? I had this boyfriend whos friend were psyched about getting an 8 ball and partying in Vegas. I said I wanted in. I had heard such great things about coke! I was so excited - that should have been my first sign of things to come. I was never that excited about a drug before.
We arrived in Vegas by car at about 10pm. Our friend Tre had the coke packed in a little baggie, packed in an empty bottle of asprin. As he cut up the lines, someone made me a screwdriver as I tried to relax. It was hard, considering my trip to Vegas, being out in Cali, and waiting to try something crazy and new. There were 4 of us in the room; tre, dogde, my boyfriend and I. Tre finished cutting the lines, did his, gave dodge his, and called me and my bf to the table. I wanted my bf to go first just so I could see what his reaction was like.
He rolled up a bill, and instead of snorting it, blew it across the table. He was super nervous because he hadnt done coke in a year, and his gf was doing it for the first time. He fixed his line back up, and took it. He handed me the bill then, and tre kneeled next to me and said 'do it quick!.' We had other friends arriving soon, and we didnt want them to have in. (Greedy... I know :) I took a deep breath, went down, and inhaled my line. The only word I can say to describe it was WOW. Within about 2 minutes I started to feel GREAT.
I had so much energy, I felt like I was in the greatest mood, and I was ready to party. Without even finishing my first drink, I made another so I was double - fisted. My bf kept asking me if I was ok, and I just kept smiling. Tre then mentioned something about a hot tub in the hotel and I whipped off my clothes with my bikini underneath and said I was ready. I just wanted to go, move around, do something SO BAD.
Right at that moment, our other friends had arrived at the room. They took one look at us and knew what was going on, I was later told. Hot tub plans were put on hold as we all decided to go to the New York, New York. The lights were crazy, they made me feel like some sort of energetic cheerleader. I felt the best I had ever felt in my life, and thats saying a lot. I remember walking over the bridge that connects the MGM Grand with the New York, New York and just beaming like crazy. I was talking to Tre like a chatterbox, and it was like we were having the most importantly amazing conversation ever.
So, we had left our hotel at 10, and arrived back at about 4am.  I look at pictures from that night and realize that it must have been obvious I was on some kind of uppity drug.
When we returned to our hotel, my bf and I had to sleep in the closet (we had like 17 people in our room.) Of course, on coke I absolutely could not fall asleep.
I didnt have anyone else on this first time high with me, so I begged my half - asleep friends to go out and get a 'breakfast sandwich' with me. No one wanted to, so I stepped out into the hotel hallway and ran laps up and down the hall. I felt so fresh and invigorated still! It was amazing. I did not sleep that night, and when everyone awoke at 11am all set to go, I went with them, still feeling like a king.
Around 5pm of this conitinuous day, tre asked me if I'd like to indulge again - of course I said yes! However, my bf said 'it was a bad idea'; and I was SO MAD at him (another sign of this drug having a rather interesting affect on me). He gave into my complaints further in the night and I did another line, along with the 3 of us. We ventured on onto the Vegas strip again, but this time, my bf was feeling weird so we headed back to the hotel room, which you all obviously know is NOT THE BEST IDEA when you are just starting your high. And this being only my second time, the waiting in our room was torture. I tried to comfort him, then made him please me sexually again. Coke has that affect on me! Some of our friends returned soon after that, making me a happy chatterbox one again. At least I had someone in the room talk to me again :)
2 years later, I have a bit of a 'taste.' I wont call it a habit because I dont need it. If its not around, its not around. I must admit I love it, its excellent for going out, talking, sex, and getting certain things accomplished. Its a small part of me and its fits in to my lifestyle, so its fine :)
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


§490:8-209 Issuer's lien. A lien in favor of an issuer upon a certificated security is valid against a purchaser only if the right of the issuer to the lien is noted conspicuously on the security certificate. [L 1997, c 33, pt of §2]


Tips When Asking Questions
Maximize your chances of getting a valuable response!
June 28, 2015
Remember the last time you saw unclear, cryptic questions on StackOverflow or other resources? It can be frustrating piecing apart the question and make assumptions when trying to understand if the question is relevant to you. You also don't want to be the one posting questions that are more likely to be ignored. Here's a couple of tips to help you out:
1) Research for an answer first!
This may sound obvious but I felt like I needed to put this out there anyways. Do your due diligence to make sure your question/situation is unique and hadn't already been answered. Be creative about what your research for and make notes about what you find so that if you do post a question you can describe how your question differs from what's already been answered.
2) Summarize your question in the title
The title is what catches users' attention. Spend time on writing a short but descriptive title in the form of a question. Make sure you have the correct spelling, punctuation, and grammar. If you're having a hard time coming up with the title, save it for last and write the rest of your question first. Here are some examples of good and bad titles:
- BAD: C# Math Confusion
- GOOD: Why does using float instead of int give me different results when all of my inputs are integers?
- BAD: android if else problems
- GOOD: Why does str == "value" evaluate to false when str is set to "value"?
3) Describe what your TRYING to do and what it's ACTUALLY doing
Make it obvious what you are trying to accomplish. Don't just make statements like: when I do X, I get an error. Tell the users what you are expecting X to do then give the users details on how and at what point did it stop working.
4) Help others reproduce the problem
Include just enough sample code for others to copy and paste the code into an editor and reproduce the exact same problem. Avoid including code that has nothing to do with the problem. Also make sure the sample code is standalone (if possible). The goal is to make it as easy and painless as possible for another user to encounter the same problem as you did.
5) Proof-read
Lastly, proof-read your question for spelling, punctuation, grammar, and capitalization mistakes. Also, read your question as if you are encountering it for the first time. Are there any gray areas that you need to clarify? Are you making any assumptions that wasn't specified? Does your question makes sense overall?
Latest Tweet
tweet tweet
Social
FB Twitter GitHub LinkedIn Google+


About Me
My name is Bruno De Hoyos and I am a graduate from The University of Texas at Austin. I received my Bachelor of Science in mechanical engineering in May 2016. I enjoy taking things apart and learning how they work, as well as working on small programming projects from time to time.
If you find anything on this site interesting or have any questions, feel free to drop me a message at the comment section below each project page.
Activities & Societies
- Pi Sigma Pi Minority Academic Engineering Society (PSP)
- Vice President External, 2015 - 2016
- Historian, 2014 - 2015
- Tau Beta Pi Engineering Honor Society (TBP)
- Active Member, 2014 - 2016
- Volunteer, 2014 - 2016
- UT IEEE Robotics and Automation Society (RAS)
- Team Member, 2013 - 2014
- Contestant, 2013 - 2014
- Society of Hispanic Professional Engineers (SHPE)
- Active Member, 2013 - 2016
- Mentor, 2015 - 2016
- American Society of Mechanical Engineers (ASME)
Honors & Awards:
- College Scholar, Spring 2014, Spring 2015
- University Honors (8 semesters)
- Darrel Royal Unrestricted Endowed Presidential Scholarship
- Shell Incentive Fund Scholarship
- Pi Sigma Pi Officer of the Year 2015
- Phil Schmidt Honorary Endowed Scholarship in Engineering
- Eric and Deborah Gonzales Endowed Presidential Scholarship in Engineering
- Equal Opportunity in Engineering (EOE) Academic Scholar, High Honor Roll 2014 - 2015
- Marvin Selig Endowed Presidential Scholarship in Mechanical Engineering
- Warren R. and Yvonne B. Waggoner Endowed Presidential Scholarship in Mechanical Engineering
- Equal Opportunity in Engineering (EOE) Academic Scholar, High Honor Roll 2012 - 2013
- AP Scholar with Distinction, May 2012
- Top 1% in graduating class, May 2012
Skills
- SolidWorks
- LabVIEW
- Arduino
- Milling machines, lathes
- Assembly language
- Microsoft Office
- Adobe Photoshop
- Tableau
- Interpersonal and communication skills
Programming
- C/C++
- Java
- MATLAB
- HTML
- R
- OpenGL
- Javascript
Languages
- English, fluent
- Spanish, fluent
- French, basic conversational


fun inputAttributes(indices: Iterable<Int>): Unit
Sets the indices of input Attributes for each Instance.
indices - An iterable contain indices that fall within the bounds of the instance.
indices


Favorite
Login
Sign Up
Logout
Select A Make
Select A Year
Select A Vehicle Type
Select A Model
Search
Please choose all options to find a vehicle.
Car Recall Information
Recall Number
Recall Date
Description
Consequence
Action
Sign Up
Email Address
Choose Password
Sign Up
Member Login
Email Address
Your Password
Login
Forgot your password?
Account Recovery
Email Address
Send
Information
Ok


or
Social Login for Easy Access
Sign In with Facebook
Sign In with Twitter
Sign In with Google+
Sign In with Linkedin
or Login with


Tuberculosis
Tuberculosis (TB) is a potentially serious infectious disease that mainly affects your lungs. The bacteria that cause tuberculosis are spread from one person to another through tiny droplets released into the air via coughs and sneezes.Many strains of tuberculosis resist the drugs most used to treat the disease. People with active tuberculosis must take several types of medications for many months.
Symptoms
Signs and symptoms of active TB include:
- Coughing that lasts three or more weeks
- Coughing up blood
- Chest pain, or pain with breathing or coughing
- Unintentional weight loss
- Fatigue
- Fever
- Night sweats
- Chills
- Loss of appetite


Go2 includes a status bar item which appears to the left of the Spotlight, time, and wireless icons. If you click on the tiny coffee cup icon Go2 will drop down a search field, with the cursor ready for you to start typing.
As you type, Go2 will dynamically build the menu below the search field based on the results of your search. The first four results of the search will have hotkeys associated with them numbering from 1-4, so to launch the third result, you can click on the result with your mouse, or you can press the hotkey “⌘3”.
As you use the Go2 search menu, the previous four selections are available immediately after clicking the status bar item. If there are certain bookmarks you launch repeatedly, this should make it a little faster to get to them.
You can open the Go2 search menu without your hands leaving the keyboard. To do so, open Go2’s preferences window, select the "Keyboard" tab and enter a hotkey. This hotkey is system-wide, so even if you are working in another application you can press the hotkey to bring up the quick search menu and launch one of your bookmarks.
Go2 also lets you arrow down out of the quick search field, so you can use the arrow keys to select the bookmark you want.


Focused and enthusiastic developer and researcher in the area of Deep Learning and its applications in Computer Vision. In particular, I am interested in Generative Adversarial Networks in combination with recently introduced Capsule Networks. My research is concerned with developing a new model to synthesize labeled data by capturing relative spatial information from real data. This would have applications in generating realistic images/videos and pose estimation.
MS in Computer Science
B.Tech. in Information and Communication Technology
Lab Instructor
Visiting Faculty
Software Developer
Teaching Assistant
1-A, Sector E-5, Phase VII, Hayatabad، Phase 7 Hayatabad, Peshawar, Khyber Pakhtunkhwa 25000
<EMAIL_ADDRESS>maryam.omar@imsciences.edu.pk