C++ 树层级存储

2013-03-09

用了一个map来记录所有的层级关系,然后从root找起,依次找出所有的节点…

// 用的是tinyXML读取
 
BOOL CXmlRead::ReadGroupInfo( std::map<CString, std::vector<std::pair<CString, BOOL>>> &mapGroup )
{
    // 载入文件
    TiXmlDocument *doc = new TiXmlDocument(PATH);
    if (!doc->LoadFile())
    {
        delete doc;
        return FALSE;
    }
 
    // 获取根节点
    TiXmlElement *pRoot = doc->FirstChildElement(_T("TableGroup"));
    ASSERT(pRoot);
    if (pRoot == NULL)
    {
        delete doc;
        return FALSE;
    }
 
    mapGroup.clear();
 
    std::vector<std::pair<CString, BOOL>> vecTable;
    TiXmlElement *pNode = dynamic_cast<TiXmlElement *>(pRoot->FirstChildElement());
    while (pNode != NULL)
    {
        // 节点属性
        CString strSubName = pNode->Attribute(_T("Name"));
        vecTable.push_back(std::make_pair(strSubName, TRUE));
        ASSERT(_T("Group") == (CString)(pNode->Value()));
 
        if(!ReadNode(pNode, mapGroup))
        {
            return FALSE;
        }
 
        // 下一关键字节点
        pNode = dynamic_cast<TiXmlElement *>(pNode->NextSiblingElement());
    }
    mapGroup[_T("ROOT")] = vecTable;
 
    delete doc;
    return TRUE;
}
 
BOOL CXmlRead::ReadNode(TiXmlElement *pNode, std::map<CString, std::vector<std::pair<CString, BOOL>>> &mapGroup)
{
    // 每次添加的新节点应该是之前没有出现过的,否则会死循环
    CString strNodeName = pNode->Attribute(_T("Name"));
    if(mapGroup.end() != mapGroup.find(strNodeName)) return FALSE;
 
    std::vector<std::pair<CString, BOOL>> vecTable;
    TiXmlElement *pSubNode = dynamic_cast<TiXmlElement *>(pNode->FirstChildElement());
    while (pSubNode != NULL)
    {
        // 节点名
        CString strSub = pSubNode->Value();
        // 节点属性
        CString strSubName = pSubNode->Attribute(_T("Name"));
 
        if(_T("Group") == strSub)
        {
            vecTable.push_back(std::make_pair(strSubName, TRUE));
            if(!ReadNode(pSubNode, mapGroup))
            {
                return FALSE;
            }
        }
        else if(_T("Table") == strSub)
        {
            vecTable.push_back(std::make_pair(strSubName, FALSE));            
        }
 
        // 下一关键字节点
        pSubNode = dynamic_cast<TiXmlElement *>(pSubNode->NextSiblingElement());
    }
 
    mapGroup[strNodeName] = vecTable;
    return TRUE;
}

其实vector里面的bool是可以不要的,最初加这个只是为了区分树节点和叶节点…

阅读全文

C++ 获取某目录下的全部文件

Peach

2013-03-08

特别需要注意的是,每个文件夹下有.和..两个文件夹分别代表当前目录和上级目录(根目录的..代表当前目录)…IsDot就是用来检测当前是不是.或..的函数

阅读全文

C++ base64编解码

Peach

2013-03-07

static std::string base64_chars = 
	&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZ&quot;
	&quot;abcdefghijklmnopqrstuvwxyz&quot;
	&quot;0123456789+/&quot;;
 
 
static bool is_base64(unsigned char c) {
	return (isalnum(c) || (c == '+') || (c == '/'));
}
 
std::string base64_encode(const unsigned char* bytes_to_encode,unsigned int in_len);
int base64_decode(std::string const&amp; encoded_string,unsigned char* pObject);
 
