ProtoFlux:Greatest Common Divisor: Difference between revisions

From Resonite Wiki
Added flux node and rudimentary explanations.
 
m Add data types
 
Line 14: Line 14:


The <code>Greatest Common Divisor</code> node finds the biggest number  between input A and B which can be divided by without a decimal.
The <code>Greatest Common Divisor</code> node finds the biggest number  between input A and B which can be divided by without a decimal.
The node can be [[Type:Int|int]], [[Type:long|long]], [[Type:Uint|uint]] or [[Type:ulong|ulong]] type data.


== Inputs ==
== Inputs ==
Line 31: Line 33:
Returns the result.
Returns the result.


[[Category:ProtoFlux:All]]
[[Category:ProtoFlux:Math]]
[[Category:ProtoFlux:Math]]

Latest revision as of 19:02, 27 May 2024

GreatestCommonDivisor
A
*
B
Math

The Greatest Common Divisor node finds the biggest number between input A and B which can be divided by without a decimal.

The node can be int, long, uint or ulong type data.

Inputs

A (Pseudo-generic)

The first value to compare.

B (Pseudo-generic)

The second value to compare.

Outputs

* (Pseudo-generic)

Returns the result.