Qt——树的搜索实现源码
一、使用QTreeWidget
头文件：
/************************************************************************
树的搜索类（QTreeWidget版）
使用方法：
调用函数TreeSearch::SearchItem(para1, para2);
第一个参数是要搜索的树QTreeWidget或它的子类
第二个参数是搜索输入的关键字
************************************************************************/ #ifndef TREESEARCH_H
#define TREESEARCH_H #include <QTreeWidget>
#include <Windows.h> #define ITEM_SHOWN (Qt::UserRole + 17) class TreeSearch
{
public:
TreeSearch();
~TreeSearch();
static void SearchItem(QTreeWidget *, const QString &);//搜索函数 private:
static void FuzzySearch(QString &); //模糊搜索
static void FuzzySearchChildren(QTreeWidgetItem *, QString &); //模糊搜索子节点（递归）
static void PreciseSearch(const QString &); //精确搜索
static void PreciseSearchChildren(QTreeWidgetItem *, const QString &);//精确搜索子节点（递归）
static void ShowTotalItem(); //显示所有节点
static void ShowTotalChildrenItem(QTreeWidgetItem *); //显示所有子节点（递归）
static void ShowTotalParentItem(QTreeWidgetItem *); //设置所有父节点可显示（递归）
static void GetPinYin(const QString &, QString &strInitial, QString &strQuanPin); //将汉字转为拼音（首字母以及全拼）
static void GetWString(const std::string &, std::wstring &wStrOut);//将string转为wstring private:
static QTreeWidget *m_pCurTreeWidget; //当前的树
}; #endif // TREESEARCH_H
实现：
#include "TreeSearch.h" QTreeWidget *TreeSearch::m_pCurTreeWidget; TreeSearch::TreeSearch()
{ } TreeSearch::~TreeSearch()
{ } void TreeSearch::SearchItem(QTreeWidget *pTreeWidget, const QString &strKeyWord)
{
m_pCurTreeWidget = pTreeWidget;
if (m_pCurTreeWidget == NULL)
{
return;
}
QRegExp rx("([a-z]?[0-9]?)*");
QString strLower = strKeyWord.toLower().trimmed();
if (!strLower.isEmpty())
{
bool bIsPreciseSearch = true;
QRegExpValidator v(rx, 0);
int pos = 0;
if (v.validate(strLower, pos) == QValidator::Acceptable)
{
bIsPreciseSearch = false;
}
if (bIsPreciseSearch)
{
PreciseSearch(strLower);
}
else
{
FuzzySearch(strLower);
}
}
//搜索框为空，显示全部节点
else
{
ShowTotalItem();
}
} void TreeSearch::FuzzySearch(QString &strKeyWord)
{
//QString strInitialOfInput; //输入
int iRootCount = m_pCurTreeWidget->topLevelItemCount();
for (int i = 0; i < iRootCount; ++i)
{
QTreeWidgetItem *pCurRootItem = m_pCurTreeWidget->topLevelItem(i);
if (pCurRootItem == NULL)
{
continue;
}
pCurRootItem->setData(0, ITEM_SHOWN, false);
QString strCurRootItem = pCurRootItem->text(0);
QString strItemInitial; //当前节点文本的拼音首字母
QString strItemQuanPin; //当前节点文本的全拼
GetPinYin(strCurRootItem, strItemInitial, strItemQuanPin);
QString strStart = "^";
QRegExp rx(strStart.append(strItemQuanPin));
QRegExpValidator v(rx, 0);
int pos = 0;
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strItemInitial.contains(strKeyWord) || v.validate(strKeyWord, pos) != QValidator::Invalid)
{
pCurRootItem->setHidden(false);
ShowTotalChildrenItem(pCurRootItem);
continue;
}
//否则继续在其子节点中搜索
else
{
FuzzySearchChildren(pCurRootItem, strKeyWord);
}
}
} void TreeSearch::FuzzySearchChildren(QTreeWidgetItem *pParentItem, QString &strKeyWord)
{
int iRootCount = pParentItem->childCount();
for (int i = 0; i < iRootCount; ++i)
{
QTreeWidgetItem *pCurChildItem = pParentItem->child(i);
if (pCurChildItem == NULL)
{
continue;
}
pCurChildItem->setData(0, ITEM_SHOWN, false);
QString strCurChildItem = pCurChildItem->text(0);
QString strItemInitial; //当前节点文本的拼音首字母
QString strItemQuanPin; //当前节点文本的全拼
GetPinYin(strCurChildItem, strItemInitial, strItemQuanPin);
QString strStart = "^";
QRegExp rx(strStart.append(strItemQuanPin));
QRegExpValidator v(rx, 0);
int pos = 0;
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strItemInitial.contains(strKeyWord) || v.validate(strKeyWord, pos) != QValidator::Invalid)
{
pCurChildItem->setHidden(false);
ShowTotalParentItem(pCurChildItem);
ShowTotalChildrenItem(pCurChildItem);
continue;
}
//否则继续在其子节点中搜索
else
{
FuzzySearchChildren(pCurChildItem, strKeyWord);
}
} bool bHasChildren = pParentItem->data(0, ITEM_SHOWN).toBool();
pParentItem->setHidden(!bHasChildren);
} void TreeSearch::PreciseSearch(const QString &strKeyWord)
{
//QString strInitialOfInput; //输入
int iRootCount = m_pCurTreeWidget->topLevelItemCount();
for (int i = 0; i < iRootCount; ++i)
{
QTreeWidgetItem *pCurRootItem = m_pCurTreeWidget->topLevelItem(i);
if (pCurRootItem == NULL)
{
continue;
}
pCurRootItem->setData(0, ITEM_SHOWN, false);
QString strCurRootItem = pCurRootItem->text(0);
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strCurRootItem.contains(strKeyWord))
{
pCurRootItem->setHidden(false);
ShowTotalChildrenItem(pCurRootItem);
continue;
}
//否则继续在其子节点中搜索
else
{
PreciseSearchChildren(pCurRootItem, strKeyWord);
}
}
} void TreeSearch::PreciseSearchChildren(QTreeWidgetItem *pParentItem, const QString &strKeyWord)
{
int iRootCount = pParentItem->childCount();
for (int i = 0; i < iRootCount; ++i)
{
QTreeWidgetItem *pCurChildItem = pParentItem->child(i);
if (pCurChildItem == NULL)
{
continue;
}
pCurChildItem->setData(0, ITEM_SHOWN, false);
QString strCurChildItem = pCurChildItem->text(0);
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strCurChildItem.contains(strKeyWord))
{
pCurChildItem->setHidden(false);
ShowTotalParentItem(pCurChildItem);
ShowTotalChildrenItem(pCurChildItem);
continue;
}
//否则继续在其子节点中搜索
else
{
PreciseSearchChildren(pCurChildItem, strKeyWord);
}
} bool bHasChildren = pParentItem->data(0, ITEM_SHOWN).toBool();
pParentItem->setHidden(!bHasChildren);
} void TreeSearch::ShowTotalItem()
{
int iRootCount = m_pCurTreeWidget->topLevelItemCount();
for (int i = 0; i < iRootCount; ++i)
{
QTreeWidgetItem *pRootItem = m_pCurTreeWidget->topLevelItem(i);
if (pRootItem == NULL)
{
continue;
}
pRootItem->setHidden(false);
ShowTotalChildrenItem(pRootItem);
}
} void TreeSearch::ShowTotalChildrenItem(QTreeWidgetItem *pParentItem)
{
int iChildCount = pParentItem->childCount();
for (int i = 0; i < iChildCount; ++i)
{
QTreeWidgetItem *pChildItem = pParentItem->child(i);
if (pChildItem == NULL)
{
continue;
}
pChildItem->setHidden(false);
ShowTotalChildrenItem(pChildItem);
}
} void TreeSearch::ShowTotalParentItem(QTreeWidgetItem *pChildItem)
{
QTreeWidgetItem *pParentItem = pChildItem->parent();
if (pParentItem != NULL)
{
pParentItem->setData(0, ITEM_SHOWN, true);
ShowTotalParentItem(pParentItem);
}
} void TreeSearch::GetPinYin(const QString &strHanZi, QString &strInitial, QString &strQuanPin)
{
//保存拼音的ASCII值
const int pyAscii[] = { -20319, -20317, -20304, -20295, -20292, -20283, -20265, -20257, -20242, -20230, -20051, -20036, -20032, -20026,
-20002, -19990, -19986, -19982, -19976, -19805, -19784, -19775, -19774, -19763, -19756, -19751, -19746, -19741, -19739, -19728,
-19725, -19715, -19540, -19531, -19525, -19515, -19500, -19484, -19479, -19467, -19289, -19288, -19281, -19275, -19270, -19263,
-19261, -19249, -19243, -19242, -19238, -19235, -19227, -19224, -19218, -19212, -19038, -19023, -19018, -19006, -19003, -18996,
-18977, -18961, -18952, -18783, -18774, -18773, -18763, -18756, -18741, -18735, -18731, -18722, -18710, -18697, -18696, -18526,
-18518, -18501, -18490, -18478, -18463, -18448, -18447, -18446, -18239, -18237, -18231, -18220, -18211, -18201, -18184, -18183,
-18181, -18012, -17997, -17988, -17970, -17964, -17961, -17950, -17947, -17931, -17928, -17922, -17759, -17752, -17733, -17730,
-17721, -17703, -17701, -17697, -17692, -17683, -17676, -17496, -17487, -17482, -17468, -17454, -17433, -17427, -17417, -17202,
-17185, -16983, -16970, -16942, -16915, -16733, -16708, -16706, -16689, -16664, -16657, -16647, -16474, -16470, -16465, -16459,
-16452, -16448, -16433, -16429, -16427, -16423, -16419, -16412, -16407, -16403, -16401, -16393, -16220, -16216, -16212, -16205,
-16202, -16187, -16180, -16171, -16169, -16158, -16155, -15959, -15958, -15944, -15933, -15920, -15915, -15903, -15889, -15878,
-15707, -15701, -15681, -15667, -15661, -15659, -15652, -15640, -15631, -15625, -15454, -15448, -15436, -15435, -15419, -15416,
-15408, -15394, -15385, -15377, -15375, -15369, -15363, -15362, -15183, -15180, -15165, -15158, -15153, -15150, -15149, -15144,
-15143, -15141, -15140, -15139, -15128, -15121, -15119, -15117, -15110, -15109, -14941, -14937, -14933, -14930, -14929, -14928,
-14926, -14922, -14921, -14914, -14908, -14902, -14894, -14889, -14882, -14873, -14871, -14857, -14678, -14674, -14670, -14668,
-14663, -14654, -14645, -14630, -14594, -14429, -14407, -14399, -14384, -14379, -14368, -14355, -14353, -14345, -14170, -14159,
-14151, -14149, -14145, -14140, -14137, -14135, -14125, -14123, -14122, -14112, -14109, -14099, -14097, -14094, -14092, -14090,
-14087, -14083, -13917, -13914, -13910, -13907, -13906, -13905, -13896, -13894, -13878, -13870, -13859, -13847, -13831, -13658,
-13611, -13601, -13406, -13404, -13400, -13398, -13395, -13391, -13387, -13383, -13367, -13359, -13356, -13343, -13340, -13329,
-13326, -13318, -13147, -13138, -13120, -13107, -13096, -13095, -13091, -13076, -13068, -13063, -13060, -12888, -12875, -12871,
-12860, -12858, -12852, -12849, -12838, -12831, -12829, -12812, -12802, -12607, -12597, -12594, -12585, -12556, -12359, -12346,
-12320, -12300, -12120, -12099, -12089, -12074, -12067, -12058, -12039, -11867, -11861, -11847, -11831, -11798, -11781, -11604,
-11589, -11536, -11358, -11340, -11339, -11324, -11303, -11097, -11077, -11067, -11055, -11052, -11045, -11041, -11038, -11024,
-11020, -11019, -11018, -11014, -10838, -10832, -10815, -10800, -10790, -10780, -10764, -10587, -10544, -10533, -10519, -10331,
-10329, -10328, -10322, -10315, -10309, -10307, -10296, -10281, -10274, -10270, -10262, -10260, -10256, -10254 }; //保存拼音的音节
const char pyStr[396][7] = { "a", "ai", "an", "ang", "ao", "ba", "bai", "ban", "bang", "bao", "bei", "ben", "beng", "bi", "bian", "biao",
"bie", "bin", "bing", "bo", "bu", "ca", "cai", "can", "cang", "cao", "ce", "ceng", "cha", "chai", "chan", "chang", "chao", "che", "chen",
"cheng", "chi", "chong", "chou", "chu", "chuai", "chuan", "chuang", "chui", "chun", "chuo", "ci", "cong", "cou", "cu", "cuan", "cui",
"cun", "cuo", "da", "dai", "dan", "dang", "dao", "de", "deng", "di", "dian", "diao", "die", "ding", "diu", "dong", "dou", "du", "duan",
"dui", "dun", "duo", "e", "en", "er", "fa", "fan", "fang", "fei", "fen", "feng", "fo", "fou", "fu", "ga", "gai", "gan", "gang", "gao",
"ge", "gei", "gen", "geng", "gong", "gou", "gu", "gua", "guai", "guan", "guang", "gui", "gun", "guo", "ha", "hai", "han", "hang",
"hao", "he", "hei", "hen", "heng", "hong", "hou", "hu", "hua", "huai", "huan", "huang", "hui", "hun", "huo", "ji", "jia", "jian",
"jiang", "jiao", "jie", "jin", "jing", "jiong", "jiu", "ju", "juan", "jue", "jun", "ka", "kai", "kan", "kang", "kao", "ke", "ken",
"keng", "kong", "kou", "ku", "kua", "kuai", "kuan", "kuang", "kui", "kun", "kuo", "la", "lai", "lan", "lang", "lao", "le", "lei",
"leng", "li", "lia", "lian", "liang", "liao", "lie", "lin", "ling", "liu", "long", "lou", "lu", "lv", "luan", "lue", "lun", "luo",
"ma", "mai", "man", "mang", "mao", "me", "mei", "men", "meng", "mi", "mian", "miao", "mie", "min", "ming", "miu", "mo", "mou", "mu",
"na", "nai", "nan", "nang", "nao", "ne", "nei", "nen", "neng", "ni", "nian", "niang", "niao", "nie", "nin", "ning", "niu", "nong",
"nu", "nv", "nuan", "nue", "nuo", "o", "ou", "pa", "pai", "pan", "pang", "pao", "pei", "pen", "peng", "pi", "pian", "piao", "pie",
"pin", "ping", "po", "pu", "qi", "qia", "qian", "qiang", "qiao", "qie", "qin", "qing", "qiong", "qiu", "qu", "quan", "que", "qun",
"ran", "rang", "rao", "re", "ren", "reng", "ri", "rong", "rou", "ru", "ruan", "rui", "run", "ruo", "sa", "sai", "san", "sang",
"sao", "se", "sen", "seng", "sha", "shai", "shan", "shang", "shao", "she", "shen", "sheng", "shi", "shou", "shu", "shua",
"shuai", "shuan", "shuang", "shui", "shun", "shuo", "si", "song", "sou", "su", "suan", "sui", "sun", "suo", "ta", "tai",
"tan", "tang", "tao", "te", "teng", "ti", "tian", "tiao", "tie", "ting", "tong", "tou", "tu", "tuan", "tui", "tun", "tuo",
"wa", "wai", "wan", "wang", "wei", "wen", "weng", "wo", "wu", "xi", "xia", "xian", "xiang", "xiao", "xie", "xin", "xing",
"xiong", "xiu", "xu", "xuan", "xue", "xun", "ya", "yan", "yang", "yao", "ye", "yi", "yin", "ying", "yo", "yong", "you",
"yu", "yuan", "yue", "yun", "za", "zai", "zan", "zang", "zao", "ze", "zei", "zen", "zeng", "zha", "zhai", "zhan", "zhang",
"zhao", "zhe", "zhen", "zheng", "zhi", "zhong", "zhou", "zhu", "zhua", "zhuai", "zhuan", "zhuang", "zhui", "zhun", "zhuo",
"zi", "zong", "zou", "zu", "zuan", "zui", "zun", "zuo" }; int iChrasc = 0;
char *ret = NULL;
std::wstring wStr; GetWString(std::string(strHanZi.toLower().toLocal8Bit()), wStr);
int iLength = WideCharToMultiByte(CP_ACP, 0, wStr.c_str(), -1, 0, 0, 0, 0);
char *nowChar = new char[iLength + 1];
memset(nowChar, 0, iLength + 1);
WideCharToMultiByte(CP_ACP, 0, wStr.c_str(), -1, nowChar, iLength, 0, 0); //转换ASCII
int offset = 0;
char *returnstr = new char[6 * iLength + 1];
memset(returnstr, 0, 6 * iLength + 1);
strInitial.clear();
strQuanPin.clear();
for (int j = 0; j < iLength;)
{
if (nowChar[j] == 0)
{
break;
}
if (nowChar[j] >= 0 && nowChar[j] < 128)
{
returnstr[offset] = nowChar[j];
strInitial.append(nowChar[j]);
strInitial = strInitial.trimmed();
++offset;
++j;
continue;
} // 汉字处理
iChrasc = nowChar[j] * 256 + nowChar[j + 1] + 256; if (iChrasc > 0 && iChrasc < 160)
{
returnstr[offset] = nowChar[j];
strInitial.append(nowChar[j]);
strInitial = strInitial.trimmed();
++offset;
++j;
}
else
{
for (int i = (sizeof(pyAscii) / sizeof(pyAscii[0]) - 1); i >= 0; --i)
{
if (i == 396)
{
continue;
}
if (pyAscii[i] <= iChrasc)
{
strcpy(returnstr + offset, pyStr[i]);
strInitial.append(QChar(pyStr[i][0]));
strInitial = strInitial.trimmed();
offset += strlen(pyStr[i]);
break;
}
}
j += 2;
}
} if (strlen(returnstr) > 0)
{
ret = new char[strlen(returnstr) + 1];
memset(ret, 0, strlen(returnstr) + 1);
strcpy(ret, returnstr);
}
delete[] returnstr;
delete[] nowChar;
strQuanPin = ret;
delete[] ret;
} void TreeSearch::GetWString(const std::string &strIn, std::wstring &wStrOut)
{
int iLength = MultiByteToWideChar(CP_ACP, 0, (LPCSTR)strIn.c_str(), -1, NULL, 0);
wchar_t *wszUtf8 = new wchar_t[iLength + 1];
memset(wszUtf8, 0, iLength * 2 + 2);
MultiByteToWideChar(CP_ACP, 0, (LPCSTR)strIn.c_str(), -1, (LPWSTR)wszUtf8, iLength);
wStrOut = wszUtf8;
delete[] wszUtf8;
}
二、QTreeView + QStandardItemModel
头文件：
/************************************************************************
树的搜索类（QTreeView + QStandardItemModel版）
使用方法：
调用函数TreeSearch::SearchItem(para1, para2, para3);
第一个参数是要搜索的树QTreeView或它的子类
第二个参数是树的数据模型QStandardItemModel或它的子类
第三个参数是搜索输入的关键字
************************************************************************/ #ifndef TREESEARCH_H
#define TREESEARCH_H #include <QTreeView>
#include <QStandardItemModel>
#include <Windows.h> #define ITEM_SHOWN (Qt::UserRole + 17) class TreeSearch
{
public:
TreeSearch();
~TreeSearch();
static void SearchItem(QTreeView *, QStandardItemModel *, const QString &);//搜索函数 private:
static void FuzzySearch(QString &); //模糊搜索
static void FuzzySearchChildren(QStandardItem *, QString &); //模糊搜索子节点（递归）
static void PreciseSearch(const QString &); //精确搜索
static void PreciseSearchChildren(QStandardItem *, const QString &);//精确搜索子节点（递归）
static void ShowTotalItem(); //显示所有节点
static void ShowTotalChildrenItem(QStandardItem *); //显示所有子节点（递归）
static void ShowTotalParentItem(QStandardItem *); //设置所有父节点可显示（递归）
static void GetPinYin(const QString &, QString &strInitial, QString &strQuanPin); //将汉字转为拼音（首字母以及全拼）
static void GetWString(const std::string &, std::wstring &wStrOut);//将string转为wstring private:
static QTreeView *m_pCurTreeView; //当前的树
static QStandardItemModel *m_pCurModel; //当前树的数据模型
}; #endif // TREESEARCH_H
实现：
#include "TreeSearch.h" QTreeView *TreeSearch::m_pCurTreeView;
QStandardItemModel *TreeSearch::m_pCurModel; TreeSearch::TreeSearch()
{ } TreeSearch::~TreeSearch()
{ } void TreeSearch::SearchItem(QTreeView *pTreeView, QStandardItemModel *pModel, const QString &strKeyWord)
{
m_pCurTreeView = pTreeView;
if (m_pCurTreeView == NULL)
{
return;
}
m_pCurModel = pModel;
if (m_pCurModel == NULL)
{
return;
}
QRegExp rx("([a-z]?[0-9]?)*");
QString strLower = strKeyWord.toLower().trimmed();
if (!strLower.isEmpty())
{
bool bIsPreciseSearch = true;
QRegExpValidator v(rx, 0);
int pos = 0;
if (v.validate(strLower, pos) == QValidator::Acceptable)
{
bIsPreciseSearch = false;
}
if (bIsPreciseSearch)
{
PreciseSearch(strLower);
}
else
{
FuzzySearch(strLower);
}
}
//搜索框为空，显示全部节点
else
{
ShowTotalItem();
}
} void TreeSearch::FuzzySearch(QString &strKeyWord)
{
//QString strInitialOfInput; //输入
int iRootCount = m_pCurModel->rowCount();
for (int i = 0; i < iRootCount; ++i)
{
QStandardItem *pCurRootItem = m_pCurModel->item(i);
if (pCurRootItem == NULL)
{
continue;
}
pCurRootItem->setData(false, ITEM_SHOWN);
QString strCurRootItem = pCurRootItem->text();
QString strItemInitial; //当前节点文本的拼音首字母
QString strItemQuanPin; //当前节点文本的全拼
GetPinYin(strCurRootItem, strItemInitial, strItemQuanPin);
QString strStart = "^";
QRegExp rx(strStart.append(strItemQuanPin));
QRegExpValidator v(rx, 0);
int pos = 0;
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strItemInitial.contains(strKeyWord) || v.validate(strKeyWord, pos) != QValidator::Invalid)
{
m_pCurTreeView->setRowHidden(pCurRootItem->row(), m_pCurModel->indexFromItem(m_pCurModel->invisibleRootItem()), false);
ShowTotalChildrenItem(pCurRootItem);
continue;
}
//否则继续在其子节点中搜索
else
{
FuzzySearchChildren(pCurRootItem, strKeyWord);
}
}
} void TreeSearch::FuzzySearchChildren(QStandardItem *pParentItem, QString &strKeyWord)
{
int iRootCount = pParentItem->rowCount();
for (int i = 0; i < iRootCount; ++i)
{
QStandardItem *pCurChildItem = pParentItem->child(i);
if (pCurChildItem == NULL)
{
continue;
}
pCurChildItem->setData(false, ITEM_SHOWN);
QString strCurChildItem = pCurChildItem->text();
QString strItemInitial; //当前节点文本的拼音首字母
QString strItemQuanPin; //当前节点文本的全拼
GetPinYin(strCurChildItem, strItemInitial, strItemQuanPin);
QString strStart = "^";
QRegExp rx(strStart.append(strItemQuanPin));
QRegExpValidator v(rx, 0);
int pos = 0;
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strItemInitial.contains(strKeyWord) || v.validate(strKeyWord, pos) != QValidator::Invalid)
{
m_pCurTreeView->setRowHidden(pCurChildItem->row(), m_pCurModel->indexFromItem(pParentItem), false);
ShowTotalParentItem(pCurChildItem);
ShowTotalChildrenItem(pCurChildItem);
continue;
}
//否则继续在其子节点中搜索
else
{
FuzzySearchChildren(pCurChildItem, strKeyWord);
}
} bool bHasChildren = pParentItem->data(ITEM_SHOWN).toBool();
if (pParentItem->parent() == NULL)
{
m_pCurTreeView->setRowHidden(pParentItem->row(), m_pCurModel->indexFromItem(m_pCurModel->invisibleRootItem()), !bHasChildren);
}
else
{
m_pCurTreeView->setRowHidden(pParentItem->row(), m_pCurModel->indexFromItem(pParentItem->parent()), !bHasChildren);
}
} void TreeSearch::PreciseSearch(const QString &strKeyWord)
{
//QString strInitialOfInput; //输入
int iRootCount = m_pCurModel->rowCount();
for (int i = 0; i < iRootCount; ++i)
{
QStandardItem *pCurRootItem = m_pCurModel->item(i);
if (pCurRootItem == NULL)
{
continue;
}
pCurRootItem->setData(false, ITEM_SHOWN);
QString strCurRootItem = pCurRootItem->text();
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strCurRootItem.contains(strKeyWord))
{
m_pCurTreeView->setRowHidden(pCurRootItem->row(), m_pCurModel->indexFromItem(m_pCurModel->invisibleRootItem()), false);
ShowTotalChildrenItem(pCurRootItem);
continue;
}
//否则继续在其子节点中搜索
else
{
PreciseSearchChildren(pCurRootItem, strKeyWord);
}
}
} void TreeSearch::PreciseSearchChildren(QStandardItem *pParentItem, const QString &strKeyWord)
{
int iRootCount = pParentItem->rowCount();
for (int i = 0; i < iRootCount; ++i)
{
QStandardItem *pCurChildItem = pParentItem->child(i);
if (pCurChildItem == NULL)
{
continue;
}
pCurChildItem->setData(false, ITEM_SHOWN);
QString strCurChildItem = pCurChildItem->text();
//如果输入的关键字匹配当前节点，则显示当前节点及其所有子节点
if (strCurChildItem.contains(strKeyWord))
{
m_pCurTreeView->setRowHidden(pCurChildItem->row(), m_pCurModel->indexFromItem(pParentItem), false);
ShowTotalParentItem(pCurChildItem);
ShowTotalChildrenItem(pCurChildItem);
continue;
}
//否则继续在其子节点中搜索
else
{
PreciseSearchChildren(pCurChildItem, strKeyWord);
}
} bool bHasChildren = pParentItem->data(ITEM_SHOWN).toBool();
if (pParentItem->parent() == NULL)
{
m_pCurTreeView->setRowHidden(pParentItem->row(), m_pCurModel->indexFromItem(m_pCurModel->invisibleRootItem()), !bHasChildren);
}
else
{
m_pCurTreeView->setRowHidden(pParentItem->row(), m_pCurModel->indexFromItem(pParentItem->parent()), !bHasChildren);
}
} void TreeSearch::ShowTotalItem()
{
int iRootCount = m_pCurModel->rowCount();
for (int i = 0; i < iRootCount; ++i)
{
QStandardItem *pRootItem = m_pCurModel->item(i);
if (pRootItem == NULL)
{
continue;
}
m_pCurTreeView->setRowHidden(pRootItem->row(), m_pCurModel->indexFromItem(m_pCurModel->invisibleRootItem()), false);
ShowTotalChildrenItem(pRootItem);
}
} void TreeSearch::ShowTotalChildrenItem(QStandardItem *pParentItem)
{
int iChildCount = pParentItem->rowCount();
for (int i = 0; i < iChildCount; ++i)
{
QStandardItem *pChildItem = pParentItem->child(i);
if (pChildItem == NULL)
{
continue;
}
m_pCurTreeView->setRowHidden(pChildItem->row(), m_pCurModel->indexFromItem(pParentItem), false);
ShowTotalChildrenItem(pChildItem);
}
} void TreeSearch::ShowTotalParentItem(QStandardItem *pChildItem)
{
QStandardItem *pParentItem = pChildItem->parent();
if (pParentItem != NULL)
{
pParentItem->setData(true, ITEM_SHOWN);
ShowTotalParentItem(pParentItem);
}
} void TreeSearch::GetPinYin(const QString &strHanZi, QString &strInitial, QString &strQuanPin)
{
//保存拼音的ASCII值
const int pyAscii[] = { -20319, -20317, -20304, -20295, -20292, -20283, -20265, -20257, -20242, -20230, -20051, -20036, -20032, -20026,
-20002, -19990, -19986, -19982, -19976, -19805, -19784, -19775, -19774, -19763, -19756, -19751, -19746, -19741, -19739, -19728,
-19725, -19715, -19540, -19531, -19525, -19515, -19500, -19484, -19479, -19467, -19289, -19288, -19281, -19275, -19270, -19263,
-19261, -19249, -19243, -19242, -19238, -19235, -19227, -19224, -19218, -19212, -19038, -19023, -19018, -19006, -19003, -18996,
-18977, -18961, -18952, -18783, -18774, -18773, -18763, -18756, -18741, -18735, -18731, -18722, -18710, -18697, -18696, -18526,
-18518, -18501, -18490, -18478, -18463, -18448, -18447, -18446, -18239, -18237, -18231, -18220, -18211, -18201, -18184, -18183,
-18181, -18012, -17997, -17988, -17970, -17964, -17961, -17950, -17947, -17931, -17928, -17922, -17759, -17752, -17733, -17730,
-17721, -17703, -17701, -17697, -17692, -17683, -17676, -17496, -17487, -17482, -17468, -17454, -17433, -17427, -17417, -17202,
-17185, -16983, -16970, -16942, -16915, -16733, -16708, -16706, -16689, -16664, -16657, -16647, -16474, -16470, -16465, -16459,
-16452, -16448, -16433, -16429, -16427, -16423, -16419, -16412, -16407, -16403, -16401, -16393, -16220, -16216, -16212, -16205,
-16202, -16187, -16180, -16171, -16169, -16158, -16155, -15959, -15958, -15944, -15933, -15920, -15915, -15903, -15889, -15878,
-15707, -15701, -15681, -15667, -15661, -15659, -15652, -15640, -15631, -15625, -15454, -15448, -15436, -15435, -15419, -15416,
-15408, -15394, -15385, -15377, -15375, -15369, -15363, -15362, -15183, -15180, -15165, -15158, -15153, -15150, -15149, -15144,
-15143, -15141, -15140, -15139, -15128, -15121, -15119, -15117, -15110, -15109, -14941, -14937, -14933, -14930, -14929, -14928,
-14926, -14922, -14921, -14914, -14908, -14902, -14894, -14889, -14882, -14873, -14871, -14857, -14678, -14674, -14670, -14668,
-14663, -14654, -14645, -14630, -14594, -14429, -14407, -14399, -14384, -14379, -14368, -14355, -14353, -14345, -14170, -14159,
-14151, -14149, -14145, -14140, -14137, -14135, -14125, -14123, -14122, -14112, -14109, -14099, -14097, -14094, -14092, -14090,
-14087, -14083, -13917, -13914, -13910, -13907, -13906, -13905, -13896, -13894, -13878, -13870, -13859, -13847, -13831, -13658,
-13611, -13601, -13406, -13404, -13400, -13398, -13395, -13391, -13387, -13383, -13367, -13359, -13356, -13343, -13340, -13329,
-13326, -13318, -13147, -13138, -13120, -13107, -13096, -13095, -13091, -13076, -13068, -13063, -13060, -12888, -12875, -12871,
-12860, -12858, -12852, -12849, -12838, -12831, -12829, -12812, -12802, -12607, -12597, -12594, -12585, -12556, -12359, -12346,
-12320, -12300, -12120, -12099, -12089, -12074, -12067, -12058, -12039, -11867, -11861, -11847, -11831, -11798, -11781, -11604,
-11589, -11536, -11358, -11340, -11339, -11324, -11303, -11097, -11077, -11067, -11055, -11052, -11045, -11041, -11038, -11024,
-11020, -11019, -11018, -11014, -10838, -10832, -10815, -10800, -10790, -10780, -10764, -10587, -10544, -10533, -10519, -10331,
-10329, -10328, -10322, -10315, -10309, -10307, -10296, -10281, -10274, -10270, -10262, -10260, -10256, -10254 }; //保存拼音的音节
const char pyStr[396][7] = { "a", "ai", "an", "ang", "ao", "ba", "bai", "ban", "bang", "bao", "bei", "ben", "beng", "bi", "bian", "biao",
"bie", "bin", "bing", "bo", "bu", "ca", "cai", "can", "cang", "cao", "ce", "ceng", "cha", "chai", "chan", "chang", "chao", "che", "chen",
"cheng", "chi", "chong", "chou", "chu", "chuai", "chuan", "chuang", "chui", "chun", "chuo", "ci", "cong", "cou", "cu", "cuan", "cui",
"cun", "cuo", "da", "dai", "dan", "dang", "dao", "de", "deng", "di", "dian", "diao", "die", "ding", "diu", "dong", "dou", "du", "duan",
"dui", "dun", "duo", "e", "en", "er", "fa", "fan", "fang", "fei", "fen", "feng", "fo", "fou", "fu", "ga", "gai", "gan", "gang", "gao",
"ge", "gei", "gen", "geng", "gong", "gou", "gu", "gua", "guai", "guan", "guang", "gui", "gun", "guo", "ha", "hai", "han", "hang",
"hao", "he", "hei", "hen", "heng", "hong", "hou", "hu", "hua", "huai", "huan", "huang", "hui", "hun", "huo", "ji", "jia", "jian",
"jiang", "jiao", "jie", "jin", "jing", "jiong", "jiu", "ju", "juan", "jue", "jun", "ka", "kai", "kan", "kang", "kao", "ke", "ken",
"keng", "kong", "kou", "ku", "kua", "kuai", "kuan", "kuang", "kui", "kun", "kuo", "la", "lai", "lan", "lang", "lao", "le", "lei",
"leng", "li", "lia", "lian", "liang", "liao", "lie", "lin", "ling", "liu", "long", "lou", "lu", "lv", "luan", "lue", "lun", "luo",
"ma", "mai", "man", "mang", "mao", "me", "mei", "men", "meng", "mi", "mian", "miao", "mie", "min", "ming", "miu", "mo", "mou", "mu",
"na", "nai", "nan", "nang", "nao", "ne", "nei", "nen", "neng", "ni", "nian", "niang", "niao", "nie", "nin", "ning", "niu", "nong",
"nu", "nv", "nuan", "nue", "nuo", "o", "ou", "pa", "pai", "pan", "pang", "pao", "pei", "pen", "peng", "pi", "pian", "piao", "pie",
"pin", "ping", "po", "pu", "qi", "qia", "qian", "qiang", "qiao", "qie", "qin", "qing", "qiong", "qiu", "qu", "quan", "que", "qun",
"ran", "rang", "rao", "re", "ren", "reng", "ri", "rong", "rou", "ru", "ruan", "rui", "run", "ruo", "sa", "sai", "san", "sang",
"sao", "se", "sen", "seng", "sha", "shai", "shan", "shang", "shao", "she", "shen", "sheng", "shi", "shou", "shu", "shua",
"shuai", "shuan", "shuang", "shui", "shun", "shuo", "si", "song", "sou", "su", "suan", "sui", "sun", "suo", "ta", "tai",
"tan", "tang", "tao", "te", "teng", "ti", "tian", "tiao", "tie", "ting", "tong", "tou", "tu", "tuan", "tui", "tun", "tuo",
"wa", "wai", "wan", "wang", "wei", "wen", "weng", "wo", "wu", "xi", "xia", "xian", "xiang", "xiao", "xie", "xin", "xing",
"xiong", "xiu", "xu", "xuan", "xue", "xun", "ya", "yan", "yang", "yao", "ye", "yi", "yin", "ying", "yo", "yong", "you",
"yu", "yuan", "yue", "yun", "za", "zai", "zan", "zang", "zao", "ze", "zei", "zen", "zeng", "zha", "zhai", "zhan", "zhang",
"zhao", "zhe", "zhen", "zheng", "zhi", "zhong", "zhou", "zhu", "zhua", "zhuai", "zhuan", "zhuang", "zhui", "zhun", "zhuo",
"zi", "zong", "zou", "zu", "zuan", "zui", "zun", "zuo" }; int iChrasc = 0;
char *ret = NULL;
std::wstring wStr; GetWString(std::string(strHanZi.toLower().toLocal8Bit()), wStr);
int iLength = WideCharToMultiByte(CP_ACP, 0, wStr.c_str(), -1, 0, 0, 0, 0);
char *nowChar = new char[iLength + 1];
memset(nowChar, 0, iLength + 1);
WideCharToMultiByte(CP_ACP, 0, wStr.c_str(), -1, nowChar, iLength, 0, 0); //转换ASCII
int offset = 0;
char *returnstr = new char[6 * iLength + 1];
memset(returnstr, 0, 6 * iLength + 1);
strInitial.clear();
strQuanPin.clear();
for (int j = 0; j < iLength;)
{
if (nowChar[j] == 0)
{
break;
}
if (nowChar[j] >= 0 && nowChar[j] < 128)
{
returnstr[offset] = nowChar[j];
strInitial.append(nowChar[j]);
strInitial = strInitial.trimmed();
++offset;
++j;
continue;
} // 汉字处理
iChrasc = nowChar[j] * 256 + nowChar[j + 1] + 256; if (iChrasc > 0 && iChrasc < 160)
{
returnstr[offset] = nowChar[j];
strInitial.append(nowChar[j]);
strInitial = strInitial.trimmed();
++offset;
++j;
}
else
{
for (int i = (sizeof(pyAscii) / sizeof(pyAscii[0]) - 1); i >= 0; --i)
{
if (i == 396)
{
continue;
}
if (pyAscii[i] <= iChrasc)
{
strcpy(returnstr + offset, pyStr[i]);
strInitial.append(QChar(pyStr[i][0]));
strInitial = strInitial.trimmed();
offset += strlen(pyStr[i]);
break;
}
}
j += 2;
}
} if (strlen(returnstr) > 0)
{
ret = new char[strlen(returnstr) + 1];
memset(ret, 0, strlen(returnstr) + 1);
strcpy(ret, returnstr);
}
delete[] returnstr;
delete[] nowChar;
strQuanPin = ret;
delete[] ret;
} void TreeSearch::GetWString(const std::string &strIn, std::wstring &wStrOut)
{
int iLength = MultiByteToWideChar(CP_ACP, 0, (LPCSTR)strIn.c_str(), -1, NULL, 0);
wchar_t *wszUtf8 = new wchar_t[iLength + 1];
memset(wszUtf8, 0, iLength * 2 + 2);
MultiByteToWideChar(CP_ACP, 0, (LPCSTR)strIn.c_str(), -1, (LPWSTR)wszUtf8, iLength);
wStrOut = wszUtf8;
delete[] wszUtf8;
}
Qt——树的搜索实现源码的更多相关文章
- java集合树状结构及源码
java集合树状结构及源码 最近一直想看一下java集合的源码,毕竟平时用的比较多,但总是感觉是跟着习惯new出来一个对象,比如ArrayList,HashMap等等,所以就简单的看了一下,了解了一下 ...
- Qt——树的搜索
一.Qt中的树 Qt中树的实现有两种方式.第一种是使用Qt提供的QTreeWidget,很多函数都封装好,比较方便:另一种是通过QTreeView实现,设置它的数据模型,比如使用QStandardIt ...
- Qt creator中文输入—fctix-qt5 源码编译 libfcitxplatforminputcontextplugin.so
fctix-qt5 的源码有两个地方可以下载: wget https://download.fcitx-im.org/fcitx-qt5/fcitx-qt5-1.0.5.tar.xztar -xJf ...
- [Unity插件]Lua行为树(一)：BehaviorDesigner源码分析
BehaviorDesigner是Unity上的一款行为树插件,不过这个插件是用C#编写的,编写出来的行为树也是依赖于C#的,不利于热更,所以有必要写一个lua版本的. 首先下载BehaviorDes ...
- QT：轻松获取网页源码
获取网页源码的小例子,代码很简单,就不多作解释了. 不过一定要注意网页的编码问题,否则会出现乱码的!!! #include <QtCore> #include <QtNetwork& ...
- Echart-无需json文件的树状图（源码）超级简单，小白的福音
源码: <!DOCTYPE html> <head> <meta charset="utf-8"> <script type=" ...
- [数据结构与算法]RED-BLACK(红黑)树的实现TreeMap源码阅读
声明:原创作品,转载时请注明文章来自SAP师太技术博客( 博/客/园www.cnblogs.com):www.cnblogs.com/jiangzhengjun,并以超链接形式标明文章原始出处,否则将 ...
- [转载] RED-BLACK(红黑)树的实现TreeMap源码阅读
转载自http://lxy2330.iteye.com/blog/1664786 由于平衡二叉树与红黑树都是二叉排序树,又红黑树是对平衡二叉树的一种改进实现,所以它的很多思想算法都来源于排序二叉或平衡 ...
- 现代编译原理——第六章：中间树 IR Tree 含源码
转自: http://www.cnblogs.com/BlackWalnut/p/4559717.html 这一章,就虎书而言,理论知识点是及其少的,就介绍了为什么要有一个中间表示树.看下面这张图就能 ...
随机推荐
- python 获取运行脚本和模块的绝对路径
方法一:sys.args[0] 在python的运行时,sys.argv[0],存了当前脚本的运行路径包括文件名 python test.py 则:sys.argv[0] =>test.py p ...
- [hdoj6415 Rikka with Nash Equilibrium][dp]
http://acm.hdu.edu.cn/showproblem.php?pid=6415 Rikka with Nash Equilibrium Time Limit: 10000/5000 MS ...
- 【题解】狼和羊-C++
Description 米基家的后院养着一群羊,米基由于疲劳睡着了,这时一群饿狼钻进了后院开始攻击羊群,后院是由许多个方格构成的长方形区域,每个方格中用字符'?'表示空地,'#'表示栅栏,'o'表示羊 ...
- String.getBytes()方法中的中文编码问题(转)
String的getBytes()方法是得到一个系统默认的编码格式的字节数组getBytes("utf-8") 得到一个UTF-8格式的字节数组 把String转换成bytes, ...
- mac charles 代理https
1.安装根证书:help - ssl proxying - install charles root certificate 2.这时候会弹出一个根证书界面,如果没有弹出,则可以去chrome,高级设 ...
- storm java环境变量设置
storm启动时会加载conf/storm-env.sh文件 编辑 conf/storm-env.sh 添加export JAVA_HOME=/usr/java/jdk1.8.0_111
- ios 修饰词作用
copy: NSString\NSMutableString\Block weak: 代理.UI控件(weak) strong: 其他OC对象 assign: 基本数据类型(int\float).枚举 ...
- sqlserver 锁表进程及执行的SQL
--1.查进程select request_session_id spid,OBJECT_NAME(resource_associated_entity_id) tableNamefrom sys.d ...
- 网络时间协议 (SNTP)
sntp是简单网络时间协议(Simple Network Protocol)的客户端,可以用来查询或修正NTP服务器的时间和本地的时差. sntp可以以非交互模式运行或运行一个计划任务的脚本. snt ...
- [Oracle]关于回滚段的一些转贴摘录
ORACLE 回滚段 回滚段概述 回滚段用于存放数据修改之前的值(包括数据修改之前的位置和值).回滚段的头部包含正在使用的该回滚段事务的信息.一个事务只能使用一个回滚段来存放它的回滚信息,而一个回滚段 ...