rows.c File Reference

#include "sparse_int.h"

Include dependency graph for rows.c:

Go to the source code of this file.

Functions
ABC_NAMESPACE_IMPL_START sm_row *	sm_row_alloc ()
void	sm_row_free (sm_row *prow)
sm_row *	sm_row_dup (sm_row *prow)
sm_element *	sm_row_insert (sm_row *prow, int col)
void	sm_row_remove (sm_row *prow, int col)
sm_element *	sm_row_find (sm_row *prow, int col)
int	sm_row_contains (sm_row *p1, sm_row *p2)
int	sm_row_intersects (sm_row *p1, sm_row *p2)
int	sm_row_compare (sm_row *p1, sm_row *p2)
sm_row *	sm_row_and (sm_row *p1, sm_row *p2)
int	sm_row_hash (sm_row *prow, int modulus)
void	sm_row_remove_element (sm_row *prow, sm_element *p)
void	sm_row_print (FILE *fp, sm_row *prow)

Function Documentation

sm_row_alloc()

ABC_NAMESPACE_IMPL_START sm_row * sm_row_alloc

(

)

Definition at line 21 of file rows.c.

{
    register sm_row *prow;
 
#ifdef FAST_AND_LOOSE
    if (sm_row_freelist == NIL(sm_row)) {
    prow = ALLOC(sm_row, 1);
    } else {
    prow = sm_row_freelist;
    sm_row_freelist = prow->next_row;
    }
#else
    prow = ALLOC(sm_row, 1);
#endif
 
    prow->row_num = 0;
    prow->length = 0;
    prow->first_col = prow->last_col = NIL(sm_element);
    prow->next_row = prow->prev_row = NIL(sm_row);
    prow->flag = 0;
    prow->user_word = NIL(char);        /* for our user ... */
    return prow;
}

Here is the caller graph for this function:

sm_row_and()

sm_row * sm_row_and	(	sm_row *	p1,
		sm_row *	p2 )

Definition at line 247 of file rows.c.

{
    register sm_element *q1, *q2;
    register sm_row *result;
 
    result = sm_row_alloc();
    q1 = p1->first_col;
    q2 = p2->first_col;
    if (q1 == 0 || q2 == 0) return result;
    for(;;) {
    if (q1->col_num < q2->col_num) {
        if ((q1 = q1->next_col) == 0) {
        return result;
        }
    } else if (q1->col_num > q2->col_num) {
        if ((q2 = q2->next_col) == 0) {
        return result;
        }
    } else {
        (void) sm_row_insert(result, q1->col_num);
        if ((q1 = q1->next_col) == 0) {
        return result;
        }
        if ((q2 = q2->next_col) == 0) {
        return result;
        }
    }
    }
}

Here is the call graph for this function:

sm_row_compare()

int sm_row_compare	(	sm_row *	p1,
		sm_row *	p2 )

Definition at line 218 of file rows.c.

{
    register sm_element *q1, *q2;
 
    q1 = p1->first_col;
    q2 = p2->first_col;
    while(q1 != 0 && q2 != 0) {
    if (q1->col_num != q2->col_num) {
        return q1->col_num - q2->col_num;
    }
    q1 = q1->next_col;
    q2 = q2->next_col;
    }
 
    if (q1 != 0) {
    return 1;
    } else if (q2 != 0) {
    return -1;
    } else {
    return 0;
    }
}

sm_row_contains()

int sm_row_contains	(	sm_row *	p1,
		sm_row *	p2 )

Definition at line 165 of file rows.c.

{
    register sm_element *q1, *q2;
 
    q1 = p1->first_col;
    q2 = p2->first_col;
    while (q1 != 0) {
    if (q2 == 0 || q1->col_num < q2->col_num) {
        return 0;
    } else if (q1->col_num == q2->col_num) {
        q1 = q1->next_col;
        q2 = q2->next_col;
    } else {
        q2 = q2->next_col;
    }
    }
    return 1;
}

sm_row_dup()

sm_row * sm_row_dup

(

sm_row *

prow

)

