sim_aux.cc

来自「经网络提出了一种基于蚁群聚类算法的径向基神经网络. 利用蚁群算法的并行寻优特征和」· CC 代码 · 共 79 行

/* $Id: sim_aux.cc,v 1.1 2006-08-09 15:20:54 jonathan Exp $
*/

#include "sim.h"

#ifdef DEBUG
bool debug;
#endif

bool contains (set<int> theSet, int theKey) 
{
	set<int>::const_iterator setIter = theSet.find(theKey);
	if (setIter == theSet.end())
		return false;
	return true;
}

bool contains (set<double> theSet, double theKey) 
{
	set<double>::const_iterator setIter = theSet.find(theKey);
	if (setIter == theSet.end())
		return false;
	return true;
}

void openInputFile (FILE *&fp, char *filename) 
{
	if ((fp = fopen(filename, "r")) == NULL)
	{
		printf("%s: file open error.\n", filename);
		exit (-1);
	}
}

void closeInputFile (FILE *&fp) 
{
	// for some reason, fclose hangs.
	fclose (fp);
}

void openOutputFile (FILE *&fp, char *prefix, char *suffix)
{
	char *filename;
	int fileLength = strlen(prefix)+strlen(suffix)+1;

	filename = new char [fileLength];
	memset (filename,0,fileLength);
	sprintf (filename, "%s%s", prefix, suffix);
	if ((fp = fopen(filename, "w")) == NULL)
	{
		printf("%s: file open error.\n", filename);
		exit (-1);
	}
	delete [] filename;
	//  return fp;
}

void openOutputFile (FILE *&fp, char *prefix, char *suffix, int round)
{
	char *filename;
	int fileLength = strlen(prefix)+strlen(suffix)+32;

	filename = new char [fileLength];
	memset (filename,0,fileLength);
	sprintf (filename, "%s%05d%s", prefix, round, suffix);
	if ((fp = fopen(filename, "w")) == NULL) 
	{
		printf("%s: file open error.\n", filename);
		exit (-1);
	}
	delete [] filename;
}

void closeOutputFile (FILE *fp)
{
	fclose (fp);
	fp = NULL;
}