mirror of
https://github.com/postgres/postgres.git
synced 2026-02-27 11:50:33 -05:00
382ceffdf7
Don't move parenthesized lines to the left, even if that means they flow past the right margin. By default, BSD indent lines up statement continuation lines that are within parentheses so that they start just to the right of the preceding left parenthesis. However, traditionally, if that resulted in the continuation line extending to the right of the desired right margin, then indent would push it left just far enough to not overrun the margin, if it could do so without making the continuation line start to the left of the current statement indent. That makes for a weird mix of indentations unless one has been completely rigid about never violating the 80-column limit. This behavior has been pretty universally panned by Postgres developers. Hence, disable it with indent's new -lpl switch, so that parenthesized lines are always lined up with the preceding left paren. This patch is much less interesting than the first round of indent changes, but also bulkier, so I thought it best to separate the effects. Discussion: https://postgr.es/m/E1dAmxK-0006EE-1r@gemulon.postgresql.org Discussion: https://postgr.es/m/30527.1495162840@sss.pgh.pa.us |
||
|---|---|---|
| .. | ||
| binaryheap.c | ||
| bipartite_match.c | ||
| hyperloglog.c | ||
| ilist.c | ||
| knapsack.c | ||
| Makefile | ||
| pairingheap.c | ||
| rbtree.c | ||
| README | ||
| stringinfo.c | ||
This directory contains a general purpose data structures, for use anywhere in the backend: binaryheap.c - a binary heap hyperloglog.c - a streaming cardinality estimator pairingheap.c - a pairing heap rbtree.c - a red-black tree ilist.c - single and double-linked lists. stringinfo.c - an extensible string type Aside from the inherent characteristics of the data structures, there are a few practical differences between the binary heap and the pairing heap. The binary heap is fully allocated at creation, and cannot be expanded beyond the allocated size. The pairing heap on the other hand has no inherent maximum size, but the caller needs to allocate each element being stored in the heap, while the binary heap works with plain Datums or pointers. The linked-lists in ilist.c can be embedded directly into other structs, as opposed to the List interface in nodes/pg_list.h.