#[derive(Drop, Debug)] struct CustomSet { collection: Array, } impl CustomSetEq< T, +Copy, +Drop, +PartialEq, +core::fmt::Display, > of PartialEq> { fn eq(lhs: @CustomSet, rhs: @CustomSet) -> bool { if lhs.collection.len() != rhs.collection.len() { return false; } lhs.is_subset(rhs) && rhs.is_subset(lhs) } } #[generate_trait] pub impl CustomSetImpl< T, +Copy, +Drop, +core::fmt::Display, +PartialEq, > of CustomSetTrait { fn new(input: @Array) -> CustomSet { let mut set = CustomSet:: { collection: array![] }; let input = input.span(); for val in input { set.add(val.clone()); } set } fn add(ref self: CustomSet, element: T) { if !self.contains(@element) { self.collection.append(element) } } fn contains(self: @CustomSet, element: @T) -> bool { let mut found = false; let collection = self.collection.span(); for value in collection { if value == element { found = true; break; } } found } fn is_empty(self: @CustomSet) -> bool { self.collection.is_empty() } fn is_subset(self: @CustomSet, other: @CustomSet) -> bool { if self.collection.len() > other.collection.len() { return false; } let mut i = 0; while let Option::Some(value) = self.collection.get(i) { if !other.contains(value.unbox()) { break; } i += 1; } i == self.collection.len() } fn is_disjoint(self: @CustomSet, other: @CustomSet) -> bool { // a more efficient way is to iterate the smaller set let mut to_iterate = self; let mut to_compare = other; if to_iterate.collection.len() > to_compare.collection.len() { to_iterate = other; to_compare = self; } let mut i = 0; while let Option::Some(value) = to_iterate.collection.get(i) { if to_compare.contains(value.unbox()) { break; } i += 1; } i == to_iterate.collection.len() } #[must_use] fn intersection(self: @CustomSet, other: @CustomSet) -> CustomSet { let mut collection: Array = array![]; // a more efficient way is to iterate the smaller set let mut to_iterate = self; let mut to_compare = other; if to_iterate.collection.len() > to_compare.collection.len() { to_iterate = other; to_compare = self; } let mut i = 0; while let Option::Some(boxed) = to_iterate.collection.get(i) { let value = boxed.unbox(); if to_compare.contains(value) { collection.append(*value); } i += 1; } Self::new(@collection) } #[must_use] fn difference(self: @CustomSet, other: @CustomSet) -> CustomSet { let mut collection: Array = array![]; let mut i = 0; while let Option::Some(value) = self.collection.get(i) { let unboxed = value.unbox(); if !other.contains(unboxed) { collection.append(*unboxed); } i += 1; } Self::new(@collection) } #[must_use] fn union(self: @CustomSet, other: @CustomSet) -> CustomSet { let mut collection: Array = array![]; let mut i = 0; while let Option::Some(value) = self.collection.get(i) { collection.append(*value.unbox()); i += 1; } let mut i = 0; while let Option::Some(value) = other.collection.get(i) { collection.append(*value.unbox()); i += 1; } Self::new(@collection) } }