On 14 October 2011 03:28, Andy Wingo <wi...@pobox.com> wrote: > On Thu 13 Oct 2011 23:42, Linas Vepstas <linasveps...@gmail.com> writes: > >> In the code that I work on, in (func a b), its rarely the case that a >> and b are merely strings or lists; they're usually some fairly complex >> structure, where e.g. 'b' is a list where car and cadr must be >> strings, and caddr may or may not be another list, with certain >> expectations about car, cadr, etc. > > In this case, I find `match' to be useful. The structure of the pattern > matches the structure of the input data, so it is much better than > cadaddring down a list.
Let me demonstrate my ignorance: what pattern-matching srfi should I be using? Last time I looked at 'match' in scheme, it was defined in some decades-old white paper Pattern Matching for Scheme http://download.plt-scheme.org/doc/103p1/pdf/match.pdf which didn't seem to be widely used anywhere. Are you saying that we have this hidden somewhere inside of guile??? --linas
