一步一步

BinarySortTreeADT.h/**二叉排序树(Binary Sort Tree)又称二叉查找(搜索)树(Binary Search Tree)。*其定义为：二叉排序树或者是空树，或者是满足如下性质的二叉树：*①若它的左子树非空，则左子树上所有结点的值均小于根结点的值；*②若它的右子树非空，则右子树上所有结点的值均大于根结点的值；*③左、右子树本身又各是一棵二叉排序

#ifndef _SMART_PTR_H#define _SMART_PTR_Htemplate class CSmartPtr{private: template class CSmartPtrRef { private: Y * m_pY; public: CSmartPtrRef(Y * p):m_pY(p){} Y *

//mymemory.h#pragma once#ifndef _MY_MEMORY_H#define _MY_MEMORY_H#include extern void* operator new(size_t size, const char* pszStr, int iLine) throw(std::bad_alloc);extern void operator de

#ifndef _CACHE_FILE_H_#define _CACHE_FILE_H_#pragma once#include #include using std::map;typedef struct tagStCacheData{ unsigned char* m_ucBuffer; int m_iBufSize; int m_iCurPos;}

Google C++ 风格指南 - 中文版

<br />// stringTest.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <Windows.h> #include <iostream> #include <strsafe.h> using namespace std; int _tmain(int argc, _TCHAR* argv[]) { char szBuffer[10] = {

<br />

安全从数字字符串到整数的转换： #include template bool safe_lexical_cast(const char* str, T& ret_val) { try { ret_val = boost::lexical_cast(str); return true; } catch (boost::bad_lexical_c

template class StaticSingletonT { public: static T* SafeInstance() { static T* s_instance_ptr = NULL; if (!s_instance_ptr) { if (atomic_compare_exchange(&s_state, OBJECT_