Newest functions Upload a function Leave a tip My account

There are 2,572 functions in this library.

Validate_Generate_CNPJ ( fnType ; CNPJ )

A variation of Francisco Carlos Otani's

  Average rating: 4.3 (41 votes) Log in to vote

Edward Souza Duana A.S. Designs, LLC n/a

  Function definition: (Copy & paste into FileMaker's Edit Custom Function window)

/* Validate_Generate_CNPJ ( fnType ; CNPJ ) The Brazilian Government IRS employs a Modulus 11 Algorithm variation to calculate a tax-oriented cadastral number -- compulsory to all companies countrywide -- entitled "CNPJ". Francisco Carlos Otani wrote a useful CF (http://www.briandunning.com/cf/1215) to validate the cadastral number checksum digits, which are the last two of a series of 14 numerical digits. Looking at Otani's CF code, I realized it could be restructured modularly; it would be concurrently conciser and more abstract, hence used as the starting point to another Modulus 11 Algorithm variation. Also, since it validated checksum numbers, the CF could as well spawn them. That's what this CF does: it either validates or produces CNPJ's checksum digits. Below, a brief explanation of its parameters. 1. fnType String Type: Number (0/1) Value Format: 0 or empty for checksum validations; 1 for generating checksum digits examples: "" or 0; 1 2. CNPJ String Type: Text wrapped between double quotes, number Value Format: for checksum validations, a 14-digit number, either formatted according to the Brazilian IRS standard (XX.XXX.XXX/XXXX-XX) or not for generating checksum digits, a 12-digit number exmaples: 11.222.333/0001-81, 11222333000181, 112223330001 I hope you enjoy it. © 2010 Edward Souza */ Let ( [ numCNPJ = Filter ( CNPJ ; "0123456789" ); valDgt = If ( Length ( numCNPJ ) = 14; Left ( numCNPJ ; 12 ); Left ( numCNPJ ; 12 ) ); valCtlA = If ( IsValid ( GetAsBoolean ( valDgt ) ); Middle ( numCNPJ ; 13 ; 1 ) ); valCtlB = If ( IsValid ( GetAsBoolean ( valDgt ) ); Right ( numCNPJ ; 1 ) ); lenValDgt = Length ( valDgt ); /*these next lists may be assembled recursivelly with the aid of an external CF*/ lstMultiA = 5 & ¶ & 4 & ¶ & 3 & ¶ & 2 & ¶ & 9 & ¶ & 8 & ¶ & 7 & ¶ & 6 & ¶ & 5 & ¶ & 4 & ¶ & 3 & ¶ & 2; lstMultiB = 6 & ¶ & 5 & ¶ & 4 & ¶ & 3 & ¶ & 2 & ¶ & 9 & ¶ & 8 & ¶ & 7 & ¶ & 6 & ¶ & 5 & ¶ & 4 & ¶ & 3 & ¶ & 2; /*the next list may be assembled recursivelly with the aid of a second external CF*/ lstValDig = Left ( valDgt ; 1 ) & ¶ & Middle ( valDgt ; 2 ; 1 ) & ¶ & Middle ( valDgt ; 3 ; 1 ) & ¶ & Middle ( valDgt ; 4 ; 1 ) & ¶ & Middle ( valDgt ; 5 ; 1 ) & ¶ & Middle ( valDgt ; 6 ; 1 ) & ¶ & Middle ( valDgt ; 7 ; 1 ) & ¶ & Middle ( valDgt ; 8 ; 1 ) & ¶ & Middle ( valDgt ; 9 ; 1 ) & ¶ & Middle ( valDgt ; 10 ; 1 ) & ¶ & Middle ( valDgt ; 11 ; 1 ) & ¶ & Right ( valDgt ; 1 ); /*this calculation may be computed recursivelly with the aid of a third external CF*/ vleCalcLstA = ( GetValue ( lstMultiA ; 1 ) * GetValue ( lstValDig ; 1 ) ) + ( GetValue ( lstMultiA ; 2 ) * GetValue ( lstValDig ; 2 ) ) + ( GetValue ( lstMultiA ; 3 ) * GetValue ( lstValDig ; 3 ) ) + ( GetValue ( lstMultiA ; 4 ) * GetValue ( lstValDig ; 4 ) ) + ( GetValue ( lstMultiA ; 5 ) * GetValue ( lstValDig ; 5 ) ) + ( GetValue ( lstMultiA ; 6 ) * GetValue ( lstValDig ; 6 ) ) + ( GetValue ( lstMultiA ; 7 ) * GetValue ( lstValDig ; 7 ) ) + ( GetValue ( lstMultiA ; 8 ) * GetValue ( lstValDig ; 8 ) ) + ( GetValue ( lstMultiA ; 9 ) * GetValue ( lstValDig ; 9 ) ) + ( GetValue ( lstMultiA ; 10 ) * GetValue ( lstValDig ; 10 ) ) + ( GetValue ( lstMultiA ; 11 ) * GetValue ( lstValDig ; 11 ) ) + ( GetValue ( lstMultiA ; 12 ) * GetValue ( lstValDig ; 12 ) ); vleCalcCtlA = If ( Mod ( vleCalcLstA ; 11 ) > 2; 11 - Mod ( vleCalcLstA ; 11 ) ; 0 ); lstValDigB = lstValDig & ¶ & vleCalcCtlA; /*this calculation may also be computed recursivelly with the aid of the third external CF*/ vleCalcLstB = ( GetValue ( lstMultiB ; 1 ) * GetValue ( lstValDigB ; 1 ) ) + ( GetValue ( lstMultiB ; 2 ) * GetValue ( lstValDigB ; 2 ) ) + ( GetValue ( lstMultiB ; 3 ) * GetValue ( lstValDigB ; 3 ) ) + ( GetValue ( lstMultiB ; 4 ) * GetValue ( lstValDigB ; 4 ) ) + ( GetValue ( lstMultiB ; 5 ) * GetValue ( lstValDigB ; 5 ) ) + ( GetValue ( lstMultiB ; 6 ) * GetValue ( lstValDigB ; 6 ) ) + ( GetValue ( lstMultiB ; 7 ) * GetValue ( lstValDigB ; 7 ) ) + ( GetValue ( lstMultiB ; 8 ) * GetValue ( lstValDigB ; 8 ) ) + ( GetValue ( lstMultiB ; 9 ) * GetValue ( lstValDigB ; 9 ) ) + ( GetValue ( lstMultiB ; 10 ) * GetValue ( lstValDigB ; 10 ) ) + ( GetValue ( lstMultiB ; 11 ) * GetValue ( lstValDigB ; 11 ) ) + ( GetValue ( lstMultiB ; 12 ) * GetValue ( lstValDigB ; 12 ) ) + ( GetValue ( lstMultiB ; 13 ) * GetValue ( lstValDigB ; 13 ) ); vleCalcCtlB = If ( Mod ( vleCalcLstB ; 11 ) > 2; 11 - Mod ( vleCalcLstB ; 11 ) ; 0 ) ]; Choose ( fnType; /*if parameter fnType is empty or equals 0, CF validates the checksum numbers; if equals 1, it generates the latter*/ Case ( /*Windows users shall replace "≠" with "<>"*/ valCtlA ≠ vleCalcCtlA; "value error - please revise CNPJ digits"; valCtlB ≠ vleCalcCtlB; "value error - please revise first checksum digit"; /*reformats CNPJ number according to Brazilian IRS standard*/ Left ( valDgt ; 2 ) & "." & Middle ( valDgt ; 3 ; 3 ) & "." & Middle ( valDgt ; 6 ; 3 ) & "/" & Right ( valDgt ; 4 ) & "-" & valCtlA & valCtlB ); Left ( valDgt ; 2 ) & "." & Middle ( valDgt ; 3 ; 3 ) & "." & Middle ( valDgt ; 6 ; 3 ) & "/" & Right ( valDgt ; 4 ) & "-" & vleCalcCtlA & vleCalcCtlB ) ) Click to copy

The Brazilian Government IRS employs a Modulus 11 Algorithm variation to calculate a tax-oriented cadastral number -- compulsory to all companies countrywide -- entitled "CNPJ".
Francisco Carlos Otani wrote a useful CF (http://www.briandunning.com/cf/1215) to validate the cadastral number checksum digits, which are the last two of a series of 14 numerical digits. Looking at Otani's CF code, I realized it could be restructured modularly; it would be concurrently conciser and more abstract, hence used as the starting point to another Modulus 11 Algorithm variation. Also, since it validated checksum numbers, the CF could as well spawn them.

 

Comments

Log in to post comments.

 

Note: these functions are not guaranteed or supported by BrianDunning.com. Please contact the individual developer with any questions or problems.

Support this website.

This library has been a free commmunity resource for FileMaker users and developers for 21 years. It receives no funding and has no advertisements. If it has helped you out, I'd really appreciate it if you could contribute whatever you think it's worth: