liveBook · Manning

Indexing

Indexing is the process of assigning or using positions, keys, or lookup structures to identify and access elements or records.

How 22 Manning books explain it

Get Programming: Learn to code with Python

How it is used
Selects characters and list items by position, then supplies boundaries for splitting full names.
How deep it goes
Works through zero-based and negative character positions plus out-of-range list errors, without exploring implementation internals.
Examples
Uses a grocery list and a full-name splitting program to show element access and slice boundaries.
What you can do after
Apply it via Python square brackets to read elements, extract name substrings, and update mutable list items.

Read how Get Programming: Learn to code with Python explains indexing →

Grokking Data Structures

An array index is the position used to identify an element within an array.

How it is used
Locates array elements for access, insertion, counting, traversal, and array-backed heap relationships.
How deep it goes
Defines positions, explains zero-based bounds and memory-location calculation, and works through insertion and counting; defers fuller heap operations.
Examples
Uses numbered drawers, die-roll counters, a capacity-checked Python insertion method, and parent–child positions in a heap.
What you can do after
Apply it via Python arrays to translate positions into valid indexes, update counters, and avoid inserting beyond capacity.

Read how Grokking Data Structures explains indexing →

Modern C, Third Edition

Array indexing is the C operation of selecting an array element with an index expression, such as A[i].

How it is used
Uses indexing to select array and pointer elements, including matrix elements in function parameters.
How deep it goes
Explains zero-based positions, pointer equivalence, array decay, parameter rewriting, and bounds constraints.
Examples
Uses a five-element designated initializer and a matrix multiplication with nested indexed accesses.
What you can do after
Apply indexing to array and pointer elements while checking bounds and communicating dimensions in function interfaces.

Read how Modern C, Third Edition explains indexing →

Learn Rust in a Month of Lunches

Indexing selects elements in an ordered collection by their numeric positions.

How it is used
Uses indexing to select array entries by position and ranges to select slices.
How deep it goes
Explains zero-based positions, usize, and exclusive and inclusive slice ranges with examples.
Examples
Uses an array of three numbers and slices of an array containing zero through nine.
What you can do after
Apply it in Rust to select an array entry or a slice using an index or range.

Read how Learn Rust in a Month of Lunches explains indexing →

Pro Angular 16

An array index is a numeric position used to access an element in an array.

How it is used
Uses positions to read or change array elements and to identify rows generated by Angular `*ngFor`.
How deep it goes
Shows bracket reads and assignments, then works through zero-based `ngFor` indices, counters, and position-dependent row styling.
Examples
Demonstrates replacing an array’s first value and numbering product-table rows as a position out of a total.
What you can do after
Apply it via TypeScript brackets and Angular `*ngFor` to update array values and display row positions.

Read how Pro Angular 16 explains indexing →

Generative AI in Action

Data indexing is the organization of stored data into searchable structures that support efficient information retrieval.

How it is used
Supports RAG by organizing source data for retrieval, including enterprise information unavailable in an LLM’s training data.
How deep it goes
Defines Redis index fields and vector settings, while also addressing data selection and source-system constraints.
Examples
Uses blog posts read through RSS and a Redis `posts` index with metadata and an HNSW vector field.
What you can do after
Configure a Redis index schema for blog content, metadata, and vector search.

Read how Generative AI in Action explains indexing →

Modern C

An index is an integer position used to identify an item in an array.

How it is used
Uses integer positions to initialize, read, and traverse array elements in C.
How deep it goes
Defines zero-based positions, then explains pointer arithmetic and array-parameter rewriting without reconstructing lengths.
Examples
Uses designated initializers, pointer-based summation, array slices, and matrix multiplication to demonstrate indexed access.
What you can do after
Apply it via C array notation, designated initializers, pointer arithmetic, and multidimensional function parameters.

Read how Modern C explains indexing →

Build AI-Enhanced Web Apps

Document indexing is the organization of document content into searchable structures for efficient information retrieval.

How it is used
Prepares document content for semantic retrieval in a RAG workflow.
How deep it goes
Details collection, chunking, embeddings, metadata, and vector storage, with code focused on directory ingestion and index creation.
Examples
Uses a directory of PDF files, processed into chunks and indexed with HNSWLib.
What you can do after
Build a semantically searchable document index using embeddings and a vector store.

Read how Build AI-Enhanced Web Apps explains indexing →

Deep Learning with R, Third Edition

