X-Git-Url: http://git.indexdata.com/?p=idzebra-moved-to-github.git;a=blobdiff_plain;f=rset%2Frsprox.c;h=15e5b19622e21cbc7da2d2150134692f7164dc99;hp=acf8c333365c413472782ef1865bb5d0034b46e0;hb=fb791f9a754adf7b26695fdb1ddd0fdee9bf28f9;hpb=97a7adeb9e5059463f039495cc01cfa448463a27 diff --git a/rset/rsprox.c b/rset/rsprox.c index acf8c33..15e5b19 100644 --- a/rset/rsprox.c +++ b/rset/rsprox.c @@ -1,5 +1,5 @@ /* This file is part of the Zebra server. - Copyright (C) 1995-2008 Index Data + Copyright (C) 1994-2009 Index Data Zebra is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free @@ -194,10 +194,11 @@ static int r_forward(RSFD rfd, void *buf, TERMID *term, const void *untilbuf) } if (i == ct->no_children) { - memcpy (buf, p->buf[0], kctrl->key_size); + i = ct->no_children-1; + memcpy(buf, p->buf[i], kctrl->key_size); if (term) - *term = p->terms[0]; - p->more[0] = rset_read (p->rfd[0], p->buf[0], &p->terms[0]); + *term = p->terms[i]; + p->more[i] = rset_read(p->rfd[i], p->buf[i], &p->terms[i]); p->hits++; return 1; } @@ -221,56 +222,68 @@ static int r_forward(RSFD rfd, void *buf, TERMID *term, const void *untilbuf) seqno[n++] = (*kctrl->getseq)(p->buf[0]); while ((p->more[0] = rset_read (p->rfd[0], - p->buf[0], &p->terms[0])) >= -1 && - p->more[0] <= -1) + p->buf[0], &p->terms[0]))) + { + cmp = (*kctrl->cmp)(p->buf[0], p->buf[1]); + if (cmp <= - rfd->rset->scope || cmp >= rfd->rset->scope) + break; if (n < 500) seqno[n++] = (*kctrl->getseq)(p->buf[0]); - - for (i = 0; ibuf[1], kctrl->key_size); + if (term) + *term = p->terms[1]; + while (1) { - zint diff = (*kctrl->getseq)(p->buf[1]) - seqno[i]; - int excl = info->exclusion; - if (!info->ordered && diff < 0) - diff = -diff; - switch (info->relation) + for (i = 0; i < n; i++) { - case 1: /* < */ - if (diff < info->distance && diff >= 0) - excl = !excl; - break; - case 2: /* <= */ - if (diff <= info->distance && diff >= 0) - excl = !excl; - break; - case 3: /* == */ - if (diff == info->distance && diff >= 0) - excl = !excl; - break; - case 4: /* >= */ - if (diff >= info->distance && diff >= 0) - excl = !excl; - break; - case 5: /* > */ - if (diff > info->distance && diff >= 0) - excl = !excl; + zint diff = (*kctrl->getseq)(p->buf[1]) - seqno[i]; + int excl = info->exclusion; + if (!info->ordered && diff < 0) + diff = -diff; + switch (info->relation) + { + case 1: /* < */ + if (diff < info->distance && diff >= 0) + excl = !excl; + break; + case 2: /* <= */ + if (diff <= info->distance && diff >= 0) + excl = !excl; + break; + case 3: /* == */ + if (diff == info->distance && diff >= 0) + excl = !excl; + break; + case 4: /* >= */ + if (diff >= info->distance && diff >= 0) + excl = !excl; + break; + case 5: /* > */ + if (diff > info->distance && diff >= 0) + excl = !excl; + break; + case 6: /* != */ + if (diff != info->distance && diff >= 0) + excl = !excl; + break; + } + if (excl) + { + p->more[1] = rset_read ( p->rfd[1], p->buf[1], + &p->terms[1]); + p->hits++; + return 1; + } + } + p->more[1] = rset_read(p->rfd[1], p->buf[1], &p->terms[1]); + if (!p->more[1]) break; - case 6: /* != */ - if (diff != info->distance && diff >= 0) - excl = !excl; + cmp = (*kctrl->cmp)(buf, p->buf[1]); + if (cmp <= - rfd->rset->scope || cmp >= rfd->rset->scope) break; - } - if (excl) - { - memcpy (buf, p->buf[1], kctrl->key_size); - if (term) - *term = p->terms[1]; - p->more[1] = rset_read ( p->rfd[1], p->buf[1], - &p->terms[1]); - p->hits++; - return 1; - } } - p->more[1] = rset_read (p->rfd[1], p->buf[1], &p->terms[1]); } } } @@ -333,6 +346,7 @@ static void r_get_terms(RSET ct, TERMID *terms, int maxterms, int *curterm) /* * Local variables: * c-basic-offset: 4 + * c-file-style: "Stroustrup" * indent-tabs-mode: nil * End: * vim: shiftwidth=4 tabstop=8 expandtab