diff --git a/config.json b/config.json index c5c67867..951cbbe6 100644 --- a/config.json +++ b/config.json @@ -869,6 +869,14 @@ "practices": [], "prerequisites": [], "difficulty": 1 + }, + { + "slug": "custom-set", + "name": "Custom Set", + "uuid": "09393e30-a635-48f1-89f8-e41c5ccba265", + "practices": [], + "prerequisites": [], + "difficulty": 1 } ], "foregone": [ diff --git a/exercises/practice/custom-set/.docs/instructions.md b/exercises/practice/custom-set/.docs/instructions.md new file mode 100644 index 00000000..33b90e28 --- /dev/null +++ b/exercises/practice/custom-set/.docs/instructions.md @@ -0,0 +1,7 @@ +# 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. diff --git a/exercises/practice/custom-set/.meta/config.json b/exercises/practice/custom-set/.meta/config.json new file mode 100644 index 00000000..0396a392 --- /dev/null +++ b/exercises/practice/custom-set/.meta/config.json @@ -0,0 +1,17 @@ +{ + "authors": [ + "erikschierboom" + ], + "files": { + "solution": [ + "custom_set.pl" + ], + "test": [ + "custom_set_tests.plt" + ], + "example": [ + ".meta/custom_set.example.pl" + ] + }, + "blurb": "Create a custom set type." +} diff --git a/exercises/practice/custom-set/.meta/custom_set.example.pl b/exercises/practice/custom-set/.meta/custom_set.example.pl new file mode 100644 index 00000000..4aa1e5db --- /dev/null +++ b/exercises/practice/custom-set/.meta/custom_set.example.pl @@ -0,0 +1,22 @@ +create_set(set([])) :- !. +create_set(Data, set(Sorted)) :- sort(Data, Sorted). + +add(Value, set(Data), Added) :- create_set([Value|Data], Added). + +is_empty(set([])). + +in_set(Value, set(Data)) :- member(Value, Data), !. +is_subset(set(Data1), Set2) :- maplist([Data]>>(in_set(Data, Set2)), Data1), !. +is_disjoint(set(Data1), Set2) :- maplist([Data]>>(\+ in_set(Data, Set2)), Data1), !. + +difference(set(Data1), Set2, Difference) :- + exclude([Data]>>(in_set(Data, Set2)), Data1, Elements), + create_set(Elements, Difference). + +intersection(set(Data1), Set2, Intersection) :- + include([Data]>>(in_set(Data, Set2)), Data1, Elements), + create_set(Elements, Intersection). + +union(set(Data1), set(Data2), Union) :- + append(Data1, Data2, Data), + create_set(Data, Union). diff --git a/exercises/practice/custom-set/.meta/tests.toml b/exercises/practice/custom-set/.meta/tests.toml new file mode 100644 index 00000000..8c450e0b --- /dev/null +++ b/exercises/practice/custom-set/.meta/tests.toml @@ -0,0 +1,127 @@ +# This is an auto-generated file. +# +# Regenerating this file via `configlet sync` will: +# - Recreate every `description` key/value pair +# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications +# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion) +# - Preserve any other key/value pair +# +# As user-added comments (using the # character) will be removed when this file +# is regenerated, comments can be added via a `comment` key. + +[20c5f855-f83a-44a7-abdd-fe75c6cf022b] +description = "Returns true if the set contains no elements -> sets with no elements are empty" + +[d506485d-5706-40db-b7d8-5ceb5acf88d2] +description = "Returns true if the set contains no elements -> sets with elements are not empty" + +[759b9740-3417-44c3-8ca3-262b3c281043] +description = "Sets can report if they contain an element -> nothing is contained in an empty set" + +[f83cd2d1-2a85-41bc-b6be-80adbff4be49] +description = "Sets can report if they contain an element -> when the element is in the set" + +[93423fc0-44d0-4bc0-a2ac-376de8d7af34] +description = "Sets can report if they contain an element -> when the element is not in the set" + +[c392923a-637b-4495-b28e-34742cd6157a] +description = "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" + +[5635b113-be8c-4c6f-b9a9-23c485193917] +description = "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" + +[832eda58-6d6e-44e2-92c2-be8cf0173cee] +description = "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" + +[c830c578-8f97-4036-b082-89feda876131] +description = "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" + +[476a4a1c-0fd1-430f-aa65-5b70cbc810c5] +description = "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" + +[d2498999-3e46-48e4-9660-1e20c3329d3d] +description = "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" + +[7d38155e-f472-4a7e-9ad8-5c1f8f95e4cc] +description = "Sets are disjoint if they share no elements -> the empty set is disjoint with itself" + +[7a2b3938-64b6-4b32-901a-fe16891998a6] +description = "Sets are disjoint if they share no elements -> empty set is disjoint with non-empty set" + +[589574a0-8b48-48ea-88b0-b652c5fe476f] +description = "Sets are disjoint if they share no elements -> non-empty set is disjoint with empty set" + +[febeaf4f-f180-4499-91fa-59165955a523] +description = "Sets are disjoint if they share no elements -> sets are not disjoint if they share an element" + +[0de20d2f-c952-468a-88c8-5e056740f020] +description = "Sets are disjoint if they share no elements -> sets are disjoint if they share no elements" + +[4bd24adb-45da-4320-9ff6-38c044e9dff8] +description = "Sets with the same elements are equal -> empty sets are equal" + +[f65c0a0e-6632-4b2d-b82c-b7c6da2ec224] +description = "Sets with the same elements are equal -> empty set is not equal to non-empty set" + +[81e53307-7683-4b1e-a30c-7e49155fe3ca] +description = "Sets with the same elements are equal -> non-empty set is not equal to empty set" + +[d57c5d7c-a7f3-48cc-a162-6b488c0fbbd0] +description = "Sets with the same elements are equal -> sets with the same elements are equal" + +[dd61bafc-6653-42cc-961a-ab071ee0ee85] +description = "Sets with the same elements are equal -> sets with different elements are not equal" + +[06059caf-9bf4-425e-aaff-88966cb3ea14] +description = "Sets with the same elements are equal -> set is not equal to larger set with same elements" + +[d4a1142f-09aa-4df9-8b83-4437dcf7ec24] +description = "Sets with the same elements are equal -> set is equal to a set constructed from an array with duplicates" + +[8a677c3c-a658-4d39-bb88-5b5b1a9659f4] +description = "Unique elements can be added to a set -> add to empty set" + +[0903dd45-904d-4cf2-bddd-0905e1a8d125] +description = "Unique elements can be added to a set -> add to non-empty set" + +[b0eb7bb7-5e5d-4733-b582-af771476cb99] +description = "Unique elements can be added to a set -> adding an existing element does not change the set" + +[893d5333-33b8-4151-a3d4-8f273358208a] +description = "Intersection returns a set of all shared elements -> intersection of two empty sets is an empty set" + +[d739940e-def2-41ab-a7bb-aaf60f7d782c] +description = "Intersection returns a set of all shared elements -> intersection of an empty set and non-empty set is an empty set" + +[3607d9d8-c895-4d6f-ac16-a14956e0a4b7] +description = "Intersection returns a set of all shared elements -> intersection of a non-empty set and an empty set is an empty set" + +[b5120abf-5b5e-41ab-aede-4de2ad85c34e] +description = "Intersection returns a set of all shared elements -> intersection of two sets with no shared elements is an empty set" + +[af21ca1b-fac9-499c-81c0-92a591653d49] +description = "Intersection returns a set of all shared elements -> intersection of two sets with shared elements is a set of the shared elements" + +[c5e6e2e4-50e9-4bc2-b89f-c518f015b57e] +description = "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" + +[2024cc92-5c26-44ed-aafd-e6ca27d6fcd2] +description = "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" + +[e79edee7-08aa-4c19-9382-f6820974b43e] +description = "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" + +[c5ac673e-d707-4db5-8d69-7082c3a5437e] +description = "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" + +[c45aed16-5494-455a-9033-5d4c93589dc6] +description = "Union returns a set of all elements in either set -> union of empty sets is an empty set" + +[9d258545-33c2-4fcb-a340-9f8aa69e7a41] +description = "Union returns a set of all elements in either set -> union of an empty set and non-empty set is the non-empty set" + +[3aade50c-80c7-4db8-853d-75bac5818b83] +description = "Union returns a set of all elements in either set -> union of a non-empty set and empty set is the non-empty set" + +[a00bb91f-c4b4-4844-8f77-c73e2e9df77c] +description = "Union returns a set of all elements in either set -> union of non-empty sets contains all unique elements" diff --git a/exercises/practice/custom-set/custom_set.pl b/exercises/practice/custom-set/custom_set.pl new file mode 100644 index 00000000..02b6567d --- /dev/null +++ b/exercises/practice/custom-set/custom_set.pl @@ -0,0 +1,18 @@ +create_set(Set). +create_set(Data, Set). + +add(Value, Set, Added). + +is_empty(Set). + +in_set(Value, Set). + +is_subset(Set1, Set2). + +is_disjoint(Set1, Set2). + +difference(Set1, Set2, Difference). + +intersection(Set1, Set2, Intersection). + +union(Set1, Set2, Union). diff --git a/exercises/practice/custom-set/custom_set_tests.plt b/exercises/practice/custom-set/custom_set_tests.plt new file mode 100644 index 00000000..12f30f59 --- /dev/null +++ b/exercises/practice/custom-set/custom_set_tests.plt @@ -0,0 +1,228 @@ +pending :- + current_prolog_flag(argv, ['--all'|_]). +pending :- + write('\nA TEST IS PENDING!\n'), + fail. + +:- begin_tests(custom_set). + + test(sets_with_no_elements_are_empty, condition(true)) :- + create_set(Sut), + is_empty(Sut). + + test(sets_with_elements_are_not_empty, [fail, condition(pending)]) :- + create_set([1], Sut), + is_empty(Sut). + + test(nothing_is_contained_in_an_empty_set, [fail, condition(pending)]) :- + create_set(Sut), + in_set(1, Sut). + + test(when_the_element_is_in_the_set, condition(pending)) :- + create_set([1, 2, 3], Sut), + in_set(1, Sut). + + test(when_the_element_is_not_in_the_set, [fail, condition(pending)]) :- + create_set([1, 2, 3], Sut), + in_set(4, Sut). + + test(empty_set_is_a_subset_of_another_empty_set, condition(pending)) :- + create_set(Set1), + create_set(Set2), + is_subset(Set1, Set2). + + test(empty_set_is_a_subset_of_non_empty_set, condition(pending)) :- + create_set(Set1), + create_set([1], Set2), + is_subset(Set1, Set2). + + test(non_empty_set_is_not_a_subset_of_empty_set, [fail, condition(pending)]) :- + create_set([1], Set1), + create_set(Set2), + is_subset(Set1, Set2). + + test(set_is_a_subset_of_set_with_exact_same_elements, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set([1, 2, 3], Set2), + is_subset(Set1, Set2). + + test(set_is_a_subset_of_larger_set_with_same_elements, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set([4, 1, 2, 3], Set2), + is_subset(Set1, Set2). + + test(set_is_not_a_subset_of_set_that_does_not_contain_its_elements, [fail, condition(pending)]) :- + create_set([1, 2, 3], Set1), + create_set([4, 1, 3], Set2), + is_subset(Set1, Set2). + + test(the_empty_set_is_disjoint_with_itself, condition(pending)) :- + create_set(Set1), + create_set(Set2), + is_disjoint(Set1, Set2). + + test(empty_set_is_disjoint_with_non_empty_set, condition(pending)) :- + create_set(Set1), + create_set([1], Set2), + is_disjoint(Set1, Set2). + + test(non_empty_set_is_disjoint_with_empty_set, condition(pending)) :- + create_set([1], Set1), + create_set(Set2), + is_disjoint(Set1, Set2). + + test(sets_are_not_disjoint_if_they_share_an_element, [fail, condition(pending)]) :- + create_set([1, 2], Set1), + create_set([2, 3], Set2), + is_disjoint(Set1, Set2). + + test(sets_are_disjoint_if_they_share_no_elements, condition(pending)) :- + create_set([1, 2], Set1), + create_set([3, 4], Set2), + is_disjoint(Set1, Set2). + + test(empty_sets_are_equal, condition(pending)) :- + create_set(Set1), + create_set(Set2), + Set1 == Set2. + + test(empty_set_is_not_equal_to_non_empty_set, condition(pending)) :- + create_set(Set1), + create_set([1, 2, 3], Set2), + Set1 \== Set2. + + test(non_empty_set_is_not_equal_to_empty_set, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set(Set2), + Set1 \== Set2. + + test(sets_with_the_same_elements_are_equal, condition(pending)) :- + create_set([1, 2], Set1), + create_set([2, 1], Set2), + Set1 == Set2. + + test(sets_with_different_elements_are_not_equal, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set([1, 2, 4], Set2), + Set1 \== Set2. + + test(set_is_not_equal_to_larger_set_with_same_elements, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set([1, 2, 3, 4], Set2), + Set1 \== Set2. + + test(set_is_equal_to_a_set_constructed_from_an_array_with_duplicates, condition(pending)) :- + create_set([1], Set1), + create_set([1, 1], Set2), + Set1 == Set2. + + test(add_to_empty_set, condition(pending)) :- + create_set(Sut), + add(3, Sut, NewSut), + create_set([3], Expected), + NewSut == Expected. + + test(add_to_non_empty_set, condition(pending)) :- + create_set([1, 2, 4], Sut), + add(3, Sut, NewSut), + create_set([1, 2, 3, 4], Expected), + NewSut == Expected. + + test(adding_an_existing_element_does_not_change_the_set, condition(pending)) :- + create_set([1, 2, 3], Sut), + add(3, Sut, NewSut), + create_set([1, 2, 3], Expected), + NewSut == Expected. + + test(intersection_of_two_empty_sets_is_an_empty_set, condition(pending)) :- + create_set(Set1), + create_set(Set2), + intersection(Set1, Set2, Intersection), + create_set(Expected), + Intersection == Expected. + + test(intersection_of_an_empty_set_and_non_empty_set_is_an_empty_set, condition(pending)) :- + create_set(Set1), + create_set([3, 2, 5], Set2), + intersection(Set1, Set2, Intersection), + create_set(Expected), + Intersection == Expected. + + test(intersection_of_a_non_empty_set_and_an_empty_set_is_an_empty_set, condition(pending)) :- + create_set([1, 2, 3, 4], Set1), + create_set(Set2), + intersection(Set1, Set2, Intersection), + create_set(Expected), + Intersection == Expected. + + test(intersection_of_two_sets_with_no_shared_elements_is_an_empty_set, condition(pending)) :- + create_set([1, 2, 3], Set1), + create_set([4, 5, 6], Set2), + intersection(Set1, Set2, Intersection), + create_set(Expected), + Intersection == Expected. + + test(intersection_of_two_sets_with_shared_elements_is_a_set_of_the_shared_elements, condition(pending)) :- + create_set([1, 2, 3, 4], Set1), + create_set([3, 2, 5], Set2), + intersection(Set1, Set2, Intersection), + create_set([2, 3], Expected), + Intersection == Expected. + + test(difference_of_two_empty_sets_is_an_empty_set, condition(pending)) :- + create_set(Set1), + create_set(Set2), + difference(Set1, Set2, Difference), + create_set(Expected), + Difference == Expected. + + test(difference_of_empty_set_and_non_empty_set_is_an_empty_set, condition(pending)) :- + create_set(Set1), + create_set([3, 2, 5], Set2), + difference(Set1, Set2, Difference), + create_set(Expected), + Difference == Expected. + + test(difference_of_a_non_empty_set_and_an_empty_set_is_the_non_empty_set, condition(pending)) :- + create_set([1, 2, 3, 4], Set1), + create_set(Set2), + difference(Set1, Set2, Difference), + create_set([1, 2, 3, 4], Expected), + Difference == Expected. + + test(difference_of_two_non_empty_sets_is_a_set_of_elements_that_are_only_in_the_first_set, condition(pending)) :- + create_set([3, 2, 1], Set1), + create_set([2, 4], Set2), + difference(Set1, Set2, Difference), + create_set([1, 3], Expected), + Difference == Expected. + + test(union_of_empty_sets_is_an_empty_set, condition(pending)) :- + create_set(Set1), + create_set(Set2), + union(Set1, Set2, Union), + create_set(Expected), + Union == Expected. + + test(union_of_an_empty_set_and_non_empty_set_is_the_non_empty_set, condition(pending)) :- + create_set(Set1), + create_set([2], Set2), + union(Set1, Set2, Union), + create_set([2], Expected), + Union == Expected. + + test(union_of_a_non_empty_set_and_empty_set_is_the_non_empty_set, condition(pending)) :- + create_set([1, 3], Set1), + create_set(Set2), + union(Set1, Set2, Union), + create_set([1, 3], Expected), + Union == Expected. + + test(union_of_non_empty_sets_contains_all_unique_elements, condition(pending)) :- + create_set([1, 3], Set1), + create_set([2, 3], Set2), + union(Set1, Set2, Union), + create_set([1, 2, 3], Expected), + Union == Expected. + +:- end_tests(custom_set).