Indexing is the mapping of text tokens to integer positions in a vocabulary.

How it is used
Converts split text tokens into integer IDs as the final stage of tokenization.
How deep it goes
Defines indexing and demonstrates vocabulary matching, without detailing model internals.
Examples
Uses a sentence, a word vocabulary, and R matching to show tokens mapped to integer positions.
What you can do after
Apply R's match() to map split tokens to vocabulary indices, with unmatched tokens returning 0 in the example.

Read how Deep Learning with R, Third Edition explains indexing →

Deep Learning with PyTorch, Second Edition

Selecting tensor elements or slices by using tensor values as indices or masks.

How it is used
Supports expressive tensor manipulation and data filtering while preparing inputs for neural-network work.
How deep it goes
Explains list-like ranges, multidimensional slices, Boolean filtering, and storage-level indexing, but defers broader tensor operations.
Examples
Uses Python lists, two-dimensional points, wine-quality masks, threshold predictions, and image, text, and source-code exercises.
What you can do after
Apply indexing in PyTorch to slice dimensions, filter rows with Boolean masks, and compare selected data categories.

Read how Deep Learning with PyTorch, Second Edition explains indexing →

Natural Language Processing in Action, Second Edition

Indexing is the construction of auxiliary structures that organize document content for efficient retrieval.

How it is used
Uses inverted indexing to speed full-text keyword search and retrieve human-authored sources for LLM grounding.
How deep it goes
Defines forward and inverted indexes, contrasts O(1) lookup with O(n) scanning, and notes trigram handling of word variants.
Examples
Uses a textbook index analogy and searches for “cat” and “cats” to illustrate retrieval and exact-match limits.
What you can do after
Apply indexing to retrieve documents matching search terms efficiently, including variants such as “cat” and “cats.”

Read how Natural Language Processing in Action, Second Edition explains indexing →

Vibe Engineering

Project indexing is the process of analyzing and cataloging project files to support efficient code search and contextual retrieval.

How it is used
Supplies searchable repository context for AI coding requests by enabling retrieval of relevant code and documentation chunks.
How deep it goes
Explains scanning, chunking, embedding, vector storage, similarity search, and prompt augmentation, while leaving retrieval relevance as an open question.
Examples
Uses a JWT-library refactor request and an unfamiliar contact-management project checked in Cursor's indexing settings.
What you can do after
Operate indexing by confirming full project coverage in Cursor's Indexing & Docs settings before prompting about an unfamiliar application.

Read how Vibe Engineering explains indexing →

Deep Learning with Python, Third Edition

The stage of text preprocessing that maps tokens to integer indices for numeric model input.

How it is used
Converts tokenized text into integer IDs for numeric model input.
How deep it goes
Demonstrates vocabulary lookup and unknown-token handling, then defers mapping IDs into a model's latent space.
Examples
Uses a word-level vocabulary to index a sentence containing an out-of-vocabulary word.
What you can do after
Build it from scratch by mapping vocabulary tokens to IDs and assigning a fallback ID to unknown tokens.

Read how Deep Learning with Python, Third Edition explains indexing →

Julia as a Second Language

An index is an integer position used to identify an element within an ordered collection.

How it is used
Uses integer positions to retrieve, replace, or process elements in Julia collections.
How deep it goes
Defines positions and demonstrates enumeration, custom access methods, and lookup-cost tradeoffs.
Examples
Demonstrates vector positions, pizza tuples, enumerated values, and indexed rocket-stage collections.
What you can do after
Apply integer indices to read or update collections, or implement bracket access for a custom collection.

Read how Julia as a Second Language explains indexing →

AI-Powered Search

Indexing is the process of ingesting and organizing content into a searchable index.

How it is used
Prepares product content and user signals for search, matching, and later relevance improvements.
How deep it goes
Demonstrates loading CSV data and writing documents to collections, then verifies keyword search without detailing index internals.
Examples
Uses a product catalog with UPCs and descriptions, an ipod query, and a separately indexed user-signals dataset.
What you can do after
Operate a search pipeline by loading product or signal data and writing it to search-engine collections.

Read how AI-Powered Search explains indexing →

LLM Evaluation and Alignment, The Foundational Ideas

Indexing is the process of transforming raw documents into a searchable representation.

How it is used
Prepares a corpus for sparse retrieval by converting raw documents into a searchable representation.
How deep it goes
Defines indexing as creating a searchable representation and compares it to library cataloging.
Examples
Uses library cataloging as an analogy for finding documents by title, topic, author, or subject.
What you can do after
Understand indexing as the corpus-preparation step required before sparse retrieval can work.

