Hi,
I have a list of sublists. Some of the sublists are empty.
The list should be processed recursevly and the resulting
list should no longer contain empty sublists.
The code I have so far looks like:
(define (step-through-list lst)
(if (empty? lst)
lst
(cons (process-sublist (car lst)) (step-through-list (cdr lst)))
....but "car" would feed empty sublists to process-sublist as any other
sublist. How can I "silently" skip empty sublists and even get out of
the recursion without harm (if the last sublist is empty) without
switching to iteration?
Is there something like "car-not-empty" ? ;)
Or do I oversee the obvious here...? ;)))
Thank you vary much for any help in advance!
Cheers
Meino
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to racket-users+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
