StatisticsPacket*
SMSReader::createStatisticsPacket() {
// Get the current statistics value
uint32 curStat = getQueueLength();
// Create the statistics packet that will be returned
return new SMSStatisticsPacket( m_ownAddr,
*getLoadedMaps(),
curStat,
numberOfPhones,
phoneNumbers,
numberOfServices,
serviceNames );
}
int qPrint(Queue *q)
{
int i=getQueueLength(q);
Customer *c;
clearScreen();
do
{
c = queueRemove(q);
printBill(c);
wait();
if(c!=NULL)
queueInsert(q, c);
i--;
}while(i>0);
}
int main(){
//set up moves
Move moves[4] ={{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
//set up hash table
HashTable *hashTable;
HashTable *queueTable;
int tableSize = pow(SIZE, 9) - SIZE + 1;
int nos[SIZE * SIZE];
int g[SIZE * SIZE];
char *nums = (char *)calloc(SIZE * SIZE, sizeof(char));
//char nums[9] = {'7', '2', '4', '5', '6', '0', '8', '3', '1'};
nums = readData();
char *gl = (char *)calloc(SIZE * SIZE, sizeof(char));
//char gl[9] = {'2', '4', '1', '7', '8', '6', '5', '0', '3'};
gl = readData();
int i;
//converts char* to int*
for(i = 0; i < SIZE * SIZE; i++) nos[i] = (int)nums[i] - '0';
for(i = 0; i < SIZE * SIZE; i++) g[i] = (int)gl[i] - '0';
goal = (Board *)calloc(1, sizeof(Board));
insertTiles(goal, g);
setNumbers(goal);
start = (Board *)calloc(1, sizeof(Board));
insertTiles(start, nos);
setNumbers(start);
start->depth = 0;
printf("\nSTART:\n");
printBoard(start);
printf("\nGOAL:\n");
printBoard(goal);
Queue *queue;
Board *newBoard;
int f;
for (f = 0; f < 5; f++){
success = 0;
hashTable = (HashTable *)createHashTable(tableSize);
queueTable = (HashTable *)createHashTable(tableSize);
solution = (Board *)calloc(1, sizeof(Board));
Board *board = (Board *)calloc(1, sizeof(Board));
board = start;
switch(f){
case 0:
board->f = getH(board);
break;
case 1:
board->f = getHout(board);
break;
case 2:
board->f = getHmanhattan(board);
break;
case 3:
board->f = getHgreat2(board);
break;
case 4:
board->f = getHgreat3(board);
break;
default:
printf("error\n");
}
//set up queue
queue = (Queue *)createQueue();
int error;
if((error = insert(queue, board)) == 1){
printf("failed to insert starting board\n");
exit(1);
}
Node *current;
//Board *newBoard;
int m;
int fVal;
int tries = 0;
//iterate through queue until done
while(!success){
current = queue->head;
if((fVal = lookupBoard(hashTable, current->b)) == -1) {
if((error = addBoard(hashTable, current->b)) == 1) {
printf("failed to add board to hashtable\n");
exit(1);
}
//moves
for(m = 0; m < 4; m++){
if(!success) {
if((newBoard = makeBoardOnMove(current, moves[m], f)) != NULL){
if(newBoard->value == goal->value){
success = 1;
solution = newBoard;
}
if((fVal = lookupBoard(queueTable, newBoard)) == -1){
tries++;
if((error = insert(queue, newBoard)) == 1) {
printf("failed to insert new board\n");
exit(1);
}
if((error = addBoard(queueTable, newBoard)) == 1) {
printf("failed to add new Board to queuetable\n");
exit(1);
}
} else if(newBoard->f < fVal) {
tries++;
if((error = replace(queue, newBoard)) == 1) {
printf("failed to replace with new board\n");
exit(1);
}
error = addBoard(queueTable, newBoard);
} else {
free(newBoard);
}
}
}
}
}
pop(queue);
if(queue->head == NULL)printf("Empty Queue\n");
}
//print out results
printf("\nTRIES: %d\n", tries);
printf("COST: %d\n", solution->depth);
printf("EST. DIST. START TO GOAL: %d\n", start->f);
printf("\nSOLUTION: ");
printPath(solution);
int ql = getQueueLength(queue);
printf("QUEUE LEN: %d\n\n", ql);
freeQueue(queue);
free(queue);
free(hashTable);
free(queueTable);
hashTable = NULL;
queueTable = NULL;
queue = NULL;
}
return 1;
}
int qLength(Queue *q)
{
printf("\n\n\tThere are %d customers in the queue.", getQueueLength(q));
wait();
}
