[tkined] Need Sanity Check, Please

pekarske_bob@burr-brown.com
Fri, 20 Aug 1999 11:05:47 -0700

I have submitted two messages to this list, but have received no reply. Am
I doing something wrong? Is anyone out there?

Anyway, I have continued to study the question in the submission below. I
have formed a theory. Would someone please let me know if I am off-base
with this?

Thank you.

After some experimentation with tkined, I observe that it will not let you
create a subgroup within an existing group. You must build nested groups
from the inside. If this is true, and if the "id" identifiers assigned upon
object creation are ordered in the time sequence of creation, and if the
"ined retrieve" returns the list in this creation order, then the
outer-most container will follow any sub-containers in the list. If all
these assumptions about the internals are true, then the container recorded
in "tabelle" for each leaf element will be the outer-most container.

This would explain why the code works despite an apparently "arbitrary"
assignment. However, I think it is risky practice to depend so much upon
internals. And I especially think these dependencies should be clearly
documented.

Does anyone else have an opinion regarding this coding. Should it be
cleaned-up?

Thank you.

---------------------- Forwarded by Bob Pekarske/Tuc/BB1 on 08/20/99 10:51
AM ---------------------------

pekarske_bob@burr-brown.com on 08/19/99 12:52:59 PM

To: tkined@ibr.cs.tu-bs.de
cc: (bcc: Bob Pekarske/Tuc/BB1)
Subject: [tkined] Need Sanity Check, Please

I am new to Tcl and Tkined, and I do not speak German well, so I may just
be confused. Please help clarify the following for me:

In ip_layout, the "erstelleObjektliste" procedure calls "erstelleTabelle"
for each GROUP in the view. ErstelleTable seems to build table in which the
index is a leaf element, and the value is the parent group. It seems to me
that in the case of nested groups, the ultimate value depend upon which of
the containing groups occurs last in the element list.

For example, if L is contained within G1, and G1 is contained within G2,
then:

1. if G1 preceeds G2 in the element list, then Table(L) = G2

2. if G2 preceeds G1 in the element list, then Table(L) = G1

It seems to me the order of G1 and G2 is arbitrary, so the result would be
arbitrary. What am I missing?

Thank you for any help.

--
!! This message is brought to you via the `tkined & scotty' mailing list.
!! Please do not reply to this message to unsubscribe. To subscribe or
!! unsubscribe, send a mail message to <tkined-request@ibr.cs.tu-bs.de>.
!! See http://wwwsnmp.cs.utwente.nl/~schoenw/scotty/ for more information.

--
!! This message is brought to you via the `tkined & scotty' mailing list.
!! Please do not reply to this message to unsubscribe. To subscribe or
!! unsubscribe, send a mail message to <tkined-request@ibr.cs.tu-bs.de>.
!! See http://wwwsnmp.cs.utwente.nl/~schoenw/scotty/ for more information.