View of the keys of a HashMap

Introduced properties

private var _map: HashMap[K, V]

core :: HashMapKeys :: _map

The original map
private fun map: HashMap[K, V]

core :: HashMapKeys :: map

The original map
private fun map=(map: HashMap[K, V])

core :: HashMapKeys :: map=

The original map

Redefined properties

redef type SELF: HashMapKeys[K, V]

core $ HashMapKeys :: SELF

Type of this instance, automatically specialized in every class
redef fun clear

core $ HashMapKeys :: clear

Remove all items
redef fun count(k: nullable Object): Int

core $ HashMapKeys :: count

How many occurrences of item are in the collection?
redef fun first: K

core $ HashMapKeys :: first

Return the first item of the collection
redef fun has(k: nullable Object): Bool

core $ HashMapKeys :: has

Is item in the collection ?
redef fun has_only(k: nullable Object): Bool

core $ HashMapKeys :: has_only

Is the collection contain only item?
redef fun is_empty: Bool

core $ HashMapKeys :: is_empty

Is there no item in the collection?
redef fun iterator: Iterator[K]

core $ HashMapKeys :: iterator

Get a new iterator on the collection.
redef fun length: Int

core $ HashMapKeys :: length

Number of items in the collection.
redef fun remove(key: nullable Object)

core $ HashMapKeys :: remove

Remove an occurrence of item
redef fun remove_all(key: nullable Object)

core $ HashMapKeys :: remove_all

Remove all occurrences of item

All properties

fun !=(other: nullable Object): Bool

core :: Object :: !=

Have self and other different values?
fun ==(other: nullable Object): Bool

core :: Object :: ==

Have self and other the same value?
type CLASS: Class[SELF]

core :: Object :: CLASS

The type of the class of self.
type CONCURRENT: ConcurrentCollection[E]

core :: Collection :: CONCURRENT

Type of the concurrent variant of this collection
type SELF: Object

core :: Object :: SELF

Type of this instance, automatically specialized in every class
private var _map: HashMap[K, V]

core :: HashMapKeys :: _map

The original map
protected fun class_factory(name: String): CLASS

core :: Object :: class_factory

Implementation used by get_class to create the specific class.
fun class_name: String

core :: Object :: class_name

The class name of the object.
abstract fun clear

core :: RemovableCollection :: clear

Remove all items
fun combinations(r: Int): Collection[SequenceRead[E]]

core :: Collection :: combinations

All r-length combinations on self (in same order) without repeated elements.
fun combinations_with_replacement(r: Int): Collection[SequenceRead[E]]

core :: Collection :: combinations_with_replacement

All r-length combination on self (in same order) with repeated elements.
fun count(item: nullable Object): Int

core :: Collection :: count

How many occurrences of item are in the collection?
fun first: E

core :: Collection :: first

Return the first item of the collection
fun get_class: CLASS

core :: Object :: get_class

The meta-object representing the dynamic type of self.
fun has(item: nullable Object): Bool

core :: Collection :: has

Is item in the collection ?
fun has_all(other: Collection[nullable Object]): Bool

core :: Collection :: has_all

Does the collection contain at least each element of other?
fun has_any(other: Collection[nullable Object]): Bool

core :: Collection :: has_any

Does the collection contain at least one element of other?
fun has_exactly(other: Collection[nullable Object]): Bool

core :: Collection :: has_exactly

Does the collection contain exactly all the elements of other?
fun has_only(item: nullable Object): Bool

core :: Collection :: has_only

Is the collection contain only item?
fun hash: Int

core :: Object :: hash

The hash code of the object.
init init

core :: Object :: init

fun inspect: String

core :: Object :: inspect

Developer readable representation of self.
protected fun inspect_head: String

core :: Object :: inspect_head

Return "CLASSNAME:#OBJECTID".
fun is_empty: Bool

core :: Collection :: is_empty

Is there no item in the collection?
intern fun is_same_instance(other: nullable Object): Bool

core :: Object :: is_same_instance

Return true if self and other are the same instance (i.e. same identity).
fun is_same_serialized(other: nullable Object): Bool

core :: Object :: is_same_serialized

Is self the same as other in a serialization context?
intern fun is_same_type(other: Object): Bool

core :: Object :: is_same_type

