C++ (Cpp) destroyNodes示例

示例#1

文件： BST.c 项目： GHScan/DailyProjects

static void 
destroyNodes(BST_T *o, Node_T *n) {
    if (n == o->guard) return;
    if (n->left) destroyNodes(o, n->left);
    if (n->right) destroyNodes(o, n->right);
    free(n);
}

示例#2

文件： LinkedList.cpp 项目： 3588/au-cs230

void LinkedList<NodeType>::resetList()
{
	destroyNodes();
	firstNode = NULL;
	lastNode = NULL;
	nodeCount = 0;

	return;
}

示例#3

文件： BST.c 项目： GHScan/DailyProjects

void            
BST_destroy(BST_T **p) {
    assert(p && *p && (*p)->type == TYPE);

    BST_T *o = *p;
    destroyNodes(o, o->root);
    free(o->guard);
    free(o);

    *p = 0;
}

示例#4

文件： tsClient.cpp 项目： amitprat/IMSDEV

int main(int argc, char* argv[]) 
{
    tsClient client;
    client.numNodes = 5;
    createConfig(client.nodes,client.indexMap,NUM_NODES,client.nodeController);
    readConfig(client.nodes,client.numNodes);
    client.clientSetup();
    client.startConnection();
    writeConfig(client.nodes,client.numNodes,client.indexMap);
    destroyNodes(client.nodes);
    return 0;
}

示例#5

文件： test_container.cpp 项目： xiaokang-huang/hq-lib

void test_container::TC_01_01() {
#define NODENUM 6
	HQTreeNode* pnodes = createNodes(NODENUM, 0);
	CPPUNIT_ASSERT(NULL != pnodes);

	assembleTree0(pnodes);
	checkSubtree0(pnodes, __FUNCTION__);
	deassembleTree(pnodes, __FUNCTION__);

	destroyNodes(pnodes, NODENUM);
#undef NODENUM
}

示例#6

文件： trieTree.c 项目： ajay/Systems

void destroyNodes(trieNodePointer root)
{
	int childrenCount = 0;
	for (int i=0; i<36; i++)
	{
		if (root->children[i] != NULL)
			childrenCount++;
	}

	if (childrenCount > 0)
	{
		for (int i=0; i<36; i++)
		{
			if (root->children[i] != NULL)
			{
				destroyNodes(root->children[i]);
			}
		}
	}

	free(root);
	root = NULL;
}

示例#7

文件： test_container.cpp 项目： xiaokang-huang/hq-lib

void test_container::TC_01_04() {
#define NODENUM 12
	HQTreeNode* pnodes = createNodes(NODENUM, 0);
	CPPUNIT_ASSERT(NULL != pnodes);
	HQTreeNode* ptree1 = pnodes;
	HQTreeNode* ptree2 = pnodes + 6;

	assembleTree1(ptree1);
	checkSubtree1(ptree1, __FUNCTION__);
	assembleTree1(ptree2);
	checkSubtree1(ptree2, __FUNCTION__);

	ptree2->Attach(ptree1 + 0, ptree1 + 3);

	test_nodes nodes[] = {
			{	ptree1 + 0, NULL, ptree1 + 2, NULL, NULL, NULL, ptree1 + 2, ptree1 + 1	},
			{	ptree1 + 1, ptree1 + 0, NULL, ptree1 + 4, NULL, ptree1 + 3, NULL, NULL	},
			{	ptree1 + 2, ptree1 + 0, ptree2 + 0, ptree1 + 0, ptree2 + 0, NULL, NULL, NULL	},
			{	ptree1 + 3, ptree1 + 0, ptree1 + 5, ptree2 + 1, ptree1 + 1, ptree2 + 0, ptree1 + 5, ptree1 + 4	},
			{	ptree1 + 4, ptree1 + 3, ptree1 + 1, ptree1 + 5, NULL, ptree1 + 5, NULL, NULL	},
			{	ptree1 + 5, ptree1 + 3, ptree1 + 4, ptree1 + 3, ptree1 + 4, NULL, NULL, NULL	},

			{	ptree2 + 0, ptree1 + 0, ptree2 + 2, ptree1 + 2, ptree1 + 3, ptree1 + 2, ptree2 + 2, ptree2 + 1	},
			{	ptree2 + 1, ptree2 + 0, ptree1 + 3, ptree2 + 4, NULL, ptree2 + 3, NULL, NULL	},
			{	ptree2 + 2, ptree2 + 0, ptree2 + 3, ptree2 + 0, ptree2 + 3, NULL, NULL, NULL	},
			{	ptree2 + 3, ptree2 + 0, ptree2 + 5, ptree2 + 2, ptree2 + 1, ptree2 + 2, ptree2 + 5, ptree2 + 4	},
			{	ptree2 + 4, ptree2 + 3, ptree2 + 1, ptree2 + 5, NULL, ptree2 + 5, NULL, NULL	},
			{	ptree2 + 5, ptree2 + 3, ptree2 + 4, ptree2 + 3, ptree2 + 4, NULL, NULL, NULL	},
	};
	check_nodelist(&(nodes[0]), sizeof(nodes) / sizeof(test_nodes), __FUNCTION__);

	deassembleTree(ptree2, __FUNCTION__);
	deassembleTree(ptree1, __FUNCTION__);

	destroyNodes(pnodes, NODENUM);
#undef NODENUM
}

示例#8

文件： LinkedList.cpp 项目： 3588/au-cs230

LinkedList<NodeType>::~LinkedList()
{
	destroyNodes();	
}

示例#9

文件： trieTree.c 项目： ajay/Systems

void destroy()
{
	destroyFiles(ROOT);
	destroyNodes(ROOT);
}