- Pacient’s anylisis based in TCM methods and results with symptoms, syndromes, meridians states, warning signs, meaning of pulse and thongs exams.
- Previous exams based in CSV files.
- 208 prescriptions based in each diagnosed as suggested automatic outputs, possible to erase or editing and even consults the several methods of TCM (shu-points, mu-points, specified shens and 13 texts and diagrams of use as consult support).
- Native integrated diagnoses in TCM as current’s World Health Organization new ICD-11 (new worldwide catalog).
- Possible of analysis based in cun-guan-chi types, 28 types of pulses, thongs color, dimensions, moviments, warmith and humidity states, as also skin, pain, eyes analysis and Huang di’s Nei jing methods of cunkou-renyng differencial methods.
- Detection of suggestion of recommendations of mu, sun si miao’s ghosts’ points, shu and chronoacupuncture based in shi tian gan’s local time method, liu xie, ni’s pathologies, star and windows of heaven points, luo, ho, xi, yuan, muxi and all wonderful vases indications as possible automatic marks.
- Multi-selection of treatments and editable accuponts automatic prescriptions and running of smart algorithm that prevents dozens of needles, adapting for best mean marge.
- Suggestion of Chinease and Japanese extrameridian’s uses and action base and location alike.
- Use of IDs for privacity of pacients name and data.
- Local data storage allowing mobility for clouding porpouses.
TAO IS PROGRAMMED FOR MANDATORY USE OF CPF FOR ID LOG, THERE IS A SHREWD ALGORITHM FOR IT'S USE AND NOT USED IN USA, FOR TESTING USE THE LINK IN FOOTER OF ITEM
- What is a Brazilian CPF? A CPF is an individual taxpayer identification number given to people living in Brazil, both native Brazilians and resident aliens, who pay taxes. The CPF number is an identification number of Brazilian citizens emitted by the Brazilian Ministry of Revenue, which is called "Ministério da Fazenda".
- What does CPF stand for? CPF stands for Cadastro de Pessoas FĂsicas (Natural Persons Register). Native Brazilians can request a CPF at any time in their lives - parents will often apply on behalf of their children when they are newborns, as CPFs are vital to living in Brazil and it’s best to obtain one sooner rather than later.
- A CPF is 11 digits long, comprised of nine base digits, and two digits at the end that are the result of an arithmetic operation on the first nine numbers, meaning any typing mistakes will lead to an invalid number. Here is an example of a CPF: 231.002.999-00.
- The CPF is comprised of a base of 9 digits and 2 check digits. It is usually written like '231.002.999-00' so as to be more human-readable.
This module provides test_cpf for checking that a CPF number is correct. Here a correct CPF number means it is 11 digits long it satisfies the two check equations mentioned below Before checking, any non-digit letter is stripped, making it easy to test formatted entries like '231.002.999-00' and entries with extra blanks like ' 999.221.222-00 '.
test_cpf
test_cpf('999.444.333-55') # incorrect CPF, returns 0
test_cpf(' 263.946.533-30 ') # is ok, returns 1
test_cpf('888') # nope, returns undef
Tests whether a CPF number is correct. Before testing, any non-digit character is stripped. Then it is expected to be 11 digits long and to satisfy two check equations which validate the last two check digits. See "THE CHECK EQUATIONS".
The policy to get rid of '.' and '-' is very liberal. It indeeds discards anything that is not a digit (0, 1, ..., 9) or letter. That is handy for discarding spaces as well
test_cpf(' 263.946.533-30 ') # is ok, returns 1
But extraneous inputs like '#333%444*2.3+2-00' are also accepted. If you are worried about this kind of input, just check against a regex:
warn "bad CPF: only digits (11) expected"
unless (
THE CHECK EQUATIONS A correct CPF number has two check digits which are computed from the base 9 first digits. Consider the CPF number written as 11 digits c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] dv[1] dv[2] To check whether a CPF is correct or not, it has to satisfy the check equations: c[1]*10+c[2]*9+c[3]*8+c[4]*7+c[5]*6+ c[6]*5+c[7]*4+c[8]*3+c[9]*2+dv[1] = 0 (mod 11) or = 1 (mod 11) (if dv[1]=0) and c[2]*10+c[3]*9+c[4]*8+c[5]*7+c[6]*6+ c[7]*5+c[8]*4+c[9]*3+dv[1]*2+dv[2] = 0 (mod 11) or = 1 (mod 11) (if dv[2]=0)
HYPERLINK FOR GENERATION OR VALID NUMBER'S CHECK: https://www.4devs.com.br/gerador_de_cpf