X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;ds=sidebyside;f=index%2Fzinfo.h;h=de8e01569a646c50226f9814a5ef6718c51368fe;hb=40e64fc6d452f02389a00e5c8004f895342099c2;hp=f0ede54d4ded9be938bece3c3fe5475d15eb6ec1;hpb=48d26dcea283f57c49f77b82d6a987e41d775749;p=idzebra-moved-to-github.git diff --git a/index/zinfo.h b/index/zinfo.h index f0ede54..de8e015 100644 --- a/index/zinfo.h +++ b/index/zinfo.h @@ -1,35 +1,42 @@ -/* - * Copyright (C) 1994-1998, Index Data I/S - * All rights reserved. - * Sebastian Hammer, Adam Dickmeiss - * - * $Log: zinfo.h,v $ - * Revision 1.5 1998-06-08 14:43:16 adam - * Added suport for EXPLAIN Proxy servers - added settings databasePath - * and explainDatabase to facilitate this. Increased maximum number - * of databases and attributes in one register. - * - * Revision 1.4 1998/05/20 10:12:21 adam - * Implemented automatic EXPLAIN database maintenance. - * Modified Zebra to work with ASN.1 compiled version of YAZ. - * - * Revision 1.3 1998/03/05 08:45:13 adam - * New result set model and modular ranking system. Moved towards - * descent server API. System information stored as "SGML" records. - * - * Revision 1.2 1996/05/22 08:22:00 adam - * Added public ZebDatabaseInfo structure. - * - * Revision 1.1 1996/05/13 14:23:07 adam - * Work on compaction of set/use bytes in dictionary. - * - */ +/* $Id: zinfo.h,v 1.21 2005-01-15 21:45:43 adam Exp $ + Copyright (C) 1995-2005 + Index Data ApS + +This file is part of the Zebra server. + +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 +Software Foundation; either version 2, or (at your option) any later +version. + +Zebra is distributed in the hope that it will be useful, but WITHOUT ANY +WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with Zebra; see the file LICENSE.zebra. If not, write to the +Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA +02111-1307, USA. +*/ + + #ifndef ZINFO_H #define ZINFO_H -#include +#include +#include #include "recindex.h" +/* Compare string (ignore case) */ +#ifdef WIN32 +#define STRCASECMP stricmp +#else +#define STRCASECMP strcasecmp +#endif + +YAZ_BEGIN_CDECL + typedef struct zebraExplainInfo *ZebraExplainInfo; typedef struct zebDatabaseInfo ZebDatabaseInfo; ZebraExplainInfo zebraExplain_open (Records records, data1_handle dh, @@ -39,8 +46,7 @@ ZebraExplainInfo zebraExplain_open (Records records, data1_handle dh, int (*updateFunc)(void *handle, Record drec, data1_node *n)); -void zebraExplain_close (ZebraExplainInfo zei, int writeFlag, - int (*updateH)(Record drec, data1_node *n)); +void zebraExplain_close (ZebraExplainInfo zei); int zebraExplain_curDatabase (ZebraExplainInfo zei, const char *database); int zebraExplain_newDatabase (ZebraExplainInfo zei, const char *database, int explain_database); @@ -49,14 +55,25 @@ int zebraExplain_addSU (ZebraExplainInfo zei, int set, int use); void zebraExplain_addSchema (ZebraExplainInfo zei, Odr_oid *oid); void zebraExplain_recordCountIncrement (ZebraExplainInfo zei, int adjust_num); void zebraExplain_recordBytesIncrement (ZebraExplainInfo zei, int adjust_num); -int zebraExplain_runNumberIncrement (ZebraExplainInfo zei, int adjust_num); +zint zebraExplain_runNumberIncrement (ZebraExplainInfo zei, int adjust_num); void zebraExplain_loadAttsets (data1_handle dh, Res res); +void zebraExplain_flush (ZebraExplainInfo zei, void *updateHandle); + +int zebraExplain_lookup_ord (ZebraExplainInfo zei, int ord, + const char **db, int *set, int *use); + +int zebraExplain_trav_ord(ZebraExplainInfo zei, void *handle, + int (*f)(void *handle, int ord)); + +int zebraExplain_removeDatabase(ZebraExplainInfo zei, void *updateHandle); typedef struct { int recordSize; - int recordOffset; + off_t recordOffset; int runNumber; } RecordAttr; RecordAttr *rec_init_attr (ZebraExplainInfo zei, Record rec); +YAZ_END_CDECL + #endif