如何使用迭代器和find / find_f在类的C ++向量中查找真实值

Question

我在尝试使类关联正常工作时遇到了麻烦。

我有一个矢量类对象，名为Items。 每个项目都有一个值，例如名称，价格等。在Items类中，有setter和getter来更改值并返回它们。

std::string choice; // users choice
ListOfOrders::iterator iter = orderList->end(); iter--; 
 // the last order inserted, ignore this this is used to get the last order so
 //we can pass the items to it (the order class has a vector of pointers
 //(items) that we are trying to pass to now.)

ListOfItems::iterator itemiter; // make the items iter
listItems(itemList); // function in the main that returns the list of items using the getters and a vector iterator.
while(choice != "x") // until the user quits
{
        // here is my prob, ofc, i can just compare the users entered choice of item (name) to the iterator because thats just returning a pointer to the class object, what i need to do it call the getName() getter from each of the objects and comparer that
    (*itemiter)->getName() = find (itemList->begin(), itemList->end(), choice);

    if (itemiter == itemList->end())
    {  
        std::cout << "sorry item not found please try again." << std::endl; 
    }
    else 
    {
        (*iter)->addItem(*itemiter); // pass the item object off to the order object's vector of items.
    }
}

我知道可以使用这样的东西（请参阅下面的内容（尚未编译，只是快速键入以给您一个想法））可以使用并且可以使用，但是必须有更好的方法对吗？

std::string choice; // users choice
cin >> choice;
ListOfOrders::iterator iter = orderList->end(); iter--; // the last order inserted
if(lookForItem(choice))
{
    std::cout << "Yes\n";
}
else
{
    std::cout << "no\n";
}

bool lookForItem(std::string choice)
{
    ListOfItems::iterator itemiter; // make the items iter

    itemiter = itemList->begin();
    while(itemiter != itemList->end())
    {
        if((*itemiter)->getName() == choice)
        {
            (*iter)->addItem(*itemiter);
        }
        iter++;
    }
    return false;
}

Answer 1

在现代C ++中，使用lambda相当简单：

auto it = std::find_if(itemList.begin(), itemList.end(),
                       [&choice](Item const & x) { return x.name == choice; } );

当然，将lambda作为传统谓词拼写起来并不难：

struct FindItemByName
{
  FindItemByName(std::string const & s) : choice(s) { }
  bool operator()(Item const & x) const { return x.name == choice; }
private:
  std::string const & choice;
};

ListOfItems::iterator it
  = std::find_if(itemList.begin(), itemList.end(), FindItemByName(choice));

Answer 2

与此类似的东西应该起作用：

#include <vector>
#include <algorithm>
#include <functional>

struct Item {
  std::string name;
  // two items are equal, when their name is equal
  bool operator==(const Item& x) { return name == x.name; }
};

struct Cmp_item_by_name { 
  bool operator()(const Item& x, const std::string& y) { return x == y; }
};

typedef std::vector<Item> Items;
Items items;

Items::const_iterator
findItem(const std::string& name) {
 return std::find_if(items.begin(), items.end(), std::bind2nd(Cmp_item_by_name(), name));
}

这将使用不推荐使用的bind2nd 。 只要您不了解，就不要使用它。 关于SO，我们有很多书籍。