miguelcostagap / custom-data-structures

custom data structures {list, dynamic arrays, queues, maps}

Custom Data Structures*

< The Project >

Creation from scratch of a custom framework with methods that allows the storage and management of a collection of elements.

--> Dynamic Arrays;

--> Maps;

--> Queues;

--> Lists,

--> Stacks

< Languages Used >

• Java

< List >

Method	Description	Satus	Branch	Contributor
add	Adds the specified element to the end of the list			Miguel Costa
addAt	Inserts the specified element at the specified position in the list			Miguel Costa
get	Returns the element at the specified index in the list			Miguel Costa
replace	Replaces the element at the specified position in the list with the specified element			Miguel Costa
remove	Removes the element at the specified index from the list			Miguel Costa
size	Returns the number of elements in the list			Miguel Costa
contains	Returns true if the list contains the specified element; otherwise, returns false			Miguel Costa

< Dynamic Arrays >

Method	Description	Satus	Branch	Contributor
add	Adds the specified element to the end of the list			Miguel Costa
addAt	Inserts the specified element at the specified position in the list			Miguel Costa
get	Returns the element at the specified index in the list			Miguel Costa
replace	Replaces the element at the specified position in the list with the specified element			Miguel Costa
remove	Removes the element at the specified index from the list			Miguel Costa
size	Returns the number of elements in the list			Miguel Costa
contains	Returns true if the list contains the specified element; otherwise, returns false			Miguel Costa

< maps >

Method	Description	Satus	Branch	Contributor
put	Associates the specified value with the specified key in the map. If the key already exists, the previous value is replaced			Miguel Costa
get	Returns the value associated with the specified key in the map, or null if the key is not found			Miguel Costa
remove	Removes the key-value pair associated with the specified key from the map			Miguel Costa
containsKey	Returns true if the map contains the specified key; otherwise, returns false			Miguel Costa
containsValue	Returns true if the map contains at least one key-value pair with the specified value; otherwise, returns false			Miguel Costa
size	Returns the number of elements in the list			Miguel Costa
values	Returns a collection of all values in the map			Miguel Costa
entrySet	Returns a set of key-value pairs (entries) in the map			Miguel Costa
keySet	Returns a set of all keys in the map			Miguel Costa

< Queues >

Method	Description	Satus	Branch	Contributor
add	Adds the specified element to the end of the list			Miguel Costa
remove	Removes and returns the element at the front of the queue. Throws an exception if the queue is empty			Miguel Costa
poll	Removes and returns the element at the front of the queue. Returns null if the queue is empty			Miguel Costa
element	Returns the element at the front of the queue without removing it. Throws an exception if the queue is empty			Miguel Costa
peek	Returns the element at the front of the queue without removing it. Returns null if the queue is empty			Miguel Costa

< Stacks >

Method	Description	Satus	Branch	Contributor
push	Add an element to the top of the stack			Miguel Costa
pop	Remove and return the element at the top of the stack			Miguel Costa
remove	Removes and returns the element at the front of the queue. Throws an exception if the queue is empty			Miguel Costa
peek	Returns the element at the front of the queue without removing it. Returns null if the queue is empty			Miguel Costa