Logo Search packages:      
Sourcecode: zimpl version File versions  Download package

set4.h

#pragma ident "@(#) $Id: set4.h,v 1.9 2004/05/09 08:36:25 bzfkocht Exp $"
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*                                                                           */
/*   File....: set4.h                                                        */
/*   Name....: Set Functions                                                 */
/*   Author..: Thorsten Koch                                                 */
/*   Copyright by Author, All rights reserved                                */
/*                                                                           */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/*
 * Copyright (C) 2001 by Thorsten Koch <koch@zib.de>
 * 
 * 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 _SET4_H_
#define _SET4_H_

enum set_type {
   SET_ERROR   =  0,
   SET_EMPTY   =  1, /* dim = ?, Empty Set */
   SET_PSEUDO  =  2, /* dim = 0, Has only empty tuple as element */
   SET_LIST    =  3, /* dim = 1, Explicit enumeration of members */
   SET_RANGE   =  4, /* dim = 1, Range: Start to End by Increment */
   SET_PROD    =  5, /* dim > 1, Cross Product of two or more sets */
   SET_MULTI   =  6, /* dim > 1, Multidimensional Subset */
   SET_UNION   =  7, /* dim > 1, Union of two sets */
   SET_INTER   =  8, /* dim > 1, Intersection of two sets */
   SET_MINUS   =  9, /* dim > 1, Subtraction of two sets */
   SET_SYMDIFF = 10, /* dim > 1, Symetric difference of two sets */
   SET_TYPES   = 11  /* marker */
};

typedef enum set_type      SetType;
typedef struct set_vtab    SetVTab;

typedef struct set_empty   SetEmpty;
typedef struct set_pseudo  SetPseudo;
typedef struct set_head    SetHead;
typedef struct set_list    SetList;
typedef struct set_range   SetRange;
typedef struct set_prod    SetProd;
typedef struct set_multi   SetMulti;

typedef struct set_empty_iter   SetEmptyIter;
typedef struct set_pseudo_iter  SetPseudoIter;
typedef struct set_list_iter    SetListIter;
typedef struct set_range_iter   SetRangeIter;
typedef struct set_prod_iter    SetProdIter;
typedef struct set_multi_iter   SetMultiIter;

struct set_head
{
   int        refc;
   int        dim;
   int        members;
   SetType    type;
};

struct set_empty
{
   SetHead head;
   SID
};

struct set_pseudo
{
   SetHead head;
   SID
};

struct set_list
{
   SetHead head;   /** head.dim == 1 */
   int     size;
   Elem**  member; /** head.members gives the number */
   Hash*   hash;
   SID
};

struct set_range
{
   SetHead head;   /** head.dim == 1 */
   int     begin;
   int     end;
   int     step;
   SID
};

struct set_prod
{
   SetHead head;   /** head.dim > 1 */
   Set*    set_a;
   Set*    set_b;
   SID
};

struct set_multi
{
   SetHead  head;   /* head.dim > 1  */
   Set**    set;    /* dim times, type == SET_LIST */
   int*     subset; /* members * dim */
   int**    order;  /* dim * members */
   SID
};

union set
{
   SetHead    head;
   SetEmpty   empty;
   SetPseudo  pseudo;
   SetList    list;
   SetRange   range;
   SetProd    prod;
   SetMulti   multi;
};

struct set_empty_iter
{
   int dummy;
   SID
};

struct set_pseudo_iter
{
   Bool first;
   SID
};

struct set_list_iter
{
   int first;
   int last;
   int now;
   SID
};

struct set_range_iter
{
   int first;
   int last;
   int now;
   SID
};

struct set_prod_iter
{
   Bool     first;
   SetIter* iter_a;
   SetIter* iter_b;
   Elem**   elem;
   SID
};

struct set_multi_iter
{
   int  dim;
   int  members;
   int  now;
   int* subset;
   SID
};

union set_iter
{
   SetEmptyIter   empty;
   SetPseudoIter  pseudo;
   SetListIter    list;
   SetRangeIter   range;
   SetProdIter    prod;
   SetMultiIter   multi;
};

