v1-0001-Fix-grammar.patch
application/x-patch
Filename: v1-0001-Fix-grammar.patch
Type: application/x-patch
Part: 0
Patch
Same data as JSON:
GET /api/v1/attachments/:id/patch
the parsed metadata as JSON — format, series position, per-file stats; never the diff bytes.
API reference →
Format: format-patch
Series: patch v1-0001
Subject: Fix grammar
| File | + | − |
|---|---|---|
| src/backend/access/nbtree/README | 1 | 1 |
From f694a97e72a3ad744073c9a04f3c39615b1a9987 Mon Sep 17 00:00:00 2001 From: Gurjeet Singh <gurjeet@singh.im> Date: Thu, 8 Jun 2023 19:30:57 -0700 Subject: [PATCH v1] Fix grammar As reported by Daniel Westermann. --- src/backend/access/nbtree/README | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/backend/access/nbtree/README b/src/backend/access/nbtree/README index dd0f7ad2bd..1174ab9131 100644 --- a/src/backend/access/nbtree/README +++ b/src/backend/access/nbtree/README @@ -17,7 +17,7 @@ The basic Lehman & Yao Algorithm Compared to a classic B-tree, L&Y adds a right-link pointer to each page, to the page's right sibling. It also adds a "high key" to each page, which is an upper bound on the keys that are allowed on that page. These two -additions make it possible detect a concurrent page split, which allows the +additions make it possible to detect a concurrent page split, which allows the tree to be searched without holding any read locks (except to keep a single page from being modified while reading it). -- 2.35.1