Added some basic hash set utility nodes for now (tho i haven't tested those since the tauri app takes a while to start). I plan to add more nodes such as, however il explain the basic ones added:

• Clear Accepts a hash set and clears that entire hash set, returning in the process the newly emptied hash set
• Make Creates an empty hash set, returning it in the process
• Insert Accepts a hash set and a value, then it inserts that element into the supplied hash set, returning in the process the newly modified hash set and a boolean value dictating if the element was present in the hash set before this insertion
• Discard Accepts a hash set and a potential value in the hash set, then it tries to remove / discard that element from the supplied hash set, returning in the process the newly modified hash set and a boolean value dictating if the element was actually removed or not from the hash set
• Has Accepts a hash set and a potential value present in the hash set, then it tries to check if the value is actually in the hash set, returning in the process true if the value is present otherwise false (a boolean value)

I plan to add more utilities as the hash set is underutilized. Some of the examples are:

• Extend Accepts a hash set and a list of values to add, adds all of the values returning in the process the modified hash set
• Contains Accepts 2 hash sets (suppose A and B) and checks if one of the hash sets is contained within the other, if so it returns true otherwise returns false (a boolean value), this operation is commutative (A ∩ B = B ∩ A) exactly like set theory
• Difference Accepts 2 hash sets and returns in the process a hash set that contains the elements that are not mutually present in both hash sets, this operation commutative (A ∖ B = B ∖ A)
• Is Subset Accepts 2 hash sets (suppose A and B) and returns if A is a subset of B (which means if all elements from A are contained within B), This operation is not commutative (A ⊂ B ≠ B ⊂ A)
• Is Superset The opposite of subset, accepts 2 hash sets (Suppose A and B again) and returns if A is a superset of B (which means if all elements from B are contained within A), This operation is not commutative (A ⊃ B ≠ B ⊃ A)