zoukankan      html  css  js  c++  java
  • C++ fill fill_n generate generate_n

    #include <iostream>
    #include <algorithm>
    #include <vector>
    #include <list>
    #include <string>
    #include <functional>
    #include<iterator>

    using namespace std;


    int main()
    {
      list<string> list1;
      list1.push_back("A");
      list1.push_back("B");
      list1.push_back("C");

      list<string>::iterator list_iter1;
      for (list_iter1 = list1.begin(); list_iter1 != list1.end(); ++list_iter1)
      {
        cout << *list_iter1 << " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;

      fill(list1.begin(), list1.end(), "D");
      for (list_iter1 = list1.begin(); list_iter1 != list1.end(); ++list_iter1)
      {
        cout << *list_iter1 << " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;

      list<string> list2;
      for (int k=0;k<12;k++)
      {
        list2.push_back("E");
      }

      list<string>::iterator list_iter2;
      for (list_iter2 = list2.begin(); list_iter2 != list2.end(); ++list_iter2)
      {
        cout << *list_iter2 << " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;


      fill_n(list2.begin(), 9, "F");
      for (list_iter2 = list2.begin(); list_iter2 != list2.end(); ++list_iter2)
      {
        cout << *list_iter2 << " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;

      list<int> list3;
      generate_n(back_inserter(list3), 5, rand);

      list<int>::iterator list_iter3;
      for (list_iter3 = list3.begin(); list_iter3 != list3.end(); ++list_iter3)
      {
        cout << *list_iter3<< " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;

      generate(list3.begin(), list3.end(), rand);
      for (list_iter3 = list3.begin(); list_iter3 != list3.end(); ++list_iter3)
      {
        cout << *list_iter3 << " ";
      }
      cout << endl;
      cout << "------------------------------------------" << endl;

      system("pause");
      return 0;
    }

    ====================================================

    A B C
    ------------------------------------------
    D D D
    ------------------------------------------
    E E E E E E E E E E E E
    ------------------------------------------
    F F F F F F F F F E E E
    ------------------------------------------
    41 18467 6334 26500 19169
    ------------------------------------------
    15724 11478 29358 26962 24464
    ------------------------------------------
    请按任意键继续. . .

  • 相关阅读:
    【转】构建高并发高可用的电商平台架构实践
    【转】深入解析浏览器的幕后工作原理
    【转】解释器,树遍历解释器,基于栈与基于寄存器
    EasyDarwin返回401 Unauthorized解决方法
    【转】SDP file
    音频PCM格式
    H264相关知识
    testNG之异常测试
    testNG之组测试
    testNG之顺序执行
  • 原文地址:https://www.cnblogs.com/herd/p/11010268.html
Copyright © 2011-2022 走看看