core/org.gnit.lucenekmp.internal.hppc/IntIntHashMap

IntIntHashMap

open class IntIntHashMap(expectedElements: Int, loadFactor: Double = DEFAULT_LOAD_FACTOR.toDouble()) : Iterable<IntIntHashMap.IntIntCursor> , Accountable, Cloneable<IntIntHashMap>

A hash map of int to int, implemented using open addressing with linear probing for collision resolution.

Mostly forked and trimmed from com.carrotsearch.hppc.IntIntHashMap

github: https://github.com/carrotsearch/hppc release 0.10.0

Constructors

IntIntHashMap

constructor(expectedElements: Int, loadFactor: Double = DEFAULT_LOAD_FACTOR.toDouble())

constructor()

New instance with sane defaults.

constructor(map: IntIntHashMap)

Create a hash map from all key-value pairs of another map.

Types

Companion

object Companion

IntContainer

abstract inner class IntContainer : Iterable<IntCursor>

IntCursor iterable with size and toArray function implemented

IntIntCursor

class IntIntCursor

Forked from HPPC, holding int index,key and value

KeysContainer

inner class KeysContainer : IntIntHashMap.IntContainer

A view of the keys inside this hash map.

Properties

childResources

open val childResources: MutableCollection<Accountable>

Returns nested resources of this class. The result should be a point-in-time snapshot (to avoid race conditions).

isEmpty

val isEmpty: Boolean

keys

var keys: IntArray?

The array holding keys.

values

var values: IntArray?

The array holding values.

Functions

addTo

fun addTo(key: Int, incrementValue: Int): Int

Adds incrementValue to any existing value for the given key or inserts incrementValue if key did not previously exist.

clear

fun clear()

clone

open override fun clone(): IntIntHashMap

containsKey

fun containsKey(key: Int): Boolean

ensureCapacity

fun ensureCapacity(expectedElements: Int)

Ensure this container can hold at least the given number of keys (entries) without resizing its buffers.

equals

open operator override fun equals(other: Any?): Boolean

get

fun get(key: Int): Int

getOrDefault

fun getOrDefault(key: Int, defaultValue: Int): Int

hashCode

open override fun hashCode(): Int

indexExists

fun indexExists(index: Int): Boolean

indexGet

fun indexGet(index: Int): Int

indexInsert

fun indexInsert(index: Int, key: Int, value: Int)

indexOf

fun indexOf(key: Int): Int

indexRemove

fun indexRemove(index: Int): Int

indexReplace

fun indexReplace(index: Int, newValue: Int): Int

iterator

open operator override fun iterator(): Iterator<IntIntHashMap.IntIntCursor>

keys

fun keys(): IntIntHashMap.KeysContainer

Returns a specialized view of the keys of this associated container.

put

fun put(key: Int, value: Int): Int

putAll

fun putAll(iterable: Iterable<IntIntHashMap.IntIntCursor>): Int

putIfAbsent

fun putIfAbsent(key: Int, value: Int): Boolean

Trove-inspired API method. An equivalent of the following code:

putOrAdd

fun putOrAdd(key: Int, putValue: Int, incrementValue: Int): Int

If key exists, putValue is inserted into the map, otherwise any existing value is incremented by additionValue.

ramBytesUsed

open override fun ramBytesUsed(): Long

Return the memory usage of this object in bytes. Negative values are illegal.

release

fun release()

remove

fun remove(key: Int): Int

size

fun size(): Int

toString

open override fun toString(): String

Convert the contents of this map to a human-friendly string.

values

fun values(): IntIntHashMap.IntContainer