aboutsummaryrefslogblamecommitdiffstats
path: root/src/tree.h
blob: 76a980cd2df19c68ffc067e6cce4eb78488db432 (plain) (tree)
1
2
                                
                                                                   


























































                                                                               
/* the Music Player Daemon (MPD)
 * Copyright (C) 2006-2007 by Warren Dukes (warren.dukes@gmail.com)
 * This project's homepage is: http://www.musicpd.org
 *
 * 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
 */

#ifndef TREE_H
#define TREE_H

typedef struct _Tree Tree;
typedef struct _TreeNode TreeNode;
typedef struct _TreeIterator TreeIterator;
typedef struct _TreeKeyData TreeKeyData;

struct _TreeIterator
{
	Tree * tree;
	TreeNode * node;
	int which;
};

struct _TreeKeyData
{
	void * key;
	void * data;
};

typedef int (*TreeCompareKeyFunction)(const void * key1, const void * key2);
typedef void (*TreeFreeFunction)(void * data);

Tree * MakeTree(TreeCompareKeyFunction compareFunc, 
		TreeFreeFunction freeKey,
		TreeFreeFunction freeData);
void FreeTree(Tree * tree);

int GetTreeSize(Tree * tree);

void SetTreeIteratorToBegin(Tree * tree, TreeIterator * iter);
int IsTreeIteratorAtEnd(const TreeIterator * iter);
void IncrementTreeIterator(TreeIterator * iter);

TreeKeyData GetTreeKeyData(TreeIterator * iter);

int InsertInTree(Tree * tree, void * key, void * data);
int RemoveFromTreeByKey(Tree * tree, void * key);
void RemoveFromTreeByIterator(Tree * tree, TreeIterator * iter);

int FindInTree(Tree * tree, void * key, TreeIterator * iter /* can be NULL */);

#endif