Home
last modified time | relevance | path

Searched refs:treepos (Results 1 – 25 of 60) sorted by relevance

123

/dports/cad/zcad/zcad-8b8a693/cad_source/zcad/gui/forms/
H A Duzcfprojecttree.pas157 i:=pos('_',treepos);
160 category:=uppercase(copy(treepos,1,i-1));
161 treepos:=copy(treepos,i+1,length(treepos)-i+1);
172 i:=pos('_',treepos);
181 treepos,treesuperpos{,category,s}:GDBString;
206 treepos:=copy(treesuperpos,1,i-1);
214 buildbranchn(CurrNode,treepos,EqCategory);
222 if treepos=uncat then
264 treepos{,treesuperpos,category}:GDBString;
326 treepos:=uncat_+pb^.name;
[all …]
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/lodepng-2.5.0/src/
H A Dhuffman.rs35 let mut treepos = 0; in decode_symbol() localVariable
50 treepos = ct as usize - self.numcodes; in decode_symbol()
52 if treepos >= self.numcodes { in decode_symbol()
61 let mut treepos = 0; in new_2d_tree() localVariable
66 if treepos > ‎0x7FFF_FFFF || treepos + 2 > tree.numcodes { in new_2d_tree()
69 if tree.tree2d[2 * treepos + bit as usize] == 32767 { in new_2d_tree()
71 tree.tree2d[2 * treepos + bit] = n as u32; in new_2d_tree()
72 treepos = 0; in new_2d_tree()
76 treepos = nodefilled; in new_2d_tree()
79 let pos = tree.tree2d[2 * treepos + bit] as usize; in new_2d_tree()
[all …]
/dports/textproc/py-nltk/nltk-3.4.1/nltk/corpus/reader/
H A Dnombank.py449 return tree[self.treepos(tree)]
451 def treepos(self, tree): member in NombankTreePointer
459 treepos = []
468 if len(treepos) < len(stack):
469 treepos.append(0)
471 treepos[-1] += 1
473 if treepos[-1] < len(stack[-1]):
474 stack.append(stack[-1][treepos[-1]])
478 treepos.pop()
482 return tuple(treepos[: len(treepos) - self.height - 1])
H A Dpropbank.py455 return tree[self.treepos(tree)]
457 def treepos(self, tree): member in PropbankTreePointer
465 treepos = []
474 if len(treepos) < len(stack):
475 treepos.append(0)
477 treepos[-1] += 1
479 if treepos[-1] < len(stack[-1]):
480 stack.append(stack[-1][treepos[-1]])
484 treepos.pop()
488 return tuple(treepos[: len(treepos) - self.height - 1])
/dports/archivers/maxcso/maxcso-1.10.0/zopfli/src/zopflipng/lodepng/
H A Dlodepng_util.cpp344 if(treepos > numcodes - 2) return 55; in makeFromLengths()
345 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in in makeFromLengths()
350 tree2d[2 * treepos + bit] = n; in makeFromLengths()
351 treepos = 0; in makeFromLengths()
356 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
357 treepos = nodefilled; in makeFromLengths()
360 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
368 result = tree2d[2 * treepos + bit]; in decode()
370 treepos = decoded ? 0 : result - numcodes; in decode()
415 for(size_t treepos = 0;;) in huffmanDecodeSymbol() local
[all …]
/dports/graphics/glx-utils/demos-5435fc7fbd332e171da9a71e33a9b190e9462cf0/src/demos/
H A Dfire.c100 static float treepos[NUMTREE][3]; variable
462 drawtree(treepos[j][0], treepos[j][1], treepos[j][2]); in drawfire()
704 treepos[i][0] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
705 treepos[i][1] = 0.0; in inittree()
706 treepos[i][2] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
708 sqrt(treepos[i][0] * treepos[i][0] + in inittree()
709 treepos[i][2] * treepos[i][2]); in inittree()
H A Dfbo_firecube.c215 static float treepos[NUMTREE][3]; variable
513 drawtree(treepos[j][0], treepos[j][1], treepos[j][2]); in drawfire()
752 treepos[i][0] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
753 treepos[i][1] = 0.0; in inittree()
754 treepos[i][2] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
756 sqrt(treepos[i][0] * treepos[i][0] + in inittree()
757 treepos[i][2] * treepos[i][2]); in inittree()
/dports/graphics/mesa-demos/mesa-demos-8.4.0/src/demos/
H A Dfire.c100 static float treepos[NUMTREE][3]; variable
462 drawtree(treepos[j][0], treepos[j][1], treepos[j][2]); in drawfire()
704 treepos[i][0] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
705 treepos[i][1] = 0.0; in inittree()
706 treepos[i][2] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
708 sqrt(treepos[i][0] * treepos[i][0] + in inittree()
709 treepos[i][2] * treepos[i][2]); in inittree()
H A Dfbo_firecube.c215 static float treepos[NUMTREE][3]; variable
513 drawtree(treepos[j][0], treepos[j][1], treepos[j][2]); in drawfire()
752 treepos[i][0] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
753 treepos[i][1] = 0.0; in inittree()
754 treepos[i][2] = vrnd() * TREEOUTR * 2.0 - TREEOUTR; in inittree()
756 sqrt(treepos[i][0] * treepos[i][0] + in inittree()
757 treepos[i][2] * treepos[i][2]); in inittree()
/dports/x11/xlockmore/xlockmore-5.67/modes/glx/
H A Dfire.c304 treestruct *treepos; /* trees positions: float treepos[num_trees][3] */ member
640 if ((fs->treepos = (treestruct *) malloc(fs->num_trees * in inittree()
647 fs->treepos[i].x =vrnd()*TREEOUTR*2.0-TREEOUTR; in inittree()
648 fs->treepos[i].y =0.0; in inittree()
649 fs->treepos[i].z =vrnd()*TREEOUTR*2.0-TREEOUTR; in inittree()
650 dist=sqrt(fs->treepos[i].x *fs->treepos[i].x +fs->treepos[i].z *fs->treepos[i].z ); in inittree()
765 drawtree(fs->treepos[j].x ,fs->treepos[j].y ,fs->treepos[j].z ); in DrawFire()
939 if (fs->treepos != NULL) { in free_fire_screen()
940 free(fs->treepos); in free_fire_screen()
941 fs->treepos = (treestruct *) NULL; in free_fire_screen()
/dports/x11/xscreensaver/xscreensaver-5.44/hacks/glx/
H A Dglforestfire.c288 treestruct *treepos; /* trees positions: float treepos[num_trees][3] */ member
612 if ((fs->treepos = (treestruct *) malloc(fs->num_trees * in inittree()
619 fs->treepos[i].x =vrnd()*TREEOUTR*2.0-TREEOUTR; in inittree()
620 fs->treepos[i].y =0.0; in inittree()
621 fs->treepos[i].z =vrnd()*TREEOUTR*2.0-TREEOUTR; in inittree()
622 dist = sqrt(fs->treepos[i].x * fs->treepos[i].x + in inittree()
623 fs->treepos[i].z * fs->treepos[i].z); in inittree()
744 mi->polygon_count += drawtree(fs->treepos[j].x ,fs->treepos[j].y ,fs->treepos[j].z ); in DrawFire()
905 if (fs->treepos != NULL) { in free_fire()
906 free(fs->treepos); in free_fire()
[all …]
/dports/x11-toolkits/wxgtk30/wxWidgets-3.0.5.1/misc/scripts/
H A Dupdate_doc_baseclasses.py46 treepos[classname] = j+1
54 treepos = dict() variable
96 startidx = treepos[classname]
/dports/x11-toolkits/py-wxPython40/wxPython-4.0.7/ext/wxWidgets/misc/scripts/
H A Dupdate_doc_baseclasses.py46 treepos[classname] = j+1
54 treepos = dict() variable
96 startidx = treepos[classname]
/dports/emulators/mesen/Mesen-0.9.8-4-g4c701ad6/Utilities/
H A DPNGHelper.cpp150 unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0; in DecodePNG() local
160 if(treepos > numcodes - 2) return 55; in DecodePNG()
161 if(tree2d[2 * treepos + bit] == 32767) //not yet filled in in DecodePNG()
163 if(i + 1 == bitlen[n]) { tree2d[2 * treepos + bit] = n; treepos = 0; } //last bit in DecodePNG()
164 …else { tree2d[2 * treepos + bit] = ++nodefilled + numcodes; treepos = nodefilled; } //addresses ar… in DecodePNG()
166 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in DecodePNG()
170 int decode(bool& decoded, unsigned long& result, size_t& treepos, unsigned long bit) const in DecodePNG()
173 if(treepos >= numcodes) return 11; //error: you appeared outside the codetree in DecodePNG()
174 result = tree2d[2 * treepos + bit]; in DecodePNG()
176 treepos = decoded ? 0 : result - numcodes; in DecodePNG()
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/rendering/
H A DDecodePNG.cxx155 if (treepos > numcodes - 2) in DecodePNG()
161 tree2d[2 * treepos + bit] = n; in DecodePNG()
162 treepos = 0; in DecodePNG()
166 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in DecodePNG()
167 treepos = nodefilled; in DecodePNG()
171 treepos = tree2d[2 * treepos + bit] - in DecodePNG()
178 std::size_t& treepos, in DecodePNG()
182 if (treepos >= numcodes) in DecodePNG()
184 result = tree2d[2 * treepos + bit]; in DecodePNG()
186 treepos = decoded ? 0 : result - numcodes; in DecodePNG()
[all …]
/dports/math/gap/gap-4.11.0/pkg/anupq-3.2.1/lib/
H A Danupqxdesc.gi51 if IsBound(datarec.treepos) then
53 datarec.treepos.class,
54 datarec.treepos.node,
55 datarec.treepos.ndes );
136 datarec.treepos := rec(class:=class, node:=parent, ndes:=n);
/dports/textproc/py-nltk/nltk-3.4.1/nltk/test/
H A Dpropbank.doctest81 which are usually easier to work with, using the `treepos()` method:
83 >>> treepos = inst.predicate.treepos(tree)
84 >>> print (treepos, tree[treepos])
/dports/emulators/citra/citra-ac98458e0/externals/lodepng/lodepng/
H A Dlodepng_util.cpp1422 if(treepos > numcodes - 2) return 55; in makeFromLengths()
1423 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1426 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1427 treepos = 0; in makeFromLengths()
1430 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1431 treepos = nodefilled; in makeFromLengths()
1434 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1441 result = tree2d[2 * treepos + bit]; in decode()
1443 treepos = decoded ? 0 : result - numcodes; in decode()
1484 for(size_t treepos = 0;;) { in huffmanDecodeSymbol() local
[all …]
/dports/emulators/citra-qt5/citra-ac98458e0/externals/lodepng/lodepng/
H A Dlodepng_util.cpp1422 if(treepos > numcodes - 2) return 55; in makeFromLengths()
1423 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1426 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1427 treepos = 0; in makeFromLengths()
1430 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1431 treepos = nodefilled; in makeFromLengths()
1434 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1441 result = tree2d[2 * treepos + bit]; in decode()
1443 treepos = decoded ? 0 : result - numcodes; in decode()
1484 for(size_t treepos = 0;;) { in huffmanDecodeSymbol() local
[all …]
/dports/graphics/libjxl/libjxl-0.6.1/third_party/lodepng/
H A Dlodepng_util.cpp1480 if(treepos > numcodes - 2) return 55; in makeFromLengths()
1481 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1484 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1485 treepos = 0; in makeFromLengths()
1488 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1489 treepos = nodefilled; in makeFromLengths()
1492 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1499 result = tree2d[2 * treepos + bit]; in decode()
1501 treepos = decoded ? 0 : result - numcodes; in decode()
1542 for(size_t treepos = 0;;) { in huffmanDecodeSymbol() local
[all …]
/dports/archivers/zopfli/zopfli-zopfli-1.0.3/src/zopflipng/lodepng/
H A Dlodepng_util.cpp1484 if(treepos > numcodes - 2) return 55; in makeFromLengths()
1485 if(tree2d[2 * treepos + bit] == 32767) { //not yet filled in in makeFromLengths()
1488 tree2d[2 * treepos + bit] = n; in makeFromLengths()
1489 treepos = 0; in makeFromLengths()
1492 tree2d[2 * treepos + bit] = ++nodefilled + numcodes; in makeFromLengths()
1493 treepos = nodefilled; in makeFromLengths()
1496 …else treepos = tree2d[2 * treepos + bit] - numcodes; //subtract numcodes from address to get addre… in makeFromLengths()
1503 result = tree2d[2 * treepos + bit]; in decode()
1505 treepos = decoded ? 0 : result - numcodes; in decode()
1546 for(size_t treepos = 0;;) { in huffmanDecodeSymbol() local
[all …]
/dports/textproc/py-nltk/nltk-3.4.1/nltk/
H A Dtgrep.py176 treepos = node.treepositions()
179 return [node[x] for x in treepos[1:]]
188 treepos = node.treepositions()
191 return [node[x] for x in treepos[1:] if all(y == 0 for y in x)]
H A Dtree.py422 value, treepos = stack.pop()
425 return treepos
430 stack.append((value[i], treepos + (i,)))
1486 treepos + (index,)
1488 for treepos in parent.treepositions(root)
/dports/math/SCIP/scip-7.0.3/src/scip/
H A Devent_estim.c428 int treepos = regforest->nbegin[treeidx]; in SCIPregForestPredict() local
429 int* childtree = &(regforest->child[2 * treepos]); in SCIPregForestPredict()
430 int* splitidxtree = &(regforest->splitidx[treepos]); in SCIPregForestPredict()
432 SCIP_Real* valuetree = &(regforest->value[treepos]); in SCIPregForestPredict()
434 SCIPdebugMessage("Tree %d at position %d\n", treeidx, treepos); in SCIPregForestPredict()
477 int treepos; in SCIPregForestFromFile() local
541 treepos = 0; in SCIPregForestFromFile()
569 assert(treepos < regforestptr->ntrees); in SCIPregForestFromFile()
571 regforestptr->nbegin[treepos++] = pos; in SCIPregForestFromFile()
/dports/games/passage/Passage_v4_UnixSource/minorGems/graphics/converters/
H A Dlodepng.cpp459 unsigned treepos = 0; /*position in the tree (1 of the numcodes columns)*/ in HuffmanTree_make2DTree() local
472 if(tree->tree2d.data[2 * treepos + bit] == 32767) /*not yet filled in*/ in HuffmanTree_make2DTree()
476 tree->tree2d.data[2 * treepos + bit] = n; /*put the current code in it*/ in HuffmanTree_make2DTree()
477 treepos = 0; in HuffmanTree_make2DTree()
483 treepos = nodefilled; in HuffmanTree_make2DTree()
486 else treepos = tree->tree2d.data[2 * treepos + bit] - tree->numcodes; in HuffmanTree_make2DTree()
692 (*result) = tree->tree2d.data[2 * (*treepos) + bit]; in HuffmanTree_decode()
695 if(*decoded) (*treepos) = 0; in HuffmanTree_decode()
696 else (*treepos) = (*result) - tree->numcodes; in HuffmanTree_decode()
703 unsigned treepos = 0, decoded, ct; in huffmanDecodeSymbol() local
[all …]

123