Verhoeff algorithm: Difference between revisions

{{trans|Python}}

 

[1, 2, 3, 4, 0, 6, 7, 8, 9, 5],

[2, 3, 4, 0, 1, 7, 8, 9, 5, 6],

(Int64(1234567890120), 1B, 0B, 0B),

(Int64(1234567890129), 1B, 0B, 0B)]

 

{{out}}

 

=={{header|C}}==

#include <stdbool.h>

#include <stdio.h>

}

return 0;

 

{{out}}

 

=={{header|F_Sharp|F#}}==

// Verhoeff algorithm. Nigel Galloway: August 26th., 2021

let d,inv,p=let d=[|0;1;2;3;4;5;6;7;8;9;1;2;3;4;0;6;7;8;9;5;2;3;4;0;1;7;8;9;5;6;3;4;0;1;2;8;9;5;6;7;4;0;1;2;3;9;5;6;7;8;5;9;8;7;6;0;4;3;2;1;6;5;9;8;7;1;0;4;3;2;7;6;5;9;8;2;1;0;4;3;8;7;6;5;9;3;2;1;0;4;9;8;7;6;5;4;3;2;1;0|]

printfn $"The assertion that 1234567890120 is valid is %A{csum 1234567890120I=0}"

printfn $"The assertion that 1234567890129 is valid is %A{csum 1234567890129I=0}"

{{out}}

<pre>

=={{header|Go}}==

{{trans|Wren}}

 

import "fmt"

}

}

 

{{out}}

Implementation:

 

ac=: |(+-/~@i.) NB. anticyclic group, order y

a2n=: (+#)@ NB. add 2^n

 

checkdigit=: INV {~ verhoeff@*&10

 

Task examples:

3 1 0

valid 2363

3 │5 │4│4 │2│8 │

0 │2 │5│5 │1│3 │

 

=={{header|jq}}==

{{works with|jq}}

'''Works with gojq, the Go implementation of jq'''

 

def d: [

"\nThe validation for '\($stc)' is \($v).\n" );

{{out}}

As for [[#Wren]].

 

=={{header|Julia}}==

0 1 2 3 4 5 6 7 8 9;

1 2 3 4 0 6 7 8 9 5;

verhoeffchecksum(args...)

end

 

=={{header|Nim}}==

 

const

discard verhoeff(10 * n + 9, true)

except ValueError:

 

{{out}}

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Verhoeff_algorithm

}

print "\n";

{{out}}

<pre>

=={{header|Phix}}==

The tables were generated in case 1-based index versions of them would help, tbh, but in the end I didn't even try that, aka start with tagset(10).

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">d</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #7060A8;">tagset</span><span style="color: #0000FF;">(</span><span style="color: #000000;">9</span><span style="color: #0000FF;">,</span><span style="color: #000000;">0</span><span style="color: #0000FF;">)},</span>

<span style="color: #7060A8;">assert</span><span style="color: #0000FF;">(</span><span style="color: #000000;">verhoeff</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tests</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]&</span><span style="color: #008000;">'9'</span><span style="color: #0000FF;">,</span><span style="color: #004600;">true</span><span style="color: #0000FF;">,</span><span style="color: #000000;">show_workings</span><span style="color: #0000FF;">)!=</span><span style="color: #008000;">'0'</span><span style="color: #0000FF;">)</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

 

=={{header|Python}}==

(0, 1, 2, 3, 4, 5, 6, 7, 8, 9),

(1, 2, 3, 4, 0, 6, 7, 8, 9, 5),

(1234567890129, True, False, False)]:

verhoeffchecksum(n, va, t, ve)

 

 

Generate the tables rather than hard coding, They're not all that complex.

 

@d[$_][^5].=rotate($_), @d[$_][5..*].=rotate($_) for 1..4;

push @d: [@d[$_].reverse] for flat 1..4, 0;

validate $check, :verbose( $int.chars < 8 );

validate +($check.chop ~ 9), :verbose( $int.chars < 8 );

{{out}}

<pre>Checkdigit calculation for 236:

=={{header|Vlang}}==

{{trans|Go}}

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9],

[1, 2, 3, 4, 0, 6, 7, 8, 9, 5],

}

}

 

{{out}}

=={{header|Wren}}==

{{libheader|Wren-fmt}}

 

var d = [

System.print("\nThe validation for '%(stc)' is %(v ? "correct" : "incorrect").\n")

}

 

{{out}}