splash screen animation

David S. Cargo (escargo@anubis.network.com)
Tue, 10 Mar 1998 08:46:19 -0600

Date: Tue, 10 Mar 1998 08:46:19 -0600
From: escargo@anubis.network.com (David S. Cargo)
Message-Id: <199803101446.IAA11769@brutus.network.com>
To: calvin-ui98@dagobah.stwing.upenn.edu
Subject: splash screen animation

This message is mainly for Corey.

I was thinking this morning that perhaps the reason the animation was
so hard is that you are using the wrong set of data.

What if you did the following: Instead of two lists of numbers 1 to m
and 1 to n (for the two sequences) in two list variables, you put
the full variable names in the list. In the cycle procedure, you
pull out a variable name, see what its initial letter is, and then
stuff it into the proper label based in its initial letter.

You have only one variable storing the list; you have only one cycle.

What do you think? This seems like part of the solution to the problem
is finding a way to reduce its complexity. If this solution worked, you
could easily extending to more than two animations if you matched the
label window paths to the list elements prefixes.

dsc