scramble2.cpp

Scalable k-means software and test datasets This package (a Unix tar file, gzipped) contains the sou

/* Scalable K-means clustering software
Copyright (C) 2000  Fredrik Farnstrom and James Lewis

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.


See the file README.TXT for more information.

*/

/* scramble.cpp */

#include <stdio.h>
#include "permutation.h"

#define NUMDIMENSIONS 56
#define MAXPOINTS 100000

int main(int argc, char *argv[])
{
	long *fpos = new long[MAXPOINTS];
	float tmp;
	int i;
	long k, numpoints, m;
	Permutation *p;
	FILE *f, *f2;

	f = fopen("cup98.dat", "r");
	if(!f)
	{	fprintf(stderr, "Error: Can't open 'cup98.dat'.\n");
		delete []fpos;
		return 1;
	}

	f2 = fopen("cup98data.dat", "w");
	if(!f)
	{	fprintf(stderr, "Error: Can't open 'cup98data.dat' for writing.\n");
		delete []fpos;
		fclose(f);
		return 1;
	}

	numpoints = 0;
	while(!feof(f))
	{
		printf("%d\n", numpoints);
		fpos[numpoints++] = ftell(f);
		for(i = 0; i < NUMDIMENSIONS; i++)
			fscanf(f, "%f", &tmp);
	}

	p = new Permutation(numpoints);

	p->reset();
	for(k = 0; k < numpoints; k++)
	{
		m = p->getNumber();
		fseek(f, fpos[m], SEEK_SET);

		printf("%d %d\n", k, m);
		for(i = 0; i < NUMDIMENSIONS; i++)
		{
			fscanf(f, "%f", &tmp);
			fwrite(&tmp, sizeof(float), 1, f2);
//			fprintf(f2, "%f ", tmp);
		}
//		fprintf(f2, "\n");
	}

	delete p;

	fclose(f);
	fclose(f2);

	delete []fpos;

	return 0;
}