STL: partition

最新推荐文章于 2024-04-30 09:00:00 发布

weixin_30659829

最新推荐文章于 2024-04-30 09:00:00 发布

阅读量128

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/freewater/archive/2013/03/11/2953520.html

本文详细介绍了C++ STL中的三个分区算法：partition、stable_partition 和 partition_copy。这些算法能够将集合中的元素根据指定条件分为两个互不相交的子集，并保持元素的相对顺序不变。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

partition

Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it.

template<class BidirectionalIterator, class Predicate>
   BidirectionalIterator partition(
      BidirectionalIterator _First, 
      BidirectionalIterator _Last, 
      Predicate _Comp
   );

stable_partition

Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it, preserving the relative order of equivalent elements.

template<class BidirectionalIterator, class Predicate> 
   BidirectionalIterator stable_partition( 
      BidirectionalIterator _First,  
      BidirectionalIterator _Last, 
      Predicate _Pred 
   );

partition_copy

Copies elements for which a condition is true to one destination, and for which the condition is false to another. The elements must come from a specified range.

template<class InputIterator, class OutputIterator1, class OutputIterator2, class Predicate>
    pair<OutputIterator1, OutputIterator2>
        partition_copy(
            InputIterator _First, 
            InputIterator _Last,
            OutputIterator1 _Dest1, 
            OutputIterator2 _Dest2, 
            Predicate _Pred
        );

转载于:https://www.cnblogs.com/freewater/archive/2013/03/11/2953520.html