std::string base64_encode(const unsigned char* bytes_to_encode,unsigned int in_len)
{
	std::string ret;
	int i = 0;
	int j = 0;
	unsigned char char_array_3[3];
	unsigned char char_array_4[4];
 
	while (in_len--) {
		char_array_3[i++] = *(bytes_to_encode++);
		if (i == 3) {
			char_array_4[0] = (char_array_3[0] &amp; 0xfc) &gt;&gt; 2;
			char_array_4[1] = ((char_array_3[0] &amp; 0x03) &lt;&lt; 4) + ((char_array_3[1] &amp; 0xf0) &gt;&gt; 4);
			char_array_4[2] = ((char_array_3[1] &amp; 0x0f) &lt;&lt; 2) + ((char_array_3[2] &amp; 0xc0) &gt;&gt; 6);
			char_array_4[3] = char_array_3[2] &amp; 0x3f;
 
			for(i = 0; (i &lt;4) ; i++)
				ret += base64_chars[char_array_4[i]];
			i = 0;
		}
	}
 
	if (i)
	{
		for(j = i; j &lt; 3; j++)
			char_array_3[j] = '\0';
 
		char_array_4[0] = (char_array_3[0] &amp; 0xfc) &gt;&gt; 2;
		char_array_4[1] = ((char_array_3[0] &amp; 0x03) &lt;&lt; 4) + ((char_array_3[1] &amp; 0xf0) &gt;&gt; 4);
		char_array_4[2] = ((char_array_3[1] &amp; 0x0f) &lt;&lt; 2) + ((char_array_3[2] &amp; 0xc0) &gt;&gt; 6);
		char_array_4[3] = char_array_3[2] &amp; 0x3f;
 
		for (j = 0; (j &lt; i + 1); j++)
			ret += base64_chars[char_array_4[j]];
 
		while((i++ &lt; 3))
			ret += '=';
 
	}
 
	return ret;
 
}
 
int base64_decode(std::string const&amp; encoded_string,unsigned char* pObject)
{
	int in_len = encoded_string.size();
	int i = 0;
	int j = 0;
	int in_ = 0;
	int iNum = 0;
	unsigned char char_array_4[4], char_array_3[3];
	std::string ret;
 
	while (in_len-- &amp;&amp; ( encoded_string[in_] != '=') &amp;&amp; is_base64(encoded_string[in_])) {
		char_array_4[i++] = encoded_string[in_]; in_++;
		if (i ==4) {
			for (i = 0; i &lt;4; i++)
				char_array_4[i] = base64_chars.find(char_array_4[i]);
 
			char_array_3[0] = (char_array_4[0] &lt;&lt; 2) + ((char_array_4[1] &amp; 0x30) &gt;&gt; 4);
			char_array_3[1] = ((char_array_4[1] &amp; 0xf) &lt;&lt; 4) + ((char_array_4[2] &amp; 0x3c) &gt;&gt; 2);
			char_array_3[2] = ((char_array_4[2] &amp; 0x3) &lt;&lt; 6) + char_array_4[3];
 
			for (i = 0; (i &lt; 3); i++)
			{
				ret += char_array_3[i];
				iNum++;
			}
			i = 0;
		}
	}
 
	if (i) {
		for (j = i; j &lt;4; j++)
			char_array_4[j] = 0;
 
		for (j = 0; j &lt;4; j++)
			char_array_4[j] = base64_chars.find(char_array_4[j]);
 
		char_array_3[0] = (char_array_4[0] &lt;&lt; 2) + ((char_array_4[1] &amp; 0x30) &gt;&gt; 4);
		char_array_3[1] = ((char_array_4[1] &amp; 0xf) &lt;&lt; 4) + ((char_array_4[2] &amp; 0x3c) &gt;&gt; 2);
		char_array_3[2] = ((char_array_4[2] &amp; 0x3) &lt;&lt; 6) + char_array_4[3];
 
		for (j = 0; (j &lt; i - 1); j++)
		{
			ret += char_array_3[j];
			iNum++;
		}
	}
 
	memcpy(pObject,ret.c_str(),iNum);
	return iNum;
}

阅读全文