Description
Create comprehensive documentation that explains the step-by-step process for calculating CPF (Brazilian Individual's Taxpayer ID) check digits.
Scope
The documentation should cover:
- Detailed explanation of the modulo-11 algorithm used for CPF validation
- Step-by-step calculation process for the first check digit (10th position)
- Step-by-step calculation process for the second check digit (11th position)
- Weight sequences used in the calculation
- Edge cases and validation rules (e.g., repeated digits)
- Multiple worked examples with different CPF numbers
Context
This comprehensive documentation will allow us to remove or simplify the algorithm description currently in the README files, keeping them focused on usage rather than implementation details.
Related
Description
Create comprehensive documentation that explains the step-by-step process for calculating CPF (Brazilian Individual's Taxpayer ID) check digits.
Scope
The documentation should cover:
Context
This comprehensive documentation will allow us to remove or simplify the algorithm description currently in the README files, keeping them focused on usage rather than implementation details.
Related
v3] Enhance packages with rich documenttion,, JSdocs and standard terms #43v3] Enhance packages with rich documenttion,, JSdocs and standard terms #43 (comment)