Return-Path: X-Original-To: notmuch@notmuchmail.org Delivered-To: notmuch@notmuchmail.org Received: from localhost (localhost [127.0.0.1]) by olra.theworths.org (Postfix) with ESMTP id AEF22431FC0 for ; Wed, 16 Jul 2014 03:32:07 -0700 (PDT) X-Virus-Scanned: Debian amavisd-new at olra.theworths.org X-Spam-Flag: NO X-Spam-Score: 0 X-Spam-Level: X-Spam-Status: No, score=0 tagged_above=-999 required=5 tests=[none] autolearn=disabled Received: from olra.theworths.org ([127.0.0.1]) by localhost (olra.theworths.org [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id hkYtLHPtDdZ4 for ; Wed, 16 Jul 2014 03:32:00 -0700 (PDT) Received: from yantan.tethera.net (yantan.tethera.net [199.188.72.155]) (using TLSv1 with cipher DHE-RSA-AES128-SHA (128/128 bits)) (No client certificate requested) by olra.theworths.org (Postfix) with ESMTPS id ADB08431FBD for ; Wed, 16 Jul 2014 03:32:00 -0700 (PDT) Received: from remotemail by yantan.tethera.net with local (Exim 4.80) (envelope-from ) id 1X7MVD-0005cn-Ld; Wed, 16 Jul 2014 07:31:59 -0300 Received: (nullmailer pid 19906 invoked by uid 1000); Wed, 16 Jul 2014 10:31:56 -0000 From: David Bremner To: Austin Clements , notmuch@notmuchmail.org Subject: Re: [PATCH v3] test: Test thread linking in all possible delivery orders In-Reply-To: <1404940538-19711-1-git-send-email-amdragon@mit.edu> References: <87wqehaw69.fsf@qmul.ac.uk> <1404940538-19711-1-git-send-email-amdragon@mit.edu> User-Agent: Notmuch/0.18.1+45~gf47eeac (http://notmuchmail.org) Emacs/24.3.1 (x86_64-pc-linux-gnu) Date: Wed, 16 Jul 2014 07:31:56 -0300 Message-ID: <87vbqx8uhv.fsf@maritornes.cs.unb.ca> MIME-Version: 1.0 Content-Type: text/plain X-BeenThere: notmuch@notmuchmail.org X-Mailman-Version: 2.1.13 Precedence: list List-Id: "Use and development of the notmuch mail system." List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 16 Jul 2014 10:32:07 -0000 Austin Clements writes: > This version addresses Mark's review by using a completely different > thread tree generation algorithm that directly generates distinct > trees. This algorithm is a little longer, so I pulled it out into its > own script. Since v2, I also realized we already had an equivalent > hand-written, but far less thorough test in T260-thread-order, so this > version simply replaces that test. Well, it matches the first 8 terms of http://oeis.org/A000169 So I guess that's good enough for me ;). d