MFC修改菜单
2015-08-16 21:23
232 查看
添加菜单
CMenu *pMenu = GetMenu()->GetSubMenu(1)->GetSubMenu(2);
if (pMenu)
{
pMenu->AppendMenu(MF_STRING, 10009, _T("Java程序设计"));
UINT uCount = pMenu->GetMenuItemCount();
CMenu menuJavaScript;
menuJavaScript.CreatePopupMenu();
pMenu->InsertMenu(uCount,MF_POPUP|MF_BYPOSITION, (UINT)menuJavaScript.Detach(), _T("JavaScript程序设计"));
}修改菜单
CMenu *pMenu = GetMenu()->GetSubMenu(1);
int nPos = FindMenuItem(pMenu, _T("Java"));
if (nPos > 0)
{
pMenu->ModifyMenu(nPos, MF_BYPOSITION,nPos, _T("Lua"));
}
删除菜单
CMenu *pMenu = GetMenu()->GetSubMenu(1);
if (pMenu)
{
pMenu->DeleteMenu(0,MF_BYPOSITION); // pMenu->RemoveMenu(0,MF_BYPOSITION);
}
查询菜单
int FindMenuItem(CMenu* pMenu, LPCTSTR lpstMenuText)
{
ASSERT(pMenu);
ASSERT(::IsMenu(pMenu->GetSafeHmenu()));
int count = pMenu->GetMenuItemCount();
for (int i = 0; i < count; i++)
{
CString str;
if (pMenu->GetMenuString(i, str, MF_BYPOSITION) && str.Compare(lpstMenuText) == 0)
return i;
}
return -1;
}
CMenu *pMenu = GetMenu()->GetSubMenu(1)->GetSubMenu(2);
if (pMenu)
{
pMenu->AppendMenu(MF_STRING, 10009, _T("Java程序设计"));
UINT uCount = pMenu->GetMenuItemCount();
CMenu menuJavaScript;
menuJavaScript.CreatePopupMenu();
pMenu->InsertMenu(uCount,MF_POPUP|MF_BYPOSITION, (UINT)menuJavaScript.Detach(), _T("JavaScript程序设计"));
}修改菜单
CMenu *pMenu = GetMenu()->GetSubMenu(1);
int nPos = FindMenuItem(pMenu, _T("Java"));
if (nPos > 0)
{
pMenu->ModifyMenu(nPos, MF_BYPOSITION,nPos, _T("Lua"));
}
删除菜单
CMenu *pMenu = GetMenu()->GetSubMenu(1);
if (pMenu)
{
pMenu->DeleteMenu(0,MF_BYPOSITION); // pMenu->RemoveMenu(0,MF_BYPOSITION);
}
查询菜单
int FindMenuItem(CMenu* pMenu, LPCTSTR lpstMenuText)
{
ASSERT(pMenu);
ASSERT(::IsMenu(pMenu->GetSafeHmenu()));
int count = pMenu->GetMenuItemCount();
for (int i = 0; i < count; i++)
{
CString str;
if (pMenu->GetMenuString(i, str, MF_BYPOSITION) && str.Compare(lpstMenuText) == 0)
return i;
}
return -1;
}
相关文章推荐
- 【JavaScript】AJax
- 102 Binary Tree Level Order Traversal
- POJ2007--Scrambled Polygon
- c++从零开始学起(关于迭代器的使用)
- hdu 4983 Goffi and GCD(欧拉函数)
- NOIP2010 引水入城
- 求最小的k个数
- 倒排索引
- 8.15总结
- Javascript 基础
- 使用Java快速实现进度条(转)
- Javascript 基础
- leetcode 128: Longest Consecutive Sequence
- Connection reset by peer问题分析
- nyoj448 寻找最大数
- uva 11795 状压dp
- leetcode中第一题twosum问题解答算法的可行性证明
- mongodb异常关闭后,再启动需要删除mongod.lock文件
- Java Swing创建自定义闪屏:在闪屏上添加Swing进度条控件(转)
- Connection reset by peer问题分析