Hi guys,
I see here that you like challenges, so heres one:
How I do I merge the items of the following lists:
(setq LstA (list "A0" "A1" "A2" "A3" "A4" "A5"))
(setq LstB (list "B0" "B1" "B2" "B3" "B4" "B5"))
(setq LstC (list "C0" "C1" "C2" "C3" "C4" "C5"))
(setq LstD (list "D0" "D1" "D2" "D3" "D4" "D5"))
Like this:
(setq LstReturn
(
("A0" "B0" "C0" "D0")
("A1" "B1" "C1" "D1")
("A2" "B2" "C2" "D2")
("A3" "B3" "C3" "D3")
("A4" "B4" "C4" "D4")
)
)
An association list is created upon merge'ing each "nth" item from each list.
I'm trying to write a subfunction like this, to achieve the above result:
(setq LstReturn (MergeNLists (setq NLst (list LstA LstB LstC LstD))))
Where the e NLst argument could take any number if lists to merge their items together.
(MergeNlists Nlst)
I'm still unsure how to properly name the subfunction, to describe exactly what is achieved.