org.apache.flex.utils

Class IntMap

java.lang.Object

org.apache.flex.utils.IntMap

public class IntMap
extends Object

Implements a sparse mapping from int -> Object. Iterators will traverse from lowest to highest. put() is O(1) if the key is higher than any existing key; O(logN) if the key already exists, and O(N) otherwise. get() is an O(logN) binary search.

Constructor Summary

Constructors

Constructor and Description
IntMap()
IntMap(int capacity)

Method Summary

Methods

Modifier and Type	Method and Description
int	capacity()
void	clear()
boolean	contains(int k)
Object	get(int k)
Object	getNextAdjacent(int k) A bit of an aberration from an academic point of view, but since this is an ordered Map, why not!
Iterator<Map.Entry<Integer,Object>>	iterator()
int[]	keySetToArray()
Object	put(int k, Object v)
Object	remove(int k)
int	size()
Object[]	valuesToArray(Object[] ar)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

IntMap

public IntMap()

IntMap

public IntMap(int capacity)

Method Detail

capacity

public int capacity()

remove

public Object remove(int k)

clear

public void clear()

put

public Object put(int k,
         Object v)

get

public Object get(int k)

contains

public boolean contains(int k)

getNextAdjacent

public Object getNextAdjacent(int k)

A bit of an aberration from an academic point of view, but since this is an ordered Map, why not!

Returns:

the element immediately following element k.

iterator

public Iterator<Map.Entry<Integer,Object>> iterator()

size

public int size()

valuesToArray

public Object[] valuesToArray(Object[] ar)

Parameters:

ar - must be of size size().

keySetToArray

public int[] keySetToArray()