[bison.git] / src / relation.h

/* Binary relations.
   Copyright (C) 2002  Free Software Foundation, Inc.

   This file is part of Bison, the GNU Compiler Compiler.

   Bison 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, or (at your option)
   any later version.

   Bison 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 Bison; see the file COPYING.  If not, write to
   the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */


#ifndef RELATION_H_
# define RELATION_H_

/* Performing operations on graphs coded as list of adjacency.

   If GRAPH is a relation_t, then GRAPH[Node] is a list of adjacent
   nodes, ended with -1.  */

typedef short relation_node_t;
typedef relation_node_t *relation_nodes_t;
typedef relation_nodes_t *relation_t;


/* Report a RELATION that has SIZE vertices.  */
void relation_print (relation_t relatio, size_t size, FILE *out);

/* Compute the transitive closure of the FUNCTION on the RELATION with
   SIZE vertices.

   If RELATION (NODE-1, NODE-2) then on exit FUNCTION[NODE-1] was
   extended (unioned) with FUNCTION[NODE-2].  */
void relation_digraph (relation_t relation, size_t size, bitsetv *function);

/* Destructively transpose *R_ARG, of size N.  */
void relation_transpose (relation_t *R_arg, int n);

#endif /* ! RELATION_H_ */
Commit	Line	Data
0e4d5753 AD	1	/* Binary relations.
	2	Copyright (C) 2002 Free Software Foundation, Inc.
	3
	4	This file is part of Bison, the GNU Compiler Compiler.
	5
	6	Bison is free software; you can redistribute it and/or modify
	7	it under the terms of the GNU General Public License as published by
	8	the Free Software Foundation; either version 2, or (at your option)
	9	any later version.
	10
	11	Bison is distributed in the hope that it will be useful,
	12	but WITHOUT ANY WARRANTY; without even the implied warranty of
	13	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	14	GNU General Public License for more details.
	15
	16	You should have received a copy of the GNU General Public License
	17	along with Bison; see the file COPYING. If not, write to
	18	the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
	19	Boston, MA 02111-1307, USA. */
	20
	21
	22	#ifndef RELATION_H_
	23	# define RELATION_H_
	24
	25	/* Performing operations on graphs coded as list of adjacency.
	26
	27	If GRAPH is a relation_t, then GRAPH[Node] is a list of adjacent
	28	nodes, ended with -1. */
	29
	30	typedef short relation_node_t;
	31	typedef relation_node_t *relation_nodes_t;
	32	typedef relation_nodes_t *relation_t;
	33
	34
	35	/* Report a RELATION that has SIZE vertices. */
d33cb3ae	36	void relation_print (relation_t relatio, size_t size, FILE *out);
0e4d5753 AD	37
	38	/* Compute the transitive closure of the FUNCTION on the RELATION with
	39	SIZE vertices.
	40
	41	If RELATION (NODE-1, NODE-2) then on exit FUNCTION[NODE-1] was
	42	extended (unioned) with FUNCTION[NODE-2]. */
d33cb3ae	43	void relation_digraph (relation_t relation, size_t size, bitsetv *function);
0e4d5753 AD	44
0e4d5753 AD	45	/* Destructively transpose R_ARG, of size N. /
d33cb3ae	46	void relation_transpose (relation_t *R_arg, int n);
0e4d5753 AD	47
0e4d5753 AD	48	#endif /* ! RELATION_H_ */