Sha256: 2661fc683aa78a33dd3bee4c47df68eeabdff47da7ee514ffc4943a28d74c8a2
Contents?: true
Size: 679 Bytes
Versions: 14
Compression:
Stored size: 679 Bytes
Contents
## Hints To complete this exercise, you need to create the data type `CustomSet`, with `Eq` and `Show` instances, and implement the following functions: - `delete` - `difference` - `empty` - `fromList` - `insert` - `intersection` - `isDisjointFrom` - `isSubsetOf` - `member` - `null` - `size` - `toList` - `union` You will find the type signatures already in place, but it is up to you to define the functions. If you're interested in writing an efficient implementation but don't quite know where to start, the best primer I know of is Chris Okasaki's "Purely Functional Data Structures", which you can read a version of here: https://www.cs.cmu.edu/~rwh/theses/okasaki.pdf
Version data entries
14 entries across 14 versions & 1 rubygems