|
set, A = allocator> - Bu konteyner joyida qiymatlarni
o‘zgartirishga yo‘l qo‘ymaydi. -
|
| bet | 23/143 | | Sana | 20.07.2024 | | Hajmi | 0,81 Mb. | | #268096 |
Bog'liq Tiplarni dinamik tarzda-fayllar.org. set, A = allocator> - Bu konteyner joyida qiymatlarni
o‘zgartirishga yo‘l qo‘ymaydi. - bu assosiativ konteyner bo‘lib, unikal kalitni qo‘llab quvvtlaydi (bir xil qaymatli kalitlarni qo‘llab quvvatlamaydi) va kalit yordamida tez qidirish imkonini beradi. set::iterator va set::const_iterator iteratorlar funksional ekvivalet hisoblanadi va o‘zgarganda const K& qiymat qaytaradi. Set to‘plamda qiymatni o‘zgartirish uchun avval o‘chirib tashlab so‘ng yangi qiymatni yoki o‘zgartirilgan varianti qo‘shiladi.
ning shabloni:
|
template ,
template class Allocator = allocator>
|
sinfning ochiq xususiyatlari, operatorlari va funksiyalari:
Typedef operatorlari:
typedef Key key_type; typedef Key value_type;
typedef Allocator::pointer pointer; typedef Allocator::reference reference;
typedef Allocator::const_reference const_reference; typedef Compare key_compare;
typedef Compare value_compare; typedef iterator;
typedef iterator const_iterator; typedef size_type;
typedef difference_type;
typedef reverse_iterator; typedef const_reverse_iterator;
set(const Compare& comp = Compare()); template
set(InputIterator first, InputIterator last, const Compare& comp = Compare());
set(const set& x);
~set();
set& operator=(const set& x);
void swap(set& x);
Xotirani ajratish va bo‘shatish operatorlari (allocation/deallocation):
Ruxsat berish vositalarining operatorlari (accessors):
key_compare key_comp() const; value_compare value_comp() const; iterator begin() const;
iterator end() const; reverse_iterator rbegin() const; reverse_iterator rend() const; bool empty() const;
size_type size() const; size_type max_size() const;
Qo‘shish va o‘chirish operatorlari (insert/erase):
pair insert(const value_type& x); iterator insert(iterator position, const value_type& x); template
void insert(InputIterator first, InputIterator last); void erase(iterator position);
size_type erase(const key_type& x); void erase(iterator first, iterator last);
iterator find(const key_type& x) const; size_type count(const key_type& x) const; iterator lower_bound(const key_type& x) const; iterator upper_bound(const key_type& x) const;
pair equal_range(const key_type& x) const;
To‘plam amallari (set operations):
Taqqoslash operatorlari:
template bool operator==(const set& x,
const set& y);
template bool operator<(const set& x,
const set& y);
to‘plamda:
|
| |
