X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=rset%2Frsprox.c;h=8276e83f2d3a6e5bc1d99097e75baa90a833aa08;hb=8d47d759a2e957ada235ab83bf877f2eb0d2ab99;hp=5b0c89b44e12365f85dac190327a3bb896aadbaf;hpb=cb7fd35de99bb927babcaa4e904f44c7783d2ea8;p=idzebra-moved-to-github.git

diff --git a/rset/rsprox.c b/rset/rsprox.c
index 5b0c89b..8276e83 100644
--- a/rset/rsprox.c
+++ b/rset/rsprox.c
@@ -1,4 +1,4 @@
-/* $Id: rsprox.c,v 1.1 2004-06-09 12:15:25 adam Exp $
+/* $Id: rsprox.c,v 1.12 2004-08-26 11:11:59 heikki Exp $
    Copyright (C) 1995,1996,1997,1998,1999,2000,2001,2002,2003,2004
    Index Data Aps
 
@@ -25,45 +25,52 @@ Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
 #include <string.h>
 #include <assert.h>
 
-#include <rsprox.h>
 #include <zebrautl.h>
+#include <rsprox.h>
 
 #ifndef RSET_DEBUG
 #define RSET_DEBUG 0
 #endif
 
-static void *r_create(RSET ct, const struct rset_control *sel, void *parms);
 static RSFD r_open (RSET ct, int flag);
 static void r_close (RSFD rfd);
 static void r_delete (RSET ct);
 static void r_rewind (RSFD rfd);
-static int r_forward(RSET ct, RSFD rfd, void *buf, int *term_index,
+static int r_forward(RSET ct, RSFD rfd, void *buf, 
                      int (*cmpfunc)(const void *p1, const void *p2),
                      const void *untilbuf);
-static int r_count (RSET ct);
-static int r_read (RSFD rfd, void *buf, int *term_index);
+static int r_read (RSFD rfd, void *buf);
 static int r_write (RSFD rfd, const void *buf);
+static void r_pos (RSFD rfd, double *current, double *total);
 
-static const struct rset_control control_prox = 
+static const struct rset_control control = 
 {
     "prox",
-    r_create,
     r_open,
     r_close,
     r_delete,
     r_rewind,
     r_forward,
-    r_count,
+    r_pos,
     r_read,
     r_write,
 };
 
-const struct rset_control *rset_kind_prox = &control_prox;
+const struct rset_control *rset_kind_prox = &control;
 
 struct rset_prox_info {
-    struct rset_prox_parms p;
-
+/*    struct rset_prox_parms p; */
+    RSET *rset;  
+    int rset_no;
+    int ordered;
+    int exclusion;
+    int relation;
+    int distance;
+    int key_size;
+    int (*cmp)(const void *p1, const void *p2);
+    int (*getseq)(const void *p);
     struct rset_prox_rfd *rfd_list;
