Nipodemos

make code & comments english

@@ -294,42 +294,42 @@ class GetUtils { @@ -294,42 +294,42 @@ class GetUtils {
294 static bool isEqual(num a, num b) => a == b; 294 static bool isEqual(num a, num b) => a == b;
295 295
296 /// Checks if the cpf is valid. 296 /// Checks if the cpf is valid.
297 - static bool isCpf(String cpf){ 297 + static bool isCpf(String cpf) {
298 if (cpf == null) return false; 298 if (cpf == null) return false;
299 299
300 // get only the numbers 300 // get only the numbers
301 - var numeros = cpf.replaceAll(RegExp(r'[^0-9]'), ''); 301 + var numbers = cpf.replaceAll(RegExp(r'[^0-9]'), '');
302 // Test if the CPF has 11 digits 302 // Test if the CPF has 11 digits
303 - if (numeros.length != 11) return false; 303 + if (numbers.length != 11) return false;
304 // Test if all CPF digits are the same 304 // Test if all CPF digits are the same
305 - if (RegExp(r'^(\d)\1*$').hasMatch(numeros)) return false; 305 + if (RegExp(r'^(\d)\1*$').hasMatch(numbers)) return false;
306 306
307 - // Dividir dígitos  
308 - List<int> digitos =  
309 - numeros.split('').map((String d) => int.parse(d)).toList(); 307 + // split the digits
  308 + List<int> digits =
  309 + numbers.split('').map((String d) => int.parse(d)).toList();
310 310
311 - // Calcular o primeiro dígito verificador  
312 - var calc_dv1 = 0; 311 + // Calculate the first verifier digit
  312 + var calcDv1 = 0;
313 for (var i in Iterable<int>.generate(9, (i) => 10 - i)) { 313 for (var i in Iterable<int>.generate(9, (i) => 10 - i)) {
314 - calc_dv1 += digitos[10 - i] * i; 314 + calcDv1 += digits[10 - i] * i;
315 } 315 }
316 - calc_dv1 %= 11;  
317 - var dv1 = calc_dv1 < 2 ? 0 : 11 - calc_dv1; 316 + calcDv1 %= 11;
  317 + var dv1 = calcDv1 < 2 ? 0 : 11 - calcDv1;
318 318
319 - // Testar o primeiro dígito verificado  
320 - if (digitos[9] != dv1) return false; 319 + // Tests the first verifier digit
  320 + if (digits[9] != dv1) return false;
321 321
322 - // Calcular o segundo dígito verificador  
323 - var calc_dv2 = 0; 322 + // Calculate the second verifier digit
  323 + var calcDv2 = 0;
324 for (var i in Iterable<int>.generate(10, (i) => 11 - i)) { 324 for (var i in Iterable<int>.generate(10, (i) => 11 - i)) {
325 - calc_dv2 += digitos[11 - i] * i; 325 + calcDv2 += digits[11 - i] * i;
326 } 326 }
327 - calc_dv2 %= 11; 327 + calcDv2 %= 11;
328 328
329 - var dv2 = calc_dv2 < 2 ? 0 : 11 - calc_dv2; 329 + var dv2 = calcDv2 < 2 ? 0 : 11 - calcDv2;
330 330
331 - // Testar o segundo dígito verificador  
332 - if (digitos[10] != dv2) return false; 331 + // Test the second verifier digit
  332 + if (digits[10] != dv2) return false;
333 333
334 return true; 334 return true;
335 } 335 }