#include <iostream> class c1{ public: virtual void vfunc(){ std::cout << "Calling c1\n";} }; class c2: public c1{ public: virtual void vfunc(){ std::cout << "Calling c2\n";} }; int main() { class c1 *c; class c1 c1_obj; class c2 c2_obj; c = &c1_obj; c->vfunc(); c = &c2_obj; c->vfunc(); return 0; }
template<class T> // template<typename T> //class or typename T min (T x, T y) { return (x < y) ? x : y; }
#define min(x, y) (((x) < (y)) ? (x) : (y))
//--------------------------------------------------------------------------
// In Tui.hpp file
//--------------------------------------------------------------------------
class CTui
{
// 沒有public的部分即為private members
public:
CTui(); //Constructor
~CTui(); // De-Constructor
void print(char *p);
};
//--------------------------------------------------------------------------
// In Tui.cpp file
//--------------------------------------------------------------------------
#include "Tui.hpp"
//
//class members of CTui
//
CTui::CTui()
{
// new 記憶體, initial 參數...
}
CTui::~CTui()
{
// delete 記憶體
}
void CTui::print(char *p)
{
}
|
#include <stdio.h> class cTest { public: static int Num; static void Func() { //static function 只能呼叫static variable & static function, 不可呼叫物件相關的function 和 variable member printf("%d", Num); } }; int cTest::Num = 9; // static variable的初始值必須寫在global area. int main() { cTest::Num = 10; cTest::Func(); return 0; }
#include <stdio.h> typedef unsigned int DWORD; #define SET_MEM_32( addr, val) \ ( *(DWORD* )(addr) = (val) ) #define GET_MEM_32( addr) (*(DWORD* )(addr)) #define MODIFY_MEM_32( addr, mask, val) \ ( *(DWORD* )(addr) = GET_MEM_32(addr) & ~(mask) | (val) & (mask) ) int main() { unsigned char arr[10]={0,1,2,3,4,5,6,7,8,9}; SET_MEM_32(arr, 0x22334455); printf("%x\n",GET_MEM_32(arr)); MODIFY_MEM_32(arr, 0xff0000, 0x770000); printf("%x\n",GET_MEM_32(arr)); return 0; }
 |
