Open the context
Choose the project folder and name the files or behavior involved.
Find the shortest unit whose repetitions exactly form a string of at most 256 Unicode code points. Test empty text and a nonperiodic string, preserving combining marks without normalization or partial final repetitions.
Choose the project folder and name the files or behavior involved.
Describe the input, expected output and boundaries that must stay intact.
Review the proposed edits and any commands before relying on their result.
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
def primitive_period(text):
if type(text) is not str or len(text) > 256:
raise ValueError("period.input")
if not text:
return ""
for width in range(1, len(text)+1):
if len(text) % width == 0:
root = text[:width]
if root * (len(text)//width) == text:
return rootThe example is a starting point for a real project, not a claim that generated code is already tested. Adjust paths, dependencies and expected behavior to match your application.