Definition at line 82 of file rows.c.

{
    register sm_row *pnew;
    register sm_element *p;
 
    pnew = sm_row_alloc();
    for(p = prow->first_col; p != 0; p = p->next_col) {
    (void) sm_row_insert(pnew, p->col_num);
    }
    return pnew;
}

Here is the call graph for this function:

sm_row_find()

sm_element * sm_row_find	(	sm_row *	prow,
		int	col )

Definition at line 146 of file rows.c.

{
    register sm_element *p;
 
    for(p = prow->first_col; p != 0 && p->col_num < col; p = p->next_col)
    ;
    if (p != 0 && p->col_num == col) {
    return p;
    } else {
    return NIL(sm_element);
    }
}

sm_row_free()

void sm_row_free

(

sm_row *

prow

)

Definition at line 53 of file rows.c.

{
#if defined(FAST_AND_LOOSE) && ! defined(COLS)
    if (prow->first_col != NIL(sm_element)) {
    /* Add the linked list of row items to the free list */
    prow->last_col->next_col = sm_element_freelist;
    sm_element_freelist = prow->first_col;
    }
 
    /* Add the row to the free list of rows */
    prow->next_row = sm_row_freelist;
    sm_row_freelist = prow;
#else
    register sm_element *p, *pnext;
 
    for(p = prow->first_col; p != 0; p = pnext) {
    pnext = p->next_col;
    sm_element_free(p);
    }
    FREE(prow);
#endif
}

sm_row_hash()

int sm_row_hash	(	sm_row *	prow,
		int	modulus )

Definition at line 279 of file rows.c.

{
    register int sum;
    register sm_element *p;
 
    sum = 0;
    for(p = prow->first_col; p != 0; p = p->next_col) {
    sum = (sum*17 + p->col_num) % modulus;
    }
    return sum;
}

sm_row_insert()

sm_element * sm_row_insert	(	sm_row *	prow,
		int	col )

Definition at line 100 of file rows.c.

{
    register sm_element *test, *element;
 
    /* get a new item, save its address */
    sm_element_alloc(element);
    test = element;
    sorted_insert(sm_element, prow->first_col, prow->last_col, prow->length, 
            next_col, prev_col, col_num, col, test);
 
    /* if item was not used, free it */
    if (element != test) {
    sm_element_free(element);
    }
 
    /* either way, return the current new value */
    return test;
}

sm_row_intersects()

int sm_row_intersects	(	sm_row *	p1,
		sm_row *	p2 )

Definition at line 190 of file rows.c.

{
    register sm_element *q1, *q2;
 
    q1 = p1->first_col;
    q2 = p2->first_col;
    if (q1 == 0 || q2 == 0) return 0;
    for(;;) {
    if (q1->col_num < q2->col_num) {
        if ((q1 = q1->next_col) == 0) {
        return 0;
        }
    } else if (q1->col_num > q2->col_num) {
        if ((q2 = q2->next_col) == 0) {
        return 0;
        }
    } else {
        return 1;
    }
    }
}

sm_row_print()

void sm_row_print	(	FILE *	fp,
		sm_row *	prow )

Definition at line 308 of file rows.c.

{
    sm_element *p;
 
    for(p = prow->first_col; p != 0; p = p->next_col) {
    (void) fprintf(fp, " %d", p->col_num);
    }
}

sm_row_remove()

void sm_row_remove	(	sm_row *	prow,
		int	col )

Definition at line 126 of file rows.c.

{
    register sm_element *p;
 
    for(p = prow->first_col; p != 0 && p->col_num < col; p = p->next_col)
    ;
    if (p != 0 && p->col_num == col) {
    dll_unlink(p, prow->first_col, prow->last_col, 
                next_col, prev_col, prow->length);
    sm_element_free(p);
    }
}

sm_row_remove_element()

void sm_row_remove_element	(	sm_row *	prow,
		sm_element *	p )

Definition at line 297 of file rows.c.

{
    dll_unlink(p, prow->first_col, prow->last_col, 
            next_col, prev_col, prow->length);
    sm_element_free(p);
}