database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-18 17:42:25 +03:00
Code Activity

Another pgindent run with updated typedefs.

Browse Source
This commit is contained in:
Bruce Momjian
2003-08-08 21:42:59 +00:00
parent 0e2b12bd96
commit 46785776c4
109 changed files with 811 additions and 808 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
src/backend/nodes/bitmapset.c
View File

@ -14,7 +14,7 @@
* Copyright (c) 2003, PostgreSQL Global Development Group
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/bitmapset.c,v 1.4 2003/08/04 00:43:18 momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/bitmapset.c,v 1.5 2003/08/08 21:41:43 momjian Exp $
*
*-------------------------------------------------------------------------
*/
@ -107,7 +107,7 @@ static const uint8 number_of_ones[256] = {
* bms_copy - make a palloc'd copy of a bitmapset
*/
Bitmapset *
bms_copy(const Bitmapset * a)
bms_copy(const Bitmapset *a)
{
Bitmapset *result;
size_t size;
@ -127,7 +127,7 @@ bms_copy(const Bitmapset * a)
* be reported as equal to a palloc'd value containing no members.
*/
bool
bms_equal(const Bitmapset * a, const Bitmapset * b)
bms_equal(const Bitmapset *a, const Bitmapset *b)
{
const Bitmapset *shorter;
const Bitmapset *longer;
@ -197,7 +197,7 @@ bms_make_singleton(int x)
* Same as pfree except for allowing NULL input
*/
void
bms_free(Bitmapset * a)
bms_free(Bitmapset *a)
{
if (a)
pfree(a);
@ -214,7 +214,7 @@ bms_free(Bitmapset * a)
* bms_union - set union
*/
Bitmapset *
bms_union(const Bitmapset * a, const Bitmapset * b)
bms_union(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@ -248,7 +248,7 @@ bms_union(const Bitmapset * a, const Bitmapset * b)
* bms_intersect - set intersection
*/
Bitmapset *
bms_intersect(const Bitmapset * a, const Bitmapset * b)
bms_intersect(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@ -280,7 +280,7 @@ bms_intersect(const Bitmapset * a, const Bitmapset * b)
* bms_difference - set difference (ie, A without members of B)
*/
Bitmapset *
bms_difference(const Bitmapset * a, const Bitmapset * b)
bms_difference(const Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
int shortlen;
@ -304,7 +304,7 @@ bms_difference(const Bitmapset * a, const Bitmapset * b)
* bms_is_subset - is A a subset of B?
*/
bool
bms_is_subset(const Bitmapset * a, const Bitmapset * b)
bms_is_subset(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int longlen;
@ -339,7 +339,7 @@ bms_is_subset(const Bitmapset * a, const Bitmapset * b)
* bms_is_member - is X a member of A?
*/
bool
bms_is_member(int x, const Bitmapset * a)
bms_is_member(int x, const Bitmapset *a)
{
int wordnum,
bitnum;
@ -362,7 +362,7 @@ bms_is_member(int x, const Bitmapset * a)
* bms_overlap - do sets overlap (ie, have a nonempty intersection)?
*/
bool
bms_overlap(const Bitmapset * a, const Bitmapset * b)
bms_overlap(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@ -384,7 +384,7 @@ bms_overlap(const Bitmapset * a, const Bitmapset * b)
* bms_nonempty_difference - do sets have a nonempty difference?
*/
bool
bms_nonempty_difference(const Bitmapset * a, const Bitmapset * b)
bms_nonempty_difference(const Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@ -416,7 +416,7 @@ bms_nonempty_difference(const Bitmapset * a, const Bitmapset * b)
* Raises error if |a| is not 1.
*/
int
bms_singleton_member(const Bitmapset * a)
bms_singleton_member(const Bitmapset *a)
{
int result = -1;
int nwords;
@ -451,7 +451,7 @@ bms_singleton_member(const Bitmapset * a)
* bms_num_members - count members of set
*/
int
bms_num_members(const Bitmapset * a)
bms_num_members(const Bitmapset *a)
{
int result = 0;
int nwords;
@ -480,7 +480,7 @@ bms_num_members(const Bitmapset * a)
* This is faster than making an exact count with bms_num_members().
*/
BMS_Membership
bms_membership(const Bitmapset * a)
bms_membership(const Bitmapset *a)
{
BMS_Membership result = BMS_EMPTY_SET;
int nwords;
@ -509,7 +509,7 @@ bms_membership(const Bitmapset * a)
* This is even faster than bms_membership().
*/
bool
bms_is_empty(const Bitmapset * a)
bms_is_empty(const Bitmapset *a)
{
int nwords;
int wordnum;
@ -544,7 +544,7 @@ bms_is_empty(const Bitmapset * a)
* Input set is modified or recycled!
*/
Bitmapset *
bms_add_member(Bitmapset * a, int x)
bms_add_member(Bitmapset *a, int x)
{
int wordnum,
bitnum;
@ -582,7 +582,7 @@ bms_add_member(Bitmapset * a, int x)
* Input set is modified in-place!
*/
Bitmapset *
bms_del_member(Bitmapset * a, int x)
bms_del_member(Bitmapset *a, int x)
{
int wordnum,
bitnum;
@ -602,7 +602,7 @@ bms_del_member(Bitmapset * a, int x)
* bms_add_members - like bms_union, but left input is recycled
*/
Bitmapset *
bms_add_members(Bitmapset * a, const Bitmapset * b)
bms_add_members(Bitmapset *a, const Bitmapset *b)
{
Bitmapset *result;
const Bitmapset *other;
@ -638,7 +638,7 @@ bms_add_members(Bitmapset * a, const Bitmapset * b)
* bms_int_members - like bms_intersect, but left input is recycled
*/
Bitmapset *
bms_int_members(Bitmapset * a, const Bitmapset * b)
bms_int_members(Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@ -664,7 +664,7 @@ bms_int_members(Bitmapset * a, const Bitmapset * b)
* bms_del_members - like bms_difference, but left input is recycled
*/
Bitmapset *
bms_del_members(Bitmapset * a, const Bitmapset * b)
bms_del_members(Bitmapset *a, const Bitmapset *b)
{
int shortlen;
int i;
@ -685,7 +685,7 @@ bms_del_members(Bitmapset * a, const Bitmapset * b)
* bms_join - like bms_union, but *both* inputs are recycled
*/
Bitmapset *
bms_join(Bitmapset * a, Bitmapset * b)
bms_join(Bitmapset *a, Bitmapset *b)
{
Bitmapset *result;
Bitmapset *other;
@ -732,7 +732,7 @@ bms_join(Bitmapset * a, Bitmapset * b)
*----------
*/
int
bms_first_member(Bitmapset * a)
bms_first_member(Bitmapset *a)
{
int nwords;
int wordnum;