简体   繁体   English

用于MFC容器CObList的STL迭代器

[英]STL iterator for MFC container CObList

I have a Folder class which contains two lists of Folders and Files . 我有一个Folder类,其中包含两个文件夹文件列表。

    class Folder : public CObject
    {
public:
    typedef std::string StringT;
     ...
    Container filesInFolder;
    Container foldersInFolder;
    StringT folderName;
    ...
    };

class File : public CObject { ... };

Lists derive from CObList. 列表派生自CObList。 Class Container : public CObList . Class Container : public CObList I need to perform search inside foldersInFolder by name and in filesInFolder by name and extension. 我需要通过名称和filesInFolder由名和扩展名内部foldersInFolder进行搜索。 CObList::Find does not allow me to use predicates. CObList :: Find不允许我使用谓词。 I would normaly use std::find_if with predicate: 我会正常地使用带谓词的std :: find_if:

struct Comparator
{
    Folder::StringT stringToCompare;
    bool operator() ( const Folder* lhs )
    {
        return lhs->GetFolderName( ) == stringToCompare;
    }
};

So i need an iterator to use this function. 所以我需要一个迭代器来使用这个函数。 On [codeguru they define a class BaseMFCIter][1] which is a child of std::iterator: 他们在[codeguru]上定义了一个类BaseMFCIter] [1],它是std :: iterator的子代:

#include < iterator >

// Define BaseMFCIter as a standard input iterator.
//
// The template arguments are: 
//  Item: the contained element type
//  Cont: the container type
//  Key:  the access key (defaults to POSITION)

template < class Item, class Cont, class Key = POSITION >
class BaseMFCIter : public std::iterator < std::input_iterator_tag, Item >
{
public:
   // Define types for the 2 member functions to be used:
   typedef Key  (Cont::*GetFirstFunctionPtr) ()     const;
   typedef Item (Cont::*GetNextFunctionPtr)  (Key&) const;

   // Default constructor, makes a null iterator, equal to BaseMFCIter::end()
   BaseMFCIter() : m_pCont(0), m_Pos(0), m_GetFirstFunc(0), m_GetNextFunc(0), m_End(true) {}

   // Constructor taking pointer to container and the iteration functions
   BaseMFCIter(Cont* pCont, GetFirstFunctionPtr pFF, GetNextFunctionPtr pNF) 
      : m_pCont(pCont), m_Pos(0), m_GetFirstFunc(pFF), m_GetNextFunc(pNF)
   { init(); }

   // Copy constructor, initialises iterator to first element
   BaseMFCIter(const BaseMFCIter& vi) : m_pCont(vi.m_pCont), m_Pos(0),
    m_GetFirstFunc(vi.m_GetFirstFunc), m_GetNextFunc(vi.m_GetNextFunc)
   { init(); }

   // Assignment operator, initialises iterator to first element
   BaseMFCIter& operator=(const BaseMFCIter& vi)
   {
      m_pCont       = vi.m_pCont; 
      m_GetFirstFunc    = vi.m_GetFirstFunc;
      m_GetNextFunc = vi.m_GetNextFunc;
      init();  
      return *this; 
   }

   bool operator == (const BaseMFCIter& rhs) const
   { return (m_Pos == rhs.m_Pos && m_End == rhs.m_End); }

   bool operator != (const BaseMFCIter& rhs) const 
   { return !operator==(rhs); }

   BaseMFCIter& operator ++ ()    { advance(); return *this; }
   BaseMFCIter& operator ++ (int) { BaseMFCIter ret(*this); advance(); return ret; }
   Item         operator *  ()    { return m_Item; }
   Item         operator -> ()    { return m_Item; }

   static BaseMFCIter end   ()    { return BaseMFCIter(); } // end() returns default null iterator

private:
   Item  m_Item;      // Current item from container
   Cont* m_pCont;     // Pointer to container
   Key   m_Pos;       // Key to item in container
   bool  m_End;       // Flag to indicate end of container reached

   // Pointers to container iteration functions
   GetFirstFunctionPtr m_GetFirstFunc;
   GetNextFunctionPtr  m_GetNextFunc;