Return true if self and other have the same dynamic type.
abstract fun iterator: Iterator[E]

core :: Collection :: iterator

Get a new iterator on the collection.
fun join(separator: nullable Text, last_separator: nullable Text): String

core :: Collection :: join

Concatenate and separate each elements with separator.
fun length: Int

core :: Collection :: length

Number of items in the collection.
private fun map: HashMap[K, V]

core :: HashMapKeys :: map

The original map
private fun map=(map: HashMap[K, V])

core :: HashMapKeys :: map=

The original map
private intern fun native_class_name: CString

core :: Object :: native_class_name

The class name of the object in CString format.
fun not_empty: Bool

core :: Collection :: not_empty

Alias for not is_empty.
intern fun object_id: Int

core :: Object :: object_id

An internal hash code for the object based on its identity.
fun output

core :: Object :: output

Display self on stdout (debug only).
intern fun output_class_name

core :: Object :: output_class_name

Display class name on stdout (debug only).
fun permutations(r: Int): Collection[SequenceRead[E]]

core :: Collection :: permutations

All r-length permutations on self (all possible ordering) without repeated elements.
fun plain_to_s: String

core :: Collection :: plain_to_s

Concatenate elements without separators
fun product(r: Int): Collection[SequenceRead[E]]

core :: Collection :: product

Cartesian product, over r times self.
fun rand: E

core :: Collection :: rand

Return a random element form the collection
abstract fun remove(item: nullable Object)

core :: RemovableCollection :: remove

Remove an occurrence of item
fun remove_all(item: nullable Object)

core :: RemovableCollection :: remove_all

Remove all occurrences of item
fun sample(length: Int): Array[E]

core :: Collection :: sample

Return a new array made of (at most) length elements randomly chosen.
fun serialization_hash: Int

core :: Object :: serialization_hash

Hash value use for serialization
private fun serialize_to_pure_json(v: JsonSerializer)

core :: Collection :: serialize_to_pure_json

Utility to serialize a normal Json array
intern fun sys: Sys

core :: Object :: sys

Return the global sys object, the only instance of the Sys class.
fun to_a: Array[E]

core :: Collection :: to_a

Build a new array from a collection
abstract fun to_concurrent: CONCURRENT

core :: Collection :: to_concurrent

Wraps self in a thread-safe collection
fun to_counter: Counter[E]

core :: Collection :: to_counter

Create and fill up a counter with the elements of `self.
fun to_curlslist: CURLSList

core :: Collection :: to_curlslist

Convert Collection[String] to CURLSList
abstract fun to_jvalue(env: JniEnv): JValue

core :: Object :: to_jvalue

fun to_s: String

core :: Object :: to_s

User readable representation of self.
fun to_shuffle: Array[E]

core :: Collection :: to_shuffle

Return a new array made of elements in a random order.
package_diagram core::hash_collection::HashMapKeys HashMapKeys core::RemovableCollection RemovableCollection core::hash_collection::HashMapKeys->core::RemovableCollection core::Collection Collection core::RemovableCollection->core::Collection ...core::Collection ... ...core::Collection->core::Collection

Ancestors

interface Collection[E: nullable Object]

core :: Collection

The root of the collection hierarchy.
interface Object

core :: Object

The root of the class hierarchy.

Parents

interface RemovableCollection[E: nullable Object]

core :: RemovableCollection

Items can be removed from this collection

Class definitions

core $ HashMapKeys
# View of the keys of a HashMap
private class HashMapKeys[K, V]
	super RemovableCollection[K]
	# The original map
	var map: HashMap[K, V]

	redef fun count(k) do if self.has(k) then return 1 else return 0
	redef fun first do return self.map._first_item._key
	redef fun has(k) do return self.map.node_at(k) != null
	redef fun has_only(k) do return (self.has(k) and self.length == 1) or self.is_empty
	redef fun is_empty do return self.map.is_empty
	redef fun length do return self.map.length

	redef fun iterator do return new MapKeysIterator[K, V](self.map.iterator)

	redef fun clear do self.map.clear

	redef fun remove(key) do self.map.remove_node(key)
	redef fun remove_all(key) do self.map.remove_node(key)
end
lib/core/collection/hash_collection.nit:284,1--303,3