谁能给个“由treectrl选择项目到Listctrl显示”的例子

[sjd163]

[e-mail]

[xiaohedou]

这里有个处理Tree Control的包装类，你看看：
http://www.codeproject.com/treectrl/rgtree.asp
简单说一下：把这个类包含在你的文件中，建立他的实例，用GetAt( /*[in]*/ POSITION pos)取得数据，后用ListCtrl.AddString()加入。


The control data storage is based on the template CRGTreeT<_ITEMDATA>. It's an object implementing a bi-directional linked list of elements, each containing a member of type ITEMDATA.

template<class _ITEMDATA> class CRGTreeT
{
public:
// Construction / Destruction
CRGTreeT();
~CRGTreeT();

// returns the count of all items
UINT GetItemCount() const;
// returns the count of all child items
UINT GetChildCount( /*[in]*/ POSITION posParent) const;
// returns the root
POSITION GetRootPosition() const;

// returns the parent of an item
POSITION GetParentPosition( /*[in]*/ POSITION pos) const;

// adds an items at the begin of the list
POSITION AddHead( /*[in]*/ const _ITEMDATA *pItemData,
/*[in]*/ POSITION posParent=NULL);
// adds an items at the end of the list
POSITION AddTail( /*[in]*/ const _ITEMDATA *pItemData,
/*[in]*/ POSITION posParent=NULL);

POSITION InsertAfter( /*[in]*/ const _ITEMDATA *pItemData,
POSITION posParent=NULL,
/*[in]*/POSITION posAfter=NULL);
// Remove the item at position pos including all subitems
void RemoveAt( /*[in]*/ POSITION pos);
// Removes all items
void RemoveAll();

// returns the first/last child item of the item at position posParent
POSITION GetChildPosition( /*[in]*/ POSITION posParent,
/*[in]*/ BOOL bFirst=TRUE) const;
// returns the next list element, NULL if none
POSITION GetNextPosition( /*[in]*/ POSITION pos) const;

// returns the previous element, NULL if none
POSITION GetPrevPosition( /*[in]*/ POSITION pos) const

// returning a copy of the ITEMDATA at position pos
void GetAt( /*[in]*/ POSITION pos, /*[out]*/ _ITEMDATA* pItemData) const;
// Returning a pointer to the ITEMDATA at position pos
_ITEMDATA* GetAt( /*[in]*/ POSITION pos);
// replace the ITEMDATA at position pos
void SetAt( /*[in]*/ POSITION pos, /*[in]*/ const _ITEMDATA* pItemData);

// sort childrens of the item at position posParent
BOOL SortChildren( /*[in]*/ POSITION posParent,
/*[in]*/ BOOL bAscending=TRUE);
// search for an item based on the compare function
POSITION Find( /*[in]*/ const _ITEMDATA *pItemData,
/*[in]*/ POSITION posParent);

// setting a callback function for sorting and finding items
CompareFunc SetCompareFunc( /*[in]*/ CompareFunc func);
DeleteFunc SetDeleteFunc( /*[in]*/ DeleteFunc func, LPARAM lParam);

protected:
// remove all childs from an item
void RemoveChilds( POSITION pos);

// quick sort algorithms for sorting up- or downwards
void QSortA( /*[in]*/ CTreeItem **pLow, /*[in]*/ CTreeItem **pHigh);
void QSortD( /*[in]*/ CTreeItem **pLow, /*[in]*/ CTreeItem **pHigh);

private:
CTreeItem m_ItemRoot;
UINT m_nCount;
CompareFunc m_pCompareFunc;
DeleteFunc m_pDeleteFunc;
LPARAM m_lParamDeleteFunc;
};

The messages will be processed in its own window procedure. Some small functions I've implemented directly, the others exists as stand alone functions with the following form

LRESULT On[MessageName]( HWND hwnd, TREE_MAP_STRUCT *ptms,
WPARAM wParam, LPARAM lParam)
There is a data structure holding the characteristics for each tree HWND:

struct TREE_MAP_STRUCT
{
HWND hwnd; // the handle of the control
HWND hWndEdit; // the handle of the controls
// edit window
WNDPROC pOldWndProc; // the old window procedure
int nItemCount; // all items inserted
int nMaxWidth; // max width of the control
int nVScrollPos; // vertical scroll position
int nHScrollPos; // horizontal scroll position
HTREEITEM hItemFirstVisible; // items ...
HTREEITEM hItemSelected;
HTREEITEM hItemEditing;
HTREEITEM hItemClicked;
HIMAGELIST hNormalImageList; // image list
HIMAGELIST hStateImageList;
bool bRedrawFlag; // should the control be redrawed
// on each inserting/erasing
_rgTree rgTree; // the CRGTreeT template
};

• 打赏
• 举报

回复 赞

[无敌魔仙]

up

• 打赏
• 举报

回复 赞

[skybblue]

已经发过去了！

• 打赏
• 举报

回复 赞