Back to index

tetex-bin  3.0
Functions
list_routines.c File Reference
#include "cpascal.h"
#include "list_routines.h"

Go to the source code of this file.

Functions

list cons (void *x, list L)
list list1 (void *x)
list list2 (void *x, void *y)
list append (list K, list L)
list append1 (list L, void *x)
av_list av_cons (int attr, int val, av_list L)
av_list av_list1 (int attr, int val)
av_list av_list2 (int attr, int val, int attr1, int val1)
av_list av_append (av_list K, av_list L)
av_list av_append1 (av_list L, int attr, int val)
in_list in_cons (int val, in_list N, in_list L)
in_list in_list1 (int val, in_list N)
in_list in_list2 (int val, in_list N, int val1, in_list N1)
in_list in_append (in_list K, in_list L)
in_list in_append1 (in_list L, int val, in_list N)
hash_list hash_cons (int x, int y, int new_class, int lig_z, hash_list L)
hash_list hash_list1 (int x, int y, int new_class, int lig_z)
hash_list hash_list2 (int x, int y, int new_class, int lig_z, int x1, int y1, int class1, int lig_z1)
hash_list hash_append (hash_list K, hash_list L)
hash_list hash_append1 (hash_list L, int x, int y, int new_class, int lig_z)
void init_queue (queue *q)
void append_to_queue (queue *q, void *content)

Function Documentation

list append ( list  K,
list  L 
)

Definition at line 61 of file list_routines.c.

{
if (K==NULL) return L;
return cons(K->contents, append(K->ptr, L));
}

Here is the call graph for this function:

Here is the caller graph for this function:

list append1 ( list  L,
void x 
)

Definition at line 68 of file list_routines.c.

{
return (append(L,list1(x)));
}

Here is the call graph for this function:

void append_to_queue ( queue q,
void content 
)

Definition at line 247 of file list_routines.c.

