#include "cutil.h"
#include "tesscallback.h"
Go to the source code of this file.
Functions |
int | count (LIST var_list) |
LIST | delete_d (LIST list, void *key, int_compare is_equal) |
LIST | delete_d (LIST list, void *key, TessResultCallback2< int, void *, void * > *is_equal) |
LIST | destroy (LIST list) |
void | destroy_nodes (LIST list, void_dest destructor) |
void | insert (LIST list, void *node) |
int | is_same_node (void *item1, void *item2) |
int | is_same (void *item1, void *item2) |
LIST | join (LIST list1, LIST list2) |
LIST | last (LIST var_list) |
void * | nth_cell (LIST var_list, int item_num) |
LIST | pop (LIST list) |
LIST | push (LIST list, void *element) |
LIST | push_last (LIST list, void *item) |
LIST | reverse (LIST list) |
LIST | reverse_d (LIST list) |
LIST | s_adjoin (LIST var_list, void *variable, int_compare compare) |
LIST | search (LIST list, void *key, int_compare is_equal) |
LIST | search (LIST list, void *key, TessResultCallback2< int, void *, void * > *) |
Macro Definition Documentation
#define first_node |
( |
|
l | ) |
((l) ? (l)->node : NIL_LIST) |
#define iterate_list |
( |
|
x, |
|
|
|
l |
|
) |
| for ((x)=(l); (x)!=0; (x)=list_rest(x)) |
#define JOIN_ON |
( |
|
list1, |
|
|
|
list2 |
|
) |
| ((list1) = join ((list1), (list2))) |
#define list_rest |
( |
|
l | ) |
((l) ? (l)->next : NIL_LIST) |
#define NIL_LIST (LIST) 0 |
#define pop_off |
( |
|
list | ) |
((list) = pop (list)) |
#define push_on |
( |
|
list, |
|
|
|
thing |
|
) |
| ((list) = push (list, (LIST) (thing))) |
#define set_rest |
( |
|
l, |
|
|
|
cell |
|
) |
| ((l)->next = (cell)) |
Typedef Documentation
Function Documentation
int count |
( |
LIST |
var_list | ) |
|
Definition at line 108 of file oldlist.cpp.
{
int temp = 0;
return (temp);
}
Definition at line 125 of file oldlist.cpp.
{
last_one = list;
result = last_one;
}
else {
last_one = list;
}
}
else {
}
}
return (result);
}
Definition at line 154 of file oldlist.cpp.
{
last_one = list;
result = last_one;
}
else {
last_one = list;
}
}
else {
}
}
return (result);
}
void insert |
( |
LIST |
list, |
|
|
void * |
node |
|
) |
| |
int is_same |
( |
void * |
item1, |
|
|
void * |
item2 |
|
) |
| |
Definition at line 252 of file oldlist.cpp.
{
return (!strcmp ((char *) item1, (char *) item2));
}
int is_same_node |
( |
void * |
item1, |
|
|
void * |
item2 |
|
) |
| |
Definition at line 241 of file oldlist.cpp.
{
return (item1 == item2);
}
Definition at line 264 of file oldlist.cpp.
{
return (list2);
return (list1);
}
void* nth_cell |
( |
LIST |
var_list, |
|
|
int |
item_num |
|
) |
| |
Definition at line 289 of file oldlist.cpp.
{
int x = 0;
if (x++ == item_num)
return (var_list);
}
return (var_list);
}
LIST push_last |
( |
LIST |
list, |
|
|
void * |
item |
|
) |
| |
Definition at line 384 of file oldlist.cpp.
{
int result;
l = var_list;
if (result == 0)
return (var_list);
else if (result < 0) {
return (var_list);
}
}
}