⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 sorted.cpp

📁 希望我提供的代码对大家有帮助
💻 CPP
字号:
//: C19:Sorted.cpp

// From Thinking in C++, 2nd Edition

// Available at http://www.BruceEckel.com

// (c) Bruce Eckel 1999

// Copyright notice in Copyright.txt

// Testing template specialization

#include "Sorted.h"

#include "Urand.h"

#include "../arraySize.h"

#include <iostream>

#include <string>

using namespace std;



char* words[] = {

  "is", "running", "big", "dog", "a",

};

char* words2[] = {

  "this", "that", "theother",

};



int main() {

  Sorted<int> is;

  Urand<47> rand;

  for(int i = 0; i < 15; i++)

    is.push_back(rand());

  for(int l = 0; l < is.size(); l++)

    cout << is[l] << ' ';

  cout << endl;

  is.sort();

  for(int l = 0; l < is.size(); l++)

    cout << is[l] << ' ';

  cout << endl;



  // Uses the template partial specialization:

  Sorted<string*> ss;

  for(int i = 0; i < asz(words); i++)

    ss.push_back(new string(words[i]));

  for(int i = 0; i < ss.size(); i++)

    cout << *ss[i] << ' ';

  cout << endl;

  ss.sort();

  for(int i = 0; i < ss.size(); i++)

    cout << *ss[i] << ' ';

  cout << endl;

  

  // Uses the full char* specialization:

  Sorted<char*> scp;

  for(int i = 0; i < asz(words2); i++)

    scp.push_back(words2[i]);

  for(int i = 0; i < scp.size(); i++)

    cout << scp[i] << ' ';

  cout << endl;

  scp.sort();

  for(int i = 0; i < scp.size(); i++)

    cout << scp[i] << ' ';

  cout << endl;

} ///:~

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -