LV11 템플릿(template), 연산자 오버로딩

// variable template template <typename T> constexpr T pi = T(3.1415926535897932385L); int main() { float f = pi<float>; double d = pi<double>; int i = pi<int>; return 0; }

//int Add(int a, int b) //{ // return a + b; //} // //float Add(float a, float b) //{ // return a + b; //} template <typename T> T Add(T a, T b) { return a + b; } int main() { srand(time(NULL)); int a = Add<int>(1, 2); float b = Add<float>(1.0f, 2.0f); return 0; }

template <typename T> void Swap(T& a, T& b); int main(void) { int c = 2, d = 3; cout << "c : " << c << ", d : " << d << endl; Swap(c, d); cout << "c : " << c << ", d : " << d << endl; string e = "hong", f = "kim"; cout << "e : " << e << ", f : " << f << endl; Swap(e, f); cout << "e : " << e << ", f : " << f << endl; return 0; } template <typename T> void Swap(T& a, T& b) { T temp; temp = a; a = b; b = temp; }

template <typename T> void Swap(T& a, T& b); template <typename T> void Swap(T& a, T& b);

template <typename 타입이름> class 클래스템플릿이름 { // 클래스 멤버의 선언 }

template <typename T> class Data { private: T data_; public: Data(T dt); data(T dt); T get_data(); };

#include <iostream> #include <list> namespace ya { template <typename T> class list { public: struct Node { T data; Node* back; }; list() // 생성자 : 객체가 생성될떄 (메모리에 할당될때) 자동으로 호출되는 함수 { mHead = nullptr; mTail = nullptr; } ~list() // 소멸자 : 객체가 사라질때 (메모리에 해제될때) 자동으로 호출되는 함수 { } void push_back(T data) { if (mHead == nullptr) { mHead = new Node(); mHead->data = data; mHead->back = nullptr; mTail = mHead; } else { mTail->back = new Node(); mTail->back->data = data; mTail->back->back = nullptr; mTail = mTail->back; } } private: Node* mHead; Node* mTail; }; } int main() { std::list<int> stlList; stlList.push_back(10); stlList.push_back(20); stlList.push_front(-10); ya::list<int> yaList; yaList.push_back(1); yaList.push_back(2); yaList.push_back(3); return 0; }

Point pt; pt.operator+( 3 ); // Call addition operator to add 3 to pt.

// operator_overloading.cpp // compile with: /EHsc #include <iostream>using namespace std; struct Complex { Complex( double r, double i ) : re(r), im(i) {} Complex operator+( Complex &other ); void Display( ) { cout << re << ", " << im << endl; } private: double re, im; }; // Operator overloaded using a member function Complex Complex::operator+( Complex &other ) { return Complex( re + other.re, im + other.im ); } int main() { Complex a = Complex( 1.2, 3.4 ); Complex b = Complex( 5.6, 7.8 ); Complex c = Complex( 0.0, 0.0 ); c = a + b; c.Display(); }

6.8, 11.2

#include <iostream> #include <list> // 수학에서의 벡터 // 크기와 방향을 가진 화살표(점) struct Point { int x; int y; Point operator+(Point other) { Point ret; ret.x = x + other.x; ret.y = y + other.y; return ret; } Point operator-(Point other) { Point ret; ret.x = x - other.x; ret.y = y - other.y; return ret; } Point operator-(int value) { Point ret; ret.x = x - value; ret.y = y - value; return ret; } bool operator<(Point other) { return (x < other.x && y < other.y); } }; // 연산자 오버로딩 int main() { Point p1; p1.x = 1; p1.y = 1; Point p2; p2.x = 3; p2.y = 2; Point p3; p3.x = p1.x + p2.x; p3.y = p1.y + p2.y; p3 = p1 + p2; //p1.operator+(p2); p3 = p1 - p2; //p1.operator+(p2); if (p1 < p2) { int a = 0; } std::string test = "test"; test += " success"; //p1.operator+(p2); return 0; }