+    struct rset_prox_rfd *free_list;
 };
 
 struct rset_prox_rfd {
@@ -72,90 +79,83 @@ struct rset_prox_rfd {
     char *more;  /* more in each lookahead? */
     struct rset_prox_rfd *next;
     struct rset_prox_info *info;
+    zint hits;
 };    
 
-static void *r_create (RSET ct, const struct rset_control *sel, void *parms)
+
+RSET rsprox_create( NMEM nmem, int key_size, 
+            int (*cmp)(const void *p1, const void *p2),
+            int (*getseq)(const void *p),
+            int rset_no, RSET *rset,
+            int ordered, int exclusion,
+            int relation, int distance)
 {
-    rset_prox_parms *prox_parms = (rset_prox_parms *) parms;
+    RSET rnew=rset_create_base(&control, nmem);
     struct rset_prox_info *info;
-    int i;
-    char prox_term[512];
-    int length_prox_term = 0;
-    int min_nn = 10000000;
-    const char *flags = NULL;
-    int term_type = 0;
-
-    info = (struct rset_prox_info *) xmalloc (sizeof(*info));
-    memcpy(&info->p, prox_parms, sizeof(struct rset_prox_parms));
-    info->p.rset = xmalloc(info->p.rset_no * sizeof(*info->p.rset));
-    memcpy(info->p.rset, prox_parms->rset,
-	   info->p.rset_no * sizeof(*info->p.rset));
+    info = (struct rset_prox_info *) nmem_malloc(rnew->nmem,sizeof(*info));
+    info->key_size = key_size;
+    info->cmp = cmp;
+    info->getseq=getseq; /* FIXME - what about multi-level stuff ?? */
+    info->rset = nmem_malloc(rnew->nmem,rset_no * sizeof(*info->rset));
+    memcpy(info->rset, rset,
+           rset_no * sizeof(*info->rset));
+    info->rset_no=rset_no;
+    info->ordered=ordered;
+    info->exclusion=exclusion;
+    info->relation=relation;
+    info->distance=distance;
     info->rfd_list = NULL;
+    info->free_list = NULL;
+    rnew->priv=info;
+    return rnew;
+}
 
-    for (i = 0; i<info->p.rset_no; i++)
-	if (rset_is_volatile(info->p.rset[i]))
-	    ct->flags |= RSET_FLAG_VOLATILE;
 
-    *prox_term = '\0';
-    for (i = 0; i<info->p.rset_no; i++)
-    {
-	int j;
-	for (j = 0; j < info->p.rset[i]->no_rset_terms; j++)
-	{
-	    const char *nflags = info->p.rset[i]->rset_terms[j]->flags;
-	    char *term = info->p.rset[i]->rset_terms[j]->name;
-	    int lterm = strlen(term);
-	    if (lterm + length_prox_term < sizeof(prox_term)-1)
-	    {
-		if (length_prox_term)
-		    prox_term[length_prox_term++] = ' ';
-		strcpy (prox_term + length_prox_term, term);
-		length_prox_term += lterm;
-	    }
-	    if (min_nn > info->p.rset[i]->rset_terms[j]->nn)
-		min_nn = info->p.rset[i]->rset_terms[j]->nn;
-	    flags = nflags;
-            term_type = info->p.rset[i]->rset_terms[j]->type;
-	}
-    }
-
-    ct->no_rset_terms = 1;
-    ct->rset_terms = (RSET_TERM *)
-	xmalloc (sizeof (*ct->rset_terms) * ct->no_rset_terms);
+static void r_delete (RSET ct)
+{
+    struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
+    int i;
 
-    ct->rset_terms[0] = rset_term_create (prox_term, length_prox_term,
-					  flags, term_type);
-    return info;
+    assert (info->rfd_list == NULL);
+    for (i = 0; i<info->rset_no; i++)
+        rset_delete (info->rset[i]);
 }
 
+
 static RSFD r_open (RSET ct, int flag)
 {
-    struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
+    struct rset_prox_info *info = (struct rset_prox_info *) ct->priv;
     struct rset_prox_rfd *rfd;
-    int i, dummy;
+    int i;
 
     if (flag & RSETF_WRITE)
     {
-	logf (LOG_FATAL, "prox set type is read-only");
-	return NULL;
+        logf (LOG_FATAL, "prox set type is read-only");
+        return NULL;
+    }
+    rfd = info->free_list;
+    if (rfd)
+        info->free_list=rfd->next;
+    else {
+        rfd = (struct rset_prox_rfd *) xmalloc (sizeof(*rfd));
+        rfd->more = nmem_malloc (ct->nmem,sizeof(*rfd->more) * info->rset_no);
+        rfd->buf = nmem_malloc(ct->nmem,sizeof(*rfd->buf) * info->rset_no);
+        for (i = 0; i < info->rset_no; i++)
+            rfd->buf[i] = nmem_malloc(ct->nmem,info->key_size);
+        rfd->rfd = nmem_malloc(ct->nmem,sizeof(*rfd->rfd) * info->rset_no);
     }
-    rfd = (struct rset_prox_rfd *) xmalloc (sizeof(*rfd));
     logf(LOG_DEBUG,"rsprox (%s) open [%p]", ct->control->desc, rfd);
     rfd->next = info->rfd_list;
     info->rfd_list = rfd;
     rfd->info = info;
 
-    rfd->more = xmalloc (sizeof(*rfd->more) * info->p.rset_no);
-
-    for (i = 0; i < info->p.rset_no; i++)
-	rfd->buf[i] = xmalloc (info->p.key_size);
 
-    for (i = 0; i < info->p.rset_no; i++)
-	rfd->rfd[i] = rset_open (info->p.rset[i], RSETF_READ);
-
-    for (i = 0; i < info->p.rset_no; i++)
-	rfd->more[i] = rset_read (info->p.rset[i], rfd->rfd[i],
-				  rfd->buf[i], &dummy);
+    for (i = 0; i < info->rset_no; i++) {
+        rfd->rfd[i] = rset_open (info->rset[i], RSETF_READ);
+        rfd->more[i] = rset_read (info->rset[i], rfd->rfd[i],
+                                  rfd->buf[i]);
+    }
+    rfd->hits=0;
     return rfd;
 }
 
@@ -167,128 +167,182 @@ static void r_close (RSFD rfd)
     for (rfdp = &info->rfd_list; *rfdp; rfdp = &(*rfdp)->next)
         if (*rfdp == rfd)
         {
-	    int i;
-	    for (i = 0; i<info->p.rset_no; i++)
-		xfree ((*rfdp)->buf[i]);
-            xfree ((*rfdp)->more);
-
-	    for (i = 0; i<info->p.rset_no; i++)
-		rset_close (info->p.rset[i], (*rfdp)->rfd[i]);
-
+            int i;
+            struct rset_prox_rfd *rfd_tmp=*rfdp;
+            for (i = 0; i<info->rset_no; i++)
+                rset_close (info->rset[i], (*rfdp)->rfd[i]);
             *rfdp = (*rfdp)->next;
-            xfree (rfd);
+            rfd_tmp->next=info->free_list;
+            info->free_list=rfd_tmp;
             return;
         }
     logf (LOG_FATAL, "r_close but no rfd match!");
     assert (0);
 }
 
