/* Generic definitions */


#define PACKAGE it.unimi.dsi.fastutil.bytes
#define VALUE_PACKAGE it.unimi.dsi.fastutil.bytes
/* Assertions (useful to generate conditional code) */
#unassert keyclass
#assert keyclass(Byte)
#unassert keys
 #assert keys(primitive)
#unassert valueclass
#assert valueclass(Byte)
#unassert values
 #assert values(primitive)
/* Current type and class (and size, if applicable) */
#define KEY_TYPE byte
#define VALUE_TYPE byte
#define KEY_CLASS Byte
#define VALUE_CLASS Byte
#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 byteValue
#define VALUE_VALUE byteValue
/* Interfaces (keys) */
#define COLLECTION ByteCollection

#define SET ByteSet

#define HASH ByteHash

#define SORTED_SET ByteSortedSet

#define STD_SORTED_SET ByteSortedSet

#define FUNCTION Byte2ByteFunction
#define MAP Byte2ByteMap
#define SORTED_MAP Byte2ByteSortedMap
#if #keyclass(Object) || #keyclass(Reference)
#define STD_SORTED_MAP SortedMap

#define STRATEGY Strategy

#else
#define STD_SORTED_MAP Byte2ByteSortedMap

#define STRATEGY PACKAGE.ByteHash.Strategy

#endif
#define LIST ByteList

#define BIG_LIST ByteBigList

#define STACK ByteStack

#define PRIORITY_QUEUE BytePriorityQueue

#define INDIRECT_PRIORITY_QUEUE ByteIndirectPriorityQueue

#define INDIRECT_DOUBLE_PRIORITY_QUEUE ByteIndirectDoublePriorityQueue

#define KEY_ITERATOR ByteIterator

#define KEY_ITERABLE ByteIterable

#define KEY_BIDI_ITERATOR ByteBidirectionalIterator

#define KEY_LIST_ITERATOR ByteListIterator

#define KEY_BIG_LIST_ITERATOR ByteBigListIterator

#define STD_KEY_ITERATOR ByteIterator

#define KEY_COMPARATOR ByteComparator

/* Interfaces (values) */
#define VALUE_COLLECTION ByteCollection

#define VALUE_ARRAY_SET ByteArraySet

#define VALUE_ITERATOR ByteIterator

#define VALUE_LIST_ITERATOR ByteListIterator

/* Abstract implementations (keys) */
#define ABSTRACT_COLLECTION AbstractByteCollection

#define ABSTRACT_SET AbstractByteSet

#define ABSTRACT_SORTED_SET AbstractByteSortedSet
#define ABSTRACT_FUNCTION AbstractByte2ByteFunction
#define ABSTRACT_MAP AbstractByte2ByteMap
#define ABSTRACT_FUNCTION AbstractByte2ByteFunction
#define ABSTRACT_SORTED_MAP AbstractByte2ByteSortedMap
#define ABSTRACT_LIST AbstractByteList

#define ABSTRACT_BIG_LIST AbstractByteBigList

#define SUBLIST ByteSubList

#define ABSTRACT_PRIORITY_QUEUE AbstractBytePriorityQueue

#define ABSTRACT_STACK AbstractByteStack

#define KEY_ABSTRACT_ITERATOR AbstractByteIterator

#define KEY_ABSTRACT_BIDI_ITERATOR AbstractByteBidirectionalIterator

#define KEY_ABSTRACT_LIST_ITERATOR AbstractByteListIterator

#define KEY_ABSTRACT_BIG_LIST_ITERATOR AbstractByteBigListIterator

#if #keyclass(Object)
#define KEY_ABSTRACT_COMPARATOR Comparator

#else
#define KEY_ABSTRACT_COMPARATOR AbstractByteComparator

#endif
/* Abstract implementations (values) */
#define VALUE_ABSTRACT_COLLECTION AbstractByteCollection

#define VALUE_ABSTRACT_ITERATOR AbstractByteIterator

#define VALUE_ABSTRACT_BIDI_ITERATOR AbstractByteBidirectionalIterator

/* Static containers (keys) */
#define COLLECTIONS ByteCollections

#define SETS ByteSets

#define SORTED_SETS ByteSortedSets

#define LISTS ByteLists

#define BIG_LISTS ByteBigLists

#define MAPS Byte2ByteMaps
#define FUNCTIONS Byte2ByteFunctions
#define SORTED_MAPS Byte2ByteSortedMaps
#define PRIORITY_QUEUES BytePriorityQueues

#define HEAPS ByteHeaps

#define SEMI_INDIRECT_HEAPS ByteSemiIndirectHeaps

#define INDIRECT_HEAPS ByteIndirectHeaps

#define ARRAYS ByteArrays

#define BIG_ARRAYS ByteBigArrays

#define ITERATORS ByteIterators

#define BIG_LIST_ITERATORS ByteBigListIterators

#define COMPARATORS ByteComparators

/* Static containers (values) */
#define VALUE_COLLECTIONS ByteCollections

#define VALUE_SETS ByteSets

#define VALUE_ARRAYS ByteArrays

/* Implementations */
#define OPEN_HASH_SET ByteOpenHashSet

#define OPEN_HASH_BIG_SET ByteOpenHashBigSet

#define OPEN_DOUBLE_HASH_SET ByteOpenDoubleHashSet

#define OPEN_HASH_MAP Byte2ByteOpenHashMap

