|
From: | Paul Rubin |
Subject: | Re: How to cast an imperative loop into a readable recursive function ? |
Date: | Thu, 02 Dec 2010 23:29:34 -0800 |
User-agent: | Gnus/5.13 (Gnus v5.13) Emacs/23.1 (gnu/linux) |
Katalin Sinkov <lispstylist@gmail.com> writes: >> (let ((s ...) (l ...) (p ...) >> ;;; s=start l=length p=?????? I don't mean p is actually a pointer, I just mean p is the offset after your (l=2 s=3) stuff that you matched with a regexp in your original example. > At some stage there will confusion and readability issue. > What strategies are there to grapple with this issue ? Why don't you read some of the Emacs library code? That is basically how I learned Lisp. Or, CL has a real package system so you can do more serious encapsulation. So you could read a CL book and apply the techniques to Emacs Lisp as best you can.
[Prev in Thread] | Current Thread | [Next in Thread] |