海边的八达通

Some basic operations for set.#include#includeusing namespace std;int main(){ int a[] = {5, 3, 9, 3, 7, 2, 9, 3}; set s(a, a+sizeof(a)/sizeof(int)); set::iterator itr = s.begin();

Simple example#include #include #include #include using namespace std;int main(){ vector v({1,2,3,4,5,4,3,2,1}); cout << "Original Vector: " << endl; auto itr = v.begin(); whi

Use student class. #ifndef STUDENT_HPP_INCLUDED#define STUDENT_HPP_INCLUDEDusing namespace std;class student{private: int NO; int Grade; string Name;public: student():NO(0),G

Simple example for defining users' own exception. The key point is to implement pure virtual function what().#include #include using namespace std;class myexception : public exception {publi

Use stringstream#include #include #include #include using namespace std;templatevoid printInfo(T& s){ for(auto itr=s.begin(); itr!=s.end(); ++itr){ cout << *itr << ' '; }

Some basic operation for stl list.#include#includeusing namespace std;template void print(T& l){ typedef typename T::iterator Titerator; Titerator itr = l.begin(); while(itr!=l.end()

A lambda is an ad-hoc, locally-scoped function. Basically, lambdas are syntactic sugar, designed to reduce a lot of the work required in creating ad-hoc functor classes,The brackets ([]) mark th

If we use containers, such as vector, the two for swap do not need to be of same length,#include#include#include #includeusing namespace std;int main(){ vectorv1{10,20,30}; vectorv2{1

Use student class, for each student, add extra 5 points to its grade.#ifndef STUDENT_HPP_INCLUDED#define STUDENT_HPP_INCLUDEDusing namespace std;class student{private: int NO; int Grad

(1) class hierarchy(2) polymorphism， pointer of base class(3) function object#include #include #include using namespace std;class Shape{public: virtual void Draw() = 0; virtua

use student class, remove students from collection, if his grade is less than 80.student class#ifndef STUDENT_HPP_INCLUDED#define STUDENT_HPP_INCLUDEDusing namespace std;class student{private:

Examples. Still use student class.#ifndef STUDENT_HPP_INCLUDED#define STUDENT_HPP_INCLUDEDusing namespace std;class student{private: int NO; int Grade; string Name;public: st

Basic operations for queue and stack. #include#include#include#include#include#includeusing namespace std;template void printStack(stack s){ while(!s.empty()){ cout << s.top(

Use adaptor design pattern and deque in stl library, get a first-in-first-out queue.#include#includeusing namespace std;template class MyQueue{private: deque d;public: MyQueue(){};

Some basic operations for map in stl.#include#includeusing namespace std;int main(){ map mymap; pair s1(1, "Tim"); pair s2(2, "Sam"); pair s3(6, "David"); pair s4(5, "James")

Following examples of book .#include#include#include#includeusing namespace std;int main(){ shared_ptr pNico(new string("nico")); shared_ptr pJutta(new string("jutta")); (*pNico)[0]

Some example for stl vector.#include#include#includeusing namespace std;class Student{public: string strNO; string strName; string strSex; string strDate; Student(string

Function Objects in STL.

Example#include #include #include #include using namespace std;class summaryInfo{public: summaryInfo():nsum(0),ncount(0){} int getSum(){ return nsum; } int getMin(){ return nmin;

Simple example#include #include #include #include using namespace std;int main(){ vector v({1,2,2,2,3,4,4,5,6,7,1,2,2,3}); auto itr = v.begin(); cout << "Original vector: " << end

One simple example.#include #include #include #include using namespace std;int main(){ vector v({2, 0, 4, 6, 0, 3, 1, -7}); int num = count(v.begin(), v.end(), 0); cout << "The nu

Protype of function is template ForwardIterator adjacent_find( ForwardIterator _First, ForwardIterator _Last );template ForwardIterator adjacent_find( ForwardIterat