A.1. Entries and Templates
Entries are designed to be used in distributed algorithms for which exact-match lookup semantics are useful. An entry is a typed set of objects, each of which may be tested for exact match with a template.
A.1.1. Operations
A service that uses entries will support methods that let you use entry objects. In this document we will use the term “operation” for such methods. There are three types of operations:
Store operations— operations that store one or more entries, usually for future matches.
Match operations— operations that search for entries that match one or more templates.
Fetch operations— operations that return one or more entries.
It is possible for a single method to provide more than one of the operation ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access