Lines Matching refs:c
260 std::pair<typename Container::iterator, bool> call_emplace_impl( Container& c, Arg&& k, Value* ) {
262 return c.emplace(std::forward<Arg>(k));
266 std::pair<typename Container::iterator, bool> call_emplace_impl( Container& c, Arg&& k, std::pair<F…
268 return c.emplace(k, std::forward<Arg>(k));
272 typename Container::iterator call_emplace_hint_impl( Container& c, typename Container::const_iterat…
276 return c.emplace_hint(hint, std::forward<Arg>(k));
280 typename Container::iterator call_emplace_hint_impl( Container& c, typename Container::const_iterat…
284 return c.emplace_hint(hint, k, std::forward<Arg>(k));
288 std::pair<typename Container::iterator, bool> call_emplace( Container& c, Arg&& k ) {
290 return call_emplace_impl(c, std::forward<Arg>(k), selector);
294 typename Container::iterator call_emplace_hint( Container& c, typename Container::const_iterator hi…
296 return call_emplace_hint_impl(c, hint, std::forward<Arg>(k), selector);
771 int c = (int)table.count(i);
772 CHECK_MESSAGE(c, "must exist");
1011 TestOperatorSquareBrackets( Table& c, const value_type& value )
1012 : my_c(c), my_value(value) {}
1028 void TestSquareBracketsAndAt( Table& c, const Value& value, /*multimap = */std::false_type ) {
1029 CallIf<DefCtorPresent>()(TestOperatorSquareBrackets<Table>(c, value));
1031 REQUIRE(equal(c.at(value.first), value.second));
1033 const Table& constC = c;
1041 void TestMapSpecificMethods( Table& c, const std::pair<const typename Table::key_type,
1044 …TestSquareBracketsAndAt<DefCtorPresent>(c, value, std::integral_constant<bool, AllowMultimapping<T…
1051 CheckValue( Table& c ) : my_c(c) {}
1134 void CommonExamine( Table c, const std::list<typename Table::value_type>& lst ) {
1137 if (!(!c.empty() && c.size() == lst.size() && c.max_size() >= c.size())) {
1139 std::cout << "Empty? " << c.empty() << std::endl;
1140 std::cout << "sizes equal? " << (c.size() == lst.size()) << std::endl;
1141 std::cout << "\t" << c.size() << std::endl;
1143 std::cout << "Max size greater? " << (c.max_size() >= c.size()) << std::endl;
1145 REQUIRE((!c.empty() && c.size() == lst.size() && c.max_size() >= c.size()));
1147 std::for_each(lst.begin(), lst.end(), CheckValue<DefCtorPresent, Table>(c));
1151 TestRange<value_type>(lst, marks).do_test_range(c.begin(), c.end());
1154 const Table constC = c;
1155 REQUIRE(c.size() == constC.size());
1157 TestRange<value_type>(lst, marks).do_test_range(c.begin(), c.end());
1160 tbb::parallel_for(c.range(), TestRange<value_type>(lst, marks));
1172 c2.swap(c);
1174 REQUIRE(c.size() == 5);
1181 auto alloc = c.get_allocator();
1246 char_key(const char* c) : my_item(c) {}
1257 bool operator==(const char_key& ck, std::string c) {
1259 while (ck[i] != '\0' && i < c.size() && ck[i] == c[i]) { ++i;}
1260 return c.size() == i && ck[i] == '\0';
1262 bool operator==(std::string c, const char_key& ck) {
1263 return ck == c;
1271 bool operator<( const char_key& ck, std::string c ) {
1272 return std::lexicographical_compare(ck.my_item, ck.my_item + ck.size(), c.begin(), c.end());
1275 bool operator<(std::string c, const char_key& ck) {
1276 return std::lexicographical_compare(c.begin(), c.end(), ck.my_item, ck.my_item + ck.size());
1327 Container c;
1330 c.insert(Value<Container>::make(i));
1334 c.insert(Value<Container>::make(0));
1341 REQUIRE_MESSAGE(c.find(k) == c.find(key), "Incorrect heterogeneous find return value");
1342 REQUIRE_MESSAGE(c.count(k) == c.count(key), "Incorrect heterogeneous count return value");
1347 Container extract_c = c;
1358 auto not_exists = c.unsafe_extract(int_key(100));
1380 auto count_before_erase = c.count(i);
1381 auto result = c.unsafe_erase(int_key(i));
1383 REQUIRE_MESSAGE(c.count(i) == 0, "Some elements was not erased");
1397 Container c;
1399 c.insert(Value<Container>::make(*it));
1403 c.insert(Value<Container>::make(*keys.begin()));
1410 REQUIRE_MESSAGE(c.find(k) == c.find(key), "Incorrect heterogeneous find return value");
1411 REQUIRE_MESSAGE(c.count(k) == c.count(key), "Incorrect heterogeneous count return value");
1416 Container extract_c = c;
1424 auto not_exists = c.unsafe_extract(char_key("not exists"));
1448 auto count_before_erase = c.count(key);
1449 auto result = c.unsafe_erase(k);
1451 REQUIRE_MESSAGE(c.count(key)==0, "Some elements was not erased");