
Introduction
Union Soups
As the name implies, a union soup is one larger soup combined from member soups across multiple stores (see FIGURE 9.7). For example, a "Names" union soup would include the entries from all the "Names" soups on all resident stores. Here are the important points about union soups:
- Union soups are dynamic. As stores appear or disappear, the union soup will flex its size to match--it contains more or fewer entries.
- You don't normally care what store an entry is on, only what soup it is a member of. As a result, your program will almost always use union soups rather than a single soup on a particular store.

FIGURE 9.7 : A "Names" union soup.
When a soup is modified, you can get notified--this happens, for instance, when a card is inserted or deleted. When this happens, you'll probably want to redisplay your view with the current entries from the soup.
An online version of Programming for the Newton using Macintosh, 2nd ed. ©1996, 1994, Julie McKeehan and Neil Rhodes.
Last modified: 1 DEC 1996