-static void r_delete (RSET ct)
-{
-    struct rset_prox_info *info = (struct rset_prox_info *) ct->buf;
-    int i;
-
-    assert (info->rfd_list == NULL);
-    rset_term_destroy(ct->rset_terms[0]);
-    xfree (ct->rset_terms);
-    for (i = 0; i<info->p.rset_no; i++)
-	rset_delete (info->p.rset[i]);
-    xfree (info->p.rset);
-    xfree (info);
-}
-
 static void r_rewind (RSFD rfd)
 {
     struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
     struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
-    int dummy, i;
+    int i;
 
     logf (LOG_DEBUG, "rsprox_rewind");
 
-    for (i = 0; i < info->p.rset_no; i++)
+    for (i = 0; i < info->rset_no; i++)
     {
-	rset_rewind (info->p.rset[i], p->rfd[i]);
-	p->more[i] = rset_read (info->p.rset[i], p->rfd[i], p->buf[i], &dummy);
+        rset_rewind (info->rset[i], p->rfd[i]);
+        p->more[i] = rset_read (info->rset[i], p->rfd[i], p->buf[i]);
     }
+    p->hits=0;
 }
 
-static int r_forward (RSET ct, RSFD rfd, void *buf, int *term_index,
-                     int (*cmpfunc)(const void *p1, const void *p2),
-                     const void *untilbuf)
+static int r_forward (RSET ct, RSFD rfd, void *buf, 
+                      int (*cmpfunc)(const void *p1, const void *p2),
+                      const void *untilbuf)
 {
     /* Note: CT is not used. We _can_ pass NULL for it */
     struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
     struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
     int cmp=0;
-    int rc, i;
-    int dummy;
+    int i;
 
     if (untilbuf)
     {
-	/* it's enough to forward first one. Other will follow
-	   automatically */
-	if ( p->more[0] && ((cmpfunc)(untilbuf, p->buf[0]) >= 2) )
-	    p->more[0] = rset_forward(info->p.rset[0], p->rfd[0],
-				      p->buf[0], &dummy, info->p.cmp,
-				      untilbuf);
+        /* it's enough to forward first one. Other will follow
+           automatically */
+        if ( p->more[0] && ((cmpfunc)(untilbuf, p->buf[0]) >= 2) )
+            p->more[0] = rset_forward(info->rset[0], p->rfd[0],
+                                      p->buf[0], info->cmp,
+                                      untilbuf);
     }
-    while (p->more[0]) 
+    if (info->ordered && info->relation == 3 && info->exclusion == 0
+        && info->distance == 1)
     {
-	for (i = 1; i < info->p.rset_no; i++)
-	{
-	    if (!p->more[i]) 
-	    {
-		p->more[0] = 0;    /* saves us a goto out of while loop. */
-		break;
-	    }
-	    cmp = (*info->p.cmp) (p->buf[i], p->buf[i-1]);
-	    if (cmp > 1)
-	    {
-		p->more[i-1] = rset_forward (info->p.rset[i-1], p->rfd[i-1],
-					     p->buf[i-1], &dummy,
-					     info->p.cmp,
-					     p->buf[i]);
-		break;
-	    }
-	    else if (cmp == 1)
-	    {
-		if ((*info->p.getseq)(p->buf[i-1]) +1 != (*info->p.getseq)(p->buf[i]))
-		{
-		    p->more[i-1] = rset_read (info->p.rset[i-1], p->rfd[i-1],
-					      p->buf[i-1], &dummy);
-		    break;
-		}
-	    }
-	    else
-	    {
-		p->more[i] = rset_forward (info->p.rset[i], p->rfd[i],
-					   p->buf[i], &dummy,
-					   info->p.cmp,
-					   p->buf[i-1]);
-		break;
-	    }
-	}
-	if (i == p->info->p.rset_no)
-	{
-            memcpy (buf, p->buf[0], info->p.key_size);
-	    *term_index = 0;
-
-	    p->more[0] = rset_read (info->p.rset[0], p->rfd[0],
-				    p->buf[0], &dummy);
-	    return 1;
-	}
+        while (p->more[0]) 
+        {
+            for (i = 1; i < info->rset_no; i++)
+            {
+                if (!p->more[i]) 
+                {
+                    p->more[0] = 0;    /* saves us a goto out of while loop. */
+                    break;
+                }
+                cmp = (*info->cmp) (p->buf[i], p->buf[i-1]);
+                if (cmp > 1)
+                {
+                    p->more[i-1] = rset_forward (info->rset[i-1],
+                                                 p->rfd[i-1],
+                                                 p->buf[i-1],
+                                                 info->cmp,
+                                                 p->buf[i]);
+                    break;
+                }
+                else if (cmp == 1)
+                {
+                    if ((*info->getseq)(p->buf[i-1]) +1 != 
+                        (*info->getseq)(p->buf[i]))
+                    {
+                        p->more[i-1] = rset_read ( info->rset[i-1], 
+                                             p->rfd[i-1], p->buf[i-1]);
+                        break;
+                    }
+                }
+                else
+                {
+                    p->more[i] = rset_forward (info->rset[i], p->rfd[i],
+                                               p->buf[i], info->cmp,
+                                               p->buf[i-1]);
+                    break;
+                }
+            }
+            if (i == p->info->rset_no)
+            {
+                memcpy (buf, p->buf[0], info->key_size);
+                p->more[0] = rset_read (info->rset[0], p->rfd[0], p->buf[0]);
+                p->hits++;
+                return 1;
+            }
+        }
+    }
+    else if (info->rset_no == 2)
+    {
+        while (p->more[0] && p->more[1]) 
+        {
+            int cmp = (*info->cmp)(p->buf[0], p->buf[1]);
+            if (cmp < -1)
+                p->more[0] = rset_forward (info->rset[0], p->rfd[0],
+                                           p->buf[0], info->cmp, p->buf[0]);
+            else if (cmp > 1)
+                p->more[1] = rset_forward (info->rset[1], p->rfd[1],
+                                           p->buf[1], info->cmp, p->buf[1]);
+            else
+            {
+                int seqno[500];
+                int n = 0;
+                
+                seqno[n++] = (*info->getseq)(p->buf[0]);
+                while ((p->more[0] = rset_read (info->rset[0], p->rfd[0],
+                                                p->buf[0])) >= -1 &&
+                       p->more[0] <= -1)
+                    if (n < 500)
+                        seqno[n++] = (*info->getseq)(p->buf[0]);
+                
+                for (i = 0; i<n; i++)
+                {
+                    int diff = (*info->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)
+                    {
+                        memcpy (buf, p->buf[1], info->key_size);
+                        
+                        p->more[1] = rset_read (info->rset[1],
+                                                p->rfd[1], p->buf[1]);
+                        p->hits++;
+                        return 1;
+                    }
+                }
+                p->more[1] = rset_read (info->rset[1], p->rfd[1],
+                                        p->buf[1]);
+            }
+        }
     }
     return 0;
 }
 