   // Use container GetFirst & GetNext functions to set to first element, or end() if not found
   void init() 
   {
      m_Pos = 0;
      m_End = true;

      if (m_pCont && m_GetFirstFunc != 0)
      {
         m_Pos = (m_pCont->*m_GetFirstFunc)();
         advance();
      }
   }

   // Use container GetNext function to find next element in container
   void advance()
   {
      m_End = m_Pos ? false : true;
      m_Item = (m_Pos && m_pCont && m_GetNextFunc != 0) ? 
               (m_pCont->*m_GetNextFunc)(m_Pos) : Item();
   }
};

But if i define my own ListIter class with myCObject being File or Folder. 但是,如果我定义自己的ListIter类,myCObject是文件或文件夹。

class ListIter : public BaseMFCIter < myCObject, CObList  >
{
public:
   ListIter( CObList* pObj = 0) : BaseMFCIter< myCObject, CObList >
       (pObj, &CObList::GetHeadPosition, &CObList::GetNext )
   {}
};

it leads me to compiler error: 它导致我编译错误:

Error   1   error C2664: 'BaseMFCIter<Item,Cont>::BaseMFCIter(Cont *,__POSITION (__thiscall CObList::* )(void) const,myCObject (__thiscall CObList::* )(Key &) const)' : cannot convert parameter 3 from 'overloaded-function' to 'myCObject (__thiscall CObList::* )(Key &) const'

Is there a workaround for this problem with overloaded function? 有关重载功能的问题是否有解决方法? If there is an analogue of std::find_if for MFC collections, please tell me. 如果有一个类似的std :: find_if用于MFC集合,请告诉我。

Here is a complete working fixed example based on your supplied test source: 这是一个基于您提供的测试源的完整的可修复固定示例:

Download links: 下载链接:

Here is the relevant ( changed ) code and test output 这是相关的( 更改的 )代码和测试输出

struct Container : public CObList
{
    myCObject* GetNext(POSITION& rPosition)       
    {
        return dynamic_cast<myCObject*>(CObList::GetNext(rPosition)); 
    }
    myCObject const* GetNext(POSITION& rPosition) const 
    {
        return dynamic_cast<const myCObject*>(CObList::GetNext(rPosition));
    }
};


class ListIter : public BaseMFCIter < const myCObject*, Container, POSITION  >
{
public:
    ListIter( Container* pObj = 0)  
        : BaseMFCIter< const myCObject*, Container, POSITION >
            (pObj, &CObList::GetHeadPosition, &Container::GetNext)
    {
    }
};

void main( )
{
    myCObject* m = new myCObject( 1 );
    myCObject* n = new myCObject( 2 );
    myCObject* p = new myCObject( 3 );
    myCObject* q = new myCObject( 4 );

    Container cont;
    cont.AddHead( m );
    cont.AddHead( n );
    cont.AddHead( p );
    cont.AddHead( q );

    POSITION pos = cont.GetHeadPosition( );

    while (pos != NULL)
    {
        const myCObject& item = *cont.GetNext( pos );
        std::cout << "Oldfashioned: " << item.x << std::endl;
    }

    for (ListIter it=ListIter(&cont); it!= ListIter(); ++it)
    {
        std::cout << "Newfangled: " << it->x << std::endl;
    }
}

The output: 输出:

Oldfashioned: 4
Oldfashioned: 3
Oldfashioned: 2
Oldfashioned: 1
Newfangled: 4
Newfangled: 3
Newfangled: 2
Newfangled: 1

As you can see I 如你所见

  • Extended the Container derived class with strongtyped accessors ( todo : you may want to add other CObList::* interface members, such as GetAt(...) ) 强类型访问器扩展了Container派生类( todo :您可能要添加其他CObList::*接口成员,例如GetAt(...)

  • fixed the instantiation of BaseMFCIter template from 修复了BaseMFCIter模板的实例化

      BaseMFCIter < myCObject, Container, POSITION > 

    to

      BaseMFCIter < const myCObject*, Container, POSITION > 
  • Included an STL-standard style loop to main to demo that it works. 包括一个STL标准样式环路main演示它的工作原理。

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM