From 081e32e32efac85b5802d00ac7e06c2ba6eb8eb0 Mon Sep 17 00:00:00 2001 From: Liam DeVoe Date: Sun, 4 Feb 2024 17:45:52 -0500 Subject: [PATCH] wording --- .../src/hypothesis/internal/conjecture/datatree.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/hypothesis-python/src/hypothesis/internal/conjecture/datatree.py b/hypothesis-python/src/hypothesis/internal/conjecture/datatree.py index 5159b7af47..68401c3c63 100644 --- a/hypothesis-python/src/hypothesis/internal/conjecture/datatree.py +++ b/hypothesis-python/src/hypothesis/internal/conjecture/datatree.py @@ -203,7 +203,7 @@ def compute_max_children(ir_type, kwargs): # # In practice, we maintain two distinct implementations for efficiency and space # reasons. If you just need the number of children, it is cheaper to use -# compute_max_children than reify the list of children (only to immediately +# compute_max_children than to reify the list of children (only to immediately # throw it away). def all_children(ir_type, kwargs): if ir_type == "integer": @@ -212,7 +212,7 @@ def all_children(ir_type, kwargs): weights = kwargs["weights"] # it's a bit annoying (but completely feasible) to implement the cases # other than "both sides bounded" here. We haven't needed to yet because - # in practice we don't struggled with unbounded integer generation. + # in practice we don't struggle with unbounded integer generation. assert min_value is not None assert max_value is not None