{
    if (q->front == NULL) {
        q->front = list1(content);
        q->tail = q->front;
    } else {
        q->tail->ptr = list1(content);
        q->tail = q->tail->ptr;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

av_list av_append ( av_list  K,
av_list  L 
)

Definition at line 114 of file list_routines.c.

{
if (K==NULL) return L;
return av_cons(K->attribute, K->value, av_append(K->ptr, L));
}

Here is the call graph for this function:

Here is the caller graph for this function:

av_list av_append1 ( av_list  L,
int  attr,
int  val 
)

Definition at line 121 of file list_routines.c.

{
return (av_append(L,av_list1(attr, val)));
}

Here is the call graph for this function:

av_list av_cons ( int  attr,
int  val,
av_list  L 
)

Definition at line 77 of file list_routines.c.

{
av_list temp;
temp = (av_list) xmalloc(sizeof(av_cell));
temp->attribute = attr;
temp->value = val;
temp->ptr = L;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

av_list av_list1 ( int  attr,
int  val 
)

Definition at line 88 of file list_routines.c.

{
av_list temp;
temp = (av_list) xmalloc(sizeof(av_cell));
temp->attribute = attr;
temp->value = val;
temp->ptr = NULL;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

av_list av_list2 ( int  attr,
int  val,
int  attr1,
int  val1 
)

Definition at line 99 of file list_routines.c.

{
av_list temp, temp1;
temp = (av_list) xmalloc(sizeof(av_cell));
temp1 = (av_list) xmalloc(sizeof(av_cell));
temp->attribute = attr;
temp->value = val;
temp->ptr = temp1;
temp1->attribute = attr1;
temp1->value = val1;
temp1->ptr = NULL;
return temp;
}

Here is the call graph for this function:

list cons ( void x,
list  L 
)

Definition at line 28 of file list_routines.c.

{
list temp;
temp = (list) xmalloc(sizeof(cell));
temp->contents = x;
temp->ptr = L;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Definition at line 227 of file list_routines.c.

{
if (K==NULL) return L;
return hash_cons(K->x, K->y, K->new_class, K->lig_z, hash_append(K->ptr, L));
}

Here is the call graph for this function:

Here is the caller graph for this function:

hash_list hash_append1 ( hash_list  L,
int  x,
int  y,
int  new_class,
int  lig_z 
)

Definition at line 234 of file list_routines.c.

{
return (hash_append(L,hash_list1(x, y, new_class, lig_z)));
}

Here is the call graph for this function:

hash_list hash_cons ( int  x,
int  y,
int  new_class,
int  lig_z,
hash_list  L 
)

Definition at line 182 of file list_routines.c.

{
hash_list temp;
temp = (hash_list) xmalloc(sizeof(hash_cell));
temp->x = x;
temp->y = y;
temp->new_class = new_class;
temp->lig_z = lig_z;
temp->ptr = L;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

hash_list hash_list1 ( int  x,
int  y,
int  new_class,
int  lig_z 
)

Definition at line 195 of file list_routines.c.

{
hash_list temp;
temp = (hash_list) xmalloc(sizeof(hash_cell));
temp->x = x;
temp->y = y;
temp->new_class = new_class;
temp->lig_z = lig_z;
temp->ptr = NULL;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

hash_list hash_list2 ( int  x,
int  y,
int  new_class,
int  lig_z,
int  x1,
int  y1,
int  class1,
int  lig_z1 
)

Definition at line 208 of file list_routines.c.

{
hash_list temp, temp1;
temp = (hash_list) xmalloc(sizeof(hash_cell));
temp1 = (hash_list) xmalloc(sizeof(hash_cell));
temp->x = x;
temp->y = y;
temp->new_class = new_class;
temp->lig_z = lig_z;
temp->ptr = temp1;
temp1->x = x1;
temp1->y = y1;
temp1->new_class = class1;
temp1->lig_z = lig_z1;
temp1->ptr = NULL;
return temp;
}

Here is the call graph for this function:

in_list in_append ( in_list  K,
in_list  L 
)

Definition at line 167 of file list_routines.c.

{
if (K==NULL) return L;
return in_cons(K->value, K->actual, in_append(K->ptr, L));
}

Here is the call graph for this function:

Here is the caller graph for this function:

in_list in_append1 ( in_list  L,
int  val,
in_list  N 
)

Definition at line 174 of file list_routines.c.

{
return (in_append(L,in_list1(val, N)));
}

Here is the call graph for this function:

in_list in_cons ( int  val,
in_list  N,
in_list  L 
)

Definition at line 130 of file list_routines.c.

{
in_list temp;
temp = (in_list) xmalloc(sizeof(in_cell));
temp->value = val;
temp->actual = N;
temp->ptr = L;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

in_list in_list1 ( int  val,
in_list  N 
)

Definition at line 141 of file list_routines.c.

{
in_list temp;
temp = (in_list) xmalloc(sizeof(in_cell));
temp->value = val;
temp->actual = N;
temp->ptr = NULL;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

in_list in_list2 ( int  val,
in_list  N,
int  val1,
in_list  N1 
)

Definition at line 152 of file list_routines.c.

{
in_list temp, temp1;
temp = (in_list) xmalloc(sizeof(in_cell));
temp1 = (in_list) xmalloc(sizeof(in_cell));
temp->value = val;
temp->ptr = temp1;
temp->actual = N;
temp1->value = val1;
temp->actual = N1;
temp1->ptr = NULL;
return temp;
}

Here is the call graph for this function:

void init_queue ( queue q)

Definition at line 240 of file list_routines.c.

{
    q->front = NULL;
    q->tail = NULL;
}
list list1 ( void x)

Definition at line 38 of file list_routines.c.

{
list temp;
temp = (list) xmalloc(sizeof(cell));
temp->contents = x;
temp->ptr = NULL;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function:

list list2 ( void x,
void y 
)

Definition at line 48 of file list_routines.c.

{
list temp, temp1;
temp = (list) xmalloc(sizeof(cell));
temp1 = (list) xmalloc(sizeof(cell));
temp->contents = x;
temp->ptr = temp1;
temp1->contents = y;
temp1->ptr = NULL;
return temp;
}

Here is the call graph for this function:

Here is the caller graph for this function: