Austin Clements writes:
> +THREADS=$(python -c '
> +def mkTrees(free, tree={}):
> +if not free:
I'm not sure if using not for an empty set is idiomatic python or not,
but it did confuse me a moment.
> +print(" ".join(map(str, [msg[1] for msg in sorted(tree.items())])))
> +ret
Austin Clements writes:
> +THREADS=$(python -c '
> +def mkTrees(free, tree={}):
> +if not free:
I'm not sure if using not for an empty set is idiomatic python or not,
but it did confuse me a moment.
> +print(" ".join(map(str, [msg[1] for msg in sorted(tree.items())])))
> +ret
This test delivers all possible (single-root) four-message threads in
all possible orders and checks that notmuch successfully links them
into threads in every case.
This is introduced as a new test (rather than just adding it to
T050-new) because it's much easier for this to start with an empty
d
This test delivers all possible (single-root) four-message threads in
all possible orders and checks that notmuch successfully links them
into threads in every case.
This is introduced as a new test (rather than just adding it to
T050-new) because it's much easier for this to start with an empty
d