| https://en.wikipedia.org/wiki/OSI_model |
public class Father { public Father() { Console.WriteLine("Father Constructor!"); } public virtual void WifeAge() { Console.WriteLine("Age is 50, father's wife!"); } public void FamilyName() { Console.WriteLine("Family name: Lee"); } ~Father() { Console.WriteLine("Father De-Constructor!"); } } public class Son : Father { public Son() { Console.WriteLine("Son Constructor!"); } public virtual void WifeAge() { Console.WriteLine("Age is 30, son's wife!"); } ~Son() { Console.WriteLine("Son De-Constructor!"); } } public class Program { public static void Main(string[] args) { Father obj = new Father(); obj.WifeAge(); Son obj2 = new Son(); obj2.WifeAge(); obj.FamilyName(); obj2.FamilyName(); } }_/_/_/_/_/_/ _/ OUTPUT _/_/_/_/_/_/_/_/
Father Constructor! Age is 50, father's wife! Father Constructor! Son Constructor! Age is 30, son's wife! Family name: Lee Family name: Lee Son De-Constructor! Father De-Constructor! Father De-Constructor!
// stack.cpp #include <iostream> #include <stack> #include <string> int main() { std::stack<int> ss; std::cout<<"size="<<ss.size()<<std::endl; for (int i=0; i<20; i++) ss.push(i); std::cout<<"size="<<ss.size()<<std::endl; while (!ss.empty()){ std::cout << ' ' << ss.top(); ss.pop(); //pop() has no return value, use top() to check value } std::cout<<std::endl; return 0; }
#include <iostream> #include <string> #include <map> using namespace std; int find_and_erase(map<string, string> &mm, string ss) { map<string, string>::iterator it; //find and erase the element if ( mm.end() != ( it = mm.find(ss)) ) { mm.erase(it); cout << ">Erase " << ss << endl; }else cout << ">Cannot find " << ss << endl; } int show_all(string ss, map<string, string> mm) { map<string, string>::iterator it; for(it = mm.begin(); it != mm.end(); it++) cout<<it->first<<" "<<it->second<<endl; cout << "****Finish job: "<< ss << endl; } int main() { map<string, string> mm; mm["John"] = "John_data"; mm["May"] = "May_data"; show_all("add John & May", mm); if ( false == mm.insert(pair<string, string>("Martin", "Martin_data")).second ) cout << "(insert failed)" << endl; show_all("insert Martin", mm); // Insert same key twice, should get failed return if ( false == mm.insert(pair<string, string>("Martin", "Martin_data")).second ) cout << "(insert failed)" << endl; show_all("insert Martin", mm); cout << "total size: " << mm.size() << endl; find_and_erase(mm, "John"); show_all("erase John", mm); // Reverse iterator for (map<string, string>::reverse_iterator itr = mm.rbegin(); itr != mm.rend(); itr++) cout<<itr->first<<" "<<itr->second<<endl; cout << "****Reverse Traversal" << endl; return 0; }
Output:
#include <stdio.h> #include <vector> #include <algorithm> //random_shuffle #include <time.h> int gen(int i) {return rand()%i; } int main() { srand(time(0)); std::vector<int> v; v.push_back(1); v.push_back(2); v.push_back(3); v.push_back(4); random_shuffle(v.begin(), v.end(), gen); for (unsigned int x=0; x<v.size(); x++) printf("%d\n", v[x]); return 0; }
#include <stdio.h> #include <vector> void print(char x, std::vector<int> &vec) // Call by Reference { printf("%c.", x); for (int i=0; i<vec.size(); i++) printf(" %d", vec[i]); puts(""); } int main() { std::vector<int> vec;// vector<int> vec(10, 0); //初始size為10個0 std::vector<int>::iterator end; vec.push_back(10); print('a', vec); vec.push_back(20); print('b', vec); vec.insert(vec.begin() + 1, 30); // 將30插入陣列中第1個位置 //vec.insert(vec.begin() + 1, 2, 30); // 將兩個30插入陣列中第1個位置 print('c', vec); //auto end=vec.end()-1; // -std=c++11 vec.erase(end=vec.end()-1); // 移除最後一個元素 print('d', vec); vec.pop_back(); // 移除最後一個元素 print('f', vec); return 0; }
#include<list> #include<iostream> #include<stdio.h> using namespace std; #define OFFSET_ITERATOR(iterator, offset) {\ iterator = obj1.begin(); \ for (int i=0; i<offset; i++) \ iterator++;\ } //將intertaor移動到offset的節點上 void show_list(); list<int> obj1;//建一個空的list對像 list<int>::iterator j; list<int>::iterator k; int main(void) { for(int i=0;i<10;i++) obj1.push_front(i); show_list(); // Remove first node (pop front) obj1.pop_front(); printf(">obj1.pop_front();\n"); show_list(); // Remove node OFFSET_ITERATOR(j, 4); obj1.erase(j); printf(">obj1.erase(4); //delete node: j-1, i.e. 4\n"); show_list(); // Insert node OFFSET_ITERATOR(j, 4); obj1.insert(j, 55); printf(">obj1.insert(4, 55);\n"); show_list(); // Remove node from j to k-1, where (j, k)=(2, 4) OFFSET_ITERATOR(j, 2); OFFSET_ITERATOR(k, 4); obj1.erase(j, k); printf(">obj1.erase(2, 3); //delete node: j~k-1, i.e. 2~3\n"); show_list(); system("pause"); return 0; } void show_list() { for (j=obj1.begin(); j!=obj1.end(); j++) cout<< *j <<" "; printf("\n"); }
string FileLocate = @"\\Address\Filename.exe"; if (File.Exists(FileLocate) == true) { var versionInfo = FileVersionInfo.GetVersionInfo(FileLocate); string version = versionInfo.ProductVersion; // "1.0.0" as default string MessageBoxTitle = "Version"; string MessageBoxContent = version.ToString() + "\n"; DialogResult dialogResult = MessageBox.Show(MessageBoxContent, MessageBoxTitle, MessageBoxButtons.OK); }
