C++设计模式之工厂模式

代码在VC++ 6.0通过编译

//InitilizeFactory.h
#ifndef __INITILIZEFACTORY__
#define __INITILIZEFACTORY__

#include <iostream>
using namespace std;

class Car{
public:
    virtual void info()=0;
};



#include <iostream>

class Toyota:public Car{
public:
    virtual void info(){
        cout<<"This is Toyota car"<<endl;
    }
};

class Ford: public Car{
public:
    virtual void info(){
        cout<<"This is Ford car"<<endl;
    }
};


#endif

//FactoryHeader.h
#ifndef __FACTORYHEADER__
#define __FACTORYHEADER__

#include "InitilizeFactory.h"

class CarFactory{
public:
    CarFactory();
    virtual ~CarFactory();
    Car* requestCar();
    int getNumCarsInProduct() const;
protected:
    virtual Car* createCar() = 0;
private:
    int mNumCarsInproduct;
};

class ToyotaFactory : public CarFactory{
public:
private:
    virtual Car* createCar();
};

class FordFactory : public CarFactory{
public:
private:
    virtual Car* createCar();
};


#endif

//FactoryHeader.cpp
#include "FactoryHeader.h"
#include <vector>

CarFactory::CarFactory():mNumCarsInproduct(0)
{
}

CarFactory::~CarFactory()
{
    mNumCarsInproduct = 0;
}

Car* CarFactory::requestCar()
{
    mNumCarsInproduct++;
    return createCar();
}

int CarFactory::getNumCarsInProduct() const
{
    return mNumCarsInproduct;
}

Car* ToyotaFactory::createCar()
{
    return new Toyota();
}

Car* FordFactory::createCar()
{
    return new Ford();
}

CarFactory* getLeastBusyFactory(const vector<CarFactory*>& inFactories)
{
    if(inFactories.size() == 0)
        return NULL;
    CarFactory* bestSoFar = inFactories[0];
    for(size_t i=1;i<inFactories.size();i++)
    {
        if (inFactories[i]->getNumCarsInProduct() < bestSoFar->getNumCarsInProduct())
        {
            bestSoFar = inFactories[i];
        }
    }
    return bestSoFar;
}


int main(int argc,char** argv)
{
    vector<CarFactory*> factories;
    
    FordFactory* ff1 = new FordFactory();
    FordFactory* ff2 = new FordFactory();
    ToyotaFactory* tf1 = new ToyotaFactory();
    FordFactory* ff3 = new FordFactory();
    ToyotaFactory* tf2 = new ToyotaFactory();

    ff1->requestCar();
    ff2->requestCar();
    tf1->requestCar();
    ff3->requestCar();
    tf2->requestCar();

    factories.push_back(ff1);
    factories.push_back(ff2);
    factories.push_back(tf1);
    factories.push_back(ff3);
    factories.push_back(tf2);

    for (int i=0;i<10;i++)
    {
        CarFactory* currentFactory = getLeastBusyFactory(factories);
        Car* theCar = currentFactory->requestCar();
        theCar->info();
    }

    return 0;
}