-static int r_count (RSET ct)
-{
-    return 0;
-}
 
-static int r_read (RSFD rfd, void *buf, int *term_index)
+static int r_read (RSFD rfd, void *buf)
 {
-    return r_forward(0, rfd, buf, term_index, 0, 0);
+    { double cur,tot; r_pos(rfd,&cur,&tot); } /*!*/
+    return r_forward(0, rfd, buf, 0, 0);
 }
 
 static int r_write (RSFD rfd, const void *buf)
@@ -297,3 +351,36 @@ static int r_write (RSFD rfd, const void *buf)
     return -1;
 }
 
+static void r_pos (RSFD rfd, double *current, double *total)
+{
+    struct rset_prox_info *info = ((struct rset_prox_rfd*)rfd)->info;
+    struct rset_prox_rfd *p = (struct rset_prox_rfd *) rfd;
+    int i;
+    double cur,tot=-1;
+    double scur=0,stot=0;
+    double r;
+
+    logf (LOG_DEBUG, "rsprox_pos");
+
+    for (i = 0; i < info->rset_no; i++)
+    {
+        rset_pos(info->rset[i], p->rfd[i],  &cur, &tot);
+        if (tot>0) {
+            scur += cur;
+            stot += tot;
+        }
+    }
+    if (tot <0) {  /* nothing found */
+        *current=-1;
+        *total=-1;
+    } else if (tot <1) { /* most likely tot==0 */
+        *current=0;
+        *total=0;
+    } else {
+        r=scur/stot; 
+        *current=p->hits;
+        *total=*current/r ; 
+    }
+    logf(LOG_DEBUG,"prox_pos: [%d] %0.1f/%0.1f= %0.4f ",
+                    i,*current, *total, r);
+}