Uses of Annotation Type
com.carrotsearch.hppc.Generated
Packages that use Generated
Package
Description
-
Uses of Generated in com.carrotsearch.hppc
Classes in com.carrotsearch.hppc with annotations of type GeneratedModifier and TypeClassDescription(package private) classCommon superclass for collections.(package private) classCommon superclass for collections.(package private) classCommon superclass for collections.(package private) classCommon superclass for collections.(package private) classCommon superclass for collections.(package private) classCommon superclass for collections.(package private) classAbstractObjectCollection<KType>Common superclass for collections.(package private) classCommon superclass for collections.classAn array-backedByteDeque.classAn array-backed list of bytes.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingbytes.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn indexed container provides random access to elements based on anindex.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).classA subclass ofByteArrayListadding stack-related utility methods.classAn array-backedCharDeque.classAn array-backed list of chars.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartobyte, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartochar, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingchars.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartodouble, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartofloat, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofchars, implemented using using open addressing with linear probing for collision resolution.interfaceAn indexed container provides random access to elements based on anindex.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartoint, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartolong, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceAn associative container from keys to (one or possibly more) values.classCharObjectHashMap<VType>A hash map ofchartoObject, implemented using open addressing with linear probing for collision resolution.interfaceCharObjectMap<VType>An associative container with unique binding from keys to a single value.classCharObjectScatterMap<VType>Same asCharObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asCharHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA set ofchars.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofchartoshort, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asCharShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofCharArrayListadding stack-related utility methods.classAn array-backedDoubleDeque.classAn array-backed list of doubles.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingdoubles.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn indexed container provides random access to elements based on anindex.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).classA subclass ofDoubleArrayListadding stack-related utility methods.classAn array-backedFloatDeque.classAn array-backed list of floats.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingfloats.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn indexed container provides random access to elements based on anindex.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).classA subclass ofFloatArrayListadding stack-related utility methods.classAn array-backedIntDeque.classAn array-backed list of ints.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttobyte, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttochar, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingints.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttodouble, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttofloat, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofints, implemented using using open addressing with linear probing for collision resolution.interfaceAn indexed container provides random access to elements based on anindex.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttoint, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttolong, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceAn associative container from keys to (one or possibly more) values.classIntObjectHashMap<VType>A hash map ofinttoObject, implemented using open addressing with linear probing for collision resolution.interfaceIntObjectMap<VType>An associative container with unique binding from keys to a single value.classIntObjectScatterMap<VType>Same asIntObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asIntHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA set ofints.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofinttoshort, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asIntShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofIntArrayListadding stack-related utility methods.classAn array-backedLongDeque.classAn array-backed list of longs.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtobyte, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtochar, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdinglongs.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtodouble, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtofloat, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set oflongs, implemented using using open addressing with linear probing for collision resolution.interfaceAn indexed container provides random access to elements based on anindex.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtoint, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtolong, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceAn associative container from keys to (one or possibly more) values.classLongObjectHashMap<VType>A hash map oflongtoObject, implemented using open addressing with linear probing for collision resolution.interfaceLongObjectMap<VType>An associative container with unique binding from keys to a single value.classLongObjectScatterMap<VType>Same asLongObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asLongHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA set oflongs.interfaceAn associative container from keys to (one or possibly more) values.classA hash map oflongtoshort, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asLongShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofLongArrayListadding stack-related utility methods.classObjectArrayDeque<KType>An array-backedObjectDeque.classObjectArrayList<KType>An array-backed list of Objects.interfaceAn associative container from keys to (one or possibly more) values.classObjectByteHashMap<KType>A hash map ofObjecttobyte, implemented using open addressing with linear probing for collision resolution.classObjectByteIdentityHashMap<KType>An identity hash map ofObjecttobyte.interfaceObjectByteMap<KType>An associative container with unique binding from keys to a single value.classObjectByteScatterMap<KType>Same asObjectByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classObjectCharHashMap<KType>A hash map ofObjecttochar, implemented using open addressing with linear probing for collision resolution.classObjectCharIdentityHashMap<KType>An identity hash map ofObjecttochar.interfaceObjectCharMap<KType>An associative container with unique binding from keys to a single value.classObjectCharScatterMap<KType>Same asObjectCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceObjectCollection<KType>A collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceObjectContainer<KType>A generic container holdingObjects.interfaceObjectDeque<KType>A linear collection that supports element insertion and removal at both ends.interfaceAn associative container from keys to (one or possibly more) values.classObjectDoubleHashMap<KType>A hash map ofObjecttodouble, implemented using open addressing with linear probing for collision resolution.classObjectDoubleIdentityHashMap<KType>An identity hash map ofObjecttodouble.interfaceObjectDoubleMap<KType>An associative container with unique binding from keys to a single value.classObjectDoubleScatterMap<KType>Same asObjectDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classObjectFloatHashMap<KType>A hash map ofObjecttofloat, implemented using open addressing with linear probing for collision resolution.classObjectFloatIdentityHashMap<KType>An identity hash map ofObjecttofloat.interfaceObjectFloatMap<KType>An associative container with unique binding from keys to a single value.classObjectFloatScatterMap<KType>Same asObjectFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectHashSet<KType>A hash set ofObjects, implemented using using open addressing with linear probing for collision resolution.interfaceObjectIndexedContainer<KType>An indexed container provides random access to elements based on anindex.interfaceAn associative container from keys to (one or possibly more) values.classObjectIntHashMap<KType>A hash map ofObjecttoint, implemented using open addressing with linear probing for collision resolution.classObjectIntIdentityHashMap<KType>An identity hash map ofObjecttoint.interfaceObjectIntMap<KType>An associative container with unique binding from keys to a single value.classObjectIntScatterMap<KType>Same asObjectIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classObjectLongHashMap<KType>A hash map ofObjecttolong, implemented using open addressing with linear probing for collision resolution.classObjectLongIdentityHashMap<KType>An identity hash map ofObjecttolong.interfaceObjectLongMap<KType>An associative container with unique binding from keys to a single value.classObjectLongScatterMap<KType>Same asObjectLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceObjectLookupContainer<KType>Marker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceObjectObjectAssociativeContainer<KType,VType> An associative container from keys to (one or possibly more) values.classObjectObjectHashMap<KType,VType> A hash map ofObjecttoObject, implemented using open addressing with linear probing for collision resolution.classObjectObjectIdentityHashMap<KType,VType> An identity hash map ofObjecttoObject.interfaceObjectObjectMap<KType,VType> An associative container with unique binding from keys to a single value.classObjectObjectScatterMap<KType,VType> Same asObjectObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectScatterSet<KType>Same asObjectHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceObjectSet<KType>A set ofObjects.interfaceAn associative container from keys to (one or possibly more) values.classObjectShortHashMap<KType>A hash map ofObjecttoshort, implemented using open addressing with linear probing for collision resolution.classObjectShortIdentityHashMap<KType>An identity hash map ofObjecttoshort.interfaceObjectShortMap<KType>An associative container with unique binding from keys to a single value.classObjectShortScatterMap<KType>Same asObjectShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classObjectStack<KType>A subclass ofObjectArrayListadding stack-related utility methods.classAn array-backedShortDeque.classAn array-backed list of shorts.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttobyte, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortByteHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttochar, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortCharHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA collection allows basic, efficient operations on sets of elements (difference and intersection).interfaceA generic container holdingshorts.interfaceA linear collection that supports element insertion and removal at both ends.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttodouble, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortDoubleHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttofloat, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortFloatHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA hash set ofshorts, implemented using using open addressing with linear probing for collision resolution.interfaceAn indexed container provides random access to elements based on anindex.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttoint, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortIntHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttolong, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortLongHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceMarker interface for containers that can check if they contain a given object in at least timeO(log n)and ideally in amortized constant timeO(1).interfaceAn associative container from keys to (one or possibly more) values.classShortObjectHashMap<VType>A hash map ofshorttoObject, implemented using open addressing with linear probing for collision resolution.interfaceShortObjectMap<VType>An associative container with unique binding from keys to a single value.classShortObjectScatterMap<VType>Same asShortObjectHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classSame asShortHashSetbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.interfaceA set ofshorts.interfaceAn associative container from keys to (one or possibly more) values.classA hash map ofshorttoshort, implemented using open addressing with linear probing for collision resolution.interfaceAn associative container with unique binding from keys to a single value.classSame asShortShortHashMapbut does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.classA subclass ofShortArrayListadding stack-related utility methods. -
Uses of Generated in com.carrotsearch.hppc.cursors
Classes in com.carrotsearch.hppc.cursors with annotations of type GeneratedModifier and TypeClassDescriptionfinal classA cursor over a collection ofbytes.final classA cursor over entries of an associative container (char keys and byte values).final classA cursor over entries of an associative container (char keys and char values).final classA cursor over a collection ofchars.final classA cursor over entries of an associative container (char keys and double values).final classA cursor over entries of an associative container (char keys and float values).final classA cursor over entries of an associative container (char keys and int values).final classA cursor over entries of an associative container (char keys and long values).final classCharObjectCursor<VType>A cursor over entries of an associative container (char keys and Object values).final classA cursor over entries of an associative container (char keys and short values).final classA cursor over a collection ofdoubles.final classA cursor over a collection offloats.final classA cursor over entries of an associative container (int keys and byte values).final classA cursor over entries of an associative container (int keys and char values).final classA cursor over a collection ofints.final classA cursor over entries of an associative container (int keys and double values).final classA cursor over entries of an associative container (int keys and float values).final classA cursor over entries of an associative container (int keys and int values).final classA cursor over entries of an associative container (int keys and long values).final classIntObjectCursor<VType>A cursor over entries of an associative container (int keys and Object values).final classA cursor over entries of an associative container (int keys and short values).final classA cursor over entries of an associative container (long keys and byte values).final classA cursor over entries of an associative container (long keys and char values).final classA cursor over a collection oflongs.final classA cursor over entries of an associative container (long keys and double values).final classA cursor over entries of an associative container (long keys and float values).final classA cursor over entries of an associative container (long keys and int values).final classA cursor over entries of an associative container (long keys and long values).final classLongObjectCursor<VType>A cursor over entries of an associative container (long keys and Object values).final classA cursor over entries of an associative container (long keys and short values).final classObjectByteCursor<KType>A cursor over entries of an associative container (Object keys and byte values).final classObjectCharCursor<KType>A cursor over entries of an associative container (Object keys and char values).final classObjectCursor<KType>A cursor over a collection ofObjects.final classObjectDoubleCursor<KType>A cursor over entries of an associative container (Object keys and double values).final classObjectFloatCursor<KType>A cursor over entries of an associative container (Object keys and float values).final classObjectIntCursor<KType>A cursor over entries of an associative container (Object keys and int values).final classObjectLongCursor<KType>A cursor over entries of an associative container (Object keys and long values).final classObjectObjectCursor<KType,VType> A cursor over entries of an associative container (Object keys and Object values).final classObjectShortCursor<KType>A cursor over entries of an associative container (Object keys and short values).final classA cursor over entries of an associative container (short keys and byte values).final classA cursor over entries of an associative container (short keys and char values).final classA cursor over a collection ofshorts.final classA cursor over entries of an associative container (short keys and double values).final classA cursor over entries of an associative container (short keys and float values).final classA cursor over entries of an associative container (short keys and int values).final classA cursor over entries of an associative container (short keys and long values).final classShortObjectCursor<VType>A cursor over entries of an associative container (short keys and Object values).final classA cursor over entries of an associative container (short keys and short values). -
Uses of Generated in com.carrotsearch.hppc.predicates
Classes in com.carrotsearch.hppc.predicates with annotations of type GeneratedModifier and TypeInterfaceDescriptioninterfaceA predicate that applies tobyte,bytepairs.interfaceA predicate that applies tobyte,charpairs.interfaceA predicate that applies tobyte,doublepairs.interfaceA predicate that applies tobyte,floatpairs.interfaceA predicate that applies tobyte,intpairs.interfaceA predicate that applies tobyte,longpairs.interfaceByteObjectPredicate<VType>A predicate that applies tobyte,Objectpairs.interfaceA predicate that applies tobyteobjects.interfaceA predicate that applies tobyte,shortpairs.interfaceA predicate that applies tochar,bytepairs.interfaceA predicate that applies tochar,charpairs.interfaceA predicate that applies tochar,doublepairs.interfaceA predicate that applies tochar,floatpairs.interfaceA predicate that applies tochar,intpairs.interfaceA predicate that applies tochar,longpairs.interfaceCharObjectPredicate<VType>A predicate that applies tochar,Objectpairs.interfaceA predicate that applies tocharobjects.interfaceA predicate that applies tochar,shortpairs.interfaceA predicate that applies todouble,bytepairs.interfaceA predicate that applies todouble,charpairs.interfaceA predicate that applies todouble,doublepairs.interfaceA predicate that applies todouble,floatpairs.interfaceA predicate that applies todouble,intpairs.interfaceA predicate that applies todouble,longpairs.interfaceDoubleObjectPredicate<VType>A predicate that applies todouble,Objectpairs.interfaceA predicate that applies todoubleobjects.interfaceA predicate that applies todouble,shortpairs.interfaceA predicate that applies tofloat,bytepairs.interfaceA predicate that applies tofloat,charpairs.interfaceA predicate that applies tofloat,doublepairs.interfaceA predicate that applies tofloat,floatpairs.interfaceA predicate that applies tofloat,intpairs.interfaceA predicate that applies tofloat,longpairs.interfaceFloatObjectPredicate<VType>A predicate that applies tofloat,Objectpairs.interfaceA predicate that applies tofloatobjects.interfaceA predicate that applies tofloat,shortpairs.interfaceA predicate that applies toint,bytepairs.interfaceA predicate that applies toint,charpairs.interfaceA predicate that applies toint,doublepairs.interfaceA predicate that applies toint,floatpairs.interfaceA predicate that applies toint,intpairs.interfaceA predicate that applies toint,longpairs.interfaceIntObjectPredicate<VType>A predicate that applies toint,Objectpairs.interfaceA predicate that applies tointobjects.interfaceA predicate that applies toint,shortpairs.interfaceA predicate that applies tolong,bytepairs.interfaceA predicate that applies tolong,charpairs.interfaceA predicate that applies tolong,doublepairs.interfaceA predicate that applies tolong,floatpairs.interfaceA predicate that applies tolong,intpairs.interfaceA predicate that applies tolong,longpairs.interfaceLongObjectPredicate<VType>A predicate that applies tolong,Objectpairs.interfaceA predicate that applies tolongobjects.interfaceA predicate that applies tolong,shortpairs.interfaceObjectBytePredicate<KType>A predicate that applies toObject,bytepairs.interfaceObjectCharPredicate<KType>A predicate that applies toObject,charpairs.interfaceObjectDoublePredicate<KType>A predicate that applies toObject,doublepairs.interfaceObjectFloatPredicate<KType>A predicate that applies toObject,floatpairs.interfaceObjectIntPredicate<KType>A predicate that applies toObject,intpairs.interfaceObjectLongPredicate<KType>A predicate that applies toObject,longpairs.interfaceObjectObjectPredicate<KType,VType> A predicate that applies toObject,Objectpairs.interfaceObjectPredicate<KType>A predicate that applies toObjectobjects.interfaceObjectShortPredicate<KType>A predicate that applies toObject,shortpairs.interfaceA predicate that applies toshort,bytepairs.interfaceA predicate that applies toshort,charpairs.interfaceA predicate that applies toshort,doublepairs.interfaceA predicate that applies toshort,floatpairs.interfaceA predicate that applies toshort,intpairs.interfaceA predicate that applies toshort,longpairs.interfaceShortObjectPredicate<VType>A predicate that applies toshort,Objectpairs.interfaceA predicate that applies toshortobjects.interfaceA predicate that applies toshort,shortpairs. -
Uses of Generated in com.carrotsearch.hppc.procedures
Classes in com.carrotsearch.hppc.procedures with annotations of type GeneratedModifier and TypeInterfaceDescriptioninterfaceA procedure that applies tobyte,bytepairs.interfaceA procedure that applies tobyte,charpairs.interfaceA procedure that applies tobyte,doublepairs.interfaceA procedure that applies tobyte,floatpairs.interfaceA procedure that applies tobyte,intpairs.interfaceA procedure that applies tobyte,longpairs.interfaceByteObjectProcedure<VType>A procedure that applies tobyte,Objectpairs.interfaceA procedure that applies tobyteobjects.interfaceA procedure that applies tobyte,shortpairs.interfaceA procedure that applies tochar,bytepairs.interfaceA procedure that applies tochar,charpairs.interfaceA procedure that applies tochar,doublepairs.interfaceA procedure that applies tochar,floatpairs.interfaceA procedure that applies tochar,intpairs.interfaceA procedure that applies tochar,longpairs.interfaceCharObjectProcedure<VType>A procedure that applies tochar,Objectpairs.interfaceA procedure that applies tocharobjects.interfaceA procedure that applies tochar,shortpairs.interfaceA procedure that applies todouble,bytepairs.interfaceA procedure that applies todouble,charpairs.interfaceA procedure that applies todouble,doublepairs.interfaceA procedure that applies todouble,floatpairs.interfaceA procedure that applies todouble,intpairs.interfaceA procedure that applies todouble,longpairs.interfaceDoubleObjectProcedure<VType>A procedure that applies todouble,Objectpairs.interfaceA procedure that applies todoubleobjects.interfaceA procedure that applies todouble,shortpairs.interfaceA procedure that applies tofloat,bytepairs.interfaceA procedure that applies tofloat,charpairs.interfaceA procedure that applies tofloat,doublepairs.interfaceA procedure that applies tofloat,floatpairs.interfaceA procedure that applies tofloat,intpairs.interfaceA procedure that applies tofloat,longpairs.interfaceFloatObjectProcedure<VType>A procedure that applies tofloat,Objectpairs.interfaceA procedure that applies tofloatobjects.interfaceA procedure that applies tofloat,shortpairs.interfaceA procedure that applies toint,bytepairs.interfaceA procedure that applies toint,charpairs.interfaceA procedure that applies toint,doublepairs.interfaceA procedure that applies toint,floatpairs.interfaceA procedure that applies toint,intpairs.interfaceA procedure that applies toint,longpairs.interfaceIntObjectProcedure<VType>A procedure that applies toint,Objectpairs.interfaceA procedure that applies tointobjects.interfaceA procedure that applies toint,shortpairs.interfaceA procedure that applies tolong,bytepairs.interfaceA procedure that applies tolong,charpairs.interfaceA procedure that applies tolong,doublepairs.interfaceA procedure that applies tolong,floatpairs.interfaceA procedure that applies tolong,intpairs.interfaceA procedure that applies tolong,longpairs.interfaceLongObjectProcedure<VType>A procedure that applies tolong,Objectpairs.interfaceA procedure that applies tolongobjects.interfaceA procedure that applies tolong,shortpairs.interfaceObjectByteProcedure<KType>A procedure that applies toObject,bytepairs.interfaceObjectCharProcedure<KType>A procedure that applies toObject,charpairs.interfaceObjectDoubleProcedure<KType>A procedure that applies toObject,doublepairs.interfaceObjectFloatProcedure<KType>A procedure that applies toObject,floatpairs.interfaceObjectIntProcedure<KType>A procedure that applies toObject,intpairs.interfaceObjectLongProcedure<KType>A procedure that applies toObject,longpairs.interfaceObjectObjectProcedure<KType,VType> A procedure that applies toObject,Objectpairs.interfaceObjectProcedure<KType>A procedure that applies toObjectobjects.interfaceObjectShortProcedure<KType>A procedure that applies toObject,shortpairs.interfaceA procedure that applies toshort,bytepairs.interfaceA procedure that applies toshort,charpairs.interfaceA procedure that applies toshort,doublepairs.interfaceA procedure that applies toshort,floatpairs.interfaceA procedure that applies toshort,intpairs.interfaceA procedure that applies toshort,longpairs.interfaceShortObjectProcedure<VType>A procedure that applies toshort,Objectpairs.interfaceA procedure that applies toshortobjects.interfaceA procedure that applies toshort,shortpairs.