const struct extremum *a = ll_data (a_, struct extremum, ll);
const struct extremum *b = ll_data (b_, struct extremum, ll);
- if ( a->value > b->value) return -1;
+ if (a->value > b->value) return -1;
return (a->value < b->value);
}
const struct extremum *a = ll_data (a_, struct extremum, ll);
const struct extremum *b = ll_data (b_, struct extremum, ll);
- if ( a->value < b->value) return -1;
+ if (a->value < b->value) return -1;
return (a->value > b->value);
}
struct extrema *extrema = xzalloc (sizeof *extrema);
extrema->capacity = n;
- if ( end == EXTREME_MAXIMA )
+ if (end == EXTREME_MAXIMA)
extrema->cmp_func = cmp_descending;
else
extrema->cmp_func = cmp_ascending;
e->location = location;
e->weight = weight;
- if ( val == SYSMIS)
+ if (val == SYSMIS)
{
free (e);
return;
ll_insert_ordered (ll_head (&extrema->list), ll_null (&extrema->list),
&e->ll, extrema->cmp_func, NULL);
- if ( extrema->n++ > extrema->capacity)
+ if (extrema->n++ > extrema->capacity)
{
struct ll *tail = ll_tail (&extrema->list);
struct extremum *et = ll_data (tail, struct extremum, ll);
{
const struct extremum *top;
- if ( ll_is_empty (&ex->list))
+ if (ll_is_empty (&ex->list))
return false;
top = (const struct extremum *)