diff options
author | Robert Haas <rhaas@postgresql.org> | 2013-08-02 09:15:42 -0400 |
---|---|---|
committer | Robert Haas <rhaas@postgresql.org> | 2013-08-02 09:15:42 -0400 |
commit | 05ee328d66b700832cff61f59894ced7878fbfdb (patch) | |
tree | be367f78eca63602b554848d1804ab005f885890 | |
parent | 43f6388931fa71d7c2885fa54804c7cdff7d9f62 (diff) | |
download | postgresql-05ee328d66b700832cff61f59894ced7878fbfdb.tar.gz postgresql-05ee328d66b700832cff61f59894ced7878fbfdb.zip |
Fix typo in comment.
Etsuro Fujita
-rw-r--r-- | src/backend/storage/buffer/bufmgr.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/backend/storage/buffer/bufmgr.c b/src/backend/storage/buffer/bufmgr.c index 8079226864d..f8483918116 100644 --- a/src/backend/storage/buffer/bufmgr.c +++ b/src/backend/storage/buffer/bufmgr.c @@ -2221,7 +2221,7 @@ DropRelFileNodesAllBuffers(RelFileNodeBackend *rnodes, int nnodes) /* * For low number of relations to drop just use a simple walk through, to * save the bsearch overhead. The threshold to use is rather a guess than - * a exactly determined value, as it depends on many factors (CPU and RAM + * an exactly determined value, as it depends on many factors (CPU and RAM * speeds, amount of shared buffers etc.). */ use_bsearch = n > DROP_RELS_BSEARCH_THRESHOLD; |