From 6508914a4ba1a593dbf61a38412e0b7ff9be8857 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jo=C3=A3o=20Fernandes?= Date: Tue, 2 Jul 2024 12:11:26 -0300 Subject: [PATCH] [gleam] complete custom-set --- gleam/custom-set/.gitignore | 4 + gleam/custom-set/HELP.md | 32 ++ gleam/custom-set/README.md | 20 ++ gleam/custom-set/gleam.toml | 12 + gleam/custom-set/manifest.toml | 27 ++ gleam/custom-set/src/custom_set.gleam | 45 +++ gleam/custom-set/test/custom_set_test.gleam | 313 ++++++++++++++++++++ 7 files changed, 453 insertions(+) create mode 100644 gleam/custom-set/.gitignore create mode 100644 gleam/custom-set/HELP.md create mode 100644 gleam/custom-set/README.md create mode 100644 gleam/custom-set/gleam.toml create mode 100644 gleam/custom-set/manifest.toml create mode 100644 gleam/custom-set/src/custom_set.gleam create mode 100644 gleam/custom-set/test/custom_set_test.gleam diff --git a/gleam/custom-set/.gitignore b/gleam/custom-set/.gitignore new file mode 100644 index 0000000..170cca9 --- /dev/null +++ b/gleam/custom-set/.gitignore @@ -0,0 +1,4 @@ +*.beam +*.ez +build +erl_crash.dump diff --git a/gleam/custom-set/HELP.md b/gleam/custom-set/HELP.md new file mode 100644 index 0000000..103fd4c --- /dev/null +++ b/gleam/custom-set/HELP.md @@ -0,0 +1,32 @@ +# Help + +## Running the tests + +To run the tests, run the command `gleam test` from within the exercise directory. + +## Submitting your solution + +You can submit your solution using the `exercism submit src/custom_set.gleam` command. +This command will upload your solution to the Exercism website and print the solution page's URL. + +It's possible to submit an incomplete solution which allows you to: + +- See how others have completed the exercise +- Request help from a mentor + +## Need to get help? + +If you'd like help solving the exercise, check the following pages: + +- The [Gleam track's documentation](https://exercism.org/docs/tracks/gleam) +- The [Gleam track's programming category on the forum](https://forum.exercism.org/c/programming/gleam) +- [Exercism's programming category on the forum](https://forum.exercism.org/c/programming/5) +- The [Frequently Asked Questions](https://exercism.org/docs/using/faqs) + +Should those resources not suffice, you could submit your (incomplete) solution to request mentoring. + +To get help if you're having trouble, you can use one of the following resources: + +- [gleam.run](https://gleam.run/documentation/) is the gleam official documentation. +- [Discord](https://discord.gg/Fm8Pwmy) is the discord channel. +- [StackOverflow](https://stackoverflow.com/questions/tagged/gleam) can be used to search for your problem and see if it has been answered already. You can also ask and answer questions. \ No newline at end of file diff --git a/gleam/custom-set/README.md b/gleam/custom-set/README.md new file mode 100644 index 0000000..8a4da97 --- /dev/null +++ b/gleam/custom-set/README.md @@ -0,0 +1,20 @@ +# Custom Set + +Welcome to Custom Set on Exercism's Gleam Track. +If you need help running the tests or submitting your code, check out `HELP.md`. + +## Instructions + +Create a custom set type. + +Sometimes it is necessary to define a custom data structure of some type, like a set. +In this exercise you will define your own set. +How it works internally doesn't matter, as long as it behaves like a set of unique elements. + +For this exercise, please refrain from using the `gleam/set` module. + +## Source + +### Created by + +- @natanaelsirqueira \ No newline at end of file diff --git a/gleam/custom-set/gleam.toml b/gleam/custom-set/gleam.toml new file mode 100644 index 0000000..89c764e --- /dev/null +++ b/gleam/custom-set/gleam.toml @@ -0,0 +1,12 @@ +name = "custom_set" +version = "0.1.0" + +[dependencies] +gleam_bitwise = "~> 1.2" +gleam_otp = "~> 0.7 or ~> 1.0" +gleam_stdlib = "~> 0.32 or ~> 1.0" +simplifile = "~> 1.0" +gleam_erlang = ">= 0.25.0 and < 1.0.0" + +[dev-dependencies] +exercism_test_runner = "~> 1.4" diff --git a/gleam/custom-set/manifest.toml b/gleam/custom-set/manifest.toml new file mode 100644 index 0000000..072155d --- /dev/null +++ b/gleam/custom-set/manifest.toml @@ -0,0 +1,27 @@ +# This file was generated by Gleam +# You typically do not need to edit this file + +packages = [ + { name = "argv", version = "1.0.1", build_tools = ["gleam"], requirements = [], otp_app = "argv", source = "hex", outer_checksum = "A6E9009E50BBE863EB37D963E4315398D41A3D87D0075480FC244125808F964A" }, + { name = "exercism_test_runner", version = "1.7.0", build_tools = ["gleam"], requirements = ["argv", "gap", "glance", "gleam_community_ansi", "gleam_erlang", "gleam_json", "gleam_stdlib", "simplifile"], otp_app = "exercism_test_runner", source = "hex", outer_checksum = "2FC1BADB19BEC2AE77BFD2D3A606A014C85412A7B874CAFC4BA8CF04B0B257CD" }, + { name = "gap", version = "1.1.0", build_tools = ["gleam"], requirements = ["gleam_community_ansi", "gleam_stdlib"], otp_app = "gap", source = "hex", outer_checksum = "2EE1B0A17E85CF73A0C1D29DA315A2699117A8F549C8E8D89FA8261BE41EDEB1" }, + { name = "glance", version = "0.8.2", build_tools = ["gleam"], requirements = ["gleam_stdlib", "glexer"], otp_app = "glance", source = "hex", outer_checksum = "ACF09457E8B564AD7A0D823DAFDD326F58263C01ACB0D432A9BEFDEDD1DA8E73" }, + { name = "gleam_bitwise", version = "1.3.1", build_tools = ["gleam"], requirements = [], otp_app = "gleam_bitwise", source = "hex", outer_checksum = "B36E1D3188D7F594C7FD4F43D0D2CE17561DE896202017548578B16FE1FE9EFC" }, + { name = "gleam_community_ansi", version = "1.4.0", build_tools = ["gleam"], requirements = ["gleam_community_colour", "gleam_stdlib"], otp_app = "gleam_community_ansi", source = "hex", outer_checksum = "FE79E08BF97009729259B6357EC058315B6FBB916FAD1C2FF9355115FEB0D3A4" }, + { name = "gleam_community_colour", version = "1.3.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleam_community_colour", source = "hex", outer_checksum = "A49A5E3AE8B637A5ACBA80ECB9B1AFE89FD3D5351FF6410A42B84F666D40D7D5" }, + { name = "gleam_erlang", version = "0.25.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleam_erlang", source = "hex", outer_checksum = "054D571A7092D2A9727B3E5D183B7507DAB0DA41556EC9133606F09C15497373" }, + { name = "gleam_json", version = "1.0.0", build_tools = ["gleam"], requirements = ["gleam_stdlib", "thoas"], otp_app = "gleam_json", source = "hex", outer_checksum = "8B197DD5D578EA6AC2C0D4BDC634C71A5BCA8E7DB5F47091C263ECB411A60DF3" }, + { name = "gleam_otp", version = "0.10.0", build_tools = ["gleam"], requirements = ["gleam_erlang", "gleam_stdlib"], otp_app = "gleam_otp", source = "hex", outer_checksum = "0B04FE915ACECE539B317F9652CAADBBC0F000184D586AAAF2D94C100945D72B" }, + { name = "gleam_stdlib", version = "0.36.0", build_tools = ["gleam"], requirements = [], otp_app = "gleam_stdlib", source = "hex", outer_checksum = "C0D14D807FEC6F8A08A7C9EF8DFDE6AE5C10E40E21325B2B29365965D82EB3D4" }, + { name = "glexer", version = "0.7.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "glexer", source = "hex", outer_checksum = "4484942A465482A0A100936E1E5F12314DB4B5AC0D87575A7B9E9062090B96BE" }, + { name = "simplifile", version = "1.5.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "simplifile", source = "hex", outer_checksum = "EB9AA8E65E5C1E3E0FDCFC81BC363FD433CB122D7D062750FFDF24DE4AC40116" }, + { name = "thoas", version = "0.4.1", build_tools = ["rebar3"], requirements = [], otp_app = "thoas", source = "hex", outer_checksum = "4918D50026C073C4AB1388437132C77A6F6F7C8AC43C60C13758CC0ADCE2134E" }, +] + +[requirements] +exercism_test_runner = { version = "~> 1.4" } +gleam_bitwise = { version = "~> 1.2" } +gleam_erlang = { version = ">= 0.25.0 and < 1.0.0"} +gleam_otp = { version = "~> 0.7 or ~> 1.0" } +gleam_stdlib = { version = "~> 0.32 or ~> 1.0" } +simplifile = { version = "~> 1.0" } diff --git a/gleam/custom-set/src/custom_set.gleam b/gleam/custom-set/src/custom_set.gleam new file mode 100644 index 0000000..ec965dd --- /dev/null +++ b/gleam/custom-set/src/custom_set.gleam @@ -0,0 +1,45 @@ +import gleam/list + +pub opaque type Set(t) { + Set(elements: List(t)) +} + +pub fn new(members: List(t)) -> Set(t) { + Set(list.unique(members)) +} + +pub fn is_empty(set: Set(t)) -> Bool { + list.is_empty(set.elements) +} + +pub fn contains(in set: Set(t), this member: t) -> Bool { + list.contains(set.elements, member) +} + +pub fn is_subset(first: Set(t), of second: Set(t)) -> Bool { + list.all(first.elements, contains(second, _)) +} + +pub fn disjoint(first: Set(t), second: Set(t)) -> Bool { + !list.any(first.elements, contains(second, _)) +} + +pub fn is_equal(first: Set(t), to second: Set(t)) -> Bool { + is_subset(first, second) && is_subset(second, first) +} + +pub fn add(to set: Set(t), this member: t) -> Set(t) { + Set([member, ..set.elements]) +} + +pub fn intersection(of first: Set(t), and second: Set(t)) -> Set(t) { + Set(list.filter(first.elements, contains(second, _))) +} + +pub fn difference(between first: Set(t), and second: Set(t)) -> Set(t) { + Set(list.filter(first.elements, fn(x) { !contains(second, x) })) +} + +pub fn union(of first: Set(t), and second: Set(t)) -> Set(t) { + Set(list.append(first.elements, second.elements)) +} diff --git a/gleam/custom-set/test/custom_set_test.gleam b/gleam/custom-set/test/custom_set_test.gleam new file mode 100644 index 0000000..0befba8 --- /dev/null +++ b/gleam/custom-set/test/custom_set_test.gleam @@ -0,0 +1,313 @@ +import custom_set +import exercism/should +import exercism/test_runner + +pub fn main() { + test_runner.main() +} + +pub fn returns_true_if_the_set_contains_no_elements_sets_with_no_elements_are_empty_test() { + let set = custom_set.new([]) + + let assert True = custom_set.is_empty(set) +} + +pub fn returns_true_if_the_set_contains_no_elements_sets_with_elements_are_not_empty_test() { + let set = custom_set.new([1]) + + let assert False = custom_set.is_empty(set) +} + +pub fn sets_can_report_if_they_contain_an_element_nothing_is_contained_in_an_empty_set_test() { + let set = custom_set.new([]) + + let assert False = custom_set.contains(in: set, this: 1) +} + +pub fn sets_can_report_if_they_contain_an_element_when_the_element_is_in_the_set_test() { + let set = custom_set.new([1, 2, 3]) + + let assert True = custom_set.contains(in: set, this: 1) +} + +pub fn sets_can_report_if_they_contain_an_element_when_the_element_is_not_in_the_set_test() { + let set = custom_set.new([1, 2, 3]) + + let assert False = custom_set.contains(in: set, this: 4) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_empty_set_is_a_subset_of_another_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let assert True = custom_set.is_subset(set1, of: set2) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_empty_set_is_a_subset_of_non_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([1]) + + let assert True = custom_set.is_subset(set1, of: set2) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_non_empty_set_is_not_a_subset_of_empty_set_test() { + let set1 = custom_set.new([1]) + let set2 = custom_set.new([]) + + let assert False = custom_set.is_subset(set1, of: set2) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_set_is_a_subset_of_set_with_exact_same_elements_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([1, 2, 3]) + + let assert True = custom_set.is_subset(set1, of: set2) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_set_is_a_subset_of_larger_set_with_same_elements_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([4, 1, 2, 3]) + + let assert True = custom_set.is_subset(set1, of: set2) +} + +pub fn a_set_is_a_subset_if_all_of_its_elements_are_contained_in_the_other_set_set_is_not_a_subset_of_set_that_does_not_contain_its_elements_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([4, 1, 3]) + + let assert False = custom_set.is_subset(set1, of: set2) +} + +pub fn sets_are_disjoint_if_they_share_no_elements_the_empty_set_is_disjoint_with_itself_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let assert True = custom_set.disjoint(set1, set2) +} + +pub fn sets_are_disjoint_if_they_share_no_elements_empty_set_is_disjoint_with_non_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([1]) + + let assert True = custom_set.disjoint(set1, set2) +} + +pub fn sets_are_disjoint_if_they_share_no_elements_non_empty_set_is_disjoint_with_empty_set_test() { + let set1 = custom_set.new([1]) + let set2 = custom_set.new([]) + + let assert True = custom_set.disjoint(set1, set2) +} + +pub fn sets_are_disjoint_if_they_share_no_elements_sets_are_not_disjoint_if_they_share_an_element_test() { + let set1 = custom_set.new([1, 2]) + let set2 = custom_set.new([2, 3]) + + let assert False = custom_set.disjoint(set1, set2) +} + +pub fn sets_are_disjoint_if_they_share_no_elements_sets_are_disjoint_if_they_share_no_elements_test() { + let set1 = custom_set.new([1, 2]) + let set2 = custom_set.new([3, 4]) + + let assert True = custom_set.disjoint(set1, set2) +} + +pub fn sets_with_the_same_elements_are_equal_empty_sets_are_equal_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let assert True = custom_set.is_equal(set1, to: set2) +} + +pub fn sets_with_the_same_elements_are_equal_empty_set_is_not_equal_to_non_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([1, 2, 3]) + + let assert False = custom_set.is_equal(set1, to: set2) +} + +pub fn sets_with_the_same_elements_are_equal_non_empty_set_is_not_equal_to_empty_set_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([]) + + let assert False = custom_set.is_equal(set1, to: set2) +} + +pub fn sets_with_the_same_elements_are_equal_sets_with_the_same_elements_are_equal_test() { + let set1 = custom_set.new([1, 2]) + let set2 = custom_set.new([2, 1]) + + let assert True = custom_set.is_equal(set1, to: set2) +} + +pub fn sets_with_the_same_elements_are_equal_sets_with_different_elements_are_not_equal_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([1, 2, 4]) + + let assert False = custom_set.is_equal(set1, to: set2) +} + +pub fn sets_with_the_same_elements_are_equal_set_is_not_equal_to_larger_set_with_same_elements_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([1, 2, 3, 4]) + + let assert False = custom_set.is_equal(set1, to: set2) +} + +pub fn unique_elements_can_be_added_to_a_set_add_to_empty_set_test() { + let set = custom_set.new([]) + + let actual = custom_set.add(to: set, this: 3) + let expected = custom_set.new([3]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn unique_elements_can_be_added_to_a_set_add_to_non_empty_set_test() { + let set = custom_set.new([1, 2, 4]) + + let actual = custom_set.add(to: set, this: 3) + let expected = custom_set.new([1, 2, 3, 4]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn unique_elements_can_be_added_to_a_set_adding_an_existing_element_does_not_change_the_set_test() { + let set = custom_set.new([1, 2, 3]) + + let actual = custom_set.add(to: set, this: 3) + let expected = custom_set.new([1, 2, 3]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn intersection_returns_a_set_of_all_shared_elements_intersection_of_two_empty_sets_is_an_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let actual = custom_set.intersection(of: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn intersection_returns_a_set_of_all_shared_elements_intersection_of_an_empty_set_and_non_empty_set_is_an_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([3, 2, 5]) + + let actual = custom_set.intersection(of: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn intersection_returns_a_set_of_all_shared_elements_intersection_of_a_non_empty_set_and_an_empty_set_is_an_empty_set_test() { + let set1 = custom_set.new([1, 2, 3, 4]) + let set2 = custom_set.new([]) + + let actual = custom_set.intersection(of: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn intersection_returns_a_set_of_all_shared_elements_intersection_of_two_sets_with_no_shared_elements_is_an_empty_set_test() { + let set1 = custom_set.new([1, 2, 3]) + let set2 = custom_set.new([4, 5, 6]) + + let actual = custom_set.intersection(of: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn intersection_returns_a_set_of_all_shared_elements_intersection_of_two_sets_with_shared_elements_is_a_set_of_the_shared_elements_test() { + let set1 = custom_set.new([1, 2, 3, 4]) + let set2 = custom_set.new([3, 2, 5]) + + let actual = custom_set.intersection(of: set1, and: set2) + let expected = custom_set.new([2, 3]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn difference_or_complement_of_a_set_is_a_set_of_all_elements_that_are_only_in_the_first_set_difference_of_two_empty_sets_is_an_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let actual = custom_set.difference(between: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn difference_or_complement_of_a_set_is_a_set_of_all_elements_that_are_only_in_the_first_set_difference_of_empty_set_and_non_empty_set_is_an_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([3, 2, 5]) + + let actual = custom_set.difference(between: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn difference_or_complement_of_a_set_is_a_set_of_all_elements_that_are_only_in_the_first_set_difference_of_a_non_empty_set_and_an_empty_set_is_the_non_empty_set_test() { + let set1 = custom_set.new([1, 2, 3, 4]) + let set2 = custom_set.new([]) + + let actual = custom_set.difference(between: set1, and: set2) + let expected = custom_set.new([1, 2, 3, 4]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn difference_or_complement_of_a_set_is_a_set_of_all_elements_that_are_only_in_the_first_set_difference_of_two_non_empty_sets_is_a_set_of_elements_that_are_only_in_the_first_set_test() { + let set1 = custom_set.new([3, 2, 1]) + let set2 = custom_set.new([2, 4]) + + let actual = custom_set.difference(between: set1, and: set2) + let expected = custom_set.new([1, 3]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn union_returns_a_set_of_all_elements_in_either_set_union_of_empty_sets_is_an_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([]) + + let actual = custom_set.union(of: set1, and: set2) + let expected = custom_set.new([]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn union_returns_a_set_of_all_elements_in_either_set_union_of_an_empty_set_and_non_empty_set_is_the_non_empty_set_test() { + let set1 = custom_set.new([]) + let set2 = custom_set.new([2]) + + let actual = custom_set.union(of: set1, and: set2) + let expected = custom_set.new([2]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn union_returns_a_set_of_all_elements_in_either_set_union_of_a_non_empty_set_and_empty_set_is_the_non_empty_set_test() { + let set1 = custom_set.new([1, 3]) + let set2 = custom_set.new([]) + + let actual = custom_set.union(of: set1, and: set2) + let expected = custom_set.new([1, 3]) + + let assert True = custom_set.is_equal(actual, expected) +} + +pub fn union_returns_a_set_of_all_elements_in_either_set_union_of_non_empty_sets_contains_all_unique_elements_test() { + let set1 = custom_set.new([1, 3]) + let set2 = custom_set.new([2, 3]) + + let actual = custom_set.union(of: set1, and: set2) + let expected = custom_set.new([3, 2, 1]) + + let assert True = custom_set.is_equal(actual, expected) +}