1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
  
58
  
59
  
60
  
61
  
62
  
63
  
64
  
65
  
66
  
67
  
68
  
69
  
70
  
71
  
72
  
73
  
74
  
75
  
76
  
77
  
78
  
79
  
80
  
81
  
82
  
83
  
84
  
85
  
86
  
87
  
88
  
89
  
90
  
91
  
92
  
93
  
94
  
95
  
96
  
97
  
98
  
99
  
100
  
101
  
102
  
103
  
104
  
105
  
106
  
107
  
108
  
109
  
110
  
111
  
112
  
113
  
114
  
115
  
116
  
117
  
118
  
119
  
120
  
121
  
122
  
123
  
124
  
125
  
126
  
127
  
128
  
129
  
130
  
131
  
132
  
133
  
134
  
135
  
136
  
137
  
138
  
139
  
140
  
141
  
142
  
143
  
144
  
145
  
146
  
147
  
148
  
149
  
150
  
151
  
152
  
153
  
154
  
155
  
156
  
157
  
158
  
159
  
160
  
161
  
162
  
163
  
164
  
165
  
166
  
167
  
168
  
169
  
170
  
171
  
172
  
173
  
174
  
175
  
176
  
177
  
178
  
179
  
180
  
181
  
182
  
183
  
184
  
185
  
186
  
187
  
188
  
189
  
190
  
191
  
192
  
193
  
194
  
195
  
196
  
197
  
198
  
199
  
200
  
201
  
202
  
203
  
204
  
205
  
206
  
207
  
208
  
209
  
210
  
211
  
212
  
213
  
214
  
215
  
216
  
217
  
218
  
219
  
220
  
221
  
222
  
223
  
224
  
225
  
226
  
227
  
228
  
229
  
230
  
231
  
232
  
233
  
234
  
235
  
236
  
237
  
238
  
239
  
240
  
241
  
242
  
243
  
244
  
245
  
246
  
247
  
248
  
249
  
250
  
251
  
252
  
253
  
254
  
255
  
256
  
257
  
258
  
259
  
260
  
261
  
262
  
263
  
264
  
265
  
266
  
267
  
268
  
269
  
270
  
271
  
272
  
273
  
274
  
275
  
276
  
277
  
278
  
279
  
280
  
281
  
282
  
283
  
#include <math.h> 
 
#include "global.h" 
#include "stralloc.h" 
#include "global.h" 
RCSID("$Id: whitefish.c,v 1.15 2001/05/25 15:00:04 js Exp $"); 
#include "pike_macros.h" 
#include "interpret.h" 
#include "program.h" 
#include "program_id.h" 
#include "object.h" 
#include "operators.h" 
#include "array.h" 
#include "module_support.h" 
 
#include "config.h" 
 
#include "whitefish.h" 
#include "resultset.h" 
#include "blob.h" 
 
/* must be included last */ 
#include "module_magic.h" 
 
struct  tofree 
{ 
  Blob **blobs; 
  Blob **tmp; 
  int nblobs; 
  struct object *res; 
}; 
 
static void free_stuff( void *_t ) 
{ 
  struct tofree *t= (struct tofree *)_t; 
  int i; 
  if( t->res ) free_object( t->res ); 
  for( i = 0; i<t->nblobs; i++ ) 
    wf_blob_free( t->blobs[i] ); 
  free( t->tmp ); 
  free( t ); 
} 
 
#define OFFSET(X) \ 
 (X.type == HIT_BODY?X.u.body.pos:X.type==HIT_FIELD?(X.u.field.pos):(X.u.anchor.pos)) 
 
#define DOFF(X)  MINIMUM((int)sqrt(X),7) 
#define MOFF(X)  (X.type==HIT_BODY?0:X.type==HIT_FIELD?X.u.field.type+2:1) 
 
