00001
00002
00003
00004
00005
00006
00007
00008
00009
00010 #ifndef SPARSE_H
00011 #define SPARSE_H
00012
00013
00014
00015
00016
00017 typedef struct sm_element_struct sm_element;
00018 typedef struct sm_row_struct sm_row;
00019 typedef struct sm_col_struct sm_col;
00020 typedef struct sm_matrix_struct sm_matrix;
00021
00022
00023
00024
00025
00026 struct sm_element_struct {
00027 int row_num;
00028 int col_num;
00029 sm_element *next_row;
00030 sm_element *prev_row;
00031 sm_element *next_col;
00032 sm_element *prev_col;
00033 char *user_word;
00034 };
00035
00036
00037
00038
00039
00040 struct sm_row_struct {
00041 int row_num;
00042 int length;
00043 int flag;
00044 sm_element *first_col;
00045 sm_element *last_col;
00046 sm_row *next_row;
00047 sm_row *prev_row;
00048 char *user_word;
00049 };
00050
00051
00052
00053
00054
00055 struct sm_col_struct {
00056 int col_num;
00057 int length;
00058 int flag;
00059 sm_element *first_row;
00060 sm_element *last_row;
00061 sm_col *next_col;
00062 sm_col *prev_col;
00063 char *user_word;
00064 };
00065
00066
00067
00068
00069
00070 struct sm_matrix_struct {
00071 sm_row **rows;
00072 int rows_size;
00073 sm_col **cols;
00074 int cols_size;
00075 sm_row *first_row;
00076 sm_row *last_row;
00077 int nrows;
00078 sm_col *first_col;
00079 sm_col *last_col;
00080 int ncols;
00081 char *user_word;
00082 };
00083
00084
00085 #define sm_get_col(A, colnum) \
00086 (((colnum) >= 0 && (colnum) < (A)->cols_size) ? \
00087 (A)->cols[colnum] : (sm_col *) 0)
00088
00089 #define sm_get_row(A, rownum) \
00090 (((rownum) >= 0 && (rownum) < (A)->rows_size) ? \
00091 (A)->rows[rownum] : (sm_row *) 0)
00092
00093 #define sm_foreach_row(A, prow) \
00094 for(prow = A->first_row; prow != 0; prow = prow->next_row)
00095
00096 #define sm_foreach_col(A, pcol) \
00097 for(pcol = A->first_col; pcol != 0; pcol = pcol->next_col)
00098
00099 #define sm_foreach_row_element(prow, p) \
00100 for(p = prow->first_col; p != 0; p = p->next_col)
00101
00102 #define sm_foreach_col_element(pcol, p) \
00103 for(p = pcol->first_row; p != 0; p = p->next_row)
00104
00105 #define sm_put(x, val) \
00106 (x->user_word = (char *) val)
00107
00108 #define sm_get(type, x) \
00109 ((type) (x->user_word))
00110
00111 extern sm_matrix *sm_alloc(), *sm_alloc_size(), *sm_dup();
00112 extern void sm_free(), sm_delrow(), sm_delcol(), sm_resize();
00113 extern void sm_write(), sm_print(), sm_dump(), sm_cleanup();
00114 extern void sm_copy_row(), sm_copy_col();
00115 extern void sm_remove(), sm_remove_element();
00116 extern sm_element *sm_insert(), *sm_find();
00117 extern sm_row *sm_longest_row();
00118 extern sm_col *sm_longest_col();
00119 extern int sm_read(), sm_read_compressed();
00120
00121 extern sm_row *sm_row_alloc(), *sm_row_dup(), *sm_row_and();
00122 extern void sm_row_free(), sm_row_remove(), sm_row_print();
00123 extern sm_element *sm_row_insert(), *sm_row_find();
00124 extern int sm_row_contains(), sm_row_intersects();
00125 extern int sm_row_compare(), sm_row_hash();
00126
00127 extern sm_col *sm_col_alloc(), *sm_col_dup(), *sm_col_and();
00128 extern void sm_col_free(), sm_col_remove(), sm_col_print();
00129 extern sm_element *sm_col_insert(), *sm_col_find();
00130 extern int sm_col_contains(), sm_col_intersects();
00131 extern int sm_col_compare(), sm_col_hash();
00132
00133 extern int sm_row_dominance(), sm_col_dominance(), sm_block_partition();
00134
00135 #endif