Read how LLM Evaluation and Alignment, The Foundational Ideas explains indexing →

Learn Generative AI with PyTorch

The use of bracket notation to access selected elements or subregions of a tensor.

How it is used
Selects individual tensor values or slices so operations can target part of a tensor rather than all its elements.
How deep it goes
Demonstrates positive and negative indexing, slices, and one- and two-dimensional access through worked examples.
Examples
Uses U.S. presidents’ heights to demonstrate selecting one value, recent values, and a row-column value.
What you can do after
Apply positive or negative indexes and slices to retrieve selected values from one- or two-dimensional tensors.

Read how Learn Generative AI with PyTorch explains indexing →

Grokking Simplicity

A numeric position identifying an element within an indexed array.

How it is used
Uses array positions to connect searches with cart updates, removals, and reusable lower-level functions.
How deep it goes
Traces indexing through for loops, comparisons, null results, and arrayGet/arraySet abstractions.
Examples
Uses cart searches, item removal, membership checks, and price updates as concrete indexed-array examples.
What you can do after
Diagnose/debug with it by tracing how array positions flow from searches into updates and removals.

Read how Grokking Simplicity explains indexing →

Python Workout, Second Edition

An index is a numeric position identifying an element within an ordered sequence.

How it is used
Retrieves sequence elements, extracts ranges, and pairs iteration values with numeric positions.
How deep it goes
Explains element access, negative positions, slice boundaries, result types, bounds, and enumerate, without descending into implementation internals.
Examples
Demonstrates enumerate over a string, first-and-last retrieval, list and tuple slices, and out-of-range endpoints.
What you can do after
Apply it via Python brackets, slices, negative positions, and enumerate to retrieve or label sequence data.

Read how Python Workout, Second Edition explains indexing →

The Well-Grounded Rubyist, Fourth Edition

An index is a numeric or key-based identifier for an element in a collection, including an ordinal position in an ordered collection.

How it is used
Retrieves collection elements by position or key, locates substrings, and labels items with iteration counters.
How deep it goes
Distinguishes string search positions, array indexes, hash keys, and iteration counters, including the absence of Hash#each_index.
Examples
Uses substring searches, numbered president lists, and hash iteration counters to illustrate indexing.
What you can do after
Apply indexing to locate substrings, retrieve collection entries, and label iterated items with their ordinal positions.

Read how The Well-Grounded Rubyist, Fourth Edition explains indexing →

Grokking Software Architecture

The creation and maintenance of auxiliary structures that help a database locate records efficiently.

How it is used
Explains how database indexes support application performance under physical limits on memory, processing, and storage.
How deep it goes
Defines B-Trees and write penalties, then explains lookup and maintenance tradeoffs without detailing index implementation.
Examples
Uses a phone-book lookup for an email address and filing papers in multiple folders to illustrate read and write costs.
What you can do after
Evaluate whether faster lookups justify the write cost of maintaining indexes.

Read how Grokking Software Architecture explains indexing →

Context Engineering

Indexing organizes information into a structure that supports efficient search and retrieval.

How it is used
Prepares knowledge-store content for retrieval in production RAG pipelines.
How deep it goes
Details chunking, embeddings, incremental updates, evaluation, and rollout, but not index structures.
Examples
Uses changed records, golden test sets, and production traffic to evaluate and roll out index updates.
What you can do after
Operate indexing by evaluating candidate indexes and releasing updates through A/B tests or canary rollouts.

Read how Context Engineering explains indexing →

Also covered in

What to know first

Related concepts

Questions about indexing

What is indexing?

Indexing is the process of assigning or using positions, keys, or lookup structures to identify and access elements or records.

Which Manning books explain indexing?

Get Programming: Learn to code with Python, Grokking Data Structures, Modern C, Third Edition, Learn Rust in a Month of Lunches, Pro Angular 16, Generative AI in Action, Modern C, Build AI-Enhanced Web Apps and 14 more.

What should I know before learning indexing?

Manning books that teach indexing usually introduce array, language model, list and retrieval-augmented generation first.

What kinds of indexing are there?

Kinds of indexing include partial index and covering index.

What is indexing a kind of?

Indexing is a kind of homogeneous string map. A homogeneous string map is a map with string keys whose values all have the same type or kind.

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.