Hyphenation: <span class="searchmatch">infix</span> op‧er‧ator <span class="searchmatch">infix</span> <span class="searchmatch">operator</span> (plural <span class="searchmatch">infix</span> <span class="searchmatch">operators</span>) (computing) an <span class="searchmatch">operator</span> that is placed in between the operands like it is commonly...
Hyphenation: <span class="searchmatch">infix</span> op‧er‧ators <span class="searchmatch">infix</span> <span class="searchmatch">operators</span> plural of <span class="searchmatch">infix</span> <span class="searchmatch">operator</span>...
elliptic <span class="searchmatch">operator</span> Elvis <span class="searchmatch">operator</span> excavator <span class="searchmatch">operator</span> flip-flop <span class="searchmatch">operator</span> forklift <span class="searchmatch">operator</span> Hamiltonian <span class="searchmatch">operator</span> hypoelliptic <span class="searchmatch">operator</span> <span class="searchmatch">infix</span> <span class="searchmatch">operator</span> integral...
+++ (programming) An <span class="searchmatch">infix</span> demux <span class="searchmatch">operator</span> (in certain programming languages such as Haskell). (demux): ⧻ + ++...
also: <span class="searchmatch">infix</span> English Wikipedia has an article on: <span class="searchmatch">infix</span> notation Wikipedia <span class="searchmatch">infix</span> notation (uncountable) (mathematics) Notation where <span class="searchmatch">operators</span> appear...
<span class="searchmatch">infix</span> interfix libfix postfix prefix prefixoid simulfix suffix suffixoid suprafix transfix infixal infixation infixion <span class="searchmatch">infix</span> notation <span class="searchmatch">infix</span> <span class="searchmatch">operator</span> morpheme...
comparable) (computing theory) Being or relating to a kind of <span class="searchmatch">operator</span> that can combine any of the <span class="searchmatch">infix</span>, prefix, postfix, and closed notations. distfix...
an <span class="searchmatch">operator</span> relative to its operand (prefix, postfix) or operands (<span class="searchmatch">infix</span>). One may use a fixity declaration in Haskell to describe an <span class="searchmatch">operator's</span> precedence...
Alternative form of ∧, the conjunction <span class="searchmatch">operator</span>. (logic) The binary <span class="searchmatch">operator</span> and, only true if both of two inputs is true. In <span class="searchmatch">infix</span> notation. NAND FALSE OR NOR NOT...
OR (uncountable) (logic) The binary <span class="searchmatch">operator</span> inclusive or, true if one at least one of two inputs is true. In <span class="searchmatch">infix</span> notation. ∨ NOR AND XOR NAND NOT OR...