Key
A key is an identifier or value used to locate or access an associated entry or property in a keyed data structure.
Get Programming: Learn to code with Python
An immutable object used to identify and retrieve a corresponding value in a dictionary.
- How it is used
- Maps one object to another so programs can retrieve values using meaningful identifiers.
- How deep it goes
- Explains key-value syntax, uniqueness, immutability, and a brief hash-function rationale without developing dictionary internals.
- Examples
- Uses grocery items, animal legs, song ratings, student grades, and city populations as dictionary keys.
- What you can do after
- Apply it via Python dictionaries to create entries, retrieve values, update mappings, and iterate over keys.
Read how Get Programming: Learn to code with Python explains key →
Kafka Streams in Action, Second Edition
A key is a common identifier used to associate, store, and retrieve a value for a particular record or entity.
- How it is used
- Associates records with stored state during aggregation and carries entity identity through Kafka processing.
- How deep it goes
- Explains lookup, initialization, update, and storage through a HashMap example, then applies keys to Spring Kafka records.
- Examples
- Uses widget counts keyed by ID and processed loans keyed by customer ID.
- What you can do after
- Apply it via Java stateful functions and Spring Kafka listeners to associate, retrieve, update, and produce keyed values.
Read how Kafka Streams in Action, Second Edition explains key →
Tiny Python Projects: Learn coding and testing with puzzles and games
A dictionary key is a hashable object used to identify and retrieve a value in a mapping.
- How it is used
- Uses keys to associate identifiers with values and retrieve them efficiently from dictionaries.
- How deep it goes
- Explains creation, lookup, membership, iteration, uniqueness, and immutability without descending into hashing internals.
- Examples
- Uses question-and-answer dictionaries, letter-indexed file lines, and unique word collection.
- What you can do after
- Apply it via Python dictionaries to create lookups, retrieve values, detect missing entries, and remove duplicates.
Read how Tiny Python Projects: Learn coding and testing with puzzles and games explains key →
Learn Rust in a Month of Lunches
A key is a value used to identify and look up an associated value in a map collection.
- How it is used
- Uses keys to insert and look up associated values in Rust maps.
- How deep it goes
- Explains insertion, missing-key lookup, replacement, entry defaults, and ordering; does not develop map internals.
- Examples
- Shows city-to-country lookups, year-to-population pairs, repeated book keys, and book-title counts.
- What you can do after
- Apply it via Rust maps to choose keys, look up values safely, and handle existing entries.
Grokking Data Structures
A key is an identifier associated with a value that determines how the value is located in an associative data structure.
- How it is used
- Uses identifiers to locate associated values during dictionary insertion, retrieval, and deletion.
- How deep it goes
- Defines keys, explains extraction and hashing, and notes indexing costs, but does not fully develop hash-collision handling.
- Examples
- Uses baseball-player names, card photographs, string identifiers, and Python key–value pairs as examples.
- What you can do after
- Apply it via dictionaries and hash tables to associate, retrieve, and remove values efficiently.
Advanced Algorithms and Data Structures
A dictionary key is a value that identifies an associated entry in a dictionary.
- How it is used
- Uses keys to retrieve dictionary values, search ordered trees, and distinguish entries from their priorities.
- How deep it goes
- Defines uniqueness and retrieval, then explains array indices, tree ordering, and bounded-length lookup complexity.
- Examples
- Uses array positions, product names in treaps, and contact identifiers in an email address book.
- What you can do after
- Apply keys via dictionary insertion, removal, containment checks, and direct value retrieval.
Read how Advanced Algorithms and Data Structures explains key →
The Quick Python Book, Fourth Edition
A dictionary key is a hashable identifier used to access an associated value in a Python dictionary.
- How it is used
- Uses keys to access dictionary values, count occurrences, cache values, and represent sparse data.
- How deep it goes
- Explains key access, immutability, hashability, and tuple restrictions without developing dictionary implementation internals.
- Examples
- Demonstrates numeric and string keys, an English-to-French dictionary, and word-frequency counting.
- What you can do after
- Apply keys to create, update, retrieve, and count dictionary values while avoiding unhashable key types.
Read how The Quick Python Book, Fourth Edition explains key →
Python Workout, Second Edition
A dictionary key is a hashable value used to identify and retrieve a value in a Python dictionary.
- How it is used
- Uses keys to organize name–value data and retrieve values efficiently from dictionaries.
- How deep it goes
- Defines hashability, uniqueness, lookup, iteration, and case sensitivity, then connects square brackets to __getitem__.
- Examples
- Demonstrates menu prices, user-entered product names, case normalization, and a FlexibleDict subclass.
- What you can do after
- Apply keys to build lookups, test membership, retrieve values, iterate dictionaries, and handle missing entries.
Python Workout: 50 ten-minute exercises
A hashable identifier used by a dictionary to associate a stored value with a lookup name.
- How it is used
- Maps names to values for records, lookups, configuration, and accumulated program data.
- How deep it goes
- Defines hashability, uniqueness, and retrieval, then demonstrates membership checks without covering hash-table internals.
- Examples
- Uses menu products, prices, parsed user records, configuration options, and website details as key-value examples.
- What you can do after
- Apply keys via Python dictionaries to store related data and retrieve values efficiently.
Read how Python Workout: 50 ten-minute exercises explains key →
100 SQL Server Mistakes and How to Avoid Them
A database key is a column or combination of columns used to identify rows or establish relationships between tables.
- How it is used
- Uses keys to identify rows, connect tables, reduce repeated data, and enforce referential integrity.
- How deep it goes
- Defines primary and foreign keys and works through entity splitting, but does not provide implementation syntax.
- Examples
- Uses Sales Order Number, OfficeID, Employees, Offices, products, and sales-order items as concrete schema examples.
- What you can do after
- Apply it to choose identifiers, split related entities, and reference shared records without duplicating their details.
Read how 100 SQL Server Mistakes and How to Avoid Them explains key →
Related concepts
- Mappart of · A map is an associative data structure that stores key-value pairs and supports retrieving values by key.
- name-value pairpart of · A name-value pair is a data association in which an identifying name or key corresponds to a value.
- natural keyincludes · A natural key is an identifier formed from meaningful domain attributes whose values uniquely identify an entity or record.
- receptionistconfigured by · The Akka receptionist is a service registry that lets actors register under keys and lets other actors subscribe to discover those registrations.
- direct-access tableused by · A direct-access table is an array-based data structure that stores each element at an array position determined directly by its key or associated index.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.