At 15:49 31/03/01 +1000, Philip Warner wrote:
>
> (TOC2 > TOC1)
> iff (Max(TOC2.OID, TOC2.DEPS) > Max(TOC1.OID, TOC1.DEPS))
> OR ( Max(TOC2.OID, TOC2.DEPS) = Max(TOC1.OID, TOC1.DEPS)
> And TOC1.OID = Max(TOC2.DEPS)
> )
>
> Where DEPS is a list of OIDs the TOC entry depends on.
>
>(I *think* that's right...).
>
This will of course not handle multi-level dependencies. But for the simple
ordering we are talking about, I think it will work. It can be extended
later when we want to walk a complete dependency tree.
----------------------------------------------------------------
Philip Warner | __---_____
Albatross Consulting Pty. Ltd. |----/ - \
(A.B.N. 75 008 659 498) | /(@) ______---_
Tel: (+61) 0500 83 82 81 | _________ \
Fax: (+61) 0500 83 82 82 | ___________ |
Http://www.rhyme.com.au | / \|
| --________--
PGP key available upon request, | /
and from pgp5.ai.mit.edu:11371 |/
---------------------------(end of broadcast)---------------------------
TIP 1: subscribe and unsubscribe commands go to [EMAIL PROTECTED]