Implement set

[zegabr]

Description

Add Set implementation

Related Issues

Closes #24

Checklist

• I have tested this code.
• I have reviewed the code changes.
• I have updated the documentation.
• This PR follows the coding standards.
• I have added tests for the changes.

[zegabr]

I've implemented most of the methods I found on the List implementation. But as this is a Set implementation, what do you think of implementing some Set operations like:

Union(s1, s2) -> returns a new set as the union of both sets
Intersection(s1, s2) -> returns a new set with elements that exist in both sets
Disjunction(s1, s2) -> returns a new set with the elements that don't exist in both sets

[zegabr]

Another thing: Considering this thread, as far as I understood, the capacity property on the map initializations don't guarantee it to be able to store as much as capacity elements without it being resized. So I omitted it from the Set initializations.

Let me know if you agree with that.

[adarsh-a-tw]

I've implemented most of the methods I found on the List implementation. But as this is a Set implementation, what do you think of implementing some Set operations like:

Union(s1, s2) -> returns a new set as the union of both sets Intersection(s1, s2) -> returns a new set with elements that exist in both sets Disjunction(s1, s2) -> returns a new set with the elements that don't exist in both sets

That's a great idea. But, let's not bring it into this issue. We can create a separate issue for that.

[adarsh-a-tw]

LGTM ! @zegabr Thanks for your contribution.

We can merge it once other codeowners approve it.

[zegabr]

That's a great idea. But, let's not bring it into this issue. We can create a separate issue for that.

Got it. Feel free to also assign it to me :)