Difference between revisions of "And"

From Lazarus wiki
Jump to navigationJump to search
m
(11 intermediate revisions by 5 users not shown)
Line 1: Line 1:
 
{{And}}
 
{{And}}
  
= Boolean operation =
+
The binary operator {{HL|and}} performs a logical conjunction.
 +
[[FPC]] also does a bitwise {{HL|and}} when supplied with ordinal types.
  
'''And''' produces a value of [[True|true]] if and only if both of its operands are true.
+
== Boolean operation ==
 +
The operator {{HL|and}} accepts to two Boolean type values.
 +
It is the logical conjunction written in classic logic as <math>A \land B</math>.
 +
Electrical engineers may write <math>A \times B</math> or <math>A \cdot B</math>, or eliminating the multiplication sign altogether writing <math>AB</math>.
 +
However, the [[*|asterisk]] has a different meaning in programming.
 +
The Boolean {{HL|and}} evaluates to [[false and true|{{HL|true}}]] if and only if both operands are {{HL|true}}.
  
== Truth table ==
+
{| class="wikitable" style="text-align:center; margin:auto;"
 
+
! {{HL|A}}
{| class="wikitable"
+
! {{HL|B}}
|-
+
! {{HL|A and B}}
! A !! B !! A and B  
 
 
|-
 
|-
| &nbsp; false &nbsp;|| &nbsp; false &nbsp;
+
| {{HL|false}}
|style="background: #eeeeee" | &nbsp; false
+
| {{HL|false}}
 +
| style="background: #eeeeee" | {{HL|false}}
 
|-
 
|-
| &nbsp; false || &nbsp; true  
+
| {{HL|false}}
|style="background: #eeeeee" | &nbsp; false
+
| {{HL|true}}
 +
| style="background: #eeeeee" | {{HL|false}}
 
|-
 
|-
| &nbsp; true || &nbsp; false  
+
| {{HL|true}}
|style="background: #eeeeee" | &nbsp; false
+
| {{HL|false}}
 +
| style="background: #eeeeee" | {{HL|false}}
 
|-
 
|-
| &nbsp; true || &nbsp; true  
+
| {{HL|true}}
|style="background: #eeeeee" | &nbsp; true
+
| {{HL|true}}
 +
| style="background: #eeeeee" | {{HL|true}}
 +
|+ truth table for logical conjunction
 
|}
 
|}
  
 +
== Bitwise operation ==
 +
FPC also defines a bitwise <syntaxhighlight lang="pascal" enclose="none">and</syntaxhighlight>.
 +
Taking two ordinal operands logical <syntaxhighlight lang="pascal" enclose="none">and</syntaxhighlight> is calculated bit by bit:
 +
    1010'1100
 +
and 0011'0100
 +
―――――――――――――
 +
    0010'0100
  
= Bitwise operation =
+
== comparative remarks ==
 
+
Depending on the compiler's specific implementation of the data type [[Set|{{HL|set}}]], the [[Asterisk|intersection of sets]] virtually does the same as the bitwise {{HL|and}}.
Bitwise and sets a bit to 1 if and only if all of the corresponding bits in its operands are 1.
 
 
 
== Is power of two ==
 
 
 
<syntaxhighlight>
 
function IsPowerOfTwo( const aValue : longint ): boolean;
 
var
 
  x : longint;
 
  b : boolean;
 
begin
 
  b := false;
 
  if aValue <> 0 then
 
    begin
 
      x := aValue - 1;
 
      x := x and aValue;
 
      if x = 0 then b := true;
 
    end;
 
  result := b;
 
end; 
 
</syntaxhighlight>
 
 
 
If you call IsPowerOfTwo(4) then get true. If you call IsPowerOfTwo(5) then get false .
 
 
 
=== Read more ===
 
* [[Not]]
 
* [[Shl]]
 
 
 
* [[Const]]
 
* [[Function]]
 
* [[Integer]]
 
  
* [[Shl# Clear a bit|Clear a bit]]
+
{{Logical operators}}
  
 
[[Category:Pascal]]
 
[[Category:Pascal]]
 +
[[Category:Operators]]

Revision as of 21:13, 29 August 2021

Deutsch (de) English (en) español (es) suomi (fi) français (fr) русский (ru)

The binary operator and performs a logical conjunction. FPC also does a bitwise and when supplied with ordinal types.

Boolean operation

The operator and accepts to two Boolean type values. It is the logical conjunction written in classic logic as [math]\displaystyle{ A \land B }[/math]. Electrical engineers may write [math]\displaystyle{ A \times B }[/math] or [math]\displaystyle{ A \cdot B }[/math], or eliminating the multiplication sign altogether writing [math]\displaystyle{ AB }[/math]. However, the asterisk has a different meaning in programming. The Boolean and evaluates to true if and only if both operands are true.

A B A and B
false false false
false true false
true false false
true true true
truth table for logical conjunction

Bitwise operation

FPC also defines a bitwise and. Taking two ordinal operands logical and is calculated bit by bit:

    1010'1100
and 0011'0100
―――――――――――――
    0010'0100

comparative remarks

Depending on the compiler's specific implementation of the data type set, the intersection of sets virtually does the same as the bitwise and.


navigation bar: Pascal logical operators
operators

and • or • not • xor
shl • shr
and_then (N/A)• or_else (N/A)

see also

{$boolEval} • Reference: § “boolean operators” • Reference: § “logical operators”