Inverted Index: Query Processing
This commit is contained in:
14
idxqry.c
14
idxqry.c
@ -1,5 +1,5 @@
|
||||
/**
|
||||
Copyright (C) powturbo 2013-2019
|
||||
Copyright (C) powturbo 2013-2023
|
||||
GPL v2 License
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
@ -46,11 +46,11 @@
|
||||
#endif
|
||||
#include <getopt.h>
|
||||
|
||||
#include "conf.h"
|
||||
#define VINT_IN
|
||||
#include "vint.h"
|
||||
#include "bitpack.h"
|
||||
#include "vp4.h"
|
||||
#include "include_/conf.h"
|
||||
#include "include_/bitpack.h"
|
||||
#include "include_/vp4.h"
|
||||
|
||||
#include "include_/vint_.h"
|
||||
#include "idx.h"
|
||||
#ifndef min
|
||||
#define min(x,y) (((x)<(y)) ? (x) : (y))
|
||||
@ -548,7 +548,7 @@ int qrybatch(idxrd_t *idx, char *fqname
|
||||
}
|
||||
|
||||
void usage() {
|
||||
fprintf(stderr, "\nTurboPFor Copyright (c) 2013-2019 Powturbo %s\n", __DATE__);
|
||||
fprintf(stderr, "\nTurboPFor Copyright (c) 2013-2023 Powturbo %s\n", __DATE__);
|
||||
fprintf(stderr, "https://github.com/powturbo/TurboPFor\n\n");
|
||||
#ifdef THREAD_MAX
|
||||
fprintf(stderr, "Benchmark: parallel intersections in compressed inverted index\n\n");
|
||||
|
||||
Reference in New Issue
Block a user