#include <stdio.h>
#include <assert.h>
#include <limits.h>
#include "index.h"
#include "rank.h"
Go to the source code of this file.
|
| static void * | create (ZebraHandle zh) |
| static void | destroy (struct zebra_register *reg, void *class_handle) |
| static void * | begin (struct zebra_register *reg, void *class_handle, RSET rset, NMEM nmem, TERMID *terms, int numterms) |
| static void | end (struct zebra_register *reg, void *set_handle) |
| static void | add (void *set_handle, int seqno, TERMID term) |
| static int | calc (void *set_handle, zint sysno, zint staticrank, int *stop_flag) |
◆ add()
| void add |
( |
void * | set_handle, |
|
|
int | seqno, |
|
|
TERMID | term ) |
|
static |
add: Called for each word occurence in a result set. This routine should be as fast as possible. This routine should "incrementally" update the score.
Definition at line 131 of file rankstatic.c.
◆ begin()
◆ calc()
| int calc |
( |
void * | set_handle, |
|
|
zint | sysno, |
|
|
zint | staticrank, |
|
|
int * | stop_flag ) |
|
static |
◆ create()
◆ destroy()
◆ end()
◆ log_initialized
◆ log_level
◆ rank_control
| struct rank_control rank_control |
|
static |
Initial value: = {
"rank-static",
}
static void * create(ZebraHandle zh)
static void * begin(struct zebra_register *reg, void *class_handle, RSET rset, NMEM nmem, TERMID *terms, int numterms)
void(* end)(struct zebra_register *reg, void *set_handle)
int(* calc)(void *set_handle, zint sysno, zint staticrank, int *stop_flag)
void(* destroy)(struct zebra_register *reg, void *class_handle)
void(* add)(void *set_handle, int seqno, TERMID term)
Definition at line 175 of file rankstatic.c.
◆ rank_static_class