/dports/math/ltl2ba/ltl2ba-1.3/ |
H A D | parse.c | 122 ptr->rgt->rgt->ntyp == U_OPER && in bin_simpler() 151 { ptr->rgt = ptr->rgt->rgt; in bin_simpler() 258 && isequal(ptr->rgt->rgt, ptr->lft->rgt)) in bin_simpler() 271 tl_nn(AND, ptr->lft->rgt, ptr->rgt->rgt)); in bin_simpler() 289 && isequal(ptr->lft->rgt, ptr->rgt->rgt)) in bin_simpler() 321 ptr->rgt->rgt->rgt))); in bin_simpler() 356 tl_nn(OR, ptr->lft->rgt, ptr->rgt->rgt)); in bin_simpler() 377 && isequal(ptr->lft->rgt, ptr->rgt->rgt)) in bin_simpler() 380 ptr->rgt->rgt); in bin_simpler() 387 && isequal(ptr->lft->rgt, ptr->rgt->rgt)) in bin_simpler() [all …]
|
H A D | rewrt.c | 47 n->lft = tmp->rgt; in right_linked() 48 tmp->rgt = n; in right_linked() 53 n->rgt = right_linked(n->rgt); in right_linked() 66 n->rgt = canonical(n->rgt); in canonical() 116 n->lft->rgt = ZN; in push_negation() 118 n->rgt = Not(m); in push_negation() 161 for (m = can; m->ntyp == tok && m->rgt; prev = m, m = m->rgt) in addcan() 193 m->rgt = ZN; in marknode() 293 { k2 = m->rgt; in Canonical() 305 prev->rgt = prev->lft->rgt; in Canonical() [all …]
|
H A D | cache.c | 113 releasenode(1, n->rgt); in releasenode() 114 n->rgt = ZN; in releasenode() 125 n->rgt = rl; in tl_nn() 140 n->rgt = p->rgt; in getnode() 152 d->rgt = dupnode(n->rgt); in dupnode() 229 if (!sameform(a->rgt, b->rgt)) in sameform() 270 && isequal(a->rgt, b->rgt)) in isequal() 289 && ismatch(a->rgt, b->rgt)) in ismatch() 302 any_term(srch, in->rgt); in any_term() 314 any_and(srch->rgt, in); in any_and() [all …]
|
/dports/devel/spin/Spin-version-6.5.0/Src/ |
H A D | tl_parse.c | 183 { ptr->rgt = ptr->rgt->rgt; in bin_simpler() 190 ptr->rgt = ptr->rgt->rgt; in bin_simpler() 225 && isequal(ptr->rgt->rgt, ptr->lft)) in bin_simpler() 230 && isequal(ptr->lft->rgt, ptr->rgt)) in bin_simpler() 250 && isequal(ptr->rgt->rgt, ptr->lft->rgt)) in bin_simpler() 263 tl_nn(AND, ptr->lft->rgt, ptr->rgt->rgt)); in bin_simpler() 293 && isequal(ptr->lft->rgt, ptr->rgt->rgt)) in bin_simpler() 322 tl_nn(OR, ptr->lft->rgt, ptr->rgt->rgt)); in bin_simpler() 341 && isequal(ptr->lft->rgt, ptr->rgt->rgt)) in bin_simpler() 344 ptr->rgt->rgt); in bin_simpler() [all …]
|
H A D | tl_rewrt.c | 32 n->lft = tmp->rgt; in right_linked() 33 tmp->rgt = n; in right_linked() 38 n->rgt = right_linked(n->rgt); in right_linked() 51 n->rgt = canonical(n->rgt); in canonical() 109 n->lft->rgt = ZN; in push_negation() 111 n->rgt = Not(m); in push_negation() 153 for (m = can; m->ntyp == tok && m->rgt; prev = m, m = m->rgt) in addcan() 188 m->rgt = ZN; in marknode() 277 { k2 = m->rgt; in Canonical() 289 prev->rgt = prev->lft->rgt; in Canonical() [all …]
|
H A D | structs.c | 159 if (!n->rgt || !n->rgt->lft) in do_same() 170 tmp = n->rgt->lft; in do_same() 194 tmp = n->rgt->lft; in Rval_struct() 273 if (!t->rgt in Sym_typ() 275 || !t->rgt->lft) in Sym_typ() 330 if (R) d->rgt = cpnn(s->rgt, 1, 1, S); in cpnn() 582 n = n->rgt; in expand() 599 if (n->rgt in mk_explicit() 601 && n->rgt->lft in mk_explicit() 641 for (t = a; t->rgt; t = t->rgt) in tail_add() [all …]
|
H A D | tl_cache.c | 104 releasenode(1, n->rgt); in releasenode() 105 n->rgt = ZN; in releasenode() 116 n->rgt = rl; in tl_nn() 131 n->rgt = p->rgt; in getnode() 143 d->rgt = dupnode(n->rgt); in dupnode() 221 if (!sameform(a->rgt, b->rgt)) in sameform() 262 && isequal(a->rgt, b->rgt)) in isequal() 281 && ismatch(a->rgt, b->rgt)) in ismatch() 294 any_term(srch, in->rgt); in any_term() 306 any_and(srch->rgt, in); in any_and() [all …]
|
H A D | tl_trans.c | 182 { n = n->rgt; in mk_grn() 218 mk_grn(n->rgt); in liveness() 223 liveness(n->rgt); in liveness() 580 common2: sdump(n->rgt); in sdump() 739 { n2 = g->New->rgt; in expand_g() 792 n1 = now->rgt; in expand_g() 820 n2 = now->rgt; in expand_g() 842 n2 = now->rgt; in expand_g() 871 p->rgt = twocases(p->rgt); in twocases() 889 tl_nn(AND, p->lft->rgt, p->rgt->rgt)); in twocases() [all …]
|
H A D | pangen3.c | 260 comwork(fd,now->rgt,m) 345 for (v = now->lft; v; v = v->rgt) in comwork() 366 for (v = now->rgt, i=0; v; v = v->rgt, i++) in comwork() 379 for (v = now->rgt, i=0; v; v = v->rgt, i++) in comwork() 388 for (v = now->rgt, i=0; v; v = v->rgt, i++) in comwork() 410 comwork(fd, now->lft->rgt, m); in comwork() 431 if (now->rgt) in comwork() 432 { Cat3("(", now->rgt->lft, ") : "); in comwork() 433 Cat3("(", now->rgt->rgt, ") )"); in comwork() 441 comwork(fd,now->rgt,m); in comwork() [all …]
|
/dports/security/py-exscript/exscript-2.6/Exscript/interpreter/ |
H A D | expression.py | 39 self.rgt = None 113 rgt = rgt_lst[0] 115 rgt = '' 124 rgt = int(rgt) 130 return [lft == rgt] 147 return [lft != rgt] 161 return [lft and rgt] 163 return [lft or rgt] 182 if self.rgt is not None: 209 root = root.rgt [all …]
|
/dports/sysutils/vttest/vttest-20180811/ |
H A D | nonvt100.c | 34 int rgt; in tst_CBT() local 92 int rgt; in tst_CHA() local 107 box.right = rgt - (rgt - lft + 1) / 4 - 1; in tst_CHA() 166 int rgt; in tst_CHT() local 287 int rgt; in tst_HPA() local 302 box.right = rgt - (rgt - lft + 1) / 4 - 1; in tst_HPA() 372 box.right = rgt - (rgt - lft + 1) / 4 - 1; in tst_HPR() 680 box.right = rgt - (rgt - lft + 1) / 4 - 1; in tst_VPA() 700 if ((box.right == rgt) && (rgt < min_cols)) in tst_VPA() 780 box.right = rgt - (rgt - lft + 1) / 4 - 1; in tst_VPR() [all …]
|
H A D | vt420.c | 613 int rgt; in tst_DECBI() local 900 int rgt; in tst_DECDC() local 1193 int rgt; in tst_ICH_DCH() local 1229 real_col = rgt; in tst_ICH_DCH() 1252 real_col = rgt; in tst_ICH_DCH() 1364 if (col < rgt) in tst_ICH_DCH() 1404 int rgt; in tst_ASCII_format() local 1421 cup(top, rgt); in tst_ASCII_format() 1492 int rgt; in tst_DECFI() local 1766 int rgt; in tst_DECIC() local [all …]
|
/dports/games/wolfpack/empire-4.4.1/src/lib/subs/ |
H A D | nstr.c | 103 tail = nstr_parse_val(tail, &np->rgt); in nstr_comp() 218 #define EVAL(op, lft, rgt) \ argument 219 ((op) == '<' ? (lft) < (rgt) \ 220 : (op) == '=' ? (lft) == (rgt) \ 221 : (op) == '>' ? (lft) > (rgt) \ 222 : (op) == '#' ? (lft) != (rgt) \ 236 struct valstr lft, rgt; in nstr_exec() local 245 rgt = np[i].rgt; in nstr_exec() 260 rgt.val_as.str.base, rgt.val_as.str.maxsz); in nstr_exec() 509 rgt = nstr_promote(rgt); in nstr_optype() [all …]
|
/dports/databases/p5-DBIx-Class-Tree-NestedSet/DBIx-Class-Tree-NestedSet-0.10/t/tlib/ |
H A D | TestTree.pm | 23 is($root->rgt, $nodes_count * 2, "$test_str - [".$root->id."] Correct number of nodes"); 28 while ($index < $root->rgt) { 31 rgt => $index, 37 ok($node->lft < $node->rgt, "$test_str - [$index] left < right"); 38 ok($node->rgt < $root->rgt || $node->lft == 1, "$test_str - [$index] right < root->right"); 39 is(($node->rgt - $node->lft) % 2, 1, "$test_str - [$index] left/right diff is odd"); 43 …is(($node->rgt - 1 - $node->lft)/2, scalar @descendants, "$test_str - [$index] correct number of d…
|
/dports/www/ilias/ILIAS-5.4.25/Modules/Forum/classes/ |
H A D | class.ilForumPostsTree.php | 14 private $rgt = 0; variable in ilForumPostsTree 62 public function setRgt($rgt) argument 64 $this->rgt = $rgt; 69 return $this->rgt; 128 * @param integer $rgt 130 public static function updateTargetRootRgt($root_node_id, $rgt) argument 138 'rgt' => array('integer', $rgt)),
|
/dports/www/ilias6/ILIAS-6.14/Modules/Forum/classes/ |
H A D | class.ilForumPostsTree.php | 14 private $rgt = 0; variable in ilForumPostsTree 62 public function setRgt($rgt) argument 64 $this->rgt = $rgt; 69 return $this->rgt; 128 * @param integer $rgt 130 public static function updateTargetRootRgt($root_node_id, $rgt) argument 138 'rgt' => array('integer', $rgt)),
|
/dports/multimedia/aegisub/aegisub-3.2.2/src/ |
H A D | block_cache.h | 103 MacroBlock(MacroBlock&& rgt) : position(rgt.position), blocks(std::move(rgt.blocks)) { } in MacroBlock() 104 MacroBlock& operator=(MacroBlock&& rgt) { 105 position = rgt.position; 106 blocks = std::move(rgt.blocks); 146 DataBlockCache(DataBlockCache&& rgt) in DataBlockCache() argument 147 : data(std::move(rgt.data)) in DataBlockCache() 148 , age(std::move(rgt.age)) in DataBlockCache() 149 , macroblock_size(rgt.macroblock_size) in DataBlockCache() 150 , macroblock_index_mask(rgt.macroblock_index_mask) in DataBlockCache() 151 , factory(std::move(rgt.factory)) in DataBlockCache()
|
H A D | validators.cpp | 49 IntValidator::IntValidator(IntValidator const& rgt) in IntValidator() argument 50 : value(rgt.value) in IntValidator() 51 , allow_negative(rgt.allow_negative) in IntValidator() 53 SetWindow(rgt.GetWindow()); in IntValidator() 98 DoubleValidator::DoubleValidator(DoubleValidator const& rgt) in DoubleValidator() argument 99 : value(rgt.value) in DoubleValidator() 100 , min(rgt.min) in DoubleValidator() 101 , max(rgt.max) in DoubleValidator() 102 , decimal_sep(rgt.decimal_sep) in DoubleValidator() 105 SetWindow(rgt.GetWindow()); in DoubleValidator()
|
/dports/graphics/volpack/volpack-1.0b3/ |
H A D | vp_warp.c | 38 double rgt[3][2])); 319 OrderCoords(coords, lft, rgt) in OrderCoords() argument 322 double rgt[3][2]; 369 rgt[0][0] = sorted_coords[2][0]; 370 rgt[0][1] = sorted_coords[2][1]; 371 rgt[1][0] = sorted_coords[2][0]; 372 rgt[1][1] = sorted_coords[2][1]; 373 rgt[2][0] = sorted_coords[2][0]; 374 rgt[2][1] = sorted_coords[2][1]; 405 rgt[0][0] = sorted_coords[3][0]; [all …]
|
/dports/devel/spin/Spin-version-6.5.0/Examples/ |
H A D | calculator.pml | 10 { int s, lft, rgt 16 run calc(me); me?rgt 18 :: s == '+' -> you!(lft+rgt) 19 :: s == '-' -> you!(lft-rgt) 20 :: s == '*' -> you!(lft*rgt) 21 :: s == '/' -> assert(rgt != 0) 22 you!(lft/rgt)
|
/dports/www/py-dj32-django-treebeard/django-treebeard-4.4/treebeard/ |
H A D | ns_tree.py | 152 newobj.rgt = 2 174 'parent_rgt': rgt, 219 newobj.rgt = self.lft + 2 222 self.rgt += 2 256 newobj.rgt = 2 325 newobj.rgt = newpos + 1 403 gap = self.rgt - self.lft + 1 409 newpos = parent.rgt 534 return self.rgt - self.lft == 1 633 rgt__gt=self.rgt) [all …]
|
/dports/www/py-django-treebeard/django-treebeard-4.4/treebeard/ |
H A D | ns_tree.py | 152 newobj.rgt = 2 174 'parent_rgt': rgt, 219 newobj.rgt = self.lft + 2 222 self.rgt += 2 256 newobj.rgt = 2 325 newobj.rgt = newpos + 1 403 gap = self.rgt - self.lft + 1 409 newpos = parent.rgt 534 return self.rgt - self.lft == 1 633 rgt__gt=self.rgt) [all …]
|
/dports/www/joomla3/joomla3-3.9.24/libraries/fof/table/ |
H A D | nested.php | 361 $this->rgt = ++$maxRgt; 406 $parentNode->rgt += 2; 481 $parentNode->rgt += 2; 758 if ($parentNode->rgt == ($this->rgt + 1)) 810 $myRight = $this->rgt; 915 $myRight = $this->rgt; 1057 $myRight = $this->rgt; 1161 $myRight = $this->rgt; 1433 return ($otherNode->lft < $this->lft) && ($otherNode->rgt > $this->rgt); 1458 return ($otherNode->lft <= $this->lft) && ($otherNode->rgt >= $this->rgt); [all …]
|
/dports/www/joomla3/joomla3-3.9.24/libraries/src/Table/ |
H A D | Nested.php | 52 public $rgt; variable in Joomla\\CMS\\Table\\Nested 210 return ($node->rgt - $node->lft) == 1; 272 $query->where('rgt > ' . $this->rgt) 375 ->where('lft > ' . (int) $node->rgt); 384 ->where('rgt > ' . (int) $node->rgt); 515 $this->rgt = $repositionData->new_rgt; 606 ->where('lft > ' . (int) $node->rgt); 613 ->where('rgt > ' . (int) $node->rgt); 645 ->where('lft > ' . (int) $node->rgt); 652 ->where('rgt > ' . (int) $node->rgt); [all …]
|
/dports/multimedia/aegisub/aegisub-3.2.2/libaegisub/common/ |
H A D | charset_6937.cpp | 116 bool operator<(extended_range const& lft, extended_range const& rgt) { in operator <() argument 117 return lft.codepoint < rgt.codepoint; in operator <() 120 bool operator<(int lft, extended_range const& rgt) { in operator <() argument 121 return lft < rgt.codepoint; in operator <() 125 bool operator<(extended_range const& lft, int rgt) { in operator <() argument 126 return lft.codepoint < rgt; in operator <()
|