面向对象程序设计（基于C++）1101 heteroQuene.cpp

要求

设计一个抽象类base，里面只有输出一个操作，然后设计三个派生类INT,CHAR,phoneNumber继承base来实现print操作。
然后要求设计一个存放Base指针的容器Hqueue来实现queue的基本操作，Base指针用于存放INT,CHAR,phoneNumber指针来实现多态性

考察

纯虚函数
继承
多态

头文件框架

#pragma once
#include<iostream>


class Base
{
private:
public:
    virtual void print()const = 0;
};

class INT:public Base
{
private:
    int num;
public:
    INT(int a);
    ~INT();
    void print()const;
};

class CHAR:public Base
{
private:
    char c;
public:
    CHAR(char b);
    ~CHAR();
    void print()const;
};


class PhoneNumber:public Base
{
private:
    std::string name;
    long long number;
public:
    PhoneNumber();
    ~PhoneNumber();
    void print()const;
    friend std::istream& operator>>(std::istream& in, PhoneNumber& P);
};


class Hqueue
{
private:
    Base** pb;
    int _capability;
    int _size;
public:
    Hqueue(int = 10);
    ~Hqueue();
    class bad_op
    {
    public:
        string type;
        bad_op();
    };

    bool isEmpty()const;
    void dequeue();
    void enqueue(Base*);
};

源文件实现

#include<iostream>
#include"heteroQueue.h"
using namespace std;

INT::INT(int a)
{
    num = a;
}
void INT::print()const
{
    cout << num << endl;
}

CHAR::CHAR(char c)
{
    this->c = c;
}
void CHAR::print()const
{
    cout << c << endl;
}

PhoneNumber::PhoneNumber()
{
    name = "";
    number = 0;
}
void PhoneNumber::print()const
{
    cout << "(" <<name << "," << number << ")" << endl;
}
istream& operator>>(istream&in ,PhoneNumber &p)
{
    in >> p.number;
    cout << "Please enter the name :"<<endl;
    in >> p.name;
    return in;
}


Hqueue::Hqueue(int a)
{
    _capability = a;
    _size = 0;
    pb = new Base*[a];
}
Hqueue::~Hqueue()
{
    delete pb;
}
bool Hqueue::isEmpty()const
{
    if(_size == 0)  return true;
    else return false;
}
void Hqueue::dequeue()
{
    if(_size == 0)
        throw bad_op{};
    else if(_size > 0)
    {
        pb[0]->print();
        for(int i = 0; i < _size - 1; i++)
        {
            pb[i] = pb[i+1];
        }
        _size--;
    }
}
void Hqueue::enqueue(Base* b)
{
    if(_size == _capability)
    {
        _capability *= 1.2;
        Base** temp = new Base*[_capability];
        for(int i = 0; i < _size; i++)
        {
            temp[i] = this->pb[i];
        }
        delete[] pb;
        pb = temp;
    }
    pb[_size++] = b;
}

Hqueue::bad_op::bad_op()
{
    type = "The queue is empty";
}