<commit_before># Primal Python:
#
# Functions for calculating primeness of numbers.
# Implementation (c) 2016-2020 <NAME> (github.com/Sonophoto)
# License: BSD-2c, i.e. Cite. [LINK TO REPO]
#
# Original Problem Statement
# accept number input
# list all primes upto and including this number.
# return a python list in ascending order
#
# First code is to sum the digits of the number
# Next we code for divisibility by 3, 5, 7, 


from math import sqrt
from functools import wraps

def sumDigits(number):
    """ Takes a single value "number" as type(int) or type(str) and sums
        the digits. Recurses as required to reduce very large numbers to
        a single digit. Tested against 710 digit 9s, only two recursions.
    """
    # Validate Input
    if type(number) == str:                                            
        if isdigit(number): number
        else
            print("Verify that your imput consists of the digits 0 thru 9. Your input: ", number)
            return -1 #Bad Input
    elif type(number) == int:
        number = str(number)
    else: return -1 # Bad Input

    # Generate Output 
    digit_sum = 0
    for c in in_val: digit_sum += int(c)
    if digit_sum < 10:
        return digit_sum
    elif digit_sum >= 10: # We still have more than one digit, recurse.
        return sumDigits(digit_sum)
<commit_msg>renamed function parallel with math usage.<commit_after># Primal Python:
#
# Functions for calculating primeness of numbers.
# Implementation (c) 2016-2020 <NAME> (github.com/Sonophoto)
# License: BSD-2c, i.e. Cite. [LINK TO REPO]
#
# Original Problem Statement
# accept number input
# list all primes upto and including this number.
# return a python list in ascending order
#
# First code is to sum the digits of the number
# Next we code for divisibility by 3, 5, 7, 


from math import sqrt
from functools import wraps

def digitalRoot(number):
    """ Takes a single value "number" as type(int) or type(str) and sums
        the digits. Recurses as required to reduce very large numbers to
        a single digit. Tested against 710 digit 9s, only two recursions.
    """
    # Validate Input
    if type(number) == str:                                            
        if isdigit(number): number
        else
            print("Verify that your imput consists of the digits 0 thru 9. Your input: ", number)
            return -1 #Bad Input
    elif type(number) == int:
        number = str(number)
    else: return -1 # Bad Input

    # Generate Output 
    digit_sum = 0
    for c in in_val: digit_sum += int(c)
    if digit_sum < 10:
        return digit_sum
    elif digit_sum >= 10: # We still have more than one digit, recurse.
        return digitalRoot(digit_sum)

{'fraction_non_alphanumeric': 0.07658482960791499, 'fraction_numerical': 0.01832172957127153, 'mean_word_length': 2.5135135135135136, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4497057', 'n_tokens_mistral': 839, 'n_tokens_neox': 760, 'n_words': 343}