想要实现CListBox里的字体颜色不同，是不是做一个CListBox派生类，然后覆盖掉DrawItem这个方法就可以？

派生CListBox，为CListBox添加一个私有成员map<UINT,COLORREF> m_itemTextColor;
重载AddString 方法 如下：
int AddString(LPCTSTR lpszItem,COLORREF clf)
{
    int iRet = CListBox::AddString(lpszItem);
    if (iRet >= 0)
        m_itemTextColor[iRet] = clf;
    return iRet;
}
在DrawItem中：
    COLORREF textColor = RGB(0,0,0);
    map<UINT,COLORREF>::iterator it = m_itemTextColor.find(lpDIS->itemID);
    if (it != m_itemTextColor.end())
        textColor = m_itemTextColor[lpDIS->itemID];
    pDC->SetTextColor(textColor);
这样就能设置每行的颜色了。   

请问蓝色标记的这里属于哪方面的知识？我第一次见到。我还需要继续找资料学习一下。

好像在msdn中找到了

template<class Key, class T, class Pred = less<Key>, class A = allocator<T> >
    class map {
public:
    typedef Key key_type;
    typedef T referent_type;
    typedef Pred key_compare;
    typedef A allocator_type;
    typedef pair<const Key, T> value_type;
    class value_compare;
    typedef A::size_type size_type;
    typedef A::difference_type difference_type;
    typedef A::rebind<value_type>::other::reference reference;
    typedef A::rebind<value_type>::other::const_reference const_reference;
    typedef T0 iterator;
    typedef T1 const_iterator;
    typedef reverse_bidirectional_iterator<iterator,
        value_type, reference, A::pointer,
            difference_type> reverse_iterator;
    typedef reverse_bidirectional_iterator<const_iterator,
        value_type, const_reference, A::const_pointer,
            difference_type> const_reverse_iterator;
    explicit map(const Pred& comp = Pred(), const A& al = A());
    map(const map& x);
    map(const value_type *first, const value_type *last,
        const Pred& comp = Pred(),
            const A& al = A());
    iterator begin();
    const_iterator begin() const;
    iterator end();
    iterator end() const;
    reverse_iterator rbegin();
    const_reverse_iterator rbegin() const;
    reverse_iterator rend();
    const_reverse_iterator rend() const;
    size_type size() const;
    size_type max_size() const;
    bool empty() const;
    A get_allocator() const;
    A::reference operator[](const Key& key);
    pair<iterator, bool> insert(const value_type& x);
    iterator insert(iterator it, const value_type& x);
    void insert(const value_type *first, const value_type *last);
    iterator erase(iterator it);
    iterator erase(iterator first, iterator last);
    size_type erase(const Key& key);
    void clear();
    void swap(map x);
    key_compare key_comp() const;
    value_compare value_comp() const;
    iterator find(const Key& key);
    const_iterator find(const Key& key) const;
    size_type count(const Key& key) const;
    iterator lower_bound(const Key& key);
    const_iterator lower_bound(const Key& key) const;
    iterator upper_bound(const Key& key);
    const_iterator upper_bound(const Key& key) const;
    pair<iterator, iterator> equal_range(const Key& key);
    pair<const_iterator, const_iterator>
        equal_range(const Key& key) const;
protected:
    A allocator;
    };

The template class describes an object that controls a varying-length sequence of elements of type pair<const Key, T>. The first element of each pair is the sort key and the second is its associated value. The sequence is represented in a way that permits lookup, insertion, and removal of an arbitrary element with a number of operations proportional to the logarithm of the number of elements in the sequence (logarithmic time). Moreover, inserting an element invalidates no iterators, and removing an element invalidates only those iterators that point at the removed element.

map::iterator
typedef T0 iterator;
The type describes an object that can serve as a bidirectional iterator for the controlled sequence. It is described here as a synonym for the unspecified type T0.

map::find
iterator find(const Key& key);
const_iterator find(const Key& key) const;
The member function returns an iterator that designates the earliest element in the controlled sequence whose sort key equals key. If no such element exists, the iterator equals end().


map::end
const_iterator end() const;
iterator end();
The member function returns a bidirectional iterator that points just beyond the end of the sequence.


[ 本帖最后由 Lyone 于 2010-12-31 09:58 编辑 ]