@@ -309,7 +309,7 @@ cube_out(PG_FUNCTION_ARGS)
309
309
/*
310
310
** The GiST Consistent method for boxes
311
311
** Should return false if for all data items x below entry,
312
- ** the predicate x op query == FALSE , where op is the oper
312
+ ** the predicate x op query == false , where op is the oper
313
313
** corresponding to strategy in the pg_amop table.
314
314
*/
315
315
Datum
@@ -396,7 +396,7 @@ g_cube_decompress(PG_FUNCTION_ARGS)
396
396
397
397
gistentryinit (* retval , PointerGetDatum (key ),
398
398
entry -> rel , entry -> page ,
399
- entry -> offset , FALSE );
399
+ entry -> offset , false );
400
400
PG_RETURN_POINTER (retval );
401
401
}
402
402
PG_RETURN_POINTER (entry );
@@ -590,9 +590,9 @@ g_cube_same(PG_FUNCTION_ARGS)
590
590
bool * result = (bool * ) PG_GETARG_POINTER (2 );
591
591
592
592
if (cube_cmp_v0 (b1 , b2 ) == 0 )
593
- * result = TRUE ;
593
+ * result = true ;
594
594
else
595
- * result = FALSE ;
595
+ * result = false ;
596
596
597
597
PG_RETURN_NDBOX_P (result );
598
598
}
@@ -624,7 +624,7 @@ g_cube_leaf_consistent(NDBOX *key,
624
624
retval = cube_contains_v0 (query , key );
625
625
break ;
626
626
default :
627
- retval = FALSE ;
627
+ retval = false ;
628
628
}
629
629
return retval ;
630
630
}
@@ -651,7 +651,7 @@ g_cube_internal_consistent(NDBOX *key,
651
651
retval = (bool ) cube_overlap_v0 (key , query );
652
652
break ;
653
653
default :
654
- retval = FALSE ;
654
+ retval = false ;
655
655
}
656
656
return retval ;
657
657
}
@@ -1059,7 +1059,7 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1059
1059
int i ;
1060
1060
1061
1061
if ((a == NULL ) || (b == NULL ))
1062
- return FALSE ;
1062
+ return false ;
1063
1063
1064
1064
if (DIM (a ) < DIM (b ))
1065
1065
{
@@ -1071,9 +1071,9 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1071
1071
for (i = DIM (a ); i < DIM (b ); i ++ )
1072
1072
{
1073
1073
if (LL_COORD (b , i ) != 0 )
1074
- return FALSE ;
1074
+ return false ;
1075
1075
if (UR_COORD (b , i ) != 0 )
1076
- return FALSE ;
1076
+ return false ;
1077
1077
}
1078
1078
}
1079
1079
@@ -1082,13 +1082,13 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1082
1082
{
1083
1083
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) >
1084
1084
Min (LL_COORD (b , i ), UR_COORD (b , i )))
1085
- return FALSE ;
1085
+ return false ;
1086
1086
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) <
1087
1087
Max (LL_COORD (b , i ), UR_COORD (b , i )))
1088
- return FALSE ;
1088
+ return false ;
1089
1089
}
1090
1090
1091
- return TRUE ;
1091
+ return true ;
1092
1092
}
1093
1093
1094
1094
Datum
@@ -1129,7 +1129,7 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
1129
1129
int i ;
1130
1130
1131
1131
if ((a == NULL ) || (b == NULL ))
1132
- return FALSE ;
1132
+ return false ;
1133
1133
1134
1134
/* swap the box pointers if needed */
1135
1135
if (DIM (a ) < DIM (b ))
@@ -1144,21 +1144,21 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
1144
1144
for (i = 0 ; i < DIM (b ); i ++ )
1145
1145
{
1146
1146
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) > Max (LL_COORD (b , i ), UR_COORD (b , i )))
1147
- return FALSE ;
1147
+ return false ;
1148
1148
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) < Min (LL_COORD (b , i ), UR_COORD (b , i )))
1149
- return FALSE ;
1149
+ return false ;
1150
1150
}
1151
1151
1152
1152
/* compare to zero those dimensions in (a) absent in (b) */
1153
1153
for (i = DIM (b ); i < DIM (a ); i ++ )
1154
1154
{
1155
1155
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) > 0 )
1156
- return FALSE ;
1156
+ return false ;
1157
1157
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) < 0 )
1158
- return FALSE ;
1158
+ return false ;
1159
1159
}
1160
1160
1161
- return TRUE ;
1161
+ return true ;
1162
1162
}
1163
1163
1164
1164
0 commit comments