
Introduction
Soups
Here are a few of the important rules of Newton data objects:
- Related data entries are stored in a soup. For example, each name card in the Names application is an entry in a soup.
- Each soup has a unique name (a string). For example, the Names application stores its entries in a soup with the name "Names".
- Each soup can be indexed on one or more slots.
- A soup can contain zero or more indexes, each of which can be based on one or more slots.
- Soup Indexes
-
- Searching through Every Entry
-
- Starting at the Right Place
-
- Ending at the Right Place as Well
-
- Tag Indexes
-
- Multislot Indexes
-
- When to Use an Index
-
An online version of Programming for the Newton using Macintosh, 2nd ed. ©1996, 1994, Julie McKeehan and Neil Rhodes.
Last modified: 1 DEC 1996