C/C++ TIPS

List some tips when using C/C++.

  1. Use std::sort instead of qsort (At least, in Visual C++). This is because std::sort is faster than qsort.
  2. Keys in an associative container are immutable.  Keep it in mind, expecially when you are using std::set and std::multiset.  Also, iterator and const_iterator for std::set and std::multiset are both constant iterators.  (VC9 SP1 doesn't follow the rules, VC10 will enforce these rules) [N2798.pdf]
    • )23.1.4/5 For set and multiset the value type is the same as the key type. For map and multimap it is equal to pair<const Key, T>. Keys in an associative container are immutable.
    • )23.1.4/6 Iterator of an associative container meets the requirements of the BidirectionalIterator concept. For associative containers where the value type is the same as the key type, both iterator and const_iterator are constant iterators. It is unspecified whether or not iterator and const_iterator are the same type.
  3. When seq is a vector, deque or list, please don't write this:
        copy(first, last, back_inserter(seq));
    instead, write this:
        seq.insert(seq.end(), first, last);
    That's not only slightly less typing, it's also significantly more efficient.  (copy()-to-back_inserter() performs repeated push_back()s and hence can trigger multiple vector reallocations, whereas insert()-at-end() will perform at most one vector reallocation. deque also benefits.)
  4. The member variables are initialized by the order that they are declared (not the order they appear in the constructor initialization list) and nothing to do with the access modifiers (public, protected and private).
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值