博客

/*
 * GList.h
 *
 *  Created on: Oct 19, 2015
 *      Author: chris
 */

#ifndef GLIST_H_
#define GLIST_H_

#include<iostream>

typedef int AtomType;
enum ElemTag{ATOM, LIST};

struct GLNode{
	ElemTag tag;
	union{
		AtomType atom;
		GLNode * subL;
	};
	GLNode * next;
	GLNode(ElemTag _tag = ATOM):
		tag(_tag), next(NULL) {}
};

typedef GLNode * GList;

bool GListCreate(GList & L);
void GListDestroy(GList & L);
bool GListCopy(GList & from, GList & to);

int  GListLength(GList & L);
bool GListEmpty(GList & L);
int  GListDepth(GList & L);

bool GListInsertAtomAt(GList & L, int pos, AtomType a);
bool GListInsertSubLAt(GList & L, int pos);

bool GListGetAtomAt(GList & L, int pos, AtomType & a);
bool GListGetSubLAt(GList & L, int pos, GList & subL);

bool GListTraverse(GList & L, bool (*visit)(AtomType &));

void GListWalkThrough(GList &L);

#endif /* GLIST_H_ */

/*
 * GList.cpp
 *
 *  Created on: Oct 19, 2015
 *      Author: chris
 */

#include"GList.h"
#include<iostream>

using namespace std;


bool GListCreate(GList & L)
{
	if(L != NULL) delete L;
	L = new GLNode;
	if(!L) return false;

	return true;
}

void GListDestroy(GList & L)
{
	GLNode * pcur = NULL;
	while(L) {
		// detac