杨小卫的专栏

//多叉树递归遍历//假设树节点定义为:struct Node{ Node *pPNode; list<Node *> childs;};//前序遍历(正序遍历):void EnumNode(Node *pNode){ do_something(pNode); list<Node *>::iterator iter; //正向遍...

<br />#include "stdafx.h"#include <string.h>#include <stdlib.h>#include <stdio.h>typedef unsigned __int64 UINT64;#define NULL 0// The standard SHA1 needs the input string to fit into a block// This function align the input string to meet

#ifndef _HANDLE_MGR_H_#define _HANDLE_MGR_H_#undef MALLOC#undef FREE#define MALLOC(x) HeapAlloc(GetProcessHeap(), 0, (x))#define FREE(x) HeapFree(GetProcessHeap(), 0, (x))#define T

enum { kHashBits = 8, kHashCount = 1 << kHashBits, //Hash表大小(1<<8=256)，值越大缓存检索越快};struct data_t{ unsigned int id; //必须是唯一值，ID不能为0 char * data_ptr;};static data_t...