Hey guys,
By providing a simple <ename> I'm trying to obtain a list of all <enames> that are located inside the most parent group.
So I'm thinking that a recursive function would be required to process every potential group for each entity.
Problem is that I got too confused with all that recursive processing and expecting the correct return at the same time.
The simpliest start for the most inner group is:
; (e->GroupL (car (entsel)))
(defun e->GroupL ( e / grp L )
(and
(eq 'ENAME (type e))
(setq grp (cdr (assoc 330 (entget e))))
(foreach x (entget grp) (and (= 340 (car x)) (setq L (cons (cdr x) L))))
)
L
)
Say for a group that contains 2 circles, it would return 2 enames..
However if that group is a part of a larger group, say + 3 rectangles + another group of 2 polylines, it should return a list of these 7 enames.