int idx, right, mid;
unsigned int idx, right, mid;
re_node_set_contains (set, elem)     const re_node_set *set;     int elem;{  int idx, right, mid;  if (set->nelem <= 0)    return 0;  /* Binary search the element.  */  idx = 0;  right = set->nelem - 1;  while (idx < right)    {      mid = (idx + right) / 2;      if (set->elems[mid] < elem)	idx = mid + 1;      else	right = mid;    }  return set->elems[idx] == elem ? idx + 1 : 0;}