Raul: > After reading this, and finally noticing the comment about remel in > the original post, I am uncomfortable with this treatment of remel. > [...] > But the original code is not using an alist, as near as I can tell --
No, just a regular list as you correctly observed > or if > that's because remel is really meant to treat the alist as a stack > where it's removing not only the matching element but all previous > elements (which is what the J implementation does). Yes, this is what it's doing, it makes sense in the context of generating combinations recursively. Obviously moving on to better ideas now, but just for the sake of clarification... Thanks for taking the trouble with the example code you supplied, makes everything clearer. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
