- C-a == Ctrl-a
- M-a == Alt-a
:q close
:w write/saves
:wa[!] write/save all windows [force]
:wq write/save and close
{ | |
"workbench.colorTheme": "Ayu Dark", | |
"workbench.colorCustomizations": { | |
"activityBar.foreground": "#fdfdfd", | |
"activityBar.background": "#000000", | |
"editor.background": "#000000", | |
"sideBar.background": "#000000", | |
"minimap.background": "#000000", | |
"statusBar.foreground": "#ffffff" | |
}, |
// g++ async_wait_demo.cpp -o out -lboost_system -lpthread -lboost_thread | |
#include <iostream> | |
#include <boost/asio.hpp> | |
#include <boost/date_time/posix_time/posix_time.hpp> | |
using namespace std; | |
void work_for_io_service_5( const boost::system::error_code& e) | |
{ |
#include <vector> | |
void * mem_pool_ptr; | |
template<typename type> | |
struct MyAlloc : allocator<type> | |
{ | |
type* allocate(size_t size) | |
{ | |
cout << "Allocate function called with size " << size << endl; |
#include <iostream> | |
#include <queue> | |
#include <vector> | |
#include <functional> | |
#include <algorithm> | |
using namespace std; | |
class Compare { | |
public: |
/* | |
* std::unordered_set unlike a std::set is implementation of chaining hash table. | |
* Therefore, it requires additional implementation to get it to work. | |
* This demo tries to show the requirements for such an implementation. | |
*/ | |
#include <iostream> | |
#include <algorithm> | |
#include <unordered_set> | |
#include <functional> |