线性容器

/* 线性容器 */


#include<iostream>
#include<cstdlib>
#include<array>// 栈上的数组
#include<vector>// 堆上的数组
#include<list>// 双链表
#include<algoruthm>// 算法

using namespace std;

// 仿函数，重载(),把对象名当作函数，加上模板可以适用于任何数据类型
// 仿函数和容器无关
template<class T>
class show
{
public:
    void operator()(const T & t)
    {
        cout << t << endl;
    }
};

void main()
{
    array<int,5> myarray = {1,2,3,4,5};
    
    //myarray[1];
    
    show<int> myshow;
    for (int i=0;i<5;i++)
    {
        myshow(myarray[i]);
    }

    for(auto i : myarray)
    {
        cout << i << endl;    
    }
    
    for_each(myarray.bengin(),myarray.end(),myshow);// 算法 迭代器 仿函数 一起发挥ide作用
    for_each(myarray.bengin(),myarray.end(),show<int>());// 仿函数的形式


    array<char *,5> mystrs = {"hello","world","run","down","go"};
    for_each(mystrs.bengin(),mystrs.end(),show<char*>());// 仿函数的形式
    cin.get();
}

//-----------------------------------------------------------------------------


template<class T>
void print(const T & t)
{
    cout << t << endl;
}


void main()
{

    vector<char*> myv = {"hello","world","run","down","go"};
    
    for_each(myv.bengin(),myv.end(),show<char*>());// 仿函数的形式


    list<int> mylist = {1,2,3,4,5};
    for_each(mylist.bengin(),mylist.end(),show<int>());
    for_each(mylist.bengin(),mylist.end(),[](int num){cout << num << endl;});
    for_each(mylist.bengin(),mylist.end(),print<int>);

    // for_each 适用于任何容器,任何容器都有迭代器，算法依赖于策略
    cin.get();

}

//-----------------------------------------------------------------------------

void main()
{
    vector<char*> myv = {"hello","world","run","down","go"};
    list<int> mylist = {1,2,3,4,5,6,7，8,10};

{
    // find  寻找相等的
    auto i = find(mylist.begin(),mylist.end(),8);
    
    if(i != mylist.end())// end() 为空
    {
        cout << "不存在" << endl;
    }
    else
    {
        cout << *i << endl;
    }
}


{
    // find  寻找相等的
    auto i = find(myv.begin(),myv.end(),"go");
    
    if(i != myv.end())// end() 为空
    {
        cout << "不存在" << endl;
    }
    else
    {
        cout << *i << endl;
    }
}


}

//-----------------------------------------------------------------------------

bool isdiv5(int x)
{
    return x%5?0:1;
}

struct isdivfive// 仿函数
{
    bool operator ()(int x)
    {
        return x%5?0:1;
    }
};

void main()
{
    vector<int> myv = {1,2,3,4,5,6,7,10};
    auto i = find_if(myv.begin(),myv.end(),isdiv5)
    
    if(i != myv.end())
    {
        cout << *i << endl;    
    }

    else
    {
        cout << "找不到" << endl;
    }
    
    auto j = find_if(i+1,my.end(),isdiv5)
    
    if(j != myv.end())
    {
        cout << *j << endl;    
    }

    else
    {
        cout << "找不到" << endl;
    }

// 仿函数演示

    auto i = find_if(myv.begin(),myv.end(),isdivfive())
    
    if(i != myv.end())
    {
        cout << *i << endl;    
    }

    else
    {
        cout << "找不到" << endl;
    }
    
    auto j = find_if(i+1,my.end(),isdivfive())
    
    if(j != myv.end())
    {
        cout << *j << endl;    
    }

    else
    {
        cout << "找不到" << endl;
    }

    cin.get();
}


//-----------------------------------------------------------------------------

// 根据x*y  比较大小
struct  MyStruct
{
    int x;
    int y;

    void operator()(const MyStruct & my)
    {
        cout << my.x << "  " << my.y << endl;
    }
};



void main()
{

    vector<MyStruct> myv = {{32,5},{2,4},{1,2},{3,5},{8,5},{6,5}};
    
    for_each(myv.begin(),myv.end(),MyStruct());

{
    vector<int> myv = {1,2,3,4,5,6,7,10};
    auto i = find_if(myv.begin(),myv.end(),isdivfive())
    sort(myv.begin(),myv.end(),print<int>);
}
    cin.get();
}