Update out-of-date comment in vacuumlazy.c

robertmhaas · robertmhaas · commit 2a6db5eba69c · 2017-06-22T13:38:53.000-04:00
Commit 15c121b seems to have overlooked the need to trim this part of the comment. Pavan Deolasee Discussion: http://postgr.es/m/CABOikdPq_9+cWRNZ0RLKTwuZyj=uL85X=Usifa-CbPee1ZCM5A@mail.gmail.com
diff --git a/src/backend/commands/vacuumlazy.c b/src/backend/commands/vacuumlazy.c
@@ -4,11 +4,10 @@
  *	  Concurrent ("lazy") vacuuming.
  *
  *
- * The major space usage for LAZY VACUUM is storage for the array of dead
- * tuple TIDs, with the next biggest need being storage for per-disk-page
- * free space info.  We want to ensure we can vacuum even the very largest
- * relations with finite memory space usage.  To do that, we set upper bounds
- * on the number of tuples and pages we will keep track of at once.
+ * The major space usage for LAZY VACUUM is storage for the array of dead tuple
+ * TIDs.  We want to ensure we can vacuum even the very largest relations with
+ * finite memory space usage.  To do that, we set upper bounds on the number of
+ * tuples we will keep track of at once.
  *
  * We are willing to use at most maintenance_work_mem (or perhaps
  * autovacuum_work_mem) memory space to keep track of dead tuples.  We

Original file line number	Diff line number	Diff line change
`@@ -4,11 +4,10 @@`
`4`	`4`	`* Concurrent ("lazy") vacuuming.`
`5`	`5`	`*`
`6`	`6`	`*`
`7`		`- * The major space usage for LAZY VACUUM is storage for the array of dead`
`8`		`- * tuple TIDs, with the next biggest need being storage for per-disk-page`
`9`		`- * free space info. We want to ensure we can vacuum even the very largest`
`10`		`- * relations with finite memory space usage. To do that, we set upper bounds`
`11`		`- * on the number of tuples and pages we will keep track of at once.`
	`7`	`+ * The major space usage for LAZY VACUUM is storage for the array of dead tuple`
	`8`	`+ * TIDs. We want to ensure we can vacuum even the very largest relations with`
	`9`	`+ * finite memory space usage. To do that, we set upper bounds on the number of`
	`10`	`+ * tuples we will keep track of at once.`
`12`	`11`	`*`
`13`	`12`	`* We are willing to use at most maintenance_work_mem (or perhaps`
`14`	`13`	`* autovacuum_work_mem) memory space to keep track of dead tuples. We`