listing.cpp

来自「本程序给出了SSD5实验课中Exercise6的参考程序 内附有详细的注释 下载」· C++ 代码 · 共 133 行

#include "Listing.h"

using namespace std;

Advertisement* Listing::operator[](const int& number) {
	for(int i = 0; i < objects.size(); i++)				// if the advertisement is found
		if(objects[i]->getNumber() == number)			// return it 
			return objects[i];							// else return null
	return NULL;
}

void Listing::add(Advertisement* ptr) {
	objects.push_back(ptr);
}

Listing::iterator Listing::begin() {
	iterator i = objects.begin();
	return i;
}

Listing::iterator Listing::end() {
	iterator i = objects.end();
	return i;
}

/*######################## sort #####################*/
Listing Listing::sort(string field){

	Listing result;
	vector<Advertisement*> all = objects;
/* Sort by quantity */
	if(field == "quantity"){
		vector<int> v;				    
		for(int i = 0; i < all.size(); i++)
			v.push_back(all[i]->getQuantity());

		std::sort(v.begin(), v.end()); // use the vector's sort algorithm

		//use reverse_iterator in order to sort from big to small
		for(vector<int>::reverse_iterator rit = v.rbegin(); rit != v.rend(); rit++)
			for(vector<Advertisement*>::iterator it = all.begin(); it != all.end(); it++)
				if((*it)->getQuantity() == *rit){
					result.add(*it);
					all.erase(it);
					break;
				}
	}
/* Sort by email */
	else if(field == "email"){
		vector<string> v;  
		for(int i = 0; i < all.size(); i++)
			v.push_back(all[i]->getEmail());

		std::sort(v.begin(), v.end()); // use the vector's sort algorithm

		//use reverse_iterator in order to sort from big to small
		for(vector<string>::reverse_iterator rit = v.rbegin(); rit != v.rend(); rit++)
			for(vector<Advertisement*>::iterator it = all.begin(); it != all.end(); it++)
				if((*it)->getEmail() == *rit){
					result.add(*it);
					all.erase(it);
					break;
				}
	}
/* Sort by start date */
	else if(field == "start"){
		vector<Date> v; 
		for(int i = 0; i < all.size(); i++)
			v.push_back(all[i]->getStart());

		std::sort(v.begin(), v.end()); // use the vector's sort algorithm

		//use reverse_iterator in order to sort from big to small
		for(vector<Date>::reverse_iterator rit = v.rbegin(); rit != v.rend(); rit++)
			for(vector<Advertisement*>::iterator it = all.begin(); it != all.end(); it++)
				if((*it)->getStart() == *rit){
					result.add(*it);
					all.erase(it);
					break;
				}
	}
/* Sort by close date */
	else if(field == "close"){
		vector<Date> v; 
		for(int i = 0; i < all.size(); i++)
			v.push_back(all[i]->getClose());

		std::sort(v.begin(), v.end()); // use the vector's sort algorithm

		//use reverse_iterator in order to sort from big to small
		for(vector<Date>::reverse_iterator rit = v.rbegin(); rit != v.rend(); rit++)
			for(vector<Advertisement*>::iterator it = all.begin(); it != all.end(); it++)
				if((*it)->getClose() == *rit){
					result.add(*it);
					all.erase(it);
					break;
				}
	}

	return result;
}
/*####################### sort ######################*/


/*###################### filter #####################*/
static Listing result; //These two vaviables are visible only in this file.
static string key;     // this file. They connect filter and proccess
extern void proccess(Advertisement*&);

Listing Listing::filter(string keyword){
	if(keyword == "")
		return *this;

	key = keyword;
	result.objects.clear();

	for_each(begin(), end(), proccess);
	
	return result;
}

void proccess(Advertisement*& ad){

		string s1 = ad->getTitle();
		string s2 = ad->getBody();
		int index1 = s1.find(key);
		int index2 = s2.find(key);

		if(index1 != -1 || index2 != -1) 
			result.add(ad);
}
/*###################### filter #####################*/