Open the context
Choose the project folder and name the files or behavior involved.
Workflows
Coding workflows · Jaccard set similarity
03
A concrete starting point
Calculate Jaccard similarity for two collections of at most 1000 integers each, ignoring duplicates. Check disjoint and identical sets and define two empty sets as one, rejecting Boolean and non-integer members.
Define the change
Describe the input, expected output and boundaries that must stay intact.
Inspect the work
Review the proposed edits and any commands before relying on their result.
Check the outcome
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
Jaccard set similarity
A concrete starting point
def jaccard(left, right):
left, right = tuple(left), tuple(right)
if len(left) > 1000 or len(right) > 1000:
raise ValueError("collection.limit")
if any(type(v) is not int for v in left + right):
raise ValueError("member.integer")
left, right = set(left), set(right)
union = left | right
return len(left & right) / len(union) if union else 1.0The 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.