static void handle_hit( Blob **blobs, 
                        int nblobs, 
                        struct object *res, 
                        int docid, 
                        double *field_c[66], 
                        double *prox_c[8] ) 
{ 
  int i, j, k, end = 0; 
  Hit *hits = malloc( nblobs * sizeof(Hit) ); 
  unsigned char *nhits = malloc( nblobs ); 
  unsigned char *pos = malloc( nblobs ); 
 
  int matrix[66][8]; 
 
  MEMSET(hits, 0, nblobs * sizeof(Hit) ); 
  MEMSET(pos, 0, nblobs ); 
 
  for( i = 0; i<nblobs; i++ ) 
    nhits[i] = wf_blob_nhits( blobs[i] ); 
 
 
  for( i = 0; i<nblobs; i++ ) 
  { 
    MEMSET( pos, 0, nblobs ); 
    for( j = 0; j<nhits[i]; j++ ) 
    { 
      hits[i] = wf_blob_hit( blobs[i], j ); 
      matrix[MOFF(hits[i])][0]++; 
      /* forward the other positions */ 
      for( k = 0; k<nblobs; k++ ) 
        if( k != j &&  pos[ k ] < nhits[ k ] ) 
        { 
          while( (hits[k].raw < hits[i].raw) && (pos[ k ] < nhits[ k ])) 
            hits[k] = wf_blob_hit( blobs[k], pos[k]++ ); 
          if( (pos[ k ] < nhits[ k ]) && hits[k].type == hits[i].type ) 
            matrix[MOFF(hits[i])][DOFF(OFFSET(hits[i])-OFFSET(hits[k]))]+=2; 
        } 
    } 
  } 
   
 
  /* Now we have our nice matrix. Time to do some multiplication */ 
 
  { 
    double accum = 0.0, fc, pc; 
    int accum_i; 
    for( i = 0; i<66; i++ ) 
      if( (fc = *field_c[i]) != 0.0 ) 
        for( j = 0; j<8; j++ ) 
          if( (pc = *prox_c[j]) != 0.0 ) 
            accum += matrix[i][j] * fc * pc; 
 
    /* Limit */ 
    if( accum > 32000.0 ) 
      accum = 32000.0; 
    accum_i = (int)(accum * 65535);  
    if( accum_i > 0 ) 
      wf_resultset_add( res, docid, accum_i ); 
  } 
} 
 
