Skip to content

Commit 2fe3c4b

Browse files
Abseil Teamcopybara-github
Abseil Team
authored and
copybara-github
committed
Indent absl container examples consistently
PiperOrigin-RevId: 759023113 Change-Id: I84d18d16abddf70a00160e2bc3c25d5a90f52e79
1 parent 48e429c commit 2fe3c4b

File tree

6 files changed

+56
-56
lines changed

6 files changed

+56
-56
lines changed

‎absl/container/btree_map.h‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -117,8 +117,8 @@ class ABSL_ATTRIBUTE_OWNER btree_map
117117
//
118118
// * Copy assignment operator
119119
//
120-
// absl::btree_map<int, std::string> map4;
121-
// map4 = map3;
120+
// absl::btree_map<int, std::string> map4;
121+
// map4 = map3;
122122
//
123123
// * Move constructor
124124
//
@@ -555,8 +555,8 @@ class ABSL_ATTRIBUTE_OWNER btree_multimap
555555
//
556556
// * Copy assignment operator
557557
//
558-
// absl::btree_multimap<int, std::string> map4;
559-
// map4 = map3;
558+
// absl::btree_multimap<int, std::string> map4;
559+
// map4 = map3;
560560
//
561561
// * Move constructor
562562
//

‎absl/container/btree_set.h‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -119,8 +119,8 @@ class ABSL_ATTRIBUTE_OWNER btree_set
119119
//
120120
// * Copy assignment operator
121121
//
122-
// absl::btree_set<std::string> set4;
123-
// set4 = set3;
122+
// absl::btree_set<std::string> set4;
123+
// set4 = set3;
124124
//
125125
// * Move constructor
126126
//
@@ -475,8 +475,8 @@ class ABSL_ATTRIBUTE_OWNER btree_multiset
475475
//
476476
// * Copy assignment operator
477477
//
478-
// absl::btree_multiset<std::string> set4;
479-
// set4 = set3;
478+
// absl::btree_multiset<std::string> set4;
479+
// set4 = set3;
480480
//
481481
// * Move constructor
482482
//

‎absl/container/flat_hash_map.h‎

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -115,18 +115,18 @@ struct FlatHashMapPolicy;
115115
// absl::flat_hash_map<std::string, std::string> ducks =
116116
// {{"a", "huey"}, {"b", "dewey"}, {"c", "louie"}};
117117
//
118-
// // Insert a new element into the flat hash map
119-
// ducks.insert({"d", "donald"});
118+
// // Insert a new element into the flat hash map
119+
// ducks.insert({"d", "donald"});
120120
//
121-
// // Force a rehash of the flat hash map
122-
// ducks.rehash(0);
121+
// // Force a rehash of the flat hash map
122+
// ducks.rehash(0);
123123
//
124-
// // Find the element with the key "b"
125-
// std::string search_key = "b";
126-
// auto result = ducks.find(search_key);
127-
// if (result != ducks.end()) {
128-
// std::cout << "Result: " << result->second << std::endl;
129-
// }
124+
// // Find the element with the key "b"
125+
// std::string search_key = "b";
126+
// auto result = ducks.find(search_key);
127+
// if (result != ducks.end()) {
128+
// std::cout << "Result: " << result->second << std::endl;
129+
// }
130130
template <class K, class V, class Hash = DefaultHashContainerHash<K>,
131131
class Eq = DefaultHashContainerEq<K>,
132132
class Allocator = std::allocator<std::pair<const K, V>>>
@@ -158,9 +158,9 @@ class ABSL_ATTRIBUTE_OWNER flat_hash_map
158158
//
159159
// * Copy assignment operator
160160
//
161-
// // Hash functor and Comparator are copied as well
162-
// absl::flat_hash_map<int, std::string> map4;
163-
// map4 = map3;
161+
// // Hash functor and Comparator are copied as well
162+
// absl::flat_hash_map<int, std::string> map4;
163+
// map4 = map3;
164164
//
165165
// * Move constructor
166166
//

