daputil.c#560 | daptopseq(CDFnode* seq) |
#562 | if(seq == NULL || seq->nctype != NC_Sequence) return FALSE; |
#563 | return daptoplevel(seq); |
ncd2dispatch.c#47 | static NCerror getseqdimsize(NCDAPCOMMON*, CDFnode* seq, size_t* sizep); |
#48 | static NCerror makeseqdim(NCDAPCOMMON*, CDFnode* seq, size_t count, CDFnode** sqdimp); |
#1516 | CDFnode* seq = (CDFnode*)nclistget(dapcomm->cdf.ddsroot->tree->seqnodes,i); |
#1521 | seq->usesequence = 1; /* assume */ |
#1522 | for(container=seq->container;container != NULL;container=container->container) { |
#1526 | {seq->usesequence = 0; break;}/* no good */ |
#1529 | if(seq->usesequence && seqdims) { |
#1530 | ncstat = getseqdimsize(dapcomm,seq,&seqsize); |
#1533 | seq->usesequence = 0; |
#1538 | if(seq->usesequence) { |
#1540 | ncstat = makeseqdim(dapcomm,seq,seqsize,&sqdim); |
#1542 | seq->array.seqdim = sqdim; |
#1544 | seq->array.seqdim = NULL; |
#1588 | getseqdimsize(NCDAPCOMMON* dapcomm, CDFnode* seq, size_t* sizep) |
#1602 | computeseqcountconstraints(dapcomm,seq,seqcountconstraints); |
#1617 | ncstat = attach(dxdroot,seq); |
#1621 | xseq = seq->attachment; |
#1626 | fprintf(stderr,"sequencesize: %s = %lu\n",seq->ocname,(unsigned long)seqsize); |
#1658 | makeseqdim(NCDAPCOMMON* dapcomm, CDFnode* seq, size_t count, CDFnode** sqdimp) |
#1661 | CDFnode* root = seq->root; |
#1665 | sqdim = makecdfnode(dapcomm,seq->ocname,OC_Dimension,NULL,root); |
#1669 | sqdim->ncbasename = cdflegalname(seq->ocname); |
#1674 | sqdim->dim.array = seq; |
#1806 | computeseqcountconstraints(NCDAPCOMMON* dapcomm, CDFnode* seq, NCbytes* seqcountconstraints) |
#1812 | ASSERT(seq->nctype == NC_Sequence); |
#1813 | computeseqcountconstraintsr(dapcomm,seq,&var); |
#1826 | if(node == seq) { |
nchashmap.c#65 | NClist* seq; |
#69 | seq = hm->table[offset]; |
#70 | if(seq == NULL) {seq = nclistnew(); hm->table[offset] = seq;} |
#71 | len = nclistlength(seq); |
#72 | list = nclistcontents(seq); |
#76 | nclistpush(seq,(void*)hash); |
#77 | nclistpush(seq,value); |
#89 | NClist* seq; |
#93 | seq = hm->table[offset]; |
#94 | if(seq == NULL) {seq = nclistnew(); hm->table[offset] = seq;} |
#95 | len = nclistlength(seq); |
#96 | list = nclistcontents(seq); |
#100 | nclistpush(seq,(void*)hash); |
#101 | nclistpush(seq,value); |
#113 | NClist* seq; |
#117 | seq = hm->table[offset]; |
#118 | if(seq == NULL) return TRUE; |
#119 | len = nclistlength(seq); |
#120 | list = nclistcontents(seq); |
#123 | nclistremove(seq,(i+1)); |
#124 | nclistremove(seq,i); |
#126 | if(nclistlength(seq) == 0) {nclistfree(seq); hm->table[offset] = NULL;} |
#148 | NClist* seq; |
#152 | seq = hm->table[offset]; |
#153 | if(seq == NULL) return TRUE; |
#154 | len = nclistlength(seq); |
#155 | list = nclistcontents(seq); |
#170 | NClist* seq = hm->table[i]; |
#171 | int len = nclistlength(seq) / 2; |
#174 | if(hashp) *hashp = (nchashid)nclistget(seq,index*2); |
#175 | if(elemp) *elemp = nclistget(seq,(index*2)+1); |
#196 | NClist* seq = hm->table[i]; |
#197 | for(j=0;j<nclistlength(seq);j+=2) { |
#198 | keys[index++] = (nchashid)nclistget(seq,j); |
semantics.c#1032 | sqContains(List* seq, Symbol* sym) |
#1035 | if(seq == NULL) return 0; |
#1036 | for(i=0;i<listlength(seq);i++) { |
#1037 | Symbol* sub = (Symbol*)listget(seq,i); |
HyperKWIC - Version 7.20DA executed at 11:37 on 27 Oct 2017 | Polyhedron Solutions - INTERNAL USE | COMMERCIAL (Any O/S) SN 4AKIed