/dports/sysutils/cfengine317/cfengine-3.17.0/libpromises/ |
H A D | verify_classes.c | 243 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 247 bool result = (logic == c_and); in EvalBoolCombination() 265 case c_and: in EvalBoolCombination() 378 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/sysutils/cfengine316/cfengine-3.16.0/libpromises/ |
H A D | verify_classes.c | 243 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 247 bool result = (logic == c_and); in EvalBoolCombination() 265 case c_and: in EvalBoolCombination() 378 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/sysutils/cfengine-devel/core-d08ae9eff/libpromises/ |
H A D | verify_classes.c | 260 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 264 bool result = (logic == c_and); in EvalBoolCombination() 282 case c_and: in EvalBoolCombination() 395 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/sysutils/cfengine/cfengine-3.19.0/libpromises/ |
H A D | verify_classes.c | 260 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 264 bool result = (logic == c_and); in EvalBoolCombination() 282 case c_and: in EvalBoolCombination() 395 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/sysutils/cfengine318/cfengine-3.18.1/libpromises/ |
H A D | verify_classes.c | 260 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 264 bool result = (logic == c_and); in EvalBoolCombination() 282 case c_and: in EvalBoolCombination() 395 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/sysutils/cfengine319/cfengine-3.19.0/libpromises/ |
H A D | verify_classes.c | 260 enum combine_t { c_or, c_and, c_xor }; // Class combinations enumerator 264 bool result = (logic == c_and); in EvalBoolCombination() 282 case c_and: in EvalBoolCombination() 395 return EvalBoolCombination(ctx, cp->rval.item, c_and); in EvalClassExpression()
|
/dports/games/residualvm/residualvm-0.3.1/graphics/tinygl/ |
H A D | clip.cpp | 240 int co, c_and, cc[3], front; in gl_draw_triangle() local 282 c_and = cc[0] & cc[1] & cc[2]; in gl_draw_triangle() 283 if (c_and == 0) { in gl_draw_triangle() 290 int co, c_and, co1, cc[3], edge_flag_tmp, clip_mask; in gl_draw_triangle_clip() local 302 c_and = cc[0] & cc[1] & cc[2]; in gl_draw_triangle_clip() 304 if (c_and != 0) in gl_draw_triangle_clip()
|
/dports/games/scummvm/scummvm-2.5.1/graphics/tinygl/ |
H A D | clip.cpp | 240 int co, c_and, cc[3], front; in gl_draw_triangle() local 282 c_and = cc[0] & cc[1] & cc[2]; in gl_draw_triangle() 283 if (c_and == 0) { in gl_draw_triangle() 290 int co, c_and, co1, cc[3], edge_flag_tmp, clip_mask; in gl_draw_triangle_clip() local 302 c_and = cc[0] & cc[1] & cc[2]; in gl_draw_triangle_clip() 304 if (c_and != 0) in gl_draw_triangle_clip()
|
/dports/sysutils/dar/dar-2.5.14-bis/src/libdar/ |
H A D | filtre.cpp | 1561 crit_and c_and = crit_and(); in filtre_merge() local 1564 c_and.clear(); in filtre_merge() 1566 c_and.add_crit(crit_same_type()); in filtre_merge() 1571 c_and.add_crit(c_or); in filtre_merge() 1574 c_and, in filtre_merge() 1579 c_and.clear(); in filtre_merge() 1581 c_and.add_crit(crit_in_place_EA_present()); in filtre_merge() 1583 c_and.add_crit(crit_in_place_EA_more_recent()); in filtre_merge() 1585 c_or.add_crit(c_and); in filtre_merge() 1586 c_and.clear(); in filtre_merge() [all …]
|
/dports/net/ipsumdump/ipsumdump-1.86/src/ |
H A D | classifier.cc | 201 prog.finish_subtree(tree, Classification::c_and); in parse_program() 211 prog.finish_subtree(tree, Classification::c_and, in parse_program()
|
H A D | ipfilter.cc | 686 p.finish_subtree(tree, (high_bit_record & 1 ? Classification::c_and : Classification::c_or)); in add_comparison_exprs() 718 p.finish_subtree(tree, (_srcdst == SD_OR ? Classification::c_or : Classification::c_and)); in compile() 735 p.finish_subtree(tree, Classification::c_and); in compile() 746 p.finish_subtree(tree, Classification::c_and); in compile() 787 p.finish_subtree(tree, Classification::c_and); in compile() 928 _prog.finish_subtree(_tree, Classification::c_and); in parse_expr_iterative() 1267 prog.finish_subtree(tree, Classification::c_and, in parse_program()
|
/dports/databases/xapian-core12/xapian-core-1.2.25/languages/compiler/ |
H A D | syswords2.h | 1 c_among = 4, c_and, c_as, c_assign, c_assignto, c_atleast,
|
H A D | syswords.h | 34 { 3, (byte *)"and", c_and },
|
/dports/mail/rspamd/rspamd-3.1/contrib/snowball/compiler/ |
H A D | syswords2.h | 1 c_among = 4, c_and, c_as, c_assign, c_assignto, c_atleast,
|
H A D | syswords.h | 34 { 3, (const byte *)"and", c_and },
|
/dports/databases/xapian-core/xapian-core-1.4.18/languages/compiler/ |
H A D | syswords2.h | 1 c_among = 4, c_and, c_as, c_assign, c_assignto, c_atleast,
|
H A D | syswords.h | 34 { 3, (const byte *)"and", c_and },
|
/dports/textproc/snowballstemmer/snowball-2.2.0/compiler/ |
H A D | syswords2.h | 1 c_among = 4, c_and, c_as, c_assign, c_assignto, c_atleast,
|
H A D | syswords.h | 34 { 3, (const byte *)"and", c_and },
|
/dports/mail/rspamd-devel/rspamd-93430bb/contrib/snowball/compiler/ |
H A D | syswords2.h | 1 c_among = 4, c_and, c_as, c_assign, c_assignto, c_atleast,
|
H A D | syswords.h | 34 { 3, (const byte *)"and", c_and },
|
/dports/math/scilab/scilab-6.1.1/scilab/modules/m2sci/macros/sci_files/ |
H A D | sci_all.sci | 27 // %c_and and %b_and are not defined 76 // %c_and and %b_and are not defined
|
/dports/math/cvc4/CVC4-1.7/src/theory/strings/ |
H A D | regexp_operation.cpp | 847 std::vector< Node > c_and; in simplifyNRegExp() local 850 c_and.push_back( r[i][0].eqNode(s).negate() ); in simplifyNRegExp() 854 … c_and.push_back(NodeManager::currentNM()->mkNode(kind::STRING_IN_REGEXP, s, r[i]).negate()); in simplifyNRegExp() 857 conc = c_and.size() == 0 ? d_true : in simplifyNRegExp() 858 c_and.size() == 1 ? c_and[0] : NodeManager::currentNM()->mkNode(kind::AND, c_and); in simplifyNRegExp() 1034 std::vector< Node > c_and; in simplifyPRegExp() local 1038 c_and.push_back( r[i][0].eqNode(s) ); in simplifyPRegExp() 1043 c_and.push_back(NodeManager::currentNM()->mkNode(kind::STRING_IN_REGEXP, s, r[i])); in simplifyPRegExp() 1049 conc = c_and.size() == 1 ? c_and[0] : NodeManager::currentNM()->mkNode(kind::AND, c_and); in simplifyPRegExp()
|
/dports/devel/py-guppy3/guppy3-3.1.2/guppy/heapy/ |
H A D | UniSet.py | 895 def c_and(self, a, b): member in AtomFamily 1033 def c_and(self, a, b): member in AndFamily 1232 def c_and(self, a, b): member in OrFamily 1409 def c_and(self, a, b): member in InvertFamily 1412 _and_AND = c_and 1540 def c_and(self, a, b): member in IdentitySetFamily 1826 def c_and(self, a, b): member in EmptyFamily 1829 _and_ATOM = _and_INVERT = _and_AND = _and_OR = _and_ID = c_and 1911 def c_and(self, a, b): member in EquivalenceRelationFamily 1913 return AtomFamily.c_and(self, a, b)
|
/dports/games/scummvm/scummvm-2.5.1/engines/director/lingo/ |
H A D | lingo-code.h | 46 void c_and();
|