@@ -625,7 +625,7 @@ g_cube_leaf_consistent(NDBOX *key,
625625default :
626626retval = FALSE;
627627}
628- return ( retval ) ;
628+ return retval ;
629629}
630630
631631bool
@@ -652,7 +652,7 @@ g_cube_internal_consistent(NDBOX *key,
652652default :
653653retval = FALSE;
654654}
655- return ( retval ) ;
655+ return retval ;
656656}
657657
658658NDBOX *
@@ -663,7 +663,7 @@ g_cube_binary_union(NDBOX *r1, NDBOX *r2, int *sizep)
663663retval = cube_union_v0 (r1 ,r2 );
664664* sizep = VARSIZE (retval );
665665
666- return ( retval ) ;
666+ return retval ;
667667}
668668
669669
@@ -729,7 +729,7 @@ cube_union_v0(NDBOX *a, NDBOX *b)
729729SET_POINT_BIT (result );
730730}
731731
732- return ( result ) ;
732+ return result ;
733733}
734734
735735Datum
@@ -1058,7 +1058,7 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
10581058int i ;
10591059
10601060if ((a == NULL )|| (b == NULL ))
1061- return ( FALSE) ;
1061+ return FALSE;
10621062
10631063if (DIM (a )< DIM (b ))
10641064{
@@ -1070,9 +1070,9 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
10701070for (i = DIM (a );i < DIM (b );i ++ )
10711071{
10721072if (LL_COORD (b ,i )!= 0 )
1073- return ( FALSE) ;
1073+ return FALSE;
10741074if (UR_COORD (b ,i )!= 0 )
1075- return ( FALSE) ;
1075+ return FALSE;
10761076}
10771077}
10781078
@@ -1081,13 +1081,13 @@ cube_contains_v0(NDBOX *a, NDBOX *b)
10811081{
10821082if (Min (LL_COORD (a ,i ),UR_COORD (a ,i ))>
10831083Min (LL_COORD (b ,i ),UR_COORD (b ,i )))
1084- return ( FALSE) ;
1084+ return FALSE;
10851085if (Max (LL_COORD (a ,i ),UR_COORD (a ,i ))<
10861086Max (LL_COORD (b ,i ),UR_COORD (b ,i )))
1087- return ( FALSE) ;
1087+ return FALSE;
10881088}
10891089
1090- return ( TRUE) ;
1090+ return TRUE;
10911091}
10921092
10931093Datum
@@ -1128,7 +1128,7 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
11281128int i ;
11291129
11301130if ((a == NULL )|| (b == NULL ))
1131- return ( FALSE) ;
1131+ return FALSE;
11321132
11331133/* swap the box pointers if needed */
11341134if (DIM (a )< DIM (b ))
@@ -1143,21 +1143,21 @@ cube_overlap_v0(NDBOX *a, NDBOX *b)
11431143for (i = 0 ;i < DIM (b );i ++ )
11441144{
11451145if (Min (LL_COORD (a ,i ),UR_COORD (a ,i ))> Max (LL_COORD (b ,i ),UR_COORD (b ,i )))
1146- return ( FALSE) ;
1146+ return FALSE;
11471147if (Max (LL_COORD (a ,i ),UR_COORD (a ,i ))< Min (LL_COORD (b ,i ),UR_COORD (b ,i )))
1148- return ( FALSE) ;
1148+ return FALSE;
11491149}
11501150
11511151/* compare to zero those dimensions in (a) absent in (b) */
11521152for (i = DIM (b );i < DIM (a );i ++ )
11531153{
11541154if (Min (LL_COORD (a ,i ),UR_COORD (a ,i ))> 0 )
1155- return ( FALSE) ;
1155+ return FALSE;
11561156if (Max (LL_COORD (a ,i ),UR_COORD (a ,i ))< 0 )
1157- return ( FALSE) ;
1157+ return FALSE;
11581158}
11591159
1160- return ( TRUE) ;
1160+ return TRUE;
11611161}
11621162
11631163
@@ -1385,7 +1385,7 @@ distance_1D(double a1, double a2, double b1, double b2)
13851385return (Min (a1 ,a2 )- Max (b1 ,b2 ));
13861386
13871387/* the rest are all sorts of intersections */
1388- return ( 0.0 ) ;
1388+ return 0.0 ;
13891389}
13901390
13911391/* Test if a box is also a point */