Verhoeff algorithm: Difference between revisions

Line 23:

<~~lang~~ 11l>V MULTIPLICATION_TABLE = [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9],

<syntaxhighlight lang="11l">V MULTIPLICATION_TABLE = [[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],

Line 77:

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

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

verhoeffchecksum(n, va, t, ve)</~~lang~~>

verhoeffchecksum(n, va, t, ve)</syntaxhighlight>

Line 83:

=={{header|C}}==

<~~lang~~ c>#include <assert.h>

<syntaxhighlight lang="c">#include <assert.h>

#include <stdbool.h>

#include <stdio.h>

Line 147:

}

return 0;

}</~~lang~~>

}</syntaxhighlight>

Line 230:

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

<~~lang~~ fsharp>

// 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|]

Line 253:

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

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

</syntaxhighlight>

</lang>

<pre>

Line 327:

=={{header|Go}}==

<~~lang~~ go>package main

<syntaxhighlight lang="go">package main

import "fmt"

Line 404:

}

}</~~lang~~>

}</syntaxhighlight>

Line 415:

Implementation:

<~~lang~~ J>cyc=: | +/~@i. NB. cyclic group, order y

<syntaxhighlight lang="j">cyc=: | +/~@i. NB. cyclic group, order y

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

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

Line 444:

checkdigit=: INV {~ verhoeff@*&10

valid=: 0 = verhoeff</~~lang~~>

valid=: 0 = verhoeff</syntaxhighlight>

Task examples:

<~~lang~~ J> checkdigit 236 12345 123456789012

<syntaxhighlight lang="j"> checkdigit 236 12345 123456789012

3 1 0

valid 2363

Line 477:

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

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

</syntaxhighlight>

</lang>

=={{header|jq}}==

Line 483:

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

<~~lang~~ jq>def lpad($len): tostring | ($len - length) as $l | (" " * $l)[:$l] + .;

<syntaxhighlight lang="jq">def lpad($len): tostring | ($len - length) as $l | (" " * $l)[:$l] + .;

def d: [

Line 556:

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

task</~~lang~~>

task</syntaxhighlight>

As for [[#Wren]].

=={{header|Julia}}==

<~~lang~~ julia>const multiplicationtable = [

<syntaxhighlight lang="julia">const multiplicationtable = [

0 1 2 3 4 5 6 7 8 9;

1 2 3 4 0 6 7 8 9 5;

Line 615:

verhoeffchecksum(args...)

end

</~~lang~~>{{out}}Same as Wren example.

</syntaxhighlight>{{out}}Same as Wren example.

=={{header|Nim}}==

<~~lang~~ ~~Nim~~>import strformat

<syntaxhighlight lang="nim">import strformat

const

Line 699:

discard verhoeff(10 * n + 9, true)

except ValueError:

echo getCurrentExceptionMsg()</~~lang~~>

echo getCurrentExceptionMsg()</syntaxhighlight>

Line 761:

=={{header|Perl}}==

<~~lang~~ perl>#!/usr/bin/perl

<syntaxhighlight lang="perl">#!/usr/bin/perl

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

Line 823:

}

print "\n";

}</~~lang~~>

}</syntaxhighlight>

<pre>

Line 857:

=={{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).

with javascript_semantics

sequence d = {tagset(9,0)},

Line 919:

assert(verhoeff(tests[i]&'9',true,show_workings)!='0')

end for

<pre>

Line 990:

=={{header|Python}}==

<~~lang~~ python>MULTIPLICATION_TABLE = [

<syntaxhighlight lang="python">MULTIPLICATION_TABLE = [

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

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

Line 1,049:

(1234567890129, True, False, False)]:

verhoeffchecksum(n, va, t, ve)

</~~lang~~>{{out}}Output same as Wren example.

</syntaxhighlight>{{out}}Output same as Wren example.

Line 1,055:

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

<lang ~~perl6~~>my @d = [^10] xx 5;

<syntaxhighlight lang="raku" line>my @d = [^10] xx 5;

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

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

Line 1,101:

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

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

}</~~lang~~>

}</syntaxhighlight>

<pre>Checkdigit calculation for 236:

Line 1,168:

=={{header|Vlang}}==

<~~lang~~ go>const d = [

<syntaxhighlight lang="go">const d = [

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

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

Line 1,242:

}

}</~~lang~~>

}</syntaxhighlight>

Line 1,251:

=={{header|Wren}}==

<~~lang~~ ecmascript>import "/fmt" for Fmt

<syntaxhighlight lang="ecmascript">import "/fmt" for Fmt

var d = [

Line 1,306:

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

}

}</~~lang~~>

}</syntaxhighlight>