selfie_lib.ArrayMap.ArrayMap Class Reference

Inheritance diagram for selfie_lib.ArrayMap.ArrayMap:

Public Member Functions
	__init__ (self)
"ArrayMap[K, V]"	empty (cls)
ListBackedSet[K]	keys (self)
_ArrayMapEntries[K, V]	items (self)
V	__getitem__ (self, K key)
Iterator[K]	__iter__ (self)
int	__len__ (self)
"ArrayMap[K, V]"	plus (self, K key, V value)
"ArrayMap[K, V]"	minus_sorted_indices (self, list[int] indices)
"ArrayMap[K, V]"	plus_or_noop (self, K key, V value)
"ArrayMap[K, V]"	plus_or_noop_or_replace (self, K key, V value)
	__str__ (self)
	__repr__ (self)

Protected Member Functions
int	_binary_search_key (self, K key)

Detailed Description

Definition at line 147 of file ArrayMap.py.

Constructor & Destructor Documentation

__init__()

selfie_lib.ArrayMap.ArrayMap.__init__

(

self

)

Definition at line 151 of file ArrayMap.py.

    def __init__(self):
        raise NotImplementedError("Use ArrayMap.empty() or other class methods instead")
 

Member Function Documentation

__getitem__()

V selfie_lib.ArrayMap.ArrayMap.__getitem__	(		self,
		K	key
	)

Definition at line 173 of file ArrayMap.py.

    def __getitem__(self, key: K) -> V:
        index = self._binary_search_key(key)
        if index >= 0:
            return self.__data[2 * index + 1]  # type: ignore
        raise KeyError(key)
 

__iter__()

Iterator[K] selfie_lib.ArrayMap.ArrayMap.__iter__

(

self

)

Definition at line 179 of file ArrayMap.py.

    def __iter__(self) -> Iterator[K]:
        return (self.__data[i] for i in range(0, len(self.__data), 2))  # type: ignore
 

__len__()

int selfie_lib.ArrayMap.ArrayMap.__len__

(

self

)

Definition at line 182 of file ArrayMap.py.

    def __len__(self) -> int:
        return len(self.__data) // 2
 

__repr__()

selfie_lib.ArrayMap.ArrayMap.__repr__

(

self

)

Definition at line 237 of file ArrayMap.py.

    def __repr__(self):
        return self.__str__()

__str__()

selfie_lib.ArrayMap.ArrayMap.__str__

(

self

)

Definition at line 234 of file ArrayMap.py.

    def __str__(self):
        return "{" + ", ".join(f"{k}: {v}" for k, v in self.items()) + "}"
 

_binary_search_key()

int selfie_lib.ArrayMap.ArrayMap._binary_search_key (   self, K  key  )

protected

Definition at line 185 of file ArrayMap.py.

    def _binary_search_key(self, key: K) -> int:
        return _binary_search(self.__keys, key)
 

empty()

"ArrayMap[K, V]" selfie_lib.ArrayMap.ArrayMap.empty

(

cls

)

Definition at line 162 of file ArrayMap.py.

    def empty(cls) -> "ArrayMap[K, V]":
        if not hasattr(cls, "__EMPTY"):
            cls.__EMPTY = cls.__create([])
        return cls.__EMPTY
 

items()

_ArrayMapEntries[K, V] selfie_lib.ArrayMap.ArrayMap.items

(

self

)

Definition at line 170 of file ArrayMap.py.

    def items(self) -> _ArrayMapEntries[K, V]:  # type: ignore
        return _ArrayMapEntries(self.__data)
 

keys()

ListBackedSet[K] selfie_lib.ArrayMap.ArrayMap.keys

(

self

)

Definition at line 167 of file ArrayMap.py.

    def keys(self) -> ListBackedSet[K]:  # type: ignore
        return self.__keys
 

minus_sorted_indices()

"ArrayMap[K, V]" selfie_lib.ArrayMap.ArrayMap.minus_sorted_indices	(		self,
		list[int]	indices
	)

Definition at line 198 of file ArrayMap.py.

    def minus_sorted_indices(self, indices: list[int]) -> "ArrayMap[K, V]":
        new_data = self.__data[:]
        adjusted_indices = [i * 2 for i in indices] + [i * 2 + 1 for i in indices]
        adjusted_indices.sort(reverse=True)
        for index in adjusted_indices:
            del new_data[index]
        return ArrayMap.__create(new_data)
 

plus()

"ArrayMap[K, V]" selfie_lib.ArrayMap.ArrayMap.plus	(		self,
		K	key,
		V	value
	)

Definition at line 188 of file ArrayMap.py.

    def plus(self, key: K, value: V) -> "ArrayMap[K, V]":
        index = self._binary_search_key(key)
        if index >= 0:
            raise KeyError
        insert_at = -(index + 1)
        new_data = self.__data[:]
        new_data.insert(insert_at * 2, key)
        new_data.insert(insert_at * 2 + 1, value)
        return ArrayMap.__create(new_data)
 

plus_or_noop()

"ArrayMap[K, V]" selfie_lib.ArrayMap.ArrayMap.plus_or_noop	(		self,
		K	key,
		V	value
	)

Definition at line 206 of file ArrayMap.py.

    def plus_or_noop(self, key: K, value: V) -> "ArrayMap[K, V]":
        index = self._binary_search_key(key)
        if index >= 0:
            return self
        else:
            # Insert new key-value pair
            insert_at = -(index + 1)
            new_data = self.__data[:]
            new_data.insert(insert_at * 2, key)
            new_data.insert(insert_at * 2 + 1, value)
            return ArrayMap.__create(new_data)
 

plus_or_noop_or_replace()

"ArrayMap[K, V]" selfie_lib.ArrayMap.ArrayMap.plus_or_noop_or_replace	(		self,
		K	key,
		V	value
	)

Definition at line 218 of file ArrayMap.py.

    def plus_or_noop_or_replace(self, key: K, value: V) -> "ArrayMap[K, V]":
        index = self._binary_search_key(key)
        if index >= 0:
            if (self.__data[2 * index + 1]) == value:
                return self
            # Replace existing value
            new_data = self.__data[:]
            new_data[2 * index + 1] = value  # Update the value at the correct position
        else:
            # Insert new key-value pair
            insert_at = -(index + 1)
            new_data = self.__data[:]
            new_data.insert(insert_at * 2, key)
            new_data.insert(insert_at * 2 + 1, value)
        return ArrayMap.__create(new_data)
 

---

The documentation for this class was generated from the following file:

• selfie-lib/selfie_lib/ArrayMap.py