static struct object *low_do_query_merge( Blob **blobs, 
                                          int nblobs, 
                                          double field_c[66], 
                                          double prox_c[8] ) 
{ 
  struct object *res = wf_resultset_new(); 
  struct tofree *__f = malloc( sizeof( struct tofree ) ); 
  ONERROR e; 
  int i, j, end=0; 
  Blob **tmp; 
   
  tmp = malloc( nblobs * sizeof( Blob *) ); 
 
  __f->res = res; 
  __f->blobs = blobs; 
  __f->nblobs = nblobs; 
  __f->tmp    = tmp; 
  SET_ONERROR( e, free_stuff, __f ); 
 
 
  /* Time to do the real work. :-) */ 
  for( i = 0; i<nblobs; i++ ) /* Forward to first element */ 
    wf_blob_next( blobs[i] );   
 
 
  /* Main loop: Find the smallest element in the blob array. */ 
  while( !end ) 
  { 
    int min = blobs[0]->docid; 
     
    for( i = 1; i<nblobs; i++ ) 
      if( !blobs[i]->eof && blobs[i]->docid < min ) 
        min = blobs[i]->docid; 
 
    for( j = 0, i = 0; i < nblobs; i++ ) 
      if( blobs[i]->docid == min && !blobs[i]->eof ) 
        tmp[j++] = blobs[i]; 
 
    handle_hit( tmp, j, res, min, &field_c, &prox_c ); 
     
    /* Step the 'min' blobs */ 
    for( i = 0; i<j; i++ ) 
      wf_blob_next( tmp[i] ); 
 
    /* Are we done? */ 
    end = 1; 
    for( i=0; i<nblobs; i++ ) 
      if( !blobs[i]->eof ) 
      { 
        end = 0; 
        break; 
      } 
  } 
 
  /* Free workarea and return the result. */ 
 
  UNSET_ONERROR( e ); 
  __f->res = 0; 
  free_stuff( __f ); 
  return res; 
} 
                                 
 
static void f_do_query_merge( INT32 args ) 
/*! @decl ResultSet do_query_merge( array(int) words,          @ 
 *!                          array(int) field_coefficients,       @ 
 *!                          array(int) proximity_coefficients,   @ 
 *!                          function(int:string) blobfeeder)    
 *!       @[words] 
 *!        
 *!          Arrays of word ids. Note that the order is significant 
 *!          for the ranking. 
 *! 
 *!       @[field_coefficients] 
 *! 
 *!       An array of ranking coefficients for the different fields.  
 *!       In the range of [0x0000-0xffff]. The array (always) has 66 
 *!       elements: 
 *! 
 *!       Index        Coefficient for field 
 *!       -----        --------------------- 
 *!       0            body 
 *!       1            anchor 
 *!       2..65        Special field 0..63 
 *! 
 *!       @[proximity_coefficients] 
 *! 
 *!         An array of ranking coefficients for the different 
 *!         proximity categories. Always has 8 elements, in the range 
 *!         of [0x0000-0xffff]. 
 *!       
 *!      Index       Meaning 
 *!      -----       ------- 
 *!      0           spread: 0 (Perfect hit) 
 *!      1           spread: 1-5 
 *!      2           spread: 6-10                                  
 *!      3           spread: 11-20 
 *!      4           spread: 21-40 
 *!      5           spread: 41-80 
 *!      6           spread: 81-160 
 *!      7           spread: 161- 
 *! 
 *!      The 'spread' value should be defined somehow. 
 *!       
 *!     @[blobfeeder] 
 *!      
 *!      This function returns a Pike string containing the word hits 
 *!      for a certain word_id. Call repeatedly until it returns 0. 
 */ 
{ 
  double proximity_coefficients[8]; 
  double field_coefficients[66]; 
  int numblobs, i; 
  Blob **blobs; 
 
  struct svalue *cb; 
  struct object *res; 
  struct array *_words, *_field, *_prox; 
 
  /* 1: Get all arguments. */ 
  get_all_args( "do_query_merge", args, "%a%a%a%*", 
                &_words, &_field, &_prox, &cb); 
 
  if( _field->size != 66 ) 
    Pike_error("Illegal size of field_coefficients array (expected 66)\n" ); 
  if( _prox->size != 8 ) 
    Pike_error("Illegal size of proximity_coefficients array (expected 8)\n" ); 
 
  numblobs = _words->size; 
  if( !numblobs ) 
  { 
    struct object *o = wf_resultset_new( ); 
    pop_n_elems( args ); 
    push_object( o ); 
    return; 
  } 
 
  blobs = malloc( sizeof(Blob *) * numblobs ); 
 
  for( i = 0; i<numblobs; i++ ) 
    blobs[i] = wf_blob_new( cb, _words->item[i].u.integer ); 
 
  for( i = 0; i<8; i++ ) 
    proximity_coefficients[i] = (double)_prox->item[i].u.integer/65535.0; 
 
  for( i = 0; i<66; i++ ) 
    field_coefficients[i] = (double)_field->item[i].u.integer/65535.0; 
 
  res = low_do_query_merge(blobs,numblobs, 
                           field_coefficients, 
                           proximity_coefficients ); 
  pop_n_elems( args ); 
  push_object( res ); 
} 
 
void pike_module_init(void) 
{ 
  init_resultset_program(); 
  init_blob_program(); 
 
  add_function( "do_query_merge", f_do_query_merge, 
                "function(array(int),array(int),array(int)" 
                ",function(int:string):object)", 
                0 ); 
} 
 
void pike_module_exit(void) 
{ 
  exit_resultset_program(); 
  exit_blob_program(); 
}