‎absl/container/flat_hash_set.h‎

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -114,16 +114,16 @@ struct FlatHashSetPolicy;
114114
// absl::flat_hash_set<std::string> ducks =
115115
// {"huey", "dewey", "louie"};
116116
//
117-
// // Insert a new element into the flat hash set
118-
// ducks.insert("donald");
117+
// // Insert a new element into the flat hash set
118+
// ducks.insert("donald");
119119
//
120-
// // Force a rehash of the flat hash set
121-
// ducks.rehash(0);
120+
// // Force a rehash of the flat hash set
121+
// ducks.rehash(0);
122122
//
123-
// // See if "dewey" is present
124-
// if (ducks.contains("dewey")) {
125-
// std::cout << "We found dewey!" << std::endl;
126-
// }
123+
// // See if "dewey" is present
124+
// if (ducks.contains("dewey")) {
125+
// std::cout << "We found dewey!" << std::endl;
126+
// }
127127
template <class T, class Hash = DefaultHashContainerHash<T>,
128128
class Eq = DefaultHashContainerEq<T>,
129129
class Allocator = std::allocator<T>>
@@ -154,9 +154,9 @@ class ABSL_ATTRIBUTE_OWNER flat_hash_set
154154
//
155155
// * Copy assignment operator
156156
//
157-
// // Hash functor and Comparator are copied as well
158-
// absl::flat_hash_set<std::string> set4;
159-
// set4 = set3;
157+
// // Hash functor and Comparator are copied as well
158+
// absl::flat_hash_set<std::string> set4;
159+
// set4 = set3;
160160
//
161161
// * Move constructor
162162
//

‎absl/container/node_hash_map.h‎

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -110,18 +110,18 @@ class NodeHashMapPolicy;
110110
// absl::node_hash_map<std::string, std::string> ducks =
111111
// {{"a", "huey"}, {"b", "dewey"}, {"c", "louie"}};
112112
//
113-
// // Insert a new element into the node hash map
114-
// ducks.insert({"d", "donald"}};
113+
// // Insert a new element into the node hash map
114+
// ducks.insert({"d", "donald"}};
115115
//
116-
// // Force a rehash of the node hash map
117-
// ducks.rehash(0);
116+
// // Force a rehash of the node hash map
117+
// ducks.rehash(0);
118118
//
119-
// // Find the element with the key "b"
120-
// std::string search_key = "b";
121-
// auto result = ducks.find(search_key);
122-
// if (result != ducks.end()) {
123-
// std::cout << "Result: " << result->second << std::endl;
124-
// }
119+
// // Find the element with the key "b"
120+
// std::string search_key = "b";
121+
// auto result = ducks.find(search_key);
122+
// if (result != ducks.end()) {
123+
// std::cout << "Result: " << result->second << std::endl;
124+
// }
125125
template <class Key, class Value, class Hash = DefaultHashContainerHash<Key>,
126126
class Eq = DefaultHashContainerEq<Key>,
127127
class Alloc = std::allocator<std::pair<const Key, Value>>>
@@ -153,9 +153,9 @@ class ABSL_ATTRIBUTE_OWNER node_hash_map
153153
//
154154
// * Copy assignment operator
155155
//
156-
// // Hash functor and Comparator are copied as well
157-
// absl::node_hash_map<int, std::string> map4;
158-
// map4 = map3;
156+
// // Hash functor and Comparator are copied as well
157+
// absl::node_hash_map<int, std::string> map4;
158+
// map4 = map3;
159159
//
160160
// * Move constructor
161161
//

‎absl/container/node_hash_set.h‎

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -108,16 +108,16 @@ struct NodeHashSetPolicy;
108108
// absl::node_hash_set<std::string> ducks =
109109
// {"huey", "dewey", "louie"};
110110
//
111-
// // Insert a new element into the node hash set
112-
// ducks.insert("donald");
111+
// // Insert a new element into the node hash set
112+
// ducks.insert("donald");
113113
//
114-
// // Force a rehash of the node hash set
115-
// ducks.rehash(0);
114+
// // Force a rehash of the node hash set
115+
// ducks.rehash(0);
116116
//
117-
// // See if "dewey" is present
118-
// if (ducks.contains("dewey")) {
119-
// std::cout << "We found dewey!" << std::endl;
120-
// }
117+
// // See if "dewey" is present
118+
// if (ducks.contains("dewey")) {
119+
// std::cout << "We found dewey!" << std::endl;
120+
// }
121121
template <class T, class Hash = DefaultHashContainerHash<T>,
122122
class Eq = DefaultHashContainerEq<T>, class Alloc = std::allocator<T>>
123123
class ABSL_ATTRIBUTE_OWNER node_hash_set
@@ -147,9 +147,9 @@ class ABSL_ATTRIBUTE_OWNER node_hash_set
147147
//
148148
// * Copy assignment operator
149149
//
150-
// // Hash functor and Comparator are copied as well
151-
// absl::node_hash_set<std::string> set4;
152-
// set4 = set3;
150+
// // Hash functor and Comparator are copied as well
151+
// absl::node_hash_set<std::string> set4;
152+
// set4 = set3;
153153
//
154154
// * Move constructor
155155
//

0 commit comments

Comments
 (0)