set-find

最新推荐文章于 2024-04-06 15:55:38 发布

迪迦 • 奥特曼

最新推荐文章于 2024-04-06 15:55:38 发布

阅读量1k

点赞数

分类专栏： STL

干啥啥不行，吃饭第一名。吃饭不积极，脑子有问题。

本文链接：https://blog.csdn.net/qwq1503/article/details/80138737

版权

STL 专栏收录该内容

123 篇文章 1 订阅

订阅专栏


//      2018/04/28 18:53:08
//      set-find

// find a given element
#include <iostream>
#include <set>
#include <iomanip>
#include <string>

using namespace std;

template<class T>
class Member{
private:
    T first, last;
public:
    Member(T l, T f) :first(f), last(l){}
    void print() const{
        cout.setf(ios::left);
        cout << setw(15) << first << " " << last << endl;
    }

        friend bool operator <(const Member& m1, const Member& m2){
        return m1.last < m2.last;
    }
    friend bool operator == (const Member& m1, const Member& m2){
        return m1.last == m2.last;
    }
};
//======================
int main(){

    typedef Member<string> M;
    typedef set<M, less<M>> S;
    M m("Forst", "Robert");
    S s;

    s.insert(m);
    s.insert(M("Smith", "John"));
    s.insert(M("Amstrong", "Bill"));
    s.insert(M("Bain", "Linda"));

    S::iterator it = s.begin();
    while (it != s.end()){
        (it++)->print();
    }

    it = s.find(m);
    if (it == s.end()){
        cout << "element is not found." << endl;
    }
    else{
        cout << "element is found:";
        (*it).print();
    }

    return 0;
};

/*
OUTPUT:
    Bill            Amstrong
    Linda           Bain
    Robert          Forst
    John            Smith
    element is found:Robert          Forst
*/