attr.c#291elem_NC_attrarray(const NC_attrarray *ncap, size_t elem)
#295 if(ncap->nelems == 0 || (unsigned long) elem >= ncap->nelems)
#300 return ncap->value[elem];
bytebuffer.c#103bbSet(Bytebufferbb, unsigned int index, char elem)
#107  bb->content[index] = elem;
#112bbAppend(Bytebufferbb, char elem)
#120  bb->content[bb->length] = elem;
#147bbAppendn(Bytebufferbb, const void* elem, const unsigned int n0)
#150  if(bb == NULL || elem == NULL) return bbFail();
#151  if(n == 0) {n = strlen((char*)elem);}
#153  memcpy((void*)&bb->content[bb->length],(void*)elem,n);
#160bbInsert(Bytebufferbb, const unsigned int index, const char elem)
#163  tmp[0]=elem;
#168bbInsertn(Bytebufferbb, const unsigned int index, const char* elem, const unsigned int n)
#198  memcpy((void*)(bb->content+index),(void*)elem,n);
daputil.c#325nclistdeleteall(NClistl, void* elem)
#333 if(test==elem) {
dim.c#302elem_NC_dimarray(const NC_dimarray *ncap, size_t elem)
#306 if(ncap->nelems == 0 || (unsigned long) elem >= ncap->nelems)
#311 return ncap->value[elem];
list.c#85listset(Listl, unsigned long index, void* elem)
#89  l->content[index] = elem;
#95listinsert(Listl, unsigned long index, void* elem)
#102  l->content[index] = elem;
#108listpush(Listl, void* elem)
#112  l->content[l->length] = elem;
#136  void* elem;
#139  elem = l->content[i];
#142  return elem;
#156listcontains(Listl, void* elem)
#160 if(elem == listget(l,i)) return 1;
#167listelemremove(Listl, void* elem)
#175    if(elem == candidate) {
list.h#48EXTERNC int listelemremove(Listl, void* elem);
nc3internal.h#118elem_NC_dimarray(const NC_dimarray *ncap, size_t elem);
#168elem_NC_attrarray(const NC_attrarray *ncap, size_t elem);
nc_hashmap.c#74      NC_dim *elem = ncap->value[table[size].data-1];
#75      NC_hashmapAddDim(ncaptable[size].data-1, elem->name->cp);
#76      assert(NC_hashmapGetDim(ncapelem->name->cp) == table[size].data-1);
#99      NC_var *elem = ncap->value[table[size].data-1];
#100      NC_hashmapAddVar(ncaptable[size].data-1, elem->name->cp);
#101      assert(NC_hashmapGetVar(ncapelem->name->cp) == table[size].data-1);
ncbytes.c#100ncbytesset(NCbytesbb, unsigned long index, char elem)
#104  bb->content[index] = elem;
#109ncbytesappend(NCbytesbb, char elem)
#116  bb->content[bb->length] = (char)(elem & 0xFF);
#137ncbytesappendn(NCbytesbb, const void* elem, unsigned long n)
#139  if(bb == NULL || elem == NULL) return ncbytesfail();
#140  if(n == 0) {n = strlen((char*)elem);}
#144  memcpy((void*)&bb->content[bb->length],(void*)elem,n);
#151ncbytesprepend(NCbytesbb, char elem)
#158  bb->content[0] = elem;
ncgeny.c#1930       Symbolelem = (Symbol*)listget(stack,i);
#1931       if(strcmp((yyvsp[(3) - (3)].sym)->name,elem->name)==0)
#1933                          elem->name);
nclist.c#85nclistset(NClistl, unsigned long index, void* elem)
#89  l->content[index] = elem;
#95nclistinsert(NClistl, unsigned long index, void* elem)
#102  l->content[index] = elem;
#108nclistpush(NClistl, void* elem)
#112  l->content[l->length] = elem;
#136  void* elem;
#139  elem = l->content[i];
#142  return elem;
#156nclistcontains(NClistl, void* elem)
#160 if(elem == nclistget(l,i)) return 1;
#167nclistelemremove(NClistl, void* elem)
#175    if(elem == candidate) {
nclist.h#48EXTERNC int nclistelemremove(NClistl, void* elem);
ocbytes.c#100ocbytesset(OCbytesbb, size_t index, char elem)
#104  bb->content[index] = elem;
#109ocbytesappend(OCbytesbb, int elem)
#116  bb->content[bb->length] = (char)elem;
#134ocbytesappendn(OCbytesbb, const void* elem, size_t n)
#136  if(bb == NULL || elem == NULL) return ocbytesfail();
#137  if(n == 0) {n = strlen((char*)elem);}
#141  memcpy((void*)&bb->content[bb->length],(void*)elem,n);
#148ocbytesprepend(OCbytesbb, char elem)
#155  bb->content[0] = elem;
oclist.c#85oclistset(OClistl, size_t index, void* elem)
#89  l->content[index] = elem;
#95oclistinsert(OClistl, size_t index, void* elem)
#102  l->content[index] = elem;
#108oclistpush(OClistl, void* elem)
#112  l->content[l->length] = elem;
#136  void* elem;
#139  elem = l->content[i];
#142  return elem;
#159oclistcontains(OClistl, void* elem)
#163 if(elem == oclistget(l,i)) return 1;
#170oclistelemremove(OClistl, void* elem)
#178    if(elem == candidate) {
oclist.h#48EXTERNC int oclistelemremove(OClistl, void* elem);
var.c#328elem_NC_vararray(const NC_vararray *ncap, size_t elem)
#332 if(ncap->nelems == 0 || (unsigned long)elem >= ncap->nelems)
#337 return ncap->value[elem];


HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed