category.cpp

SSD6卡耐基梅陇大学联系3答案 绝对正确 SSD6数据结构 是一门很重要的课程 希望对大家有帮助

#include "Category.h"
#include <assert.h>
istream &operator>>(istream &stream,Category &c)
{
	int parent;
	string name;
	stream>>parent>>name;
	c.setParent(parent);
	c.setName(name);
	return stream;
}
Category::Category():number(0),parent(0),name("")
{
}
Category::Category(int parent, string name):parent(parent),name(name)
{
}
int Category::getNumber(void)const
{
	return number;
}
int Category::getParent(void)const
{
	return parent;
}
string Category::getName(void)const
{
	return name;
}
void Category::setNumber(int number)
{
	this->number = number;
}
void Category::setParent(int parent)
{
	this->parent = parent;
}
void Category::setName(string name)
{
	this->name = name;
}
void Category::addSubCategory(Category	*pc)
{
	assert(pc!=NULL);
	sub_categories.push_back(pc);
}
vector<Category*>::iterator Category::subCategoriesBegin()
{
	return sub_categories.begin();
}
vector<Category*>::iterator Category::subCategoriesEnd()
{
	return sub_categories.end();
}
vector<int>::iterator Category::itemsBegin()
{
	return items.begin();
}
vector<int>::iterator Category::itemsEnd()
{
	return items.end();
}
void Category::addItem(int num_of_ad)
{
	items.push_back(num_of_ad);
}

void Category::findOfferings(Listing::iterator start, Listing::iterator finish, Listing &matches)
{
	//Maybe STL has an algorithm to do this job ,but I am unable to find it .
	// I use a loop to solve it
	Listing::iterator it = start;
	vector<int>::iterator it2 ;
	for(;it !=finish; it++)
		for(it2 = items.begin();it2 != items.end(); it2++)
			if((*it2) == (*it)->getNumber() )
				matches.add(*it);
}
void Category::findOfferingsRecursive(Listing::iterator start, Listing::iterator finish, Listing &matches)
{
	//a recursive method
	findOfferings(start,finish,matches);
	vector<Category*>::iterator it = subCategoriesBegin();
	for ( ;it != subCategoriesEnd();it++)
		(*it)->findOfferingsRecursive(start,finish,matches);
}
//Categories are considered equal if their identification numbers are equal.
bool Category::operator ==(const Category& rhs)
{
	return number == rhs.getNumber();
}