HelenOS sources
insert 414 uspace/drv/nic/ar9271/ar9271.c ieee80211_key_config_t *key_conf, bool insert)
insert 420 uspace/drv/nic/ar9271/ar9271.c if (insert) {
insert 788 uspace/lib/cpp/include/__bits/adt/deque.hpp return insert(
insert 825 uspace/lib/cpp/include/__bits/adt/deque.hpp return insert(position, init.begin(), init.end());
insert 107 uspace/lib/cpp/include/__bits/adt/hash_table.hpp insert(x);
insert 199 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return Policy::insert(*this, val);
insert 204 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return Policy::insert(*this, forward<value_type>(val));
insert 413 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
insert 423 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
insert 434 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
insert 729 uspace/lib/cpp/include/__bits/adt/list.hpp return insert(
insert 753 uspace/lib/cpp/include/__bits/adt/list.hpp return insert(position, init.begin(), init.end());
insert 118 uspace/lib/cpp/include/__bits/adt/map.hpp insert(first, last);
insert 146 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 185 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 332 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.insert(val);
insert 337 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.insert(forward<value_type>(val));
insert 351 uspace/lib/cpp/include/__bits/adt/map.hpp return insert(val).first;
insert 356 uspace/lib/cpp/include/__bits/adt/map.hpp return insert(forward<value_type>(val)).first;
insert 373 uspace/lib/cpp/include/__bits/adt/map.hpp insert(*first++);
insert 378 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 777 uspace/lib/cpp/include/__bits/adt/map.hpp insert(first, last);
insert 805 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 844 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 943 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.insert(val);
insert 948 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.insert(forward<value_type>(val));
insert 962 uspace/lib/cpp/include/__bits/adt/map.hpp return insert(val);
insert 967 uspace/lib/cpp/include/__bits/adt/map.hpp return insert(forward<value_type>(val));
insert 984 uspace/lib/cpp/include/__bits/adt/map.hpp insert(*first++);
insert 989 uspace/lib/cpp/include/__bits/adt/map.hpp insert(init.begin(), init.end());
insert 232 uspace/lib/cpp/include/__bits/adt/queue.hpp c.insert(c.end(), first, last);
insert 242 uspace/lib/cpp/include/__bits/adt/queue.hpp c.insert(c.end(), first, last);
insert 72 uspace/lib/cpp/include/__bits/adt/rbtree.hpp insert(x);
insert 196 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return Policy::insert(*this, val);
insert 201 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return Policy::insert(*this, forward<value_type>(val));
insert 426 uspace/lib/cpp/include/__bits/adt/rbtree.hpp Policy::insert(*this, node, parent);
insert 177 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node, parent);
insert 194 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node, parent);
insert 211 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node, parent);
insert 392 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node);
insert 402 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node);
insert 412 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return insert(tree, node);
insert 94 uspace/lib/cpp/include/__bits/adt/set.hpp insert(first, last);
insert 122 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 161 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 260 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.insert(val);
insert 265 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.insert(forward<value_type>(val));
insert 270 uspace/lib/cpp/include/__bits/adt/set.hpp return insert(val).first;
insert 275 uspace/lib/cpp/include/__bits/adt/set.hpp return insert(forward<value_type>(val)).first;
insert 282 uspace/lib/cpp/include/__bits/adt/set.hpp insert(*first++);
insert 287 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 575 uspace/lib/cpp/include/__bits/adt/set.hpp insert(first, last);
insert 603 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 642 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 741 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.insert(val);
insert 746 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.insert(forward<value_type>(val));
insert 751 uspace/lib/cpp/include/__bits/adt/set.hpp return insert(val);
insert 756 uspace/lib/cpp/include/__bits/adt/set.hpp return insert(forward<value_type>(val));
insert 763 uspace/lib/cpp/include/__bits/adt/set.hpp insert(*first++);
insert 768 uspace/lib/cpp/include/__bits/adt/set.hpp insert(init.begin(), init.end());
insert 99 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(first, last);
insert 129 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 189 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 258 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.insert(val);
insert 263 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.insert(forward<value_type>(val));
insert 277 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return insert(val).first;
insert 282 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return insert(forward<value_type>(val)).first;
insert 299 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(*first++);
insert 304 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 774 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(first, last);
insert 804 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 866 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 935 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.insert(val);
insert 940 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.insert(forward<value_type>(val));
insert 954 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return insert(val);
insert 959 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return insert(forward<value_type>(val));
insert 976 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(*first++);
insert 981 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp insert(init.begin(), init.end());
insert 104 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(first, last);
insert 134 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 194 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 263 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.insert(val);
insert 268 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.insert(forward<value_type>(val));
insert 273 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return insert(val).first;
insert 278 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return insert(forward<value_type>(val)).first;
insert 285 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(*first++);
insert 290 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 520 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(first, last);
insert 550 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 610 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 679 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.insert(val);
insert 684 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.insert(forward<value_type>(val));
insert 689 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return insert(val);
insert 694 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return insert(forward<value_type>(val));
insert 701 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(*first++);
insert 706 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp insert(init.begin(), init.end());
insert 716 uspace/lib/cpp/include/__bits/io/ostream.hpp return aux::insert(os, str, len);
insert 727 uspace/lib/cpp/include/__bits/io/ostream.hpp return aux::insert(os, str, len);
insert 740 uspace/lib/cpp/include/__bits/io/ostream.hpp return aux::insert(os, str, len);
insert 756 uspace/lib/cpp/include/__bits/io/ostream.hpp return aux::insert(os, str, len);
insert 772 uspace/lib/cpp/include/__bits/io/ostream.hpp return aux::insert(os, str, len);
insert 475 uspace/lib/cpp/include/__bits/iterator.hpp iter = container.insert(iter, value);
insert 483 uspace/lib/cpp/include/__bits/iterator.hpp iter = container.insert(iter, move(value));
insert 942 uspace/lib/cpp/include/__bits/string/string.hpp return insert(pos, str.data(), str.size());
insert 952 uspace/lib/cpp/include/__bits/string/string.hpp return insert(pos1, str.data() + pos2, len);
insert 971 uspace/lib/cpp/include/__bits/string/string.hpp return insert(pos, str, traits_type::length(str));
insert 976 uspace/lib/cpp/include/__bits/string/string.hpp return insert(pos, basic_string(n, c));
insert 1021 uspace/lib/cpp/include/__bits/string/string.hpp insert(idx, str);
insert 1028 uspace/lib/cpp/include/__bits/string/string.hpp return insert(pos, init.begin(), init.end());
insert 1641 uspace/lib/cpp/include/__bits/string/string.hpp return move(rhs.insert(0, lhs));
insert 1665 uspace/lib/cpp/include/__bits/string/string.hpp return move(rhs.insert(0, lhs));
insert 1681 uspace/lib/cpp/include/__bits/string/string.hpp return move(rhs.insert(0, 1, lhs));
insert 242 uspace/lib/cpp/src/__bits/test/deque.cpp d1.insert(d1.begin() + 5, to_insert.begin(), to_insert.end());
insert 249 uspace/lib/cpp/src/__bits/test/deque.cpp d2.insert(d2.begin() + 5, to_insert);
insert 260 uspace/lib/cpp/src/__bits/test/deque.cpp d3.insert(d3.begin() + 5, 8U, 99);
insert 183 uspace/lib/cpp/src/__bits/test/list.cpp l1.insert(l1.begin(), 5U, 42);
insert 195 uspace/lib/cpp/src/__bits/test/list.cpp l1.insert(it1, data1.begin(), data1.end());
insert 206 uspace/lib/cpp/src/__bits/test/list.cpp l1.insert(it2, data1);
insert 178 uspace/lib/cpp/src/__bits/test/map.cpp auto res5 = map2.insert(std::pair<const int, const char*>{5, "A"});
insert 183 uspace/lib/cpp/src/__bits/test/map.cpp auto res6 = map2.insert(std::pair<const int, std::string>{6, "B"});
insert 188 uspace/lib/cpp/src/__bits/test/map.cpp auto res7 = map2.insert(std::pair<const int, std::string>{6, "C"});
insert 307 uspace/lib/cpp/src/__bits/test/map.cpp auto res4 = mmap.insert(std::pair<const int, int>{8, 6});
insert 312 uspace/lib/cpp/src/__bits/test/map.cpp auto res5 = mmap.insert(std::pair<const int, int>{9, 8});
insert 137 uspace/lib/cpp/src/__bits/test/set.cpp auto res5 = set2.insert("A");
insert 141 uspace/lib/cpp/src/__bits/test/set.cpp auto res6 = set2.insert(std::string{"B"});
insert 145 uspace/lib/cpp/src/__bits/test/set.cpp auto res7 = set2.insert(std::string{"B"});
insert 153 uspace/lib/cpp/src/__bits/test/set.cpp set2.insert(std::string{"G"});
insert 154 uspace/lib/cpp/src/__bits/test/set.cpp set2.insert(std::string{"H"});
insert 155 uspace/lib/cpp/src/__bits/test/set.cpp set2.insert(std::string{"K"});
insert 162 uspace/lib/cpp/src/__bits/test/set.cpp set3.insert(1);
insert 167 uspace/lib/cpp/src/__bits/test/set.cpp set3.insert(3);
insert 175 uspace/lib/cpp/src/__bits/test/set.cpp set3.insert(1);
insert 184 uspace/lib/cpp/src/__bits/test/set.cpp set.insert(i);
insert 186 uspace/lib/cpp/src/__bits/test/set.cpp set.insert(i);
insert 232 uspace/lib/cpp/src/__bits/test/set.cpp auto res4 = mset.insert(8);
insert 236 uspace/lib/cpp/src/__bits/test/set.cpp auto res5 = mset.insert(9);
insert 172 uspace/lib/cpp/src/__bits/test/string.cpp str1.insert(0, "hello");
insert 180 uspace/lib/cpp/src/__bits/test/string.cpp str2.insert(str2.begin() + 6, ' ');
insert 188 uspace/lib/cpp/src/__bits/test/string.cpp str3.insert(str3.begin() + 2, 2ul, 'l');
insert 197 uspace/lib/cpp/src/__bits/test/string.cpp str4.insert(str4.begin() + 1, insertee.begin(),
insert 207 uspace/lib/cpp/src/__bits/test/string.cpp str5.insert(str5.begin() + 3, init);
insert 160 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res5 = map2.insert(std::pair<const int, const char*>{5, "A"});
insert 165 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res6 = map2.insert(std::pair<const int, std::string>{6, "B"});
insert 170 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res7 = map2.insert(std::pair<const int, std::string>{6, "C"});
insert 193 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res12 = map2.insert(std::pair<const int, const char*>{11, "test"});
insert 244 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res4 = mmap.insert(std::pair<const int, int>{8, 6});
insert 249 uspace/lib/cpp/src/__bits/test/unordered_map.cpp auto res5 = mmap.insert(std::pair<const int, int>{9, 8});
insert 259 uspace/lib/cpp/src/__bits/test/unordered_map.cpp mmap.insert(std::pair<const int, int>{8, 8});
insert 127 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res5 = set2.insert("A");
insert 131 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res6 = set2.insert(std::string{"B"});
insert 135 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res7 = set2.insert(std::string{"B"});
insert 143 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set2.insert(std::string{"G"});
insert 144 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set2.insert(std::string{"H"});
insert 145 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set2.insert(std::string{"K"});
insert 152 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set3.insert(1);
insert 157 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set3.insert(3);
insert 165 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set3.insert(1);
insert 169 uspace/lib/cpp/src/__bits/test/unordered_set.cpp set3.insert(15);
insert 198 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res4 = mset.insert(8);
insert 202 uspace/lib/cpp/src/__bits/test/unordered_set.cpp auto res5 = mset.insert(9);
insert 142 uspace/lib/cpp/src/__bits/test/vector.cpp auto it = vec1.insert(vec1.begin() + 3, 99);
insert 154 uspace/lib/cpp/src/__bits/test/vector.cpp vec2.insert(vec2.begin() + 3, 5ul, 99);
insert 162 uspace/lib/cpp/src/__bits/test/vector.cpp vec3.insert(vec3.begin() + 3, vec2.begin() + 3, vec2.begin() + 8);
insert 170 uspace/lib/cpp/src/__bits/test/vector.cpp vec4.insert(vec4.begin() + 3, check1);
insert 178 uspace/lib/cpp/src/__bits/test/vector.cpp vec5.insert(vec5.begin() + 3, {1, 2, 3, 99, 4, 5});
insert 186 uspace/lib/cpp/src/__bits/test/vector.cpp vec6.insert(vec6.begin(), check3);
insert 105 uspace/lib/ieee80211/src/ieee80211_impl.c ieee80211_key_config_t *key_conf, bool insert)
HelenOS homepage, sources at GitHub