From 8a16ef48eb3346efdeeb511c91b061cbf9abc9fd Mon Sep 17 00:00:00 2001 From: Gareth Rees Date: Wed, 18 Mar 2015 20:54:28 +0000 Subject: [PATCH] Todo was done: replace it with cross-reference to design. Copied from Perforce Change: 187788 ServerID: perforce.ravenbrook.com --- mps/code/splay.c | 11 +++++------ 1 file changed, 5 insertions(+), 6 deletions(-) diff --git a/mps/code/splay.c b/mps/code/splay.c index 658faa7dd25..fa15575b505 100644 --- a/mps/code/splay.c +++ b/mps/code/splay.c @@ -1,7 +1,7 @@ /* splay.c: SPLAY TREE IMPLEMENTATION * * $Id$ - * Copyright (c) 2001-2014 Ravenbrook Limited. See end of file for license. + * Copyright (c) 2001-2015 Ravenbrook Limited. See end of file for license. * * .purpose: Splay trees are used to manage potentially unbounded * collections of ordered things. In the MPS these are usually @@ -9,10 +9,9 @@ * * .source: * - * .note.stack: It's important that the MPS have a bounded stack - * size, and this is a problem for tree algorithms. Basically, - * we have to avoid recursion. TODO: Design documentation for this - * requirement, meanwhile see job003651 and job003640. + * .note.stack: It's important that the MPS have a bounded stack size, + * and this is a problem for tree algorithms. Basically, we have to + * avoid recursion. See design.mps.sp.req.sol.depth.no-recursion. */ @@ -1402,7 +1401,7 @@ Res SplayTreeDescribe(SplayTree splay, mps_lib_FILE *stream, Count depth, /* C. COPYRIGHT AND LICENSE * - * Copyright (C) 2001-2014 Ravenbrook Limited . + * Copyright (C) 2001-2015 Ravenbrook Limited . * All rights reserved. This is an open source license. Contact * Ravenbrook for commercial licensing options. *