You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Commit aec370f
Browse filesBrowse the repository at this point in the historyBrowse files
A hashtable would be unlikely because it is sorted and can be efficiently iterated.
7
8
8
-
- immutable elements: it is not possible to modify an object,
9
-
one must first remove it and resinsert.
9
+
Unique elements: inserting twice does nothing.
10
10
11
-
This is so because modification may mean reordering.
11
+
Immutable elements: it is not possible to modify an object, one must first remove it and resinsert. This is so because modification may mean reordering.
12
12
*/
13
13
14
14
#include"common.hpp"
@@ -81,7 +81,7 @@ int main() {
81
81
/*
82
82
# insert
83
83
84
-
Return is a pair conatining:
84
+
Return is a pair containing:
85
85
86
86
- if the item was not present, an iterator to the item inserted and true
87
87
- if the item was present, an iterator to the existing item inserted and false
0 commit comments