设计模式个人备忘（享元模式，strategy, templete strategy)

最新推荐文章于 2023-12-23 12:40:13 发布

原创最新推荐文章于 2023-12-23 12:40:13 发布 · 810 阅读

0 ·

CC 4.0 BY-SA版权

设计模式专栏收录该内容

2 篇文章

订阅专栏

本文详细解析了C++中应用策略模式的实现，通过实例展示了如何使用策略模式来灵活处理不同算法的选择与切换，提高了代码的复用性和灵活性。文中包括了策略模式的定义、特点、优点，并通过具体代码示例来说明如何在实际项目中应用这一设计模式。

设计模式C++实现（9）——享元模式

常见设计模式的解析和实现(C++)之十六-Strategy模式

http://sourcemaking.com/design_patterns/strategy/cpp/1

http://www.vincehuston.org/dp/strategy.html

template<typename STRATEGY>
class Stat {
public:
   void readVector( int v[], int n ) {
      m_impl.sort( v, n );
      m_min = v[0];
      m_max = v[n-1];
      m_median = v[n/2];
   }
   ...
private:
   STRATEGY  m_impl;
};

class SortBubble {
   void sort( int v[], int n ) {
   ...

class SortShell {
   void sort( int v[], int n ) {
   ...

int main( void ) {
   const int NUM = 9;
   int       array[NUM];
   srand( time(0) );
   cout << "Vector: ";
   for (int i=0; i < NUM; ++i) {
      array[i] = rand() % 9 + 1;
      cout << array[i] << ' ';
   }
   cout << '\n';
   Stat<SortBubble>  one;
   one.readVector( array, NUM );
   cout << "min is " << one.getMin() << ", max is " << one.getMax()
        << ", median is " << one.getMedian() << '\n';

   Stat<SortShell>  two;
   two.readVector( array, NUM );
   cout << "min is " << two.getMin() << ", max is " << two.getMax()
        << ", median is " << two.getMedian() << '\n';
}

// Vector: 8 3 1 9 7 2 2 9 7
// Bubble: 1 2 2 3 7 7 8 9 9
// min is 1, max is 9, median is 7
// Shell:  1 2 2 3 7 7 8 9 9
// min is 1, max is 9, median is 7