@@ -625,7 +625,7 @@ g_cube_leaf_consistent(NDBOX *key,
625
625
default :
626
626
retval = FALSE;
627
627
}
628
- return ( retval ) ;
628
+ return retval ;
629
629
}
630
630
631
631
bool
@@ -652,7 +652,7 @@ g_cube_internal_consistent(NDBOX *key,
652
652
default :
653
653
retval = FALSE;
654
654
}
655
- return ( retval ) ;
655
+ return retval ;
656
656
}
657
657
658
658
NDBOX *
@@ -663,7 +663,7 @@ g_cube_binary_union(NDBOX *r1, NDBOX *r2, int *sizep)
663
663
retval = cube_union_v0 (r1 , r2 );
664
664
* sizep = VARSIZE (retval );
665
665
666
- return ( retval ) ;
666
+ return retval ;
667
667
}
668
668
669
669
@@ -729,7 +729,7 @@ cube_union_v0(NDBOX *a, NDBOX *b)
729
729
SET_POINT_BIT (result );
730
730
}
731
731
732
- return ( result ) ;
732
+ return result ;
733
733
}
734
734
735
735
Datum
@@ -1058,7 +1058,7 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1058
1058
int i ;
1059
1059
1060
1060
if ((a == NULL ) || (b == NULL ))
1061
- return ( FALSE) ;
1061
+ return FALSE;
1062
1062
1063
1063
if (DIM (a ) < DIM (b ))
1064
1064
{
@@ -1070,9 +1070,9 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1070
1070
for (i = DIM (a ); i < DIM (b ); i ++ )
1071
1071
{
1072
1072
if (LL_COORD (b , i ) != 0 )
1073
- return ( FALSE) ;
1073
+ return FALSE;
1074
1074
if (UR_COORD (b , i ) != 0 )
1075
- return ( FALSE) ;
1075
+ return FALSE;
1076
1076
}
1077
1077
}
1078
1078
@@ -1081,13 +1081,13 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
1081
1081
{
1082
1082
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) >
1083
1083
Min (LL_COORD (b , i ), UR_COORD (b , i )))
1084
- return ( FALSE) ;
1084
+ return FALSE;
1085
1085
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) <
1086
1086
Max (LL_COORD (b , i ), UR_COORD (b , i )))
1087
- return ( FALSE) ;
1087
+ return FALSE;
1088
1088
}
1089
1089
1090
- return ( TRUE) ;
1090
+ return TRUE;
1091
1091
}
1092
1092
1093
1093
Datum
@@ -1128,7 +1128,7 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
1128
1128
int i ;
1129
1129
1130
1130
if ((a == NULL ) || (b == NULL ))
1131
- return ( FALSE) ;
1131
+ return FALSE;
1132
1132
1133
1133
/* swap the box pointers if needed */
1134
1134
if (DIM (a ) < DIM (b ))
@@ -1143,21 +1143,21 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
1143
1143
for (i = 0 ; i < DIM (b ); i ++ )
1144
1144
{
1145
1145
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) > Max (LL_COORD (b , i ), UR_COORD (b , i )))
1146
- return ( FALSE) ;
1146
+ return FALSE;
1147
1147
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) < Min (LL_COORD (b , i ), UR_COORD (b , i )))
1148
- return ( FALSE) ;
1148
+ return FALSE;
1149
1149
}
1150
1150
1151
1151
/* compare to zero those dimensions in (a) absent in (b) */
1152
1152
for (i = DIM (b ); i < DIM (a ); i ++ )
1153
1153
{
1154
1154
if (Min (LL_COORD (a , i ), UR_COORD (a , i )) > 0 )
1155
- return ( FALSE) ;
1155
+ return FALSE;
1156
1156
if (Max (LL_COORD (a , i ), UR_COORD (a , i )) < 0 )
1157
- return ( FALSE) ;
1157
+ return FALSE;
1158
1158
}
1159
1159
1160
- return ( TRUE) ;
1160
+ return TRUE;
1161
1161
}
1162
1162
1163
1163
@@ -1385,7 +1385,7 @@ distance_1D(double a1, double a2, double b1, double b2)
1385
1385
return (Min (a1 , a2 ) - Max (b1 , b2 ));
1386
1386
1387
1387
/* the rest are all sorts of intersections */
1388
- return ( 0.0 ) ;
1388
+ return 0.0 ;
1389
1389
}
1390
1390
1391
1391
/* Test if a box is also a point */
0 commit comments