~ubuntu-branches/ubuntu/lucid/graphviz/lucid-updates

« back to all changes in this revision

Viewing changes to lib/filter/btree.h

  • Committer: Bazaar Package Importer
  • Author(s): Bryce Harrington
  • Date: 2008-06-19 20:23:23 UTC
  • mfrom: (1.2.5 upstream)
  • Revision ID: james.westby@ubuntu.com-20080619202323-ls23h96ntj9ny94m
Tags: 2.18-1ubuntu1
* Merge from debian unstable, remaining changes:
  - Build depend on liblualib50-dev instead of liblua5.1-0-dev.
  - Drop libttf-dev (libttf-dev is in universe) (LP: #174749).
  - Replace gs-common with ghostscript.
  - Build-depend on python-dev instead of python2.4-dev or python2.5-dev.
  - Mention the correct python version for the python bindings in the
    package description.

Show diffs side-by-side

added added

removed removed

Lines of Context:
 
1
/* $Id: btree.h,v 1.2 2008/02/26 16:43:51 arif Exp $ $Revision: 1.2 $ */
 
2
/* vim:set shiftwidth=4 ts=8: */
 
3
 
 
4
/**********************************************************
 
5
*      This software is part of the graphviz package      *
 
6
*                http://www.graphviz.org/                 *
 
7
*                                                         *
 
8
*            Copyright (c) 1994-2004 AT&T Corp.           *
 
9
*                and is licensed under the                *
 
10
*            Common Public License, Version 1.0           *
 
11
*                      by AT&T Corp.                      *
 
12
*                                                         *
 
13
*        Information and Software Systems Research        *
 
14
*              AT&T Research, Florham Park NJ             *
 
15
**********************************************************/
 
16
 
 
17
#ifndef BTREE_H
 
18
#define BTREE_H
 
19
#include "tvnodes.h"
 
20
 
 
21
btree_node* new_node(char* attribute,char* regex, float min, float max);
 
22
int insert_node (btree_node* parent_n,btree_node* n);
 
23
int delete_node(btree_node* n);
 
24
int delete_node_recursive(btree_node* n);       //internal function
 
25
btree_node* look_up_node_with_string(btree_node* n,char* string_to_lookup);
 
26
int validate_lookup(btree_node* n,char* string_to_lookup);      //it can be anything, in this case attr_name
 
27
int print_tree(btree_node* root);
 
28
int print_children(btree_node* n);
 
29
btree_node* tree_from_filter_string(char* filter_string);
 
30
int evaluate_filter_atom(char* string,btree_node* Nodes[],char* op);
 
31
int evaluate_expresions(tv_node* Node,btree_node* root);
 
32
#endif