hash_list

class HashList < Object

A HashList works like an Array (in that individual elements can be accessed by index), but is also like a List (in that shift/unshift operations are fast).

TODO: Perhaps this should have a different name, since insert/delete operations may be slow? (if they were to be implemented)

TODO: This could be implemented using two arrays.

TODO: Document this class.

Public Methods

initialize(*array)

clear()

self.[](*array)

clone()

push(x)

pop()

unshift(x)

shift()

empty?()

each(&block)

each_pair(&block)

reverse_each(&block)

reverse_each_index(&block)

reverse_each_pair

reverse_each_pair is an alias for reverse_each_index.

reverse()

reverse!()

first()

last()

<=>(other)

size()

length

length is an alias for size.

[](idx)

[]=(idx, val)

Mixins

Enumerable
Comparable
EnumerableContainer
IndexableContainer
ReverseIndexableContainer
SingleEnumerableContainer
SingleUpdatableContainer

Requires