C++ Learning resources

Basics
pinter to get member in class and struct
http://c.biancheng.net/cpp/biancheng/view/188.html
http://c.biancheng.net/cpp/biancheng/view/173.html


library classes


c++11
http://www.oschina.net/news/28928/9-reasons-to-start-using-c11
http://blog.csdn.net/m6830098/article/details/17253057

pair:
http://www.cnblogs.com/cszlg/archive/2013/03/10/2952807.html

set:
O(logn) to find
best to insert and delete element
find()，若找到，返回该键值迭代器的位置，否则，返回最后一个元素后面一个位置。
http://www.cnblogs.com/BeyondAnyTime/archive/2012/08/13/2636375.html
http://www.cnblogs.com/youxin/p/3414015.html
STL常用vector,map,set,sort用法

stack, queue, vector
C++ STL stack、queue和vector的使用

unordered container turorial

vector赋值
http://zhidao.baidu.com/link?url=2ytPLBMlhGcfz3jH7lJfNl92TwlWKif5To75ylE0Gq8OSLv9EW-oCtBsf-7oP1OtEjcpgEvy4QR_AtT-xj172q
http://zhidao.baidu.com/question/36348703.html?qbl=relate_question_0&word=vector%20%B8%B3%D6%B5


Container adaptor and underlying container:
stack, queue and priority_queue are implemented as container adaptors. Container adaptors are not full container classes, but classes that provide a specific interface relying on an object of one of the container classes (such as dequeor list) to handle the elements. The underlying container is encapsulated in such a way that its elements are accessed by the members of the container adaptor independently of the underlying container class used.
http://www.cplusplus.com/reference/stl/

priority_queue
http://www.cplusplus.com/reference/queue/priority_queue/

rewrite comp function of sort()
http://fusharblog.com/3-ways-to-define-comparison-functions-in-cpp/


memory management

difference between stack and heap
http://my.oschina.net/u/1167799/blog/160086
http://www.cnblogs.com/wengzilin/p/3922022.html
http://boyishachang.blog.51cto.com/3485129/1275724

difference between malloc/free and new/delete
http://blog.sciencenet.cn/blog-591030-595189.html



对象创建 JAVA C++ 比较
http://developer.51cto.com/art/201305/395862.htm