Operatorlarni qayta yuklash
Nima uchun a + b yozish a.qosh(b) dan qulayroq?
Matematikada biz belgilar bilan fikrlaymiz. O‘z sinflarimiz ham shunday “gapira” oladimi?
pul1 + pul2, vaqt++, cout << sana — qaysi biri tabiiyroq o‘qiladi?+ bilan “qo‘shish” nimani bildiradi?2 * vektor va vektor * 2 ikkalasi ham ishlashi kerakmi?Bu ma’ruza oxirida siz quyidagilarni bajara olasiz...
A’zo yoki erkin funksiya?
Qaysi operator qayerda yoziladi?
| Qoida | Operatorlar |
|---|---|
| Faqat a’zo | =, [], (), ->, tur o‘zgartirish operatorlari |
| Faqat erkin | Chap operand boshqa sinf: cout << a, cin >> a, 2 * a |
| Odatda a’zo | Obyektni o‘zgartiruvchi: +=, -=, ++, --, unar - |
| Odatda erkin (friend) | Simmetrik: + - * / == != < > |
| Qayta yuklanmaydi | ::, ., .*, ?:, sizeof, typeid |
a @ b uchun a’zo a.operator@(b) va erkin operator@(a, b) ni qidiradi.A’zo operator va 2 + a muammosi
struct Metr { double q; Metr(double q) : q(q) {} Metr operator+(const Metr &b) const { return Metr(q + b.q); } }; struct Sekund { double q; Sekund(double q) : q(q) {} friend Sekund operator+(const Sekund &a, const Sekund &b) { return Sekund(a.q + b.q); } }; int main() { Metr m(5); cout << (m + 2).q << " "; Sekund s(5); cout << (s + 2).q << " " << (2 + s).q; }
7 7 7
To‘liq operatorlar to‘plami
class Pul { long long tiyin; public: Pul(long long som = 0, int t = 0) : tiyin(som * 100 + t) {} Pul& operator+=(const Pul &b) { tiyin += b.tiyin; return *this; } Pul& operator*=(int k) { tiyin *= k; return *this; } friend Pul operator+(Pul a, const Pul &b) { return a += b; } friend Pul operator*(Pul a, int k) { return a *= k; } friend bool operator<(const Pul &a, const Pul &b) { return a.tiyin < b.tiyin; } friend ostream& operator<<(ostream &o, const Pul &p) { return o << p.tiyin / 100 << "." << p.tiyin % 100 / 10 << p.tiyin % 10 << " so'm"; } }; int main() { Pul non(4500), choy(2000, 50); Pul jami = non * 2 + choy; cout << jami << " " << (choy < non); }
11000.50 so'm 1
1-bo‘lim yakuni: A’zo yoki erkin funksiya?
operator= faqat a’zo bo‘ladi?operator+ bo‘lsa 2 + a nima uchun ishlamaydi?Arifmetik operatorlar
Avval += (a’zo), keyin + (erkin)
operator+= — a’zo
Vektor& operator+=(const Vektor &b) { x += b.x; y += b.y; return *this; }- Obyektni o‘zgartiradi
- Havola qaytaradi —
a += b += czanjiri
operator+ — erkin
friend Vektor operator+(Vektor a, const Vektor &b) { return a += b; }- a — nusxa (qiymat bo‘yicha)
- Yangi obyekt qaytaradi — operandlar o‘zgarmaydi
Vektor2D arifmetikasi
struct Vektor { double x, y; Vektor& operator+=(const Vektor &b) { x += b.x; y += b.y; return *this; } Vektor& operator*=(double k) { x *= k; y *= k; return *this; } Vektor operator-() const { return {-x, -y}; } friend Vektor operator+(Vektor a, const Vektor &b) { return a += b; } friend Vektor operator*(Vektor a, double k) { return a *= k; } friend Vektor operator*(double k, Vektor a) { return a *= k; } friend double operator*(const Vektor &a, const Vektor &b) { return a.x * b.x + a.y * b.y; } }; int main() { Vektor a{3, 4}, b{1, 2}; Vektor c = 2 * a + -b; cout << c.x << "," << c.y << " " << a * b; }
5,6 11
Fibonachchini log(n) qadamda
struct M { long long a, b, c, d; friend M operator*(const M &x, const M &y) { return {x.a * y.a + x.b * y.c, x.a * y.b + x.b * y.d, x.c * y.a + x.d * y.c, x.c * y.b + x.d * y.d}; } }; long long fib(int n) { M r{1, 0, 0, 1}, m{1, 1, 1, 0}; while (n) { if (n & 1) r = r * m; m = m * m; n >>= 1; } return r.b; } int main() { cout << fib(10) << " " << fib(90); }
55 2880067194370816120
2-bo‘lim yakuni: Arifmetik operatorlar
1-topshiriq: Kasr: arifmetik operatorlar
Kasr sinfi uchun +, -, *, / operatorlarini va << ni qayta yuklang. Kasr har doim qisqartirilgan, maxraj musbat; maxraj 1 bo‘lsa faqat surat chiqadi. Nolga bo‘lishda (/ va ikkinchi kasr 0) XATO chiqaring.
Kirish: Birinchi qatorda q (1 ≤ q ≤ 100), keyin q qatorda a/b op c/d (b, d ≠ 0, |son| ≤ 10⁴).
Chiqish: Har bir amal natijasi.
3 1/2 + 1/3 3/4 * 2/3 1/2 / 0/5
5/6 1/2 XATO
Taqqoslash operatorlari
Oltita operator — ikkita asos
| Operator | Ifoda |
|---|---|
a != b | !(a == b) |
a > b | b < a |
a <= b | !(b < a) |
a >= b | !(a < b) |
std::sort, std::map, std::set, std::max aynan shundan foydalanadi.operator< bilan saralash
struct Sana { int k, o, y; friend bool operator<(const Sana &a, const Sana &b) { if (a.y != b.y) return a.y < b.y; if (a.o != b.o) return a.o < b.o; return a.k < b.k; } }; int main() { vector<Sana> v = {{20, 1, 2026}, {8, 1, 2026}, {3, 2, 2026}, {27, 12, 2025}}; sort(v.begin(), v.end()); for (auto &s : v) cout << s.k << "." << s.o << " "; cout << (max(v[0], v[1]) < v[2]); }
27.12 8.1 20.1 3.2 1
“Kosmik kema” operatori <=>
#include <iostream> #include <vector> #include <algorithm> #include <compare> using namespace std; struct Talaba { int kurs; double ball; string ism; auto operator<=>(const Talaba &) const = default; }; int main() { vector<Talaba> t = {{2, 88.5, "Bekzod"}, {1, 91, "Aziza"}, {2, 88.5, "Anvar"}}; sort(t.begin(), t.end()); for (auto &x : t) cout << x.ism << " "; cout << (t[0] < t[1]) << (t[1] == t[2]); return 0; }
Aziza Anvar Bekzod 10
3-bo‘lim yakuni: Taqqoslash operatorlari
<=> = default nima beradi?a <= b ni faqat < orqali qanday yozasiz?2-topshiriq: Sanalarni taqqoslash
Sana sinfi uchun < va == operatorlarini qayta yuklang (yoki C++20 <=>). main() sanalarni sort bilan saralaydi va takrorlanmaydigan sanalar sonini topadi — bu faqat sizning operatorlaringiz orqali ishlaydi.
Kirish: Birinchi qatorda n (1 ≤ n ≤ 1000), keyin n ta sana dd.mm.yyyy ko‘rinishida.
Chiqish: Saralangan sanalar (har biri alohida qatorda, dd.mm.yyyy), oxirida Turli: k.
4 15.03.2025 01.12.2024 15.03.2025 31.01.2025
01.12.2024 31.01.2025 15.03.2025 15.03.2025 Turli: 3
Oqim operatorlari
Sinfingiz cout, cin, fayl va stringstream bilan
cout << a << b zanjirini ta’minlaydi.Zanjir
cout << a << b ≡ operator<<(operator<<(cout, a), b)Chiqarish
friend ostream& operator<<(ostream &o, const T &x)O‘qish
friend istream& operator>>(istream &in, T &x) — noto‘g‘ri bo‘lsa in.setstate(ios::failbit)while (cin >> v) va if (cin >> v) standart turlar kabi to‘g‘ri ishlaydi.Tekshiruvchi operator>>
struct Vaqt { int s = 0, d = 0; friend istream& operator>>(istream &in, Vaqt &v) { int s, d; char c; if (in >> s >> c >> d) { if (c == ':' && s >= 0 && s < 24 && d >= 0 && d < 60) v = {s, d}; else in.setstate(ios::failbit); } return in; } }; int main() { for (string q : {"12:30", "25:00", "12-30", "7 : 05"}) { istringstream ss(q); Vaqt v; if (ss >> v) cout << v.s * 60 + v.d << " "; else cout << "xato "; } }
750 xato xato 425
Istalgan vector va pair uchun
template <typename A, typename B> ostream& operator<<(ostream &o, const pair<A, B> &p) { return o << "(" << p.first << ", " << p.second << ")"; } template <typename T> ostream& operator<<(ostream &o, const vector<T> &v) { o << "["; for (size_t i = 0; i < v.size(); i++) o << (i ? ", " : "") << v[i]; return o << "]"; } int main() { vector<pair<string, int>> v = {{"Aziza", 91}, {"Bekzod", 78}}; vector<vector<int>> m = {{1, 2}, {3}}; cout << v << endl << m; }
[(Aziza, 91), (Bekzod, 78)] [[1, 2], [3]]
4-bo‘lim yakuni: Oqim operatorlari
ostream& qaytaradi?3-topshiriq: Oqim operatorlari: Nuqta
Nuqta uchun >> va << operatorlarini erkin funksiya sifatida yozing. >> nuqtani (x, y) ko‘rinishida o‘qisin, << ham shunday chiqarsin. main() koordinata boshidan eng uzoq nuqtani (teng bo‘lsa — birinchisini) va barcha nuqtalar yig‘indisini chiqaradi.
Kirish: Birinchi qatorda n (1 ≤ n ≤ 1000), keyin n ta nuqta (x, y) ko‘rinishida (butun sonlar, |son| ≤ 10⁶).
Chiqish: Ikki qator: eng uzoq nuqta va yig‘indi nuqta — ikkalasi (x, y) ko‘rinishida.
3 (1, 2) (-3, 4) (0, 0)
(-3, 4) (-2, 6)
Maxsus operatorlar
Konteyner va ko‘rsatkichga o‘xshash sinflar
| Operator | Imzo | Qo‘llanishi |
|---|---|---|
[] | T& operator[](size_t) + const T& ... const | a[i] = 5; va const obyektdan o‘qish |
() | R operator()(args...) | Funktor, m(i, j) — istalgan sondagi parametr |
->, * | T* operator->(), T& operator*() | Aqlli ko‘rsatkichlar, iteratorlar |
bool | explicit operator bool() const | if (obj) — “yaroqlimi?” |
int n = obj;, obj + 1 kabi ma’nosiz ifodalar ham kompilyatsiya bo‘ladi (bool → int).[] ikki versiya va explicit bool
class XMassiv { vector<int> d; public: XMassiv(initializer_list<int> q) : d(q) {} int& operator[](size_t i) { if (i >= d.size()) throw out_of_range("indeks"); return d[i]; } const int& operator[](size_t i) const { return d.at(i); } explicit operator bool() const { return !d.empty(); } }; int main() { XMassiv a{10, 20, 30}; a[1] = 99; const XMassiv &c = a; cout << c[1] << " " << (a ? "bor" : "yo'q") << " "; try { a[5] = 1; } catch (const out_of_range &) { cout << "chegara!"; } }
99 bor chegara!
a[1] = 99 yozish mumkinc[1] = 5 — XATOif (a) / a ? ... ishlaydi, int n = a; — yo‘qO‘z aqlli ko‘rsatkichimiz
struct Talaba { string ism; int ball; }; template <typename T> class Egasi { T *p; public: explicit Egasi(T *q) : p(q) {} ~Egasi() { delete p; cout << " [o'chirildi]"; } Egasi(const Egasi &) = delete; T* operator->() const { return p; } T& operator*() const { return *p; } }; int main() { Egasi<Talaba> t(new Talaba{"Aziza", 90}); t->ball += 5; cout << (*t).ism << ": " << t->ball; }
Aziza: 95 [o'chirildi]
5-bo‘lim yakuni: Maxsus operatorlar
4-topshiriq: Ko‘phad: [] va ()
Kophad sinfi koeffitsiyentlarni saqlaydi. operator[] i-darajali koeffitsiyentga murojaat qilsin (o‘zgartirish ham mumkin), operator() esa ko‘phadning x nuqtadagi qiymatini Gorner sxemasi bilan hisoblasin.
Kirish: Birinchi qatorda daraja n (0 ≤ n ≤ 20) va n + 1 ta koeffitsiyent (a0 a1 … an). Keyin q va q ta buyruq: ? x — qiymatni hisoblash, = i c — i-koeffitsiyentni c ga o‘zgartirish. Natijalar long long ga sig‘adi.
Chiqish: Har bir ? uchun ko‘phad qiymati.
2 1 0 1 3 ? 2 = 0 -4 ? 2
5 0
Loyiha: KattaSon
Raqamlarni massivda saqlaymiz
Muammo
Saqlash
vector<int> r — raqamlar teskari: r[0] — birlarQo‘shish
Ko‘paytirish
c[i + j] += a[i] * b[j]Operatorlar
a + b, a * b, cout << a — int kabiKattaSon::operator+=
class KattaSon { vector<int> r; public: explicit KattaSon(const string &s) { for (int i = s.size() - 1; i >= 0; i--) r.push_back(s[i] - '0'); } KattaSon& operator+=(const KattaSon &b) { int elt = 0; for (size_t i = 0; i < max(r.size(), b.r.size()) || elt; i++) { if (i == r.size()) r.push_back(0); int s = r[i] + elt + (i < b.r.size() ? b.r[i] : 0); r[i] = s % 10; elt = s / 10; } return *this; } friend KattaSon operator+(KattaSon a, const KattaSon &b) { return a += b; } friend ostream& operator<<(ostream &o, const KattaSon &k) { for (int i = k.r.size() - 1; i >= 0; i--) o << k.r[i]; return o; } }; int main() { KattaSon a("98765432109876543210"), b("12345678901234567890"); cout << a + b; }
111111111011111111100
30! — 33 xonali son
struct KS { vector<int> r{1}; KS& operator*=(int k) { int elt = 0; for (size_t i = 0; i < r.size() || elt; i++) { if (i == r.size()) r.push_back(0); long long s = (long long)r[i] * k + elt; r[i] = s % 10; elt = s / 10; } return *this; } friend ostream& operator<<(ostream &o, const KS &k) { for (int i = k.r.size() - 1; i >= 0; i--) o << k.r[i]; return o; } }; int main() { KS f; for (int i = 2; i <= 30; i++) f *= i; cout << f; }
265252859812191058636308480000000
6-bo‘lim yakuni: Loyiha: KattaSon
Asosiy xulosalar
1A’zo yoki erkin
= [] () -> — a’zo; << >> va simmetrik — erkin (friend).2+= orqali +
+= havola qaytaradi, + — nusxa + += va yangi obyekt.3Taqqoslash
== va < yetarli; C++20 <=> = default — hammasi.4Oqimlar
ostream&/istream& qaytaradi; xato — setstate(failbit).5Maxsus
[] — ikki versiya; explicit operator bool; ->/* — aqlli ko‘rsatkich.6Oltin qoida
Yakunlashdan oldin sakkizta savol
cout << a uchun operator qanday e’lon qilinadi?a > b ni < orqali?<=> = default qaysi tartibda taqqoslaydi?14-laboratoriya ishi: 6 ta dasturlash topshirig‘i
Matritsa operatorlari
Vaqt: ++ va -
Funktor: filtr
KattaSon: qo‘shish va taqqoslash
KattaSon: ko‘paytirish va faktorial
Versiyalar: <=> operatori
Darsni tark etishdan oldin
Javoblaringizni yozing (✎ Javob yozish) yoki qog‘ozga yozib topshiring.
Kasr uchun qaysi operatorlarni a’zo, qaysilarini erkin qilasiz?