struct set_vtab
{
   void     (*set_free)      (Set* set);
   Set*     (*set_copy)      (const Set* set);
   Bool     (*set_is_valid)  (const Set* set);
   int      (*set_lookup_idx)(const Set* set, const Tuple* tuple, int offset);
   void     (*set_get_tuple) (const Set* set, int idx, Tuple* tuple, int offset);
   SetIter* (*iter_init)     (const Set* set, const Tuple* pattern, int offset);
   Bool     (*iter_next)     (SetIter* iter, const Set* set, Tuple* tuple, int offset);
   void     (*iter_exit)     (SetIter* iter, const Set* set);
   void     (*iter_reset)    (SetIter* iter, const Set* set);
};

#define SET_DEFAULT 0x0
#define SET_NO_HASH 0x1



#ifdef NDEBUG
extern SetVTab* set_vtab_global;
#endif

/* set4.c
 */
/*lint -sem(        set_lookup, 1p == 1 && 2p == 1 && 3n >= 0, @n >= -1) */
extern int          set_lookup_idx(const Set* set, const Tuple* tuple, int offset);
/*lint -sem(        set_get_tuple_intern, 1p == 1 && 2n >= 0 && 3p == 1 && 4n >= 0) */
extern void         set_get_tuple_intern(const Set* set, int idx, Tuple* tuple, int offset);
/*lint -sem(        set_iter_init_intern, 1p == 1 && 3n >= 0, @p == 1) */
extern SetIter*     set_iter_init_intern(const Set* set, const Tuple* pattern, int offset);
/*lint -sem(        set_iter_next_intern, 1p == 1 && 2p == 1 && 3p == 1 && 4n >= 0) */
extern Bool         set_iter_next_intern(SetIter* iter, const Set* set, Tuple* tuple, int offset);
/*lint -sem(        set_iter_exit_intern, custodial(1), 1p == 1 && 2p == 1) */
extern void         set_iter_exit_intern(SetIter* iter, const Set* set);
/*lint -sem(        set_iter_reset_intern, 1p == 1 && 2p == 1) */
extern void         set_iter_reset_intern(SetIter* iter, const Set* set);

/* setempty.c
 */
/*lint -sem(        set_empty_init, 1p == SET_TYPES) */
extern void         set_empty_init(SetVTab* vtab);
   
/* setpseudo.c
 */
/*lint -sem(        set_pseudo_init, 1p == SET_TYPES) */
extern void         set_pseudo_init(SetVTab* vtab);
   
/* setlist.c
 */
/*lint -sem(        set_list_init, 1p == SET_TYPES) */
extern void         set_list_init(SetVTab* vtab);
/*lint -sem(        set_list_new, 1n > 0 && 2n >= 0, @p == 1) */
extern Set*         set_list_new(int size, int flags);
/*lint -sem(        set_list_add_elem, 1p == 1 && 2p == 1, @n >= -1) */
extern int          set_list_add_elem(Set* set, const Elem* elem, SetCheckType check);
/*lint -sem(        set_list_new_from_elems, 1p == 1, @p == 1) */
extern Set*         set_list_new_from_elems(const List* list, SetCheckType check);
/*lint -sem(        set_list_new_from_tuples, 1p == 1, @p == 1) */
extern Set*         set_list_new_from_tuples(const List* list, SetCheckType check);
/*lint -sem(        set_list_new_from_entries, 1p == 1, @p == 1) */
extern Set*         set_list_new_from_entries(const List* list, SetCheckType check);
/*lint -sem(        set_list_get_elem, 1p == 1 && 2n >= 0, @p == 1) */
extern const Elem*  set_list_get_elem(const Set* set, int idx);

/* setrange.c
 */
/*lint -sem(        set_range_init, 1p == SET_TYPES) */
extern void         set_range_init(SetVTab* vtab);

/* setprod.c
 */
/*lint -sem(        set_prod_init, 1p == SET_TYPES) */
extern void         set_prod_init(SetVTab* vtab);

/* set multi.c
 */
/*lint -sem(        set_multi_init, 1p == SET_TYPES) */
extern void         set_multi_init(SetVTab* vtab);
/*lint -sem(        set_multi_new_from_list, 1p == 1, @p == 1) */
extern Set*         set_multi_new_from_list(const List* list, SetCheckType check);

#endif /* _SET4_H_ */











Generated by  Doxygen 1.6.0   Back to index