Skip to content

Correctly distinguish ordered/sorted lists due to changes in lists.js #790

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
geekygirlsarah merged 1 commit into from
Dec 28, 2025
Merged

Correctly distinguish ordered/sorted lists due to changes in lists.js #790

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
52 changes: 46 additions & 6 deletions web/thesauruses/ada/2012/lists.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,13 +60,54 @@
"not-implemented": "true",
"name": "Delete the list"
},
"name_of_unordered_mutable_list": {
"name_of_sorted_mutable_list": {
"code": "sets",
"name": "What is a unordered mutable list called?"
"name": "What is a sorted mutable list called?"
},
"create_a_unordered_mutable_list": {
"create_a_sorted_mutable_list": {
"code": "S : Set;",
"comment": "Ad.Containers.Ordered_Sets container is required",
"name": "Create the list"
},
"sorted_mutable_list_start_number": {
"not-implemented": "true",
"name": "What number does it start at?"
},
"access_element_in_sorted_mutable_list": {
"not-implemented": "true",
"name": "Access element by index"
},
"insert_into_sorted_mutable_list": {
"code": "S.Include (value); \n S.Insert (value);",
"comment": "S.Insert(value) raises Constraint_Error if value appended is already in the list",
"name": "Insert element in middle"
},
"erase_element_at_beginning_of_sorted_mutable_list": {
"not-implemented": "true",
"name": "Erase first element"
},
"erase_element_at_end_of_sorted_mutable_list": {
"not-implemented": "true",
"name": "Erase last element"
},
"erase_element_in_middle_of_sorted_mutable_list": {
"not-implemented": "true",
"name": "Erase element in the middle"
},
"swap_elements_in_sorted_mutable_list": {
"not-implemented": "true",
"name": "Swap two elements"
},
"delete_sorted_mutable_list": {
"not-implemented": "true",
"name": "Delete the list"
},
"name_of_unordered_mutable_list": {
"not-implemented": "true",
"name": "What is a unordered mutable list called?"
},
"create_a_unordered_mutable_list": {
"not-implemented": "true",
"name": "unordered"
},
"unordered_mutable_list_start_number": {
Expand All @@ -78,9 +119,8 @@
"name": "Access element by index"
},
"insert_into_unordered_mutable_list": {
"code": "S.Include (value); \n S.Insert (value);",
"comment": "S.Insert(value) raises Constraint_Error if value appended is already in the list",
"name": "Insert element at end"
"not-implemented": "true",
"name": "Insert element in middle"
},
"erase_element_at_beginning_of_unordered_mutable_list": {
"not-implemented": "true",
Expand Down
18 changes: 9 additions & 9 deletions web/thesauruses/haskell/2010/lists.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -95,40 +95,40 @@
"name": "Delete the list"
},
"name_of_ordered_immutable_list": {
"not-implemented": true,
"comment": "`a` is the type of elements of the list",
"code": "[a]",
"name": "What is a ordered immutable list called?"
},
"create_a_ordered_immutable_list": {
"not-implemented": true,
"code": "[firstElement, secondElement]",
"name": "Create the list"
},
"ordered_immutable_list_start_number": {
"not-implemented": true,
"code": "0",
"name": "What number does it start at?"
},
"access_element_in_ordered_immutable_list": {
"not-implemented": true,
"code": "list !! index",
"name": "Access element by index"
},
"delete_ordered_immutable_list": {
"not-implemented": true,
"name": "Delete the list"
},
"name_of_unordered_immutable_list": {
"comment": "`a` is the type of elements of the list",
"code": "[a]",
"not-implemented": true,
"name": "What is a unordered immutable list called?"
},
"create_a_unordered_immutable_list": {
"code": "[firstElement, secondElement]",
"not-implemented": true,
"name": "Create the list"
},
"unordered_immutable_list_start_number": {
"code": "0",
"not-implemented": true,
"name": "What number does it start at?"
},
"access_element_in_unordered_immutable_list": {
"code": "list !! index",
"not-implemented": true,
"name": "Access element by index"
},
"delete_unordered_immutable_list": {
Expand Down
90 changes: 69 additions & 21 deletions web/thesauruses/nim/1/lists.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,43 +56,43 @@
},
"name_of_unordered_mutable_list": {
"name": "What is a unordered, mutable list called?",
"code": "Table"
"not-implemented": true
},
"create_a_unordered_mutable_list": {
"name": "unordered",
"code": "{\"key\": \"value\"}.toTable"
"not-implemented": true
},
"unordered_mutable_list_start_number": {
"name": "What number does it start at?",
"code": "0"
"not-implemented": true
},
"access_element_in_unordered_mutable_list": {
"name": "Access element by index",
"code": "table[key]"
"not-implemented": true
},
"insert_into_unordered_mutable_list": {
"name": "Insert element in middle",
"code": "table[key] = value"
"not-implemented": true
},
"erase_element_at_beginning_of_unordered_mutable_list": {
"name": "Erase first element",
"code": "table.del key"
"not-implemented": true
},
"erase_element_at_end_of_unordered_mutable_list": {
"name": "Erase last element",
"code": "table.del key"
"not-implemented": true
},
"erase_element_in_middle_of_unordered_mutable_list": {
"name": "Erase element in the middle",
"code": "table.del key"
"not-implemented": true
},
"swap_elements_in_unordered_mutable_list": {
"name": "Swap two elements",
"code": "swap table[key0], table[key1]"
"not-implemented": true
},
"delete_unordered_mutable_list": {
"name": "Delete the list",
"code": "Automatic compile-time deterministic memory management"
"not-implemented": true
},
"name_of_ordered_immutable_list": {
"name": "What is a ordered, immutable list called?",
Expand All @@ -116,60 +116,108 @@
},
"name_of_unordered_immutable_list": {
"name": "What is a unordered, immutable list called?",
"code": "Table"
"not-implemented": true
},
"create_a_unordered_immutable_list": {
"name": "Create the list",
"code": "{\"key\": \"value\"}.toTable"
"not-implemented": true
},
"unordered_immutable_list_start_number": {
"name": "What number does it start at?",
"code": "0"
"not-implemented": true
},
"access_element_in_unordered_immutable_list": {
"name": "Access element by index",
"code": "table[key]"
"not-implemented": true
},
"delete_unordered_immutable_list": {
"name": "Delete the list",
"code": "Automatic compile-time deterministic memory management"
"not-implemented": true
},
"name_of_mutable_hashed_list": {
"name": "What is a mutable hashed list called?",
"code": "Table"
"code": "HashSet"
},
"create_a_mutable_hashed_list": {
"name": "Create the list",
"code": "{\"key\": \"value\"}.toTable"
"code": "[1, 2].toHashSet"
},
"insert_element_to_mutable_hashed_list": {
"name": "Insert an element",
"code": "table[key] = value"
"code": "hashset.incl item"
},
"erase_element_from_mutable_hashed_list": {
"name": "Erase an element from the list",
"code": "table.del key"
"code": "hashset.excl item"
},
"delete_mutable_hashed_list": {
"name": "Delete the list",
"code": "Automatic compile-time deterministic memory management"
},
"name_of_immutable_hashed_list": {
"name": "What is an immutable hashed list called?",
"code": "Table"
"code": "HashSet"
},
"create_a_immutable_hashed_list": {
"name": "Create the list",
"code": "{\"key\": \"value\"}.toTable"
"code": "[1, 2].toHashSet"
},
"delete_immutable_hashed_list": {
"name": "Delete the list",
"code": "Automatic compile-time deterministic memory management"
},
"create_a_mutable_set": {
"name": "Create a mutable key/value set",
"code": "{\"key\": \"value\"}.toTable"
},
"get_key_from_mutable_set": {
"name": "Get key",
"not-implemented": true
},
"get_value_from_mutable_set": {
"name": "Get value",
"code": "table[key]"
},
"get_all_keys_from_mutable_set": {
"name": "Get all keys",
"code": "toSeq(table.keys)"
},
"get_all_values_from_mutable_set": {
"name": "Get all values",
"code": "toSeq(table.values)"
},
"swap_key_and_value_in_mutable_set": {
"name": "Swap a key and value",
"not-implemented": true
},
"delete_mutable_set": {
"name": "Delete the set",
"code": "Automatic compile-time deterministic memory management"
},
"create_a_immutable_set": {
"name": "Create an immutable key/value set",
"code": "{\"key\": \"value\"}.toTable"
},
"get_key_from_immutable_set": {
"name": "Get key",
"not-implemented": true
},
"get_value_from_immutable_set": {
"name": "Get value",
"code": "table[key]"
},
"get_all_keys_from_immutable_set": {
"name": "Get all keys",
"code": "toSeq(table.keys)"
},
"get_all_values_from_immutable_set": {
"name": "Get all values",
"code": "toSeq(table.values)"
},
"swap_key_and_value_in_immutable_set": {
"name": "Swap a key and value",
"not-implemented": true
},
"delete_immutable_set": {
"name": "Delete the set",
"code": "Automatic compile-time deterministic memory management"
Expand Down
Loading
Loading