text: /* Generic definitions */
  
  
  #define PACKAGE it.unimi.dsi.fastutil.ints
  #define VALUE_PACKAGE it.unimi.dsi.fastutil.ints
  /* Assertions (useful to generate conditional code) */
  #unassert keyclass
  #assert keyclass(Integer)
  #unassert keys
   #assert keys(primitive)
  #unassert valueclass
  #assert valueclass(Integer)
  #unassert values
   #assert values(primitive)
  /* Current type and class (and size, if applicable) */
  #define KEY_TYPE int
  #define VALUE_TYPE int
  #define KEY_CLASS Integer
  #define VALUE_CLASS Integer
  #if #keyclass(Object) || #keyclass(Reference)
  #define KEY_GENERIC_CLASS K
  #define KEY_GENERIC_TYPE K
  #define KEY_GENERIC <K>
  #define KEY_GENERIC_WILDCARD <?>
  #define KEY_EXTENDS_GENERIC <? extends K>
  #define KEY_SUPER_GENERIC <? super K>
  #define KEY_GENERIC_CAST (K)
  #define KEY_GENERIC_ARRAY_CAST (K[])
  #define KEY_GENERIC_BIG_ARRAY_CAST (K[][])
  #else
  #define KEY_GENERIC_CLASS KEY_CLASS
  #define KEY_GENERIC_TYPE KEY_TYPE
  #define KEY_GENERIC
  #define KEY_GENERIC_WILDCARD
  #define KEY_EXTENDS_GENERIC
  #define KEY_SUPER_GENERIC
  #define KEY_GENERIC_CAST
  #define KEY_GENERIC_ARRAY_CAST
  #define KEY_GENERIC_BIG_ARRAY_CAST
  #endif
  #if #valueclass(Object) || #valueclass(Reference)
  #define VALUE_GENERIC_CLASS V
  #define VALUE_GENERIC_TYPE V
  #define VALUE_GENERIC <V>
  #define VALUE_EXTENDS_GENERIC <? extends V>
  #define VALUE_GENERIC_CAST (V)
  #define VALUE_GENERIC_ARRAY_CAST (V[])
  #else
  #define VALUE_GENERIC_CLASS VALUE_CLASS
  #define VALUE_GENERIC_TYPE VALUE_TYPE
  #define VALUE_GENERIC
  #define VALUE_EXTENDS_GENERIC
  #define VALUE_GENERIC_CAST
  #define VALUE_GENERIC_ARRAY_CAST
  #endif
  #if #keyclass(Object) || #keyclass(Reference)
  #if #valueclass(Object) || #valueclass(Reference)
  #define KEY_VALUE_GENERIC <K,V>
  #define KEY_VALUE_EXTENDS_GENERIC <? extends K, ? extends V>
  #else
  #define KEY_VALUE_GENERIC <K>
  #define KEY_VALUE_EXTENDS_GENERIC <? extends K>
  #endif
  #else
  #if #valueclass(Object) || #valueclass(Reference)
  #define KEY_VALUE_GENERIC <V>
  #define KEY_VALUE_EXTENDS_GENERIC <? extends V>
  #else
  #define KEY_VALUE_GENERIC
  #define KEY_VALUE_EXTENDS_GENERIC
  #endif
  #endif
  /* Value methods */
  #define KEY_VALUE intValue
  #define VALUE_VALUE intValue
  /* Interfaces (keys) */
  #define COLLECTION IntCollection
  
  #define SET IntSet
  
  #define HASH IntHash
  
  #define SORTED_SET IntSortedSet
  
  #define STD_SORTED_SET IntSortedSet
  
  #define FUNCTION Int2IntFunction
  #define MAP Int2IntMap
  #define SORTED_MAP Int2IntSortedMap
  #if #keyclass(Object) || #keyclass(Reference)
  #define STD_SORTED_MAP SortedMap
  
  #define STRATEGY Strategy
  
  #else
  #define STD_SORTED_MAP Int2IntSortedMap
  
  #define STRATEGY PACKAGE.IntHash.Strategy
  
  #endif
  #define LIST IntList
  
  #define BIG_LIST IntBigList
  
  #define STACK IntStack
  
  #define PRIORITY_QUEUE IntPriorityQueue
  
  #define INDIRECT_PRIORITY_QUEUE IntIndirectPriorityQueue
  
  #define INDIRECT_DOUBLE_PRIORITY_QUEUE IntIndirectDoublePriorityQueue
  
  #define KEY_ITERATOR IntIterator
  
  #define KEY_ITERABLE IntIterable
  
  #define KEY_BIDI_ITERATOR IntBidirectionalIterator
  
  #define KEY_LIST_ITERATOR IntListIterator
  
  #define KEY_BIG_LIST_ITERATOR IntBigListIterator
  
  #define STD_KEY_ITERATOR IntIterator
  
  #define KEY_COMPARATOR IntComparator
  
  /* Interfaces (values) */
  #define VALUE_COLLECTION IntCollection
  
  #define VALUE_ARRAY_SET IntArraySet
  
  #define VALUE_ITERATOR IntIterator
  
  #define VALUE_LIST_ITERATOR IntListIterator
  
  /* Abstract implementations (keys) */
  #define ABSTRACT_COLLECTION AbstractIntCollection
  
  #define ABSTRACT_SET AbstractIntSet
  
  #define ABSTRACT_SORTED_SET AbstractIntSortedSet
  #define ABSTRACT_FUNCTION AbstractInt2IntFunction
  #define ABSTRACT_MAP AbstractInt2IntMap
  #define ABSTRACT_FUNCTION AbstractInt2IntFunction
  #define ABSTRACT_SORTED_MAP AbstractInt2IntSortedMap
  #define ABSTRACT_LIST AbstractIntList
  
  #define ABSTRACT_BIG_LIST AbstractIntBigList
  
  #define SUBLIST IntSubList
  
  #define ABSTRACT_PRIORITY_QUEUE AbstractIntPriorityQueue
  
  #define ABSTRACT_STACK AbstractIntStack
  
  #define KEY_ABSTRACT_ITERATOR AbstractIntIterator
  
  #define KEY_ABSTRACT_BIDI_ITERATOR AbstractIntBidirectionalIterator
  
  #define KEY_ABSTRACT_LIST_ITERATOR AbstractIntListIterator
  
  #define KEY_ABSTRACT_BIG_LIST_ITERATOR AbstractIntBigListIterator
  
  #if #keyclass(Object)
  #define KEY_ABSTRACT_COMPARATOR Comparator
  
  #else
  #define KEY_ABSTRACT_COMPARATOR AbstractIntComparator
  
  #endif
  /* Abstract implementations (values) */
  #define VALUE_ABSTRACT_COLLECTION AbstractIntCollection
  
  #define VALUE_ABSTRACT_ITERATOR AbstractIntIterator
  
  #define VALUE_ABSTRACT_BIDI_ITERATOR AbstractIntBidirectionalIterator
  
  /* Static containers (keys) */
  #define COLLECTIONS IntCollections
  
  #define SETS IntSets
  
  #define SORTED_SETS IntSortedSets
  
  #define LISTS IntLists
  
  #define BIG_LISTS IntBigLists
  
  #define MAPS Int2IntMaps
  #define FUNCTIONS Int2IntFunctions
  #define SORTED_MAPS Int2IntSortedMaps
  #define PRIORITY_QUEUES IntPriorityQueues
  
  #define HEAPS IntHeaps
  
  #define SEMI_INDIRECT_HEAPS IntSemiIndirectHeaps
  
  #define INDIRECT_HEAPS IntIndirectHeaps
  
  #define ARRAYS IntArrays
  
  #define BIG_ARRAYS IntBigArrays
  
  #define ITERATORS IntIterators
  
  #define BIG_LIST_ITERATORS IntBigListIterators
  
  #define COMPARATORS IntComparators
  
  /* Static containers (values) */
  #define VALUE_COLLECTIONS IntCollections
  
  #define VALUE_SETS IntSets
  
  #define VALUE_ARRAYS IntArrays
  
  /* Implementations */
  #define OPEN_HASH_SET IntOpenHashSet
  
  #define OPEN_HASH_BIG_SET IntOpenHashBigSet
  
  #define OPEN_DOUBLE_HASH_SET IntOpenDoubleHashSet
  
  #define OPEN_HASH_MAP Int2IntOpenHashMap
  
  #define STRIPED_OPEN_HASH_MAP StripedInt2IntOpenHashMap
  
  #define OPEN_DOUBLE_HASH_MAP Int2IntOpenDoubleHashMap
  
  #define ARRAY_SET IntArraySet
  
  #define ARRAY_MAP Int2IntArrayMap
  
  #define LINKED_OPEN_HASH_SET IntLinkedOpenHashSet
  
  #define AVL_TREE_SET IntAVLTreeSet
  
  #define RB_TREE_SET IntRBTreeSet
  
  #define AVL_TREE_MAP Int2IntAVLTreeMap
  
  #define RB_TREE_MAP Int2IntRBTreeMap
  
  #define ARRAY_LIST IntArrayList
  
  #define BIG_ARRAY_BIG_LIST IntBigArrayBigList
  
  #define ARRAY_FRONT_CODED_LIST IntArrayFrontCodedList
  
  #define HEAP_PRIORITY_QUEUE IntHeapPriorityQueue
  
  #define HEAP_SEMI_INDIRECT_PRIORITY_QUEUE IntHeapSemiIndirectPriorityQueue
  
  #define HEAP_INDIRECT_PRIORITY_QUEUE IntHeapIndirectPriorityQueue
  
  #define HEAP_SESQUI_INDIRECT_DOUBLE_PRIORITY_QUEUE IntHeapSesquiIndirectDoublePriorityQueue
  
  #define HEAP_INDIRECT_DOUBLE_PRIORITY_QUEUE IntHeapIndirectDoublePriorityQueue
  
  #define ARRAY_FIFO_QUEUE IntArrayFIFOQueue
  
  #define ARRAY_PRIORITY_QUEUE IntArrayPriorityQueue
  
  #define ARRAY_INDIRECT_PRIORITY_QUEUE IntArrayIndirectPriorityQueue
  
  #define ARRAY_INDIRECT_DOUBLE_PRIORITY_QUEUE IntArrayIndirectDoublePriorityQueue
  
  /* Synchronized wrappers */
  #define SYNCHRONIZED_COLLECTION SynchronizedIntCollection
  
  #define SYNCHRONIZED_SET SynchronizedIntSet
  
  #define SYNCHRONIZED_SORTED_SET SynchronizedIntSortedSet
  
  #define SYNCHRONIZED_FUNCTION SynchronizedInt2IntFunction
  
  #define SYNCHRONIZED_MAP SynchronizedInt2IntMap
  
  #define SYNCHRONIZED_LIST SynchronizedIntList
  
  /* Unmodifiable wrappers */
  #define UNMODIFIABLE_COLLECTION UnmodifiableIntCollection
  
  #define UNMODIFIABLE_SET UnmodifiableIntSet
  
  #define UNMODIFIABLE_SORTED_SET UnmodifiableIntSortedSet
  
  #define UNMODIFIABLE_FUNCTION UnmodifiableInt2IntFunction
  
  #define UNMODIFIABLE_MAP UnmodifiableInt2IntMap
  
  #define UNMODIFIABLE_LIST UnmodifiableIntList
  
  #define UNMODIFIABLE_KEY_ITERATOR UnmodifiableIntIterator
  
  #define UNMODIFIABLE_KEY_BIDI_ITERATOR UnmodifiableIntBidirectionalIterator
  
  #define UNMODIFIABLE_KEY_LIST_ITERATOR UnmodifiableIntListIterator
  
  /* Other wrappers */
  #define KEY_READER_WRAPPER IntReaderWrapper
  
  #define KEY_DATA_INPUT_WRAPPER IntDataInputWrapper
  
  /* Methods (keys) */
  #define NEXT_KEY nextInt
  #define PREV_KEY previousInt
  #define FIRST_KEY firstIntKey
  #define LAST_KEY lastIntKey
  #define GET_KEY getInt
  #define REMOVE_KEY removeInt
  #define READ_KEY readInt
  #define WRITE_KEY writeInt
  #define DEQUEUE dequeueInt
  #define DEQUEUE_LAST dequeueLastInt
  #define SUBLIST_METHOD intSubList
  #define SINGLETON_METHOD intSingleton
  
  #define FIRST firstInt
  #define LAST lastInt
  #define TOP topInt
  #define PEEK peekInt
  #define POP popInt
  #define KEY_ITERATOR_METHOD intIterator
  
  #define KEY_LIST_ITERATOR_METHOD intListIterator
  
  #define KEY_EMPTY_ITERATOR_METHOD emptyIntIterator
  
  #define AS_KEY_ITERATOR asIntIterator
  
  #define TO_KEY_ARRAY toIntArray
  #define ENTRY_GET_KEY getIntKey
  #define REMOVE_FIRST_KEY removeFirstInt
  #define REMOVE_LAST_KEY removeLastInt
  #define PARSE_KEY parseInt
  #define LOAD_KEYS loadInts
  #define LOAD_KEYS_BIG loadIntsBig
  #define STORE_KEYS storeInts
  /* Methods (values) */
  #define NEXT_VALUE nextInt
  #define PREV_VALUE previousInt
  #define READ_VALUE readInt
  #define WRITE_VALUE writeInt
  #define VALUE_ITERATOR_METHOD intIterator
  
  #define ENTRY_GET_VALUE getIntValue
  #define REMOVE_FIRST_VALUE removeFirstInt
  #define REMOVE_LAST_VALUE removeLastInt
  /* Methods (keys/values) */
  #define ENTRYSET int2IntEntrySet
  /* Methods that have special names depending on keys (but the special names depend on values) */
  #if #keyclass(Object) || #keyclass(Reference)
  #define GET_VALUE getInt
  #define REMOVE_VALUE removeInt
  #else
  #define GET_VALUE get
  #define REMOVE_VALUE remove
  #endif
  /* Equality */
  #ifdef Custom
  #define KEY_EQUALS(x,y) ( strategy.equals( (x),  KEY_GENERIC_CAST (y) ) )
  #else
  #if #keyclass(Object)
  #define KEY_EQUALS(x,y) ( (x) == null ? (y) == null : (x).equals(y) )
  #define KEY_EQUALS_NOT_NULL(x,y) ( (x).equals(y) )
  #else
  #define KEY_EQUALS(x,y) ( (x) == (y) )
  #define KEY_EQUALS_NOT_NULL(x,y) ( (x) == (y) )
  #endif
  #endif
  
  #if #valueclass(Object)
  #define VALUE_EQUALS(x,y) ( (x) == null ? (y) == null : (x).equals(y) )
  #else
  #define VALUE_EQUALS(x,y) ( (x) == (y) )
  #endif
  
  /* Object/Reference-only definitions (keys) */
  #if #keyclass(Object) || #keyclass(Reference)
  #define REMOVE remove
  #define KEY_OBJ2TYPE(x) (x)
  #define KEY_CLASS2TYPE(x) (x)
  #define KEY2OBJ(x) (x)
  #if #keyclass(Object)
  #ifdef Custom
  #define KEY2JAVAHASH(x) ( strategy.hashCode( KEY_GENERIC_CAST (x)) )
  #define KEY2INTHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( strategy.hashCode( KEY_GENERIC_CAST (x)) ) )
  #define KEY2LONGHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)strategy.hashCode( KEY_GENERIC_CAST (x)) ) )
  #else
  #define KEY2JAVAHASH(x) ( (x) == null ? 0 : (x).hashCode() )
  #define KEY2INTHASH(x) ( (x) == null ? 0x87fcd5c : it.unimi.dsi.fastutil.HashCommon.murmurHash3( (x).hashCode() ) )
  #define KEY2LONGHASH(x) ( (x) == null ? 0x810879608e4259ccL : it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)(x).hashCode() ) )
  #endif
  #else
  #define KEY2JAVAHASH(x) ( (x) == null ? 0 : System.identityHashCode(x) )
  #define KEY2INTHASH(x) ( (x) == null ? 0x87fcd5c : it.unimi.dsi.fastutil.HashCommon.murmurHash3( System.identityHashCode(x) ) )
  #define KEY2LONGHASH(x) ( (x) == null ? 0x810879608e4259ccL : it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)System.identityHashCode(x) ) )
  #endif
  #define KEY_CMP(x,y) ( ((Comparable<KEY_GENERIC_CLASS>)(x)).compareTo(y) )
  #define KEY_CMP_EQ(x,y) ( ((Comparable<KEY_GENERIC_CLASS>)(x)).compareTo(y) == 0 )
  #define KEY_LESS(x,y) ( ((Comparable<KEY_GENERIC_CLASS>)(x)).compareTo(y) < 0 )
  #define KEY_LESSEQ(x,y) ( ((Comparable<KEY_GENERIC_CLASS>)(x)).compareTo(y) <= 0 )
  #define KEY_NULL (null)
  #else
  /* Primitive-type-only definitions (keys) */
  #define REMOVE rem
  #define KEY_CLASS2TYPE(x) ((x).KEY_VALUE())
  #define KEY_OBJ2TYPE(x) (KEY_CLASS2TYPE((KEY_CLASS)(x)))
  #define KEY2OBJ(x) (KEY_CLASS.valueOf(x))
  #if #keyclass(Boolean)
  #define KEY_CMP_EQ(x,y) ( (x) == (y) )
  #define KEY_NULL (false)
  #define KEY_CMP(x,y) ( !(x) && (y) ? -1 : ( (x) == (y) ? 0 : 1 ) )
  #define KEY_LESS(x,y) ( !(x) && (y) )
  #define KEY_LESSEQ(x,y) ( !(x) || (y) )
  #else
  #define KEY_NULL ((KEY_TYPE)0)
  #if #keyclass(Float) || #keyclass(Double)
  #define KEY_CMP_EQ(x,y) ( KEY_CLASS.compare((x),(y)) == 0 )
  #define KEY_CMP(x,y) ( KEY_CLASS.compare((x),(y)) )
  #define KEY_LESS(x,y) ( KEY_CLASS.compare((x),(y)) < 0 )
  #define KEY_LESSEQ(x,y) ( KEY_CLASS.compare((x),(y)) <= 0 )
  #else
  #define KEY_CMP_EQ(x,y) ( (x) == (y) )
  #define KEY_CMP(x,y) ( (x) < (y) ? -1 : ( (x) == (y) ? 0 : 1 ) )
  #define KEY_LESS(x,y) ( (x) < (y) )
  #define KEY_LESSEQ(x,y) ( (x) <= (y) )
  #endif
  #if #keyclass(Float)
  #define KEY2LEXINT(x) fixFloat(x)
  #elif #keyclass(Double)
  #define KEY2LEXINT(x) fixDouble(x)
  #else
  #define KEY2LEXINT(x) (x)
  #endif
  #endif
  #ifdef Custom
  #define KEY2JAVAHASH(x) ( strategy.hashCode(x) )
  #define KEY2INTHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( strategy.hashCode(x) ) )
  #define KEY2LONGHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)strategy.hashCode(x) ) )
  #else
  #if #keyclass(Float)
  #define KEY2JAVAHASH(x) it.unimi.dsi.fastutil.HashCommon.float2int(x)
  #define KEY2INTHASH(x) it.unimi.dsi.fastutil.HashCommon.murmurHash3( it.unimi.dsi.fastutil.HashCommon.float2int(x) )
  #define KEY2LONGHASH(x) it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)it.unimi.dsi.fastutil.HashCommon.float2int(x) )
  #elif #keyclass(Double)
  #define KEY2JAVAHASH(x) it.unimi.dsi.fastutil.HashCommon.double2int(x)
  #define KEY2INTHASH(x) (int)it.unimi.dsi.fastutil.HashCommon.murmurHash3(Double.doubleToRawLongBits(x))
  #define KEY2LONGHASH(x) it.unimi.dsi.fastutil.HashCommon.murmurHash3(Double.doubleToRawLongBits(x))
  #elif #keyclass(Long)
  #define KEY2JAVAHASH(x) it.unimi.dsi.fastutil.HashCommon.long2int(x)
  #define KEY2INTHASH(x) (int)it.unimi.dsi.fastutil.HashCommon.murmurHash3(x)
  #define KEY2LONGHASH(x) it.unimi.dsi.fastutil.HashCommon.murmurHash3(x)
  #elif #keyclass(Boolean)
  #define KEY2JAVAHASH(x) ((x) ? 1231 : 1237)
  #define KEY2INTHASH(x) ((x) ? 0xfab5368 : 0xcba05e7b)
  #define KEY2LONGHASH(x) ((x) ? 0x74a19fc8b6428188L : 0xbaeca2031a4fd9ecL)
  #else
  #define KEY2JAVAHASH(x) (x)
  #define KEY2INTHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( (x) ) )
  #define KEY2LONGHASH(x) ( it.unimi.dsi.fastutil.HashCommon.murmurHash3( (long)(x) ) )
  #endif
  #endif
  #endif
  /* Object/Reference-only definitions (values) */
  #if #valueclass(Object) || #valueclass(Reference)
  #define VALUE_OBJ2TYPE(x) (x)
  #define VALUE_CLASS2TYPE(x) (x)
  #define VALUE2OBJ(x) (x)
  #if #valueclass(Object)
  #define VALUE2JAVAHASH(x) ( (x) == null ? 0 : (x).hashCode() )
  #else
  #define VALUE2JAVAHASH(x) ( (x) == null ? 0 : System.identityHashCode(x) )
  #endif
  #define VALUE_NULL (null)
  #define OBJECT_DEFAULT_RETURN_VALUE (this.defRetValue)
  #else
  /* Primitive-type-only definitions (values) */
  #define VALUE_CLASS2TYPE(x) ((x).VALUE_VALUE())
  #define VALUE_OBJ2TYPE(x) (VALUE_CLASS2TYPE((VALUE_CLASS)(x)))
  #define VALUE2OBJ(x) (VALUE_CLASS.valueOf(x))
  #if #valueclass(Float) || #valueclass(Double) || #valueclass(Long)
  #define VALUE_NULL (0)
  #define VALUE2JAVAHASH(x) it.unimi.dsi.fastutil.HashCommon.int2int(x)
  #elif #valueclass(Boolean)
  #define VALUE_NULL (false)
  #define VALUE2JAVAHASH(x) (x ? 1231 : 1237)
  #else
  #if #valueclass(Integer)
  #define VALUE_NULL (0)
  #else
  #define VALUE_NULL ((VALUE_TYPE)0)
  #endif
  #define VALUE2JAVAHASH(x) (x)
  #endif
  #define OBJECT_DEFAULT_RETURN_VALUE (null)
  #endif
  #include "drv/Map.drv"
  
  