Lines Matching refs:list
20 // notice, this list of conditions and the following disclaimer.
22 // notice, this list of conditions and the following disclaimer in the
71 static void antlr3ListFree (pANTLR3_LIST list);
72 static void antlr3ListDelete(pANTLR3_LIST list, ANTLR3_INTKEY key);
73 static void * antlr3ListGet (pANTLR3_LIST list, ANTLR3_INTKEY key);
74 static ANTLR3_INT32 antlr3ListPut (pANTLR3_LIST list, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
75 static ANTLR3_INT32 antlr3ListAdd (pANTLR3_LIST list, void * element, void (ANTLR3_CDECL *freeptr)(void *));
76 static void * antlr3ListRemove(pANTLR3_LIST list, ANTLR3_INTKEY key);
77 static ANTLR3_UINT32 antlr3ListSize (pANTLR3_LIST list);
392 /** Takes the element with the supplied key out of the list, and deletes the data
416 /** Takes the element with the supplied key out of the list, and deletes the data
865 pANTLR3_LIST list;
869 list = (pANTLR3_LIST)ANTLR3_MALLOC((size_t)sizeof(ANTLR3_LIST));
871 if (list == NULL)
878 list->table = antlr3HashTableNew(sizeHint);
880 if (list->table == (pANTLR3_HASH_TABLE)ANTLR3_FUNC_PTR(ANTLR3_ERR_NOMEM))
887 list->free = antlr3ListFree;
888 list->del = antlr3ListDelete;
889 list->get = antlr3ListGet;
890 list->add = antlr3ListAdd;
891 list->remove = antlr3ListRemove;
892 list->put = antlr3ListPut;
893 list->size = antlr3ListSize;
895 return list;
898 static ANTLR3_UINT32 antlr3ListSize (pANTLR3_LIST list)
900 return list->table->size(list->table);
904 antlr3ListFree (pANTLR3_LIST list)
906 /* Free the hashtable that stores the list
908 list->table->free(list->table);
910 /* Free the allocation for the list itself
912 ANTLR3_FREE(list);
916 antlr3ListDelete (pANTLR3_LIST list, ANTLR3_INTKEY key)
918 list->table->delI(list->table, key);
922 antlr3ListGet (pANTLR3_LIST list, ANTLR3_INTKEY key)
924 return list->table->getI(list->table, key);
927 /** Add the supplied element to the list, at the next available key
929 static ANTLR3_INT32 antlr3ListAdd (pANTLR3_LIST list, void * element, void (ANTLR3_CDECL *freeptr)(void *))
933 key = list->table->size(list->table) + 1;
934 return list->put(list, key, element, freeptr);
937 /** Remove from the list, but don't free the element, just send it back to the
941 antlr3ListRemove (pANTLR3_LIST list, ANTLR3_INTKEY key)
945 entry = list->table->removeI(list->table, key);
958 antlr3ListPut (pANTLR3_LIST list, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *))
960 return list->table->putI(list->table, key, element, freeptr);
1008 /* Free the list that supports the stack
1329 /// Add the supplied pointer and freeing function pointer to the list,
2374 // in to the list of nodes.
2445 topo->cycle[l - i] = topo->cycle[l]; // Move to zero base in the cycle list
2473 // list.
2488 // Stop if we exahust the bit list or have checked the
2507 // So we just add the node into the sorted list at the
2512 // Remove this node from the cycle list if we have not detected a cycle
2535 // entries to accomodate the sorted list and another to accomodate
2599 // interdependent and you want to walk the list of the generated trees