靠～～MFC的容器难用死啦

rickerliang 2007-01-18 11:23:47

MFC的CList之类的，真别扭啊，简直就是反人类啊
我是stl的忠实拥护者，但在公司不能用stl，靠，只能用MFC的容器，我日tmd，MFC的容器我不能接受啊～～～救命～～！！

...全文

950 31 打赏收藏转发到动态举报

写回复

用AI写文章

31 条回复

切换为时间正序

请发表友善的回复…

发表回复

zcy21111 2011-04-06

打赏
举报

没有这么难把··

yuewanwan1988 2011-03-30

打赏
举报

呵呵，不知道，现在都还没怎么用，也不是很清楚，要看看。。。

rickerliang 2007-01-25

打赏
举报

故意这么弄不就是风格么，hoho

kimryo 2007-01-24

打赏
举报

hoho 这是P.J. Plauger的风格
==========================

不是的~他们是故意这么弄的~

rickerliang 2007-01-24

打赏
举报

hoho 这是P.J. Plauger的风格

Featured 2007-01-23

打赏
举报

哈哈

crystal_heart 2007-01-23

打赏
举报

VC 的 STL 烂在哪里？摘抄一段下来以供欣赏，VC2003的 map

template<class _Kty,
class _Ty,
class _Pr,
class _Alloc> inline
void swap(map<_Kty, _Ty, _Pr, _Alloc>& _Left,
map<_Kty, _Ty, _Pr, _Alloc>& _Right)
{ // swap _Left and _Right maps
_Left.swap(_Right);
}

// TEMPLATE CLASS multimap
template<class _Kty,
class _Ty,
class _Pr = less<_Kty>,
class _Alloc = allocator<pair<const _Kty, _Ty> > >
class multimap
: public _Tree<_Tmap_traits<_Kty, _Ty, _Pr, _Alloc, true> >
{ // ordered red-black tree of {key, mapped} values, non-unique keys
public:
typedef multimap<_Kty, _Ty, _Pr, _Alloc> _Myt;
typedef _Tree<_Tmap_traits<_Kty, _Ty, _Pr, _Alloc, true> > _Mybase;
typedef _Kty key_type;
typedef _Ty mapped_type;
typedef _Ty referent_type; // retained
typedef _Pr key_compare;
typedef typename _Mybase::value_compare value_compare;
typedef typename _Mybase::allocator_type allocator_type;
typedef typename _Mybase::size_type size_type;
typedef typename _Mybase::difference_type difference_type;
typedef typename _Mybase::pointer pointer;
typedef typename _Mybase::const_pointer const_pointer;
typedef typename _Mybase::reference reference;
typedef typename _Mybase::const_reference const_reference;
typedef typename _Mybase::iterator iterator;
typedef typename _Mybase::const_iterator const_iterator;
typedef typename _Mybase::reverse_iterator reverse_iterator;
typedef typename _Mybase::const_reverse_iterator
const_reverse_iterator;
typedef typename _Mybase::value_type value_type;

multimap()
: _Mybase(key_compare(), allocator_type())
{ // construct empty map from defaults
}

explicit multimap(const key_compare& _Pred)
: _Mybase(_Pred, allocator_type())
{ // construct empty map from comparator
}
multimap(const key_compare& _Pred, const allocator_type& _Al)
: _Mybase(_Pred, _Al)
{ // construct empty map from comparator and allocator
}

template<class _Iter>
multimap(_Iter _First, _Iter _Last)
: _Mybase(key_compare(), allocator_type())
{ // construct map from [_First, _Last), defaults
for (; _First != _Last; ++_First)
insert(*_First);
}

template<class _Iter>
multimap(_Iter _First, _Iter _Last,
const key_compare& _Pred)
: _Mybase(_Pred, allocator_type())
{ // construct map from [_First, _Last), comparator
for (; _First != _Last; ++_First)
insert(*_First);
}

template<class _Iter>
multimap(_Iter _First, _Iter _Last,
const key_compare& _Pred, const allocator_type& _Al)
: _Mybase(_Pred, _Al)
{ // construct map from [_First, _Last), comparator, and allocator
for (; _First != _Last; ++_First)
insert(*_First);
}

iterator insert(const value_type& _Val)
{ // insert a {key, mapped} value
return (_Mybase::insert(_Val).first);
}

iterator insert(iterator _Where, const value_type& _Val)
{ // insert a {key, mapped} value, with hint
return (_Mybase::insert(_Where, _Val));
}

template<class _Iter>
void insert(_Iter _First, _Iter _Last)
{ // insert [_First, _Last), arbitrary iterators
for (; _First != _Last; ++_First)
insert(*_First);
}
};

rickerliang 2007-01-22