Annotation of OpenXM_contrib/TiGERS_0.9/gset.h, Revision 1.1
1.1 ! maekawa 1: /*
! 2: ** gset.h Birk Huber, 4/99
! 3: ** -- header file with definitions and basic operations on gsets
! 4: **
! 5: **
! 6: ** TiGERS, Toric Groebner Basis Enumeration by Reverse Search
! 7: ** copyright (c) 1999 Birk Huber
! 8: **
! 9: */
! 10: #include "binomial.h"
! 11:
! 12: typedef struct gset_tag *gset;
! 13:
! 14: struct gset_tag{
! 15: int id,nfacets,nelts,deg;
! 16: binomial bottom;
! 17: binomial cache_edge;
! 18: struct gset_tag *cache_vtx;
! 19: struct gset_tag *next;
! 20: };
! 21:
! 22: #define gset_first(g) (g->bottom)
! 23: #define gset_cache_vtx(g) (g->cache_vtx)
! 24: #define gset_cache_edge(g) (g->cache_edge)
! 25: #define gset_nelts(g) (g->nelts)
! 26: #define gset_nfacets(g) (g->nfacets)
! 27: #define gset_id(g) (g->id)
! 28: #define gset_deg(g) (g->deg)
! 29: gset gset_new();
! 30: void gset_free(gset g);
! 31: int gset_read(FILE *is,gset g);
! 32: void gset_print(FILE *of,gset g);
! 33: void gset_init_print(FILE *of,gset g);
! 34: void gset_insert(gset g, binomial b);
! 35: binomial gset_downedge(gset g);
! 36: gset gset_flip(gset g1, binomial b);
! 37: void gset_autoreduce();
! 38: int gset_isfacet(gset g,binomial b);
! 39: void gset_setfacets(gset g);
! 40: gset gset_toric_ideal(int **,int,int);
! 41: void gset_rgb(gset g, int (*comp)(monomial,monomial));
! 42:
! 43:
! 44:
! 45:
! 46:
! 47:
! 48:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>