Skip to main content
This appendix provides a quick reference for the foundational concepts covered throughout the book.

The Ten Elements

Storage Structures

Arrays

  • Access: O(1) by index, O(n) search
  • Use for: Conversation history, event logs, queues
  • Operations: push, slice, filter, map

Maps

  • Access: O(1) by key
  • Use for: User preferences, entity data, keyed lookup
  • Operations: get, set, has, delete

Vector Stores

  • Access: O(log n) approximate nearest neighbor
  • Use for: Semantic search, knowledge bases, similar item retrieval
  • Operations: insert, search, delete

Retrieval Patterns

Flow Patterns

Sequential

Operations that depend on each other:

Parallel

Independent operations that can run simultaneously:

Conditional

Branching based on classification or state:

Iterative

Loops with termination conditions:

Coordination Patterns

Pipeline

Sequential handoffs through stages:

Hub and Spoke

Central coordinator delegates to specialists:

Swarm

Peers coordinate through shared state:

Feedback Signal Types

Autonomy Boundaries

Evaluation Dimensions

Learning Types