structs.arrays module

structs.arrays.prev(iterable)

Iterate in reverse over an iterable type supporting the __prev__ API

class structs.arrays.BaseList(*args, **kwargs)

Bases: list

Custom list subclass with some additional iteration functionality

next()

Handle next iteration functionality

prev()

Add basic implementation of the prev API

class structs.arrays.BitArray(iterable=())

Bases: list

A bit array (also known as bitmap, bitset, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective at exploiting bit-level parallelism in hardware to perform operations quickly.

append(p_object)

Append the logical bitwise representation of p_object

extend(iterable)

Append the logical bitwise representation of the objects in iterable

insert(index, p_object)

Append the logical bitwise representation of p_object to index

class structs.arrays.SortedList(iterable=(), key=None, reverse=False)

Bases: list

A list implementation that always maintains a sorted order

append(p_object)

Add p_object into ordered place in the list

extend(iterable)

Append each item in iterable into it’s sorted location in the list

insert(p_object, *args)

Insert p_object at it’s calculated index

class structs.arrays.CircularArray(*args, **kwargs)

Bases: structs.arrays.BaseList

A list subclass that will continually iterate until explicitly broken out of. ie, you’re probably going to want a return or break in a loop over a CircularArray