From mboxrd@z Thu Jan 1 00:00:00 1970 From: Robin Green Subject: (no subject) Date: Fri, 18 Sep 2009 13:35:11 +0100 Message-ID: Mime-Version: 1.0 (generated by SEMI 1.14.6 - "Maruoka") Content-Type: text/plain; charset=US-ASCII Return-path: Received: from mailman by lists.gnu.org with tmda-scanned (Exim 4.43) id 1MocgS-000129-Ko for emacs-orgmode@gnu.org; Fri, 18 Sep 2009 08:35:28 -0400 Received: from exim by lists.gnu.org with spam-scanned (Exim 4.43) id 1MocgN-0000tq-OY for emacs-orgmode@gnu.org; Fri, 18 Sep 2009 08:35:28 -0400 Received: from [199.232.76.173] (port=33663 helo=monty-python.gnu.org) by lists.gnu.org with esmtp (Exim 4.43) id 1MocgN-0000tR-Hy for emacs-orgmode@gnu.org; Fri, 18 Sep 2009 08:35:23 -0400 Received: from mxout.netdorm.com ([64.182.105.30]:58487) by monty-python.gnu.org with esmtps (TLS-1.0:DHE_RSA_AES_256_CBC_SHA1:32) (Exim 4.60) (envelope-from ) id 1MocgN-0005KR-6A for emacs-orgmode@gnu.org; Fri, 18 Sep 2009 08:35:23 -0400 Received: from mail.dnsexit.com (mail.dnsexit.com [67.214.171.75] (may be forged)) by mxout.netdorm.com (8.13.8/8.13.8) with ESMTP id n8ICctXF031832 for ; Fri, 18 Sep 2009 08:38:56 -0400 Received: from localhost.localdomain (csltrg.swan.ac.uk [137.44.2.173]) (using TLSv1 with cipher DHE-RSA-AES256-SHA (256/256 bits)) (No client certificate requested) by mail.dnsexit.com (Postfix) with ESMTP id 67CF68B5D24 for ; Fri, 18 Sep 2009 08:29:36 -0400 (EDT) Received: from fedora.greenrd.org (fedora [127.0.0.1]) by localhost.localdomain (8.14.3/8.14.3) with ESMTP id n8ICZBTs009978 for ; Fri, 18 Sep 2009 13:35:11 +0100 List-Id: "General discussions about Org-mode." List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Sender: emacs-orgmode-bounces+geo-emacs-orgmode=m.gmane.org@gnu.org Errors-To: emacs-orgmode-bounces+geo-emacs-orgmode=m.gmane.org@gnu.org To: emacs-orgmode@gnu.org Is there any equivalent to planner-mode's planner-rank.el for org-mode? I want to automatically compute some sort of combined measure of urgency and importance for each of my TODOs, and rank them according to this measure. (Of course, I could write my own code to do this, and I might do just that if there isn't anything suitable already out there.) -- Robin