Home
last modified time | relevance | path

Searched refs:firstNode (Results 1 – 25 of 874) sorted by relevance

12345678910>>...35

/dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmdata/libsrc/
H A Ddclist.cc55 : firstNode(NULL), in DcmList()
72 DcmListNode *temp = firstNode; in ~DcmList()
73 firstNode = firstNode->nextNode; in ~DcmList()
76 } while ( firstNode != NULL ); in ~DcmList()
116 node->nextNode = firstNode; in prepend()
117 firstNode->prevNode = node; in prepend()
118 currentNode = firstNode = node; in prepend()
232 currentNode = firstNode; in seek()
290 tmpNode = firstNode; in deleteAllElements()
299 firstNode = tmpNode->nextNode; in deleteAllElements()
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/qt3support/tools/
H A Dq3glist.cpp281 curNode = firstNode; in operator =()
329 curNode = firstNode; in locate()
345 node = firstNode; in locate()
393 firstNode->prev = n; in prepend()
414 firstNode = n; in append()
462 firstNode->prev = n; in relinkNode()
723 n = firstNode; in findRef()
749 n = firstNode; in find()
844 if ( firstNode ) { in first()
1041 firstNode = n; in read()
[all …]
/dports/devel/qmake/qt-x11-free-3.3.8/src/tools/
H A Dqglist.cpp277 curNode = firstNode; in operator =()
325 curNode = firstNode; in locate()
341 node = firstNode; in locate()
389 firstNode->prev = n; in prepend()
410 firstNode = n; in append()
458 firstNode->prev = n; in relinkNode()
719 n = firstNode; in findRef()
745 n = firstNode; in find()
839 if ( firstNode ) { in first()
1036 firstNode = n; in read()
[all …]
/dports/misc/vxl/vxl-3.3.2/v3p/dcmtk/dcmdata/libsrc/
H A Ddclist.cxx69 : firstNode(NULL), in DcmList()
86 DcmListNode *temp = firstNode; in ~DcmList()
87 firstNode = firstNode->nextNode; in ~DcmList()
90 } while ( firstNode != (DcmListNode*)NULL ); in ~DcmList()
91 actualNode = firstNode = lastNode = (DcmListNode*)NULL; in ~DcmList()
104 actualNode = firstNode = lastNode = new DcmListNode(obj); in append()
126 actualNode = firstNode = lastNode = new DcmListNode(obj); in prepend()
130 node->nextNode = firstNode; in prepend()
131 firstNode->prevNode = node; in prepend()
132 actualNode = firstNode = node; in prepend()
[all …]
/dports/games/solarconquest/SolarConquest/source/
H A DParticles.h157 firstNode = NULL; in CParticleList()
201 if (firstNode) in AddParticle()
213 if (firstNode) in AddParticle()
227 if (firstNode) in AddParticle()
229 firstNode = newObj; in AddParticle()
265 curObj = firstNode; in DeleteAllParticles()
276 firstNode = NULL; in DeleteAllParticles()
284 if (firstNode) in PullParticleFromList()
288 firstNode = firstNode->nextObj; in PullParticleFromList()
307 if (firstNode) in InsertParticle()
[all …]
H A DSoundList.h68 CSoundListNode* firstNode;
83 firstNode = NULL; in CSoundList()
104 cNode = firstNode; in ~CSoundList()
111 firstNode = NULL; in ~CSoundList()
122 if (!firstNode) in AddSound()
126 if (firstNode) in AddSound()
128 newNode->nextNode = firstNode; in AddSound()
129 firstNode->prevNode = newNode; in AddSound()
131 firstNode = newNode; in AddSound()
140 CSoundListNode* cNode = firstNode; in FindNode()
[all …]
H A DTextureList.h97 CTextureListNode* firstNode;
110 firstNode = NULL; in CTextureList()
117 cNode = firstNode; in ~CTextureList()
124 firstNode = NULL; in ~CTextureList()
138 if (firstNode) in AddTexture()
140 newNode->nextNode = firstNode; in AddTexture()
141 firstNode->prevNode = newNode; in AddTexture()
143 firstNode = newNode; in AddTexture()
149 CTextureListNode* cNode = firstNode; in FindNode()
167 firstNode = delNode->nextNode; in DeleteTexture()
/dports/security/openvpn-auth-ldap/openvpn-auth-ldap-auth-ldap-2.0.4/tests/
H A Dmockpf.c115 PFNode *firstNode; member
137 list->firstNode = NULL; in init_pflist()
152 if (!list->firstNode) { in insert_pfnode()
153 list->firstNode = new; in insert_pfnode()
159 position = list->firstNode; in insert_pfnode()
167 list->firstNode = new; in insert_pfnode()
179 list->firstNode = NULL; in remove_pfnode()
186 list->firstNode = node->next; in remove_pfnode()
217 while (pf_tables->firstNode) { in mockpf_teardown()
221 while (tableNode->addrs.firstNode) in mockpf_teardown()
[all …]
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/pqc/crypto/gmss/
H A DTreehash.java37 private byte[] firstNode; field in Treehash
130 this.firstNode = statByte[0]; in Treehash()
153 this.firstNode = null; in Treehash()
189 this.firstNode = null; in initialize()
225 if (this.firstNode == null) in update()
227 this.firstNode = leaf; in update()
315 this.firstNode = null; in destroy()
352 if (firstNode == null) in getFirstNodeHeight()
386 return this.firstNode; in getFirstNode()
410 this.firstNode = hash; in setFirstNode()
[all …]
/dports/science/cdk/cdk-cdk-2.3/legacy/src/main/java/org/openscience/cdk/smiles/smarts/parser/
H A DASTLowAndExpression.java69 Node firstNode = this.jjtGetChild(0); in insertLeafChild() local
70 while (!(firstNode instanceof ASTImplicitHighAndExpression)) { in insertLeafChild()
71 firstNode = firstNode.jjtGetChild(0); in insertLeafChild()
76 insert.jjtAddChild(firstNode.jjtGetChild(0), 1); in insertLeafChild()
77 firstNode.jjtRemoveChild(0); in insertLeafChild()
78 firstNode.jjtAddChild(insert, 0); in insertLeafChild()
/dports/math/spooles-mpich/spooles.2.2/Network/src/
H A DaddArc.c16 int firstNode, in Network_addArc() argument
32 || firstNode < 0 || firstNode >= nnode in Network_addArc()
37 "\n bad input\n", network, firstNode, secondNode, in Network_addArc()
55 arc->first = firstNode ; in Network_addArc()
59 arc->nextOut = outheads[firstNode] ; in Network_addArc()
60 outheads[firstNode] = arc ; in Network_addArc()
/dports/math/spooles-mpich/spooles.2.2_SHARED/Network/src/
H A DaddArc.c16 int firstNode, in Network_addArc() argument
32 || firstNode < 0 || firstNode >= nnode in Network_addArc()
37 "\n bad input\n", network, firstNode, secondNode, in Network_addArc()
55 arc->first = firstNode ; in Network_addArc()
59 arc->nextOut = outheads[firstNode] ; in Network_addArc()
60 outheads[firstNode] = arc ; in Network_addArc()
/dports/math/spooles/spooles.2.2_SHARED/Network/src/
H A DaddArc.c16 int firstNode, in Network_addArc() argument
32 || firstNode < 0 || firstNode >= nnode in Network_addArc()
37 "\n bad input\n", network, firstNode, secondNode, in Network_addArc()
55 arc->first = firstNode ; in Network_addArc()
59 arc->nextOut = outheads[firstNode] ; in Network_addArc()
60 outheads[firstNode] = arc ; in Network_addArc()
/dports/math/spooles/spooles.2.2/Network/src/
H A DaddArc.c16 int firstNode, in Network_addArc() argument
32 || firstNode < 0 || firstNode >= nnode in Network_addArc()
37 "\n bad input\n", network, firstNode, secondNode, in Network_addArc()
55 arc->first = firstNode ; in Network_addArc()
59 arc->nextOut = outheads[firstNode] ; in Network_addArc()
60 outheads[firstNode] = arc ; in Network_addArc()
/dports/audio/csound/csound-6.15.0/util2/
H A Dmatrix.tk53 set firstNode ""
55 global firstNode secondNode
58 mkEdge $firstNode $secondNode
59 set firstNode ""
65 global firstNode
68 mkEdge $firstNode $curNode
69 set firstNode ""
80 if {$firstNode != ""} {
101 if {($firstNode != "") && ($curNode != "") && ($firstNode != $curNode)} {
102 mkEdge $firstNode $curNode
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/HelpSource/Tutorials/Mark_Polishook_tutorial/Japanese_version/
H A D11.schelp103 SynthDef("firstNode-source", {
124 // "firstNode-source"は最初に実行されなければならない
125 // もし "secondNode-filter"が先に評価されれば、"firstNode-source"はそれを通して処理されなくなってしまう
127 Synth("firstNode-source");
138 Synth.head(s, "firstNode-source");
143 この例では、適切な順序でシンセを配置するのに.headメッセージと.tailメッセージに頼っています。ここでの適切な順序とは、"firstNode-source"がルートノード・グループの先頭に、"…
145 それゆえ、"firstNode-source"はリンクリストの中で第1番のアイテムになり、"secondNode-filter"は第2のアイテムになります。この順序付けは2つのシンセの評価順序が変更…
150 Synth.head(s, "firstNode-source");
177 Synth.head(~source, "firstNode-source");
/dports/lang/php73/php-7.3.33/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
H A Dbug77345_gc_2.phpt20 $firstNode = new Node();
21 $firstNode->previous = $firstNode;
22 $firstNode->next = $firstNode;
24 $circularDoublyLinkedList = $firstNode;
/dports/www/mod_php81/php-8.1.1/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/lang/php74/php-7.4.27/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/lang/php81/php-8.1.1/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/lang/php80/php-8.0.15/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/www/mod_php73/php-7.3.33/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/www/mod_php74/php-7.4.27/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;
/dports/www/mod_php80/php-8.0.15/Zend/tests/
H A Dbug77345_gc_1.phpt19 $firstNode = new Node();
20 $firstNode->previous = $firstNode;
21 $firstNode->next = $firstNode;
23 $circularDoublyLinkedList = $firstNode;

12345678910>>...35