Or: Difference between revisions

Jump to navigation Jump to search

Or (view source)

Revision as of 02:19, 28 May 2022

1,079 bytes removed ,  02:19, 28 May 2022
→‎Documentation: BQN
(→‎Extended definition: Split the description for integers and non-integers)
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Built-in|Or|∨}} is a [[dyadic]] [[scalar function|scalar]] [[boolean function]] which tests if at least one of the two arguments is true: it returns 1 if at least one side is 1 and 0 if both are 0. It represents the [[wikipedia:logical disjunction|logical disjunction]] in Boolean logic.
{{Built-in|Or|∨}} is a [[dyadic]] [[scalar function|scalar]] [[boolean function]] which tests if at least one of the two arguments is true: it returns 1 if at least one side is 1 and 0 if both are 0. It represents the [[wikipedia:logical disjunction|logical disjunction]] in Boolean logic. In many APLs, Or is a special case of the [[GCD]] function.


{|class=wikitable
{|class=wikitable
Line 29: Line 29:
</source>
</source>


== Extended definition ==
== See also ==
 
* [[Add]]
Many APL implementations extend this function to non-Boolean arguments. In this case, this function behaves as '''[[wikipedia:Greatest common divisor|Greatest Common Divisor]]''' or '''GCD'''. For positive integer arguments, it is defined as the largest positive number which divides both numbers. If one of the arguments is zero, the GCD function returns the other number.
* [[Maximum]]
 
* [[Union]]
<source lang=apl>
* [[Nor]]
      ∘.∨⍨ 0,⍳10
* [[And]]
0 1 2 3 4 5 6 7 8 9 10
1 1 1 1 1 1 1 1 1 1  1
2 1 2 1 2 1 2 1 2 1  2
3 1 1 3 1 1 3 1 1 3  1
4 1 2 1 4 1 2 1 4 1  2
5 1 1 1 1 5 1 1 1 1  5
6 1 2 3 2 1 6 1 2 3  2
7 1 1 1 1 1 1 7 1 1  1
8 1 2 1 4 1 2 1 8 1  2
9 1 1 3 1 1 3 1 1 9  1
10 1 2 1 2 5 2 1 2 1 10
</source>{{Works in|[[Dyalog APL]]}}
 
While the mathematical definition of GCD does not cover non-integers, some implementations accept them as arguments. In this case, the return value of <source lang=apl inline>R←X∨Y</source> is chosen so that both <source lang=apl inline>X÷R</source> and <source lang=apl inline>Y÷R</source> are integers (or [[wikipedia:Gaussian integer|Gaussian integers]], when X and/or Y are [[complex]] numbers).
 
<source lang=apl>
      0.6∨13÷3
0.06666666667
      0.6(13÷3)÷0.6∨13÷3
9 65
      2J2∨3J1
1J1
      2J2 3J1÷1J1
2 2J¯1
</source>{{Works in|[[Dyalog APL]]}}


== External links ==
== External links ==
Line 65: Line 40:
=== Documentation ===
=== Documentation ===


* [http://help.dyalog.com/17.1/#Language/Primitive%20Functions/Or%20Greatest%20Common%20Divisor.htm Dyalog]
* [https://help.dyalog.com/17.1/#Language/Primitive%20Functions/Or%20Greatest%20Common%20Divisor.htm Dyalog]
* [http://microapl.com/apl_help/ch_020_020_420.htm APLX]
* J [https://www.jsoftware.com/help/dictionary/d101.htm Dictionary], [https://code.jsoftware.com/wiki/Vocabulary/plusdot#dyadic NuVoc]
* J [https://www.jsoftware.com/help/dictionary/d101.htm Dictionary], [https://code.jsoftware.com/wiki/Vocabulary/plusdot#dyadic NuVoc]
* [https://mlochbaum.github.io/BQN/doc/logic.html BQN]
{{APL built-ins}}[[Category:Primitive functions]][[Category:Scalar dyadic functions]]
{{APL built-ins}}[[Category:Primitive functions]][[Category:Scalar dyadic functions]]
Retrieved from ‘https://aplwiki.com/wiki/Special:MobileDiff/4617...8618’

Navigation menu