#define STRIPED_OPEN_HASH_MAP StripedByte2ByteOpenHashMap

#define OPEN_DOUBLE_HASH_MAP Byte2ByteOpenDoubleHashMap

#define ARRAY_SET ByteArraySet

#define ARRAY_MAP Byte2ByteArrayMap

#define LINKED_OPEN_HASH_SET ByteLinkedOpenHashSet

#define AVL_TREE_SET ByteAVLTreeSet

#define RB_TREE_SET ByteRBTreeSet

#define AVL_TREE_MAP Byte2ByteAVLTreeMap

#define RB_TREE_MAP Byte2ByteRBTreeMap

#define ARRAY_LIST ByteArrayList

#define BIG_ARRAY_BIG_LIST ByteBigArrayBigList

#define ARRAY_FRONT_CODED_LIST ByteArrayFrontCodedList

#define HEAP_PRIORITY_QUEUE ByteHeapPriorityQueue

#define HEAP_SEMI_INDIRECT_PRIORITY_QUEUE ByteHeapSemiIndirectPriorityQueue

#define HEAP_INDIRECT_PRIORITY_QUEUE ByteHeapIndirectPriorityQueue

#define HEAP_SESQUI_INDIRECT_DOUBLE_PRIORITY_QUEUE ByteHeapSesquiIndirectDoublePriorityQueue

#define HEAP_INDIRECT_DOUBLE_PRIORITY_QUEUE ByteHeapIndirectDoublePriorityQueue

#define ARRAY_FIFO_QUEUE ByteArrayFIFOQueue

#define ARRAY_PRIORITY_QUEUE ByteArrayPriorityQueue

#define ARRAY_INDIRECT_PRIORITY_QUEUE ByteArrayIndirectPriorityQueue

#define ARRAY_INDIRECT_DOUBLE_PRIORITY_QUEUE ByteArrayIndirectDoublePriorityQueue

/* Synchronized wrappers */
#define SYNCHRONIZED_COLLECTION SynchronizedByteCollection

#define SYNCHRONIZED_SET SynchronizedByteSet

#define SYNCHRONIZED_SORTED_SET SynchronizedByteSortedSet

#define SYNCHRONIZED_FUNCTION SynchronizedByte2ByteFunction

#define SYNCHRONIZED_MAP SynchronizedByte2ByteMap

#define SYNCHRONIZED_LIST SynchronizedByteList

/* Unmodifiable wrappers */
#define UNMODIFIABLE_COLLECTION UnmodifiableByteCollection

#define UNMODIFIABLE_SET UnmodifiableByteSet

#define UNMODIFIABLE_SORTED_SET UnmodifiableByteSortedSet

#define UNMODIFIABLE_FUNCTION UnmodifiableByte2ByteFunction

#define UNMODIFIABLE_MAP UnmodifiableByte2ByteMap

#define UNMODIFIABLE_LIST UnmodifiableByteList

#define UNMODIFIABLE_KEY_ITERATOR UnmodifiableByteIterator

#define UNMODIFIABLE_KEY_BIDI_ITERATOR UnmodifiableByteBidirectionalIterator

#define UNMODIFIABLE_KEY_LIST_ITERATOR UnmodifiableByteListIterator

/* Other wrappers */
#define KEY_READER_WRAPPER ByteReaderWrapper

#define KEY_DATA_INPUT_WRAPPER ByteDataInputWrapper

/* Methods (keys) */
#define NEXT_KEY nextByte
#define PREV_KEY previousByte
#define FIRST_KEY firstByteKey
#define LAST_KEY lastByteKey
#define GET_KEY getByte
#define REMOVE_KEY removeByte
#define READ_KEY readByte
#define WRITE_KEY writeByte
#define DEQUEUE dequeueByte
#define DEQUEUE_LAST dequeueLastByte
#define SUBLIST_METHOD byteSubList
#define SINGLETON_METHOD byteSingleton

#define FIRST firstByte
#define LAST lastByte
#define TOP topByte
#define PEEK peekByte
#define POP popByte
#define KEY_ITERATOR_METHOD byteIterator

#define KEY_LIST_ITERATOR_METHOD byteListIterator

#define KEY_EMPTY_ITERATOR_METHOD emptyByteIterator

#define AS_KEY_ITERATOR asByteIterator

#define TO_KEY_ARRAY toByteArray
#define ENTRY_GET_KEY getByteKey
#define REMOVE_FIRST_KEY removeFirstByte
#define REMOVE_LAST_KEY removeLastByte
#define PARSE_KEY parseByte
#define LOAD_KEYS loadBytes
#define LOAD_KEYS_BIG loadBytesBig
#define STORE_KEYS storeBytes
/* Methods (values) */
#define NEXT_VALUE nextByte
#define PREV_VALUE previousByte
#define READ_VALUE readByte
#define WRITE_VALUE writeByte
#define VALUE_ITERATOR_METHOD byteIterator

#define ENTRY_GET_VALUE getByteValue
#define REMOVE_FIRST_VALUE removeFirstByte
#define REMOVE_LAST_VALUE removeLastByte
/* Methods (keys/values) */
#define ENTRYSET byte2ByteEntrySet
/* Methods that have special names depending on keys (but the special names depend on values) */
#if #keyclass(Object) || #keyclass(Reference)
#define GET_VALUE getByte
#define REMOVE_VALUE removeByte
#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.byte2int(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/RBTreeMap.drv"

