C++ (Cpp) linkedListFreeの例

コード例 #1

ファイル: properties.c プロジェクト: gidish/PlanckDB

Properties propertiesCreate(char *filePath) {
    PropertiesInternal *m = (PropertiesInternal *) memoryAlloc(sizeof(PropertiesInternal));
    m->map = hashmapCreate(SMALL_CONTAINER_SIZE);
    FILE *fp;
    long len;
    char *buf;
    fp = fopen(filePath, "rt");
    if (fp == NULL) {
        printf("couldn't open the properties file");
    };
    fseek(fp, 0, SEEK_END);            //go to end
    len = ftell(fp);                    //get position at end (length)
    fseek(fp, 0, SEEK_SET);            //go to beg.
    buf = (char *) memoryAlloc(len + 1);        //malloc buffer
    long result = fread(buf, (size_t) (len + 1), 1, fp);            //read into buffer
    if (result < 0) {
        printf("Fail to read properties file .");
    }
    fclose(fp);
    buf[len] = 0;
    char *key;
    char *value;
    const char newLineDelimiter[] = "\n";
    const char spaseDelimiter[] = "=";
    char *token;
    token = strtok(buf, newLineDelimiter);
    LinkedList linkedList = linkedListCreate();
    while (token != NULL) {
        linkedListAddFirst(linkedList, token);
        token = strtok(NULL, newLineDelimiter);
    }
    while (linkedListSize(linkedList) > 0) {
        char *token = (char *) linkedListRemoveFirst(linkedList);
        key = strtok(token, spaseDelimiter);
        value = strtok(NULL, spaseDelimiter);
        unsigned int keyId = stringTransformToInt(key, strlen(key));
        hashmapPut(m->map, keyId, value);
    }
    linkedListFree(linkedList);

    return m;
}

コード例 #2

ファイル: navmesh_query.c プロジェクト: agersant/crystal

static void aStar( const BNavmesh *navmesh, const BTriangle *startTriangle, const BTriangle *endTriangle, const BVector *destination, BAStarOutput *output )
{
	assert( navmesh != NULL );
	assert( startTriangle != NULL );
	assert( endTriangle != NULL );
	assert( destination != NULL );
	assert( output != NULL );
	assert( isPointInsideNavmeshTriangle( navmesh, destination, endTriangle) );
	assert( startTriangle->connectedComponent == endTriangle->connectedComponent );

	BLinkedList openList, closedList;
	linkedListInit( &openList, sizeof( BAStarNode ), NULL );
	linkedListInit( &closedList, sizeof( BAStarNode ), NULL );

	BAStarNode startNode;
	startNode.cost = 0;
	startNode.previousTriangle = NULL;
	startNode.triangle = startTriangle;
	startNode.heuristic = heuristic( startNode.triangle, destination );
	linkedListPrepend( &openList, &startNode );

	BAStarNode arrivalNode;
	while ( 1 )
	{
		BAStarNode current;
		assert( !linkedListIsEmpty( &openList ) ); // TODO Handle case where no path exists
		linkedListGetHead( &openList, &current );
		linkedListRemoveHead( &openList );
		linkedListPrepend( &closedList, &current );

		if ( current.triangle == endTriangle )
		{
			arrivalNode = current;
			break;
		}

		for ( int neighborIndex = 0; neighborIndex < 3; neighborIndex++ )
		{
			const int neighborTriangleIndex = current.triangle->neighbours[neighborIndex];
			assert( neighborTriangleIndex < navmesh->numTriangles );
			if ( neighborTriangleIndex < 0 )
			{
				continue;
			}
			const BTriangle *neighborTriangle = &navmesh->triangles[neighborTriangleIndex];

			const float newCost = current.cost + movementCost( current.triangle, neighborTriangle );

			BAStarNode occurenceInOpenList;
			int inOpenList = linkedListFind( &openList, isTriangle, ( void * ) neighborTriangle, &occurenceInOpenList );
			if ( inOpenList )
			{
				if ( newCost < occurenceInOpenList.cost )
				{
					linkedListRemove( &openList, isTriangle, ( void * ) &current.triangle );
					inOpenList = 0;
				}
			}
			const int inClosedList = linkedListFind( &closedList, isTriangle, ( void * ) neighborTriangle, NULL );
			if ( !inOpenList && !inClosedList )
			{
				BAStarNode newNode;
				newNode.cost = newCost;
				newNode.triangle = neighborTriangle;
				newNode.heuristic = heuristic( newNode.triangle, destination );
				newNode.previousTriangle = current.triangle;
				linkedListInsertBefore( &openList, &newNode, hasBetterRank );
			}
		}
	}

	output->numTriangles = 0;
	{
		const BTriangle *currentTriangle = endTriangle;
		while ( currentTriangle != NULL )
		{
			assert( currentTriangle >= 0 );
			BAStarNode node;
			verify( linkedListFind( &closedList, isTriangle, ( void * ) currentTriangle, &node ) );
			currentTriangle = node.previousTriangle;
			output->numTriangles++;
		}
	}

	output->triangles = malloc( sizeof( BTriangle * ) * output->numTriangles );
	{
		int nextPathTriangleIndex = output->numTriangles - 1;
		const BTriangle *currentTriangle = endTriangle;
		while ( currentTriangle != NULL )
		{
			assert( currentTriangle >= 0 );
			assert( nextPathTriangleIndex >= 0 );
			assert( nextPathTriangleIndex < output->numTriangles );
			output->triangles[nextPathTriangleIndex] = currentTriangle;

			BAStarNode node;
			verify( linkedListFind( &closedList, isTriangle, ( void * ) currentTriangle, &node ) );
			currentTriangle = node.previousTriangle;
			nextPathTriangleIndex--;
		}
	}

	linkedListFree( &openList );
	linkedListFree( &closedList );

	assert( output->triangles[0] == startTriangle );
	assert( output->triangles[output->numTriangles - 1] == endTriangle );
}