diff options
| author | Bruce Hill <bruce@bruce-hill.com> | 2025-09-21 15:57:29 -0400 |
|---|---|---|
| committer | Bruce Hill <bruce@bruce-hill.com> | 2025-09-21 15:57:29 -0400 |
| commit | 4d5ebf7fc10214a14de02e6d758daff29c66fa2d (patch) | |
| tree | b69172762404bb98633f3575179c29183bbfc2a7 | |
| parent | 9540d7e5adf84249678334dff79e436356950c6a (diff) | |
Remove sets from learnxiny
| -rw-r--r-- | examples/learnxiny.tm | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/examples/learnxiny.tm b/examples/learnxiny.tm index 7b1c74ca..fb85296a 100644 --- a/examples/learnxiny.tm +++ b/examples/learnxiny.tm @@ -159,23 +159,6 @@ func main() >> table3[[10, 20]]! = "one" - # Sets are similar to tables, but they represent an unordered collection of - # unique values: - set := |10, 20, 30| - >> set.has(20) - = yes - >> set.has(999) - = no - - # You can do some operations on sets: - other_set := |30, 40, 50| - >> set.with(other_set) - = |10, 20, 30, 40, 50| - >> set.without(other_set) - = |10, 20| - >> set.overlap(other_set) - = |30| - # So far, the datastructures that have been discussed are all *immutable*, # meaning you can't add, remove, or change their contents. If you want to # have mutable data, you need to allocate an area of memory which can hold @@ -243,7 +226,6 @@ func takes_many_types( text_aka_string:Text, list_of_ints:[Int], table_of_text_to_bools:{Text=Bool}, - set_of_ints:|Int|, pointer_to_mutable_list_of_ints:@[Int], optional_int:Int?, function_from_int_to_text:func(x:Int -> Text), |