25 for(
int i=t->
max-1;
i>=0;
i--)
52 for(
int i=t->
max-1;
i>=0;
i--)
77 if (strcmp(
s,
p->key)==0)
return p;
100 p->val.data=
v->CopyD();
113 int cnt=0;
int cnt2=0;
114 for(
int i=0;
i<lt->
max;
i++)
120 while(
p!=
NULL) { cnt2++;
p=
p->next;}
123 Print(
"%d columns, %d entries, size:%d",cnt,cnt2,lt->
max);
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
uint32_t hashlittle(const void *key, size_t length)
void t_destroyTable(stablerec *t)
char * stringTable(stablerec *t)
stablerec * t_createTable(int s)
void htable_Print(stablerec *d)
leftv t_findTabelVal(stablerec *t, const char *s)
find the data to key s
void t_addTable(stablerec *t, char *s, leftv v)
add a new entry (key s, data v) to table t, eats s, copies v
telem t_findTable(stablerec *t, const char *s)
find the entry to key s
stablerec * copyTable(stablerec *t)
#define omFreeSize(addr, size)
void StringSetS(const char *st)
void StringAppendS(const char *st)
void PrintS(const char *s)