comp
_Compare comp;
explicit priority_queue(const _Compare& __x) : c(), comp(__x) {}
: c(__s), comp(__x)
{ make_heap(c.begin(), c.end(), comp); }
: c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
: c(__first, __last), comp(__x)
{ make_heap(c.begin(), c.end(), comp); }
: c(__s), comp(__x)
make_heap(c.begin(), c.end(), comp);
: c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
: c(__first, __last), comp(__x)
{ make_heap(c.begin(), c.end(), comp); }
: c(__c), comp(__x)
make_heap(c.begin(), c.end(), comp);
push_heap(c.begin(), c.end(), comp);
pop_heap(c.begin(), c.end(), comp);
void TList<T>::SortItems(int (*comp)(const T**, const T**)) {
sort_func sort = (sort_func)comp;
void SortItems(int (*comp)(const T**, const T**));
u_int comp);
u_int compicvLen, u_int compivLen, u_int comp);
u_int comp)
u_int compicvLen, u_int compivLen, u_int comp);
u_int comp)
u_int compicvLen, u_int compivLen, u_int comp);
u_int comp)
| (comp << AR_CompProc_S)
u_int compicvLen, u_int compivLen, u_int comp);
u_int comp)
comp = key.Compare(*other);
if (comp < 0)
else if (comp > 0)
if (type == BTREE_BACKWARD && comp < 0)
else if (type == BTREE_FORWARD && comp > 0)
*slot, comp);
int low = 0, mid = 0, comp = 0;
int comp = Compare(a->offset, b);
return comp;
static struct comp comps[MAXCOMP];
int32 comp = 255 - bitspixel[2] - bitspixel[3];
bmppixel[0] = (comp < 0) ? 0 : comp;
comp = 255 - bitspixel[1] - bitspixel[3];
bmppixel[1] = (comp < 0) ? 0 : comp;
comp = 255 - bitspixel[0] - bitspixel[3];
bmppixel[2] = (comp < 0) ? 0 : comp;
int32 comp;
comp = 255 - pbits[2] - pbits[3];
ppng[0] = (comp < 0) ? 0 : comp;
comp = 255 - pbits[1] - pbits[3];
ppng[1] = (comp < 0) ? 0 : comp;
comp = 255 - pbits[0] - pbits[3];
ppng[2] = (comp < 0) ? 0 : comp;
int comp = 255 - in_data[2] - in_data[3];
out_buf[0] = comp < 0 ? 0 : comp;
comp = 255 - in_data[1] - in_data[3];
out_buf[1] = comp < 0 ? 0 : comp;
comp = 255 - in_data[0] - in_data[3];
out_buf[2] = comp < 0 ? 0 : comp;
switch (tiff_ifd[thm].comp) {
int32 comp;
comp = 255 - pbits[2] - pbits[3];
ptga[0] = (comp < 0) ? 0 : comp;
comp = 255 - pbits[1] - pbits[3];
ptga[1] = (comp < 0) ? 0 : comp;
comp = 255 - pbits[0] - pbits[3];
ptga[2] = (comp < 0) ? 0 : comp;
comp = stricoll(line1, line2);
comp = strcoll(line1, line2);
if (!comp) {
if (comp < 0) {
int comp, file1done = 0, file2done = 0, read1, read2;
const u_char *comp;
comp = base + (i & 0x3f);
if (dnsdecode(comp, cp, base, cresult,
int comp = 0;
comp = column->CompareFields(field1, field2);
comp = -comp;
if (comp != 0)
return comp;
BTextMailComponent *comp = new BTextMailComponent;
comp->SetDecodedData(&io);
comp->SetEncoding(quoted_printable,encoding);
((BEmailMessage *)(fFields))->AddComponent(comp);
BTextMailComponent *comp = new BTextMailComponent();
comp->SetDecodedData(&io);
comp->SetEncoding(quoted_printable,encode);
((BEmailMessage *)(fFields))->AddComponent(comp);
int comp = 0;
comp = (*t->t_compare)(elm, node);
if (comp < 0)
else if (comp > 0)
if (comp < 0)
int comp;
comp = (*t->t_compare)(key, node);
if (comp < 0)
else if (comp > 0)
int comp;
comp = (*t->t_compare)(key, node);
if (comp < 0) {
} else if (comp > 0)
int comp = 0; \
comp = (cmp)(elm, parent); \
if (comp < 0) \
else if (comp > 0) \
if (comp < 0) \
int comp; \
comp = cmp(elm, tmp); \
if (comp < 0) \
else if (comp > 0) \
int comp; \
comp = cmp(elm, tmp); \
if (comp < 0) { \
else if (comp > 0) \
dirpool_add_dir(Dirpool *dp, Id parent, Id comp, int create)
if (parent == 0 && comp == 1)
if (dp->dirs[d] == comp)
dp->dirs[dp->ndirs] = comp;
Id dirpool_add_dir(Dirpool *dp, Id parent, Id comp, int create);
const char *comp;
Id dn, mp, comp, *dirmap, *dirs;
comp = *dirs++;
if (comp <= 0)
mp = dirmap[-comp];
compstr = stringpool_id2str(&data->spool, comp);
compstr = pool_id2str(data->repo->pool, comp);
if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
mptree[0].comp = 0;
if (mptree[i].compl == compl && !strncmp(mptree[i].comp, compstr, compl))
mptree[i].comp = compstr;
printf("#%d comp: %s\n", i, mptree[i].comp);
Id parent, comp;
comp = dirpool_compid(&data->dirpool, parent);
comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);
comp = dirpool_compid(&data->dirpool, parent);
comps = stringpool_id2str(data->localpool ? &data->spool : &pool->ss, comp);