./0040775000113000011300000000000007450176664007714 5ustar kripkrip./Demo.jsp0100644000113000011300000001170307445370772011313 0ustar kripkrip<%@page import="org.openisis.*,java.io.IOException,java.util.Date"%> <%! static final String EMPTY = ""; static Db[] dbs = new Db[2]; static String dberr = EMPTY; static { try { String[] args = new String[] { "-v", "error", "-encoding", "Cp850" }; dbs[0] = Db.open( "/var/db/cds/cds", args ); args = new String[] { "-v", "error", "-format", "aligned" }; dbs[1] = Db.open( "/var/db/unesb/unesb", args ); } catch (IOException e) { dberr = e.toString(); } }; static String NV ( String x ) { return null==x ? EMPTY : x; } static int ROWS = 5; // number of rows to show at once %> <% String search = NV( request.getParameter( "search" ) ); int off = 0; int rows = ROWS; int dbnum = -1; try { off = Integer.parseInt( request.getParameter( "off" ) ); } catch ( Exception e ) {} try { dbnum = Integer.parseInt( request.getParameter( "db" ) ); if ( dbs.length <= dbnum ) dbnum = -1; } catch ( Exception e ) { } if ( 0 > dbnum ) try { dbnum = Integer.parseInt( (String)session.getAttribute( "db" ) ); } catch ( Exception e ) { dbnum = 0; } else session.setAttribute( "db", ""+dbnum ); Db db = dbs[dbnum]; try { rows = Integer.parseInt( request.getParameter( "rows" ) ); } catch ( Exception e ) {} int[] set = (int[])session.getAttribute( "set" ); %> OpenIsis JSP demo <%= dberr %>
narrow previous search rows at once in
Note: $,"",*,+,^,(F),(G),..,$$,/(tag) are supported. Queries are processed straight left to right.

<% if ( EMPTY != search ) { long then = (new Date()).getTime(); int[] nset = db.search( search, Db.QRY_SIMPLE ); long now = (new Date()).getTime(); if ( null == nset ) { %> sorry, no results for <%=search%> <% session.removeAttribute( "set" ); return; } else { %> got <%=nset.length%> rows for <%=search%> in <%=(now - then)/1000.%> seconds.
<% if ( null == set || null == request.getParameter("narrow") ) set = nset; else { // and sets set = Db.AND( set, nset ); %> <%=set.length%> rows remaining after combine with previous search
<% } session.setAttribute( "set", set ); } } // EMPTY != search if ( null == set ) return; if ( 0 < off ) { int boff = off-rows; if ( boff < 0 ) boff = 0; %> <<rows <%=boff+1%> to <%=boff+rows%> <% } int end = off + rows; if ( end >= set.length ) end = set.length; else { %> rows <%=end+1%> to <%=end+rows%>>> <% } %>

rows <%=off+1%> to <%=end%>

<%-- start output --%> <% if ( 0 == dbnum ) { for ( int i=off; i

MFN : <%= r.getRowId() %>
<%= r.v("CONFERENCE : ",null,12,m,0,0,r13,s) %> <%= r.v("TITLE : ",null,24,m,0,0,r13,s) %> <%= r.v("AUTHOR(S) : ",null,14,m,0,0,"; "+r13+" ",s) %> <%= r.v("EDITION : ",null,25,m,0,0,r13,s) %> <%= r.v("IMPRINT : ",null,26,m,0,0,r13,s) %> <%= r.v("COLLATION : ",null,30,m,0,0,r13,s) %> <%= r.v("SERIES : ",null,44,m,0,0,r13,s) %> <%= r.v("NOTES : ",null,50,m,0,0,r13,s) %> <%= r.v("CORP. BODY : ",null,71,m,0,0,r13,s) %> <%= r.v("ADDED CONF : ",null,72,m,0,0,r13,s) %> <%= r.v("OTHER TITLE: ",null,74,m,0,0,r13,s) %> <%= r.v("OTHER LANG : ",null,76,m|'*',0,0,r13,s) %> <%= r.v("KEYWORDS : ",null,69,m,0,0,r13,s) %> <% } } else { %> <% for ( int i=off; i <% continue; } int id = r.getRowId(); int l = r.getLen(); %> <% for ( int j=0; j <% if ( '^' == f.val.charAt(0) ) { Field[] s = f.split(); if ( null == s ) continue; for ( int k=0; k <% } // for subfields } // if subfields } // for fields } // for rows %>
       
skip bad row <%=set[i]%> as <%=i+1%> of <%=set.length%>
row <%=id%> with <%=l%> fields as <%=i+1%> of <%=set.length%>
<%=id%> <%=f.tag%>   <%=f.html()%>
<%=id%> <%=f.tag%> <%=(char)s[k].tag%> <%=s[k].html()%>
<% } %> ./Changes0100644000113000011300000000017107355467174011204 0ustar kripkripRevision history for Perl extension OpenIsis. 0.01 Wed May 23 08:04:14 2001 - original version; created by h2xs 1.19 ./Db.java0100644000113000011300000001650207447676137011111 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ package org.openisis; import java.io.IOException; import java.util.Iterator; /** This class represents an isis db. The actual implementation is done in derived classes.

$Id: Db.java,v 1.9 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.9 $ @author $Author: kripke $ */ public abstract class Db { /** the default encoding. * the constant String value is "ISO-8859-1". */ public static final String DEFAULT_ENCODING = "ISO-8859-1"; /* standard empty String returned by several methods */ public static final String EMPTY = ""; /** index scan key equal */ public static final int QRY_KEYEQ = 0; /** index scan key prefix */ public static final int QRY_KEYPF = 1; public static final int PREFIX = QRY_KEYPF; // legacy alias /** index scan key auto (checks for '$') */ public static final int QRY_KEYAT = 2; /** fulltext scan for equal */ public static final int QRY_SCANE = 64; /** fulltext scan for contains */ public static final int QRY_SCANC = 65; /** query expression with simple left-to-right binding */ public static final int QRY_SIMPLE = 128; /** query expression with proper binding using precedence, () */ public static final int QRY_PROPER = 129; /** field v: heading mode */ public static final int MHL = 0x10000; /** field v: data flag (no effect w/o heading) */ public static final int MD = 0x20000; /** field v: data mode (includes heading flag) */ public static final int MDL = 0x30000; /** field v: uppercase mode flag */ public static final int MXU = 0x40000; /** field v: uppercase heading mode */ public static final int MHU = 0x50000; /** field v: uppercase data mode */ public static final int MDU = 0x70000; /** field v: index formatting flag */ public static final int MI = 0x80000; /** field v: 16bit UNICODE HTML. HTML-entities are escaped. */ public static final int HTU = 0x100000; /** field v: 8bit ISO-8859-1 HTML. HTML-entities and all chars greater than 255 are escaped. */ public static final int HTI = 0x300000; /** field v: 7bit ASCII HTML. HTML-entities and all chars greater than 127 are escaped. */ public static final int HTA = 0x700000; /** rec v: repeated prefix plus operator (not on 1st occ) */ public static final int PP = 0x2000000; /** rec v: repeated suffix plus operator (not on last occ) */ public static final int PS = 0x1000000; /** rec v: dummy presence selector Dn */ public static final int DS = 0x4000000; /** rec v: dummy absence selector Nn */ public static final int NS = 0x8000000; /** rec v: occurence range up to last occ */ public static final int LOCC = 0xffff << 16; /** open an isis database. The following options are supported as text-style parameters:

@param dbname basename of database. the dbhome arg, if given, will be prepended, and the ISIS file extensions appended to build the actual filename. Therefore, depending on the value of dbhome and location of files, this may need to include a path. db may be null, if argv includes a dbname arg. @param argv array of names and values. May be null. argv contains parameter names, which may be prefixed by a dash '-'. Depending on the actual parameter, the next string may or must contain a corresponding parameter value. An optional parameter value may be omitted, if at end of argv or the next name is prefixed with a dash. To avoid ambiguity, values never start with a dash. See above for a list of supported parameter names. Unrecognized parameter names are ignored. @return a new Db (unless some RuntimeException is thrown) @throws IoException especially FileNotFoundExceptiond and UnsupportedEncodingException */ public static Db open ( String dbname, String[] args ) throws IOException { String enc = DEFAULT_ENCODING; boolean usePureDb = false; if ( null != args ) for ( int i=0; i $Id: Field.java,v 1.8 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.8 $ @author $Author: kripke $ */ public class Field { /** what a single field can contribute to the V operator. @param b a StringBuffer to append to @param mode OR-combination of the field formatting flags defined in Db and an optional subfield character. @param plain a String to format @param len a 16bit length constraint | offset << 16 @return false iff a non-existing subfield was requested, else true */ public static boolean v ( StringBuffer b, int mode, String plain, int len ) { if ( 0 != (Db.MXU & mode) ) // won't change any specials plain = plain.toUpperCase(); final char[] c = plain.toCharArray(); final int cl=c.length; char sub = (char)mode; int o=0, e=cl; if ( 0 != sub ) { if ( '*' == sub ) { // first subfield if ( e > 1 && '^' == c[0] ) o = 2; } else { if ( 0 != (Db.MXU & mode) ) // oops - upcased subfield marks ... sub = Character.toUpperCase(sub); for (;;) { if ( cl == o ) return false; // no subfield if ( '^' != c[o++] ) continue; if ( cl == o ) return false; // no subfield if ( sub == c[o++] ) break; } } // got sub starting at o e = o; while ( cl > e && '^' != c[e] ) e++; } // now the relevant data is at offset o and ends at e if ( 0 != len ) { int off = len >>> 16; len |= 0xffff; o += off; if ( 0 != len && e > o+len ) e = o+len; } if ( e <= o ) return true; // existing but empty boolean mh = Db.MHL == (Db.MHL & mode); boolean mi = Db.MI == (Db.MI & mode); boolean ht = Db.HTU == (Db.HTU & mode); boolean ab = false; // inside angel brackets: stop at = if ( ! (mh || ht) ) { b.append( c, o, e-o ); return true; } final char htlim = // chars > htlim are escaped ( Db.HTA == (Db.HTA & mode) ) ? 127 : ( Db.HTI == (Db.HTI & mode) ) ? 255 : Character.MAX_VALUE; int i=o; char x = 0; // now we run at least one of mh or ht mode replacements LOOP: for (;;i++) { if ( i < e && htlim >= (x = c[i]) ) switch ( x ) { case '"': case '&': if ( ht ) break; continue; case '^': if ( mh ) break; continue; case '=': if ( ab ) break; continue; case '<': case '>': break; // special in any case default: continue; } if ( i > o ) // flush what we had up to current position b.append( c, o, i-o ); if ( i == e ) // done break; o = i+1; // new offset after this if ( htlim < x ) { // write decimal value b.append( "&#" ).append( (int)x ).append( ';' ); continue; } // now we have one of the special chars switch ( x ) { case '"': b.append( """ ); continue; // ht case '&': b.append( "&" ); continue; // ht case '^': // mh if ( i+1 < e ) { x = Character.toUpperCase( c[++i] ); if ( 1 < o ) // not on beginning of field b.append( ('A' == x) ? ';' : ('A'' != c[i] ) if ( e == ++i ) break LOOP; // ran to end o = i+1; // don't break, go on checking for ><-pair case '>': ab = false; if ( ! mh ) b.append( ">" ); else if ( i+1 while ( '>' != c[i] && '=' != c[i] ) if ( e == ++i ) break LOOP; // ran to end o = i+1; break; } } if ( Db.MDL == (Db.MDL & mode) ) // data mode switch ( Character.getType( c[e-1] ) ) { case Character.START_PUNCTUATION: case Character.END_PUNCTUATION: case Character.CONNECTOR_PUNCTUATION: case Character.OTHER_PUNCTUATION: b.append( " " ); break; default: b.append( ". " ); } return true; } // v /** format a String in HTU-mode. @see #v(StringBuffer,int,String,int) */ public static String html ( String plain ) { StringBuffer b = new StringBuffer( plain.length() + 3 ); v( b, Db.HTU, plain, 0 ); // always true w/o subfield spec return b.toString(); } // html // // so far the statics // /** the tag of this field. For primary fields, this is the field number. For subfields, this is actually a char. */ public final int tag; public final String val; public Field ( int tag_, String val_ ) { tag = tag_; val = val_; } /** split the Field into subfields. */ public Field[] split () { if ( null == val || 0 == val.length() ) return null; StringTokenizer st = new StringTokenizer( val, "^" ); Field[] f = new Field[ st.countTokens() ]; for ( int i=0; i Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! ./MANIFEST0100644000113000011300000000007507355467174011045 0ustar kripkripChanges Makefile.PL MANIFEST OpenIsis.pm OpenIsis.xs test.pl ./Makefile0100644000113000011300000002174507447714013011350 0ustar kripkrip# #/* # openisis - an open implementation of the ISIS database # Version 0.8.x (microversion see file Version) # Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # This software is dedicated to the memory of Eckart Dietrich. # # This software is inspired by (but contains no code of) the iAPI # Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. # See iAPI.txt for what it contains. #EOH */ # # # $Id: Makefile,v 1.26 2002/03/25 19:36:44 kripke Exp $ # the Makefile # TARGETS=openisis # object files in lib LOBJS=lstr.o ldb.o lrec.o lfmt.o luti.o lqry.o # classes in jar CLASSES=Field Rec Db NativeDb PureDb Test Charset # win32 dlls DLLS=openjsis.dll # standard make defines CC=gcc # you may want to try jikes JC=javac # figure out where to find JNI ... ifeq ($(JNIINC),) ifeq ($(JAVAHOME),) JAVAHOME=/usr/java/jdk1.3 endif JNIINC=-I$(JAVAHOME)/include -I$(JAVAHOME)/include/linux endif # check if some linker options for shared objects are given, you may need to # specify some options on some platforms - e.g. "-G" on solaris. ifeq ($(LDFLAGS),) LDFLAGS=-shared endif # DBG= DBG=-g # DBG=-DNDEBUG #UNIXIO= UNIXIO=-DUNIXIO -D_REENTRANT THREADDEF= THREADLIB= ifneq ($(PTHREADS),) THREADDEF=-DHAVE_PTHREAD THREADLIB=-lpthread endif # note that -O is necessary for -Wuninitialized warnings # java needs long long CFLAGS=-O2 -Wall -W -Wshadow -pedantic -Wno-long-long --unsigned-char \ $(DBG) $(JNIINC) $(UNIXIO) $(THREADDEF) # DB to use -- define DB for db/DB/DB, or DBDIR for other path ifeq ($(DB),) DB=cds endif ifeq ($(DBDIR),) DBDIR=db/$(DB)/$(DB) endif # standard default target all: $(TARGETS) .PHONY: all clean run demo perl jar java jdoc # do not delete intermediates .PRECIOUS: org/openisis/%.java %.class %.h clean: rm -rf *.o *.a *.so *.dll *.jar *.tmp *.exp openisis demo core perl org Makefile.old testout.txt libopenisis.a: $(LOBJS) $(AR) $(ARFLAGS) $@ $^ openisis: openisis.o libopenisis.a $(CC) $(DBG) $(THREADLIB) -o $@ $^ shared: openisis.o libopenisis.so $(CC) $(DBG) -o openisis $^ win32: openisis $(DLLS) openisis.jar mv openisis openisis.exe demo: demo.o libopenisis.a $(CC) $(DBG) -o $@ $^ ./demo -db $(DBDIR) 42 run: openisis ./openisis -v $${V:-debug} -db $(DBDIR) $(FMT) 2>&1 | less dump: openisis ./openisis -db $(DBDIR) $(FMT) search: openisis ./openisis -v $${V:-debug} -search 'development$$' -db $(DBDIR) $(FMT) 2>&1 | less searchdump: openisis ./openisis -v $${V:-debug} -search '$$' -db $(DBDIR) $(FMT) 2>&1 terms: openisis ./openisis -v $${V:-warn} -terms '$$' -db $(DBDIR) $(FMT) 2>&1 | less test: openisis ./openisis -v $${V:-warn} -scan development -db $(DBDIR) $(FMT) >testout.txt ./openisis -v $${V:-warn} -terms '$$' -db $(DBDIR) $(FMT) >>testout.txt ./openisis -v $${V:-warn} -search 'devel$$' -fmt mfnf -db $(DBDIR) $(FMT) >>testout.txt diff testout.txt testres.txt crash: openisis time ./openisis -v $${V:-warn} -crash 'Z$$' -db db/unesb/unesb searchtest: openisis ./openisis -v $${V:-warn} -fmt mfnf -search 'a$$' -db $(DBDIR) $(FMT) >testout.txt diff testout.txt searchtest.txt shsearch: shared LD_LIBRARY_PATH=. ./openisis -v $${V:-debug} -search development -db $(DBDIR) $(FMT) 2>&1 | less # take your time :) time: openisis free time ./openisis -perf 100000 -db $(DBDIR) >/dev/null free # time results for the unesb perf test differ dramatically # depending on the working of operating system caching # you may achive about 0.40 sec (12.000 recs per sec) # but immediatly after timing the cds, # the same test may take more than 40 sec utime: openisis free time ./openisis -perf 5000 -db db/unesb/unesb >/dev/null free time ./openisis -fmt mfnf -search 'k$$' -db db/unesb/unesb >/dev/null # perl: libopenisis.a -mkdir perl -ln -s ../Makefile.PL ../OpenIsis.pm ../OpenIsis.xs ../test.pl perl cd perl; perl Makefile.PL; make test : : ++++++++++++++++++++++++++++++++++++++++++++++++++++++ : +++ as root in the perl subdir, run 'make install' +++ : ++++++++++++++++++++++++++++++++++++++++++++++++++++++ java: openisis.jar libopenjsis.so : jtest: java LD_LIBRARY_PATH=. java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Test -v $${V:-warn} -db $(DBDIR) -encoding Cp850 \ -row 42 \ -search development \ -terms '' \ -mpu -row 130 \ -mhl -hta -row 130 \ -m1 -row 130 \ >testout.txt diff testout.txt jtest.txt jcrash: java LD_LIBRARY_PATH=. time java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Test -v $${V:-warn} -dbpath db/unesb -db unesb \ -crash Z # print in cds1.pft format jcds1: java LD_LIBRARY_PATH=. java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Test -v $${V:-warn} -db $(DBDIR) -encoding Cp850 \ -m1 -dump jtime: java LD_LIBRARY_PATH=. time java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Test -search 'a$$' -v $${V:-warn} \ -db db/unesb/unesb >/dev/null jdump: java LD_LIBRARY_PATH=. java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Test -v 9 -db $(DBDIR) 2>&1 | less # -overview overview.html jdoc: - mkdir jdoc javadoc \ -sourcepath . \ -encoding ISO-8859-1 \ -J-Xmx64m \ -d jdoc \ -use \ -version \ -author \ -windowtitle 'org.openisis source code documentation' \ -doctitle 'org.openisis source code documentation' \ -header 'org.openisis source code documentation' \ -footer 'this is public material' \ -bottom 'for your eyes only' \ -stylesheetfile jdocstyle.css \ -charset "iso-8859-1" \ org.openisis charset: java mkdir -p db/charset LD_LIBRARY_PATH=. java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Charset -utf8seq >db/charset/charset.seq mx seq=db/charset/charset.seq create=db/charset/charset -all now tell=1 mx db/charset/charset fst='1 1 MHL,V1' \ ln1=db/charset/charset.lk1 ln2=db/charset/charset.lk2 +fix -all now tell=1 ifload db/charset/charset db/charset/charset.lk1 db/charset/charset.lk2 \ +fix tell=1 -reset -balan LD_LIBRARY_PATH=. java -classpath openisis.jar:$(CLASSPATH) \ org.openisis.Charset # openisis.jar: $(foreach cls,$(CLASSES),org/openisis/$(cls).class) openisis.jar: $(CLASSES:%=org/openisis/%.class) jar cvf $@ org/openisis %.class: %.java $(JC) $< # if you need one java, you might need them all ... org/openisis/%.java: %.java @-[ -d org/openisis ] || mkdir -p org/openisis -cd org/openisis && ln -s ../../*.java . %.h: %.class javah -jni -o $@ $(subst /,.,$*) libopenisis.so: $(LOBJS) $(CC) $(LDFLAGS) -o $@ $^ libopenjsis.so: openjsis.o libopenisis.a $(CC) $(LDFLAGS) -o $@ $^ %.dll: $(CC) -mdll -o junk.tmp -Wl,--base-file,$*.tmp $($*_deps) dlltool --dllname $@ --base-file $*.tmp \ --output-exp $*.exp --input-def $*.def dlltool --dllname $@ --input-def $*.def \ --output-lib lib$*.a gcc -mdll -mconsole -o $@ $($*_deps) -Wl,$*.exp,--enable-stdcall-fixup # dependences of win32 dlls # note on cross-builds: make sure you have the proper jni headers included - # those supplied for the target platform openjsis_deps=openjsis.o $(LOBJS) openjsis.dll: $(openjsis_deps) # maintenance targets ... most need a posix shell ci: clean : +++ enter checkin message +++ -read msg && ci -l -m"$$msg" * tar: clean @-[ -d tar ] || mkdir tar tar czvf tar/openisis.`tail -1 Version`.tgz . --exclude CVS --exclude tar --exclude tcl --exclude db --exclude WEB-INF snap: clean @-[ -d tar ] || mkdir tar tar czvf tar/oi`date +%y%m%d`.tgz . --exclude CVS --exclude tar --exclude WEB-INF headers: for f in *.h *.c *.xs *.java; do \ cat Header.txt >$$f.tmp; \ sed -e '1,/^EOH/d' $$f >>$$f.tmp; \ mv -f $$f.tmp $$f; \ done for f in Makefile Makefile.PL *.pl *.pm; do \ head -n 1 $$f >$$f.tmp; \ sed -e 's/^/#/' Header.txt >>$$f.tmp; \ sed -e '1,/^#EOH/d' $$f >>$$f.tmp; \ mv -f $$f.tmp $$f; \ done # please do not try to make deps w/o sed, gcc and mv ... deps: sed -n -e '1,/^# generated deps/p' Makefile >Makefile.tmp gcc -MM *.c >>Makefile.tmp mv -f Makefile Makefile.old mv Makefile.tmp Makefile -diff Makefile Makefile.old # generated deps -- do not edit below this line demo.o: demo.c openisis.h ldb.o: ldb.c lstr.h ldb.h luti.h openisis.h lfmt.o: lfmt.c ldb.h luti.h openisis.h lqry.o: lqry.c ldb.h luti.h openisis.h lrec.o: lrec.c ldb.h luti.h openisis.h lstr.o: lstr.c lstr.h luti.h openisis.h luti.o: luti.c lstr.h luti.h openisis.h mlock.o: mlock.c openisis.o: openisis.c openisis.h openjsis.o: openjsis.c openisis.h org/openisis/NativeDb.h tpl.o: tpl.c ldb.h luti.h openisis.h ./Makefile.PL0100644000113000011300000000323207447676137011667 0ustar kripkrip# #/* # openisis - an open implementation of the ISIS database # Version 0.8.x (microversion see file Version) # Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # This software is dedicated to the memory of Eckart Dietrich. # # This software is inspired by (but contains no code of) the iAPI # Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. # See iAPI.txt for what it contains. #EOH */ # # $Id: Makefile.PL,v 1.8 2002/03/25 19:36:44 kripke Exp $ # the MakeMaker Makefile for the openisis perl XSUB # use ExtUtils::MakeMaker; # See lib/ExtUtils/MakeMaker.pm for details of how to influence # the contents of the Makefile that is written. WriteMakefile( 'NAME' => 'OpenIsis', 'VERSION_FROM' => 'OpenIsis.pm', # finds $VERSION 'LIBS' => ['-L.. -lopenisis'], # e.g., '-lm' 'DEFINE' => '', # e.g., '-DHAVE_SOMETHING' 'INC' => '-I..', # e.g., '-I/usr/include/other' 'CC' => 'gcc', 'LD' => 'gcc' ); ./NativeDb.java0100644000113000011300000001310707447676137012256 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ package org.openisis; import java.io.IOException; import java.io.FileNotFoundException; import java.io.UnsupportedEncodingException; import java.util.Iterator; import java.util.NoSuchElementException; /** This class is the native implementation of class Db.

Installation

The shared library "openjsis" must be loadable. On a UNIX System, make sure that the file libopenjsis.so resides in a directory listed by the environment variable LD_LIBRARY_PATH or in /etc/ld.so.conf. If you just drop it in /usr/lib or similar dir, you may have to run a command like ldconfig.

On Windows, put openjsis.dll somewhere in the PATH.

$Id: NativeDb.java,v 1.12 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.12 $ @author $Author: kripke $ */ public class NativeDb extends Db { private static synchronized native short nopen ( String dbname, String[] args ); /** read a record by rowid. * The native implementation gives character data as byte[], * since we need to employ java encoding mechanisms anyway. * The tag is packed as four bytes little endian. * @param db a db number as returned by open * @param rowid the number (aka mfn) of the row * @param tag in which to look for txt, negative for any * @param txt to grep from record, null for no grep * @return an array of Objects: * the first is an array of ints filled with rowid an tags * the others are byte[] with field character data in encoding * @see #encoding */ private static native Object[] nreadRow ( short db, int rowid, int tag, byte[] txt ); private static native Object[] nTerms ( short db, byte[] term, byte[] start ); private static native int[] nsearch ( short db, byte[] key, int mode ); static { // TODO: try some explicit paths like our jar's location with System.load // in order to not have to export LD_LIBRARY_PATH or so System.loadLibrary( "openjsis" ); } public byte[] cvt ( String txt ) { try { return txt.getBytes(encoding); } catch ( UnsupportedEncodingException e ) { // shouldn't happen -- our fault throw new Error( "failed to check for support of encoding "+encoding ); } } public String cvt ( byte[] b ) { try { // System.err.println( "got "+b.length+" bytes "+b ); for ( int l=b.length; 0 0 ? "0" : // 0... self-contained b[i] < -64 ? "f" : // 10... six follower bits b[i] < -32 ? "1" : // 110... five bits, one follower b[i] < -16 ? "2" : // 1110... four bits, two followers "b" // bad ) + "("+b[i]+")" ); return ""; } return ""; } catch ( UnsupportedEncodingException e ) { // shouldn't happen -- our fault throw new Error( "failed to check for support of encoding "+encoding ); } } /** Number of this db. */ public final short db; public NativeDb ( String enc, String dbname, String[] args ) throws IOException { super( enc ); db = nopen( dbname, args ); if ( 0 > db ) throw new FileNotFoundException(); } Rec mkRow ( Object[] buf ) { if ( null == buf ) return null; int[] ids = (int[])buf[0]; int rowid = ids[0]; Field[] f = new Field[ buf.length-1 ]; for ( int i=1; i= buf.length ) { buf = null; return false; } nxt = 1; return true; } public Object next () { if ( ! hasNext() ) throw new NoSuchElementException(); return cvt( (byte[])buf[nxt++] ); } public void remove () { throw new UnsupportedOperationException(); } } public Iterator terms ( String prefix ) { return new TermIterator( prefix ); } } // NativeDb ./OpenIsis.pm0100644000113000011300000000632007447713655012002 0ustar kripkrip# #/* # openisis - an open implementation of the ISIS database # Version 0.8.x (microversion see file Version) # Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # This software is dedicated to the memory of Eckart Dietrich. # # This software is inspired by (but contains no code of) the iAPI # Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. # See iAPI.txt for what it contains. #EOH */ # # $Id: OpenIsis.pm,v 1.9 2002/03/25 21:33:33 kripke Exp $ # perl module wrapper for openisis perl XSUB # package OpenIsis; use strict; use vars qw($VERSION @ISA @EXPORT @EXPORT_OK); require Exporter; require DynaLoader; require AutoLoader; @ISA = qw(Exporter DynaLoader); # Items to export into callers namespace by default. Note: do not export # names by default without a very good reason. Use EXPORT_OK instead. # Do not simply export all your public functions/methods/constants. @EXPORT = qw( ); $VERSION = '0.852'; bootstrap OpenIsis $VERSION; # query mode constants *QRY_KEYEQ = \0; *QRY_KEYPF = \1; *QRY_KEYAT = \2; *QRY_SCANE = \64; *QRY_SCANC = \65; *QRY_SIMPLE = \128; *QRY_PROPER = \129; # Preloaded methods go here. # Autoload methods go after =cut, and are processed by the autosplit program. 1; __END__ # Below is the stub of documentation for the OpenIsis module. =head1 NAME OpenIsis - Perl extension for accessing ISIS databases =head1 SYNOPSIS use OpenIsis; $db = OpenIsis::open( 'basename', '-dbpath', '/home/me/mydb' ); $maxmfn = OpenIsis::maxRowid( $db ); for (OpenIsis::query( $db, 'plant * water' )) { my $row = OpenIsis::read( $db, $_ ); # get hashref my $v24 = $row->{'24'}; # field tags map to arrayrefs OpenIsis::MHL( @$v24 ); # apply heading mode to array print $row->{'mfn'}, "TITLE :", join("\n ", @$v24 ), "\n"; my $v30 = $row->{'30'}->[0]; # contents is like ^ap. 233-238 ^billus. my $subfields = OpenIsis::subfields( $v30 ); # get subfield values print "a = ", $subfields->{'a'}, " b = ", $subfields->{'b'}, "\n"; } # print terms starting with A print join('; ',OpenIsis::terms( $db, 'a$' )), "\n"; =head1 DESCRIPTION The OpenIsis perl extension provides access to ISIS databases based on the openisis C library. =head1 AUTHOR Erik Grziwotz, erik@openisis.org =head1 SEE ALSO perl(1). =cut sub MHL { for ( @_ ) { s/(<[^=>]*)=[^>]+>/\1>/g; # dump substitutions s/>< pairs s/[><]//g; # nuke other >< s/^\^.//; # kill initial subfield spec s/\^a/; /; # ^a -> ; s/\^[b-i]/, /g; # ^[b-i] -> , s/\^./. /g; # others -> . } } ./OpenIsis.xs0100644000113000011300000001030007447713655012011 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: OpenIsis.xs,v 1.10 2002/03/25 21:33:33 kripke Exp $ the openisis XSUB */ #include "EXTERN.h" #include "perl.h" #include "XSUB.h" #include /* perl's assert doesn't really assert */ #include "openisis.h" MODULE = OpenIsis PACKAGE = OpenIsis PROTOTYPES: ENABLE void log( level, file ) int level char* file CODE: openIsisLog( level, *file ? file : NULL ); int open( name, ... ) char* name CODE: { const char **argv = NULL; int argc = 0; if ( 1 < items ) { STRLEN n_a; int i; argv = (const char **)malloc( (items-1) * sizeof(argv[0]) ); for ( i=1; irowid ), 0 ); for ( i=0; i < r->len; i++ ) { char buf[7]; AV *ar; SV *ref, **entry; SV *val; val = newSVpv( (char*)r->field[i].val, r->field[i].len ); snprintf( buf, sizeof(buf), "%hu", r->field[i].tag ); buf[sizeof(buf)-1] = 0; entry = hv_fetch( hv, buf, strlen(buf), 1 ); assert ( NULL != entry ); /* out of memory */ if ( NULL == *entry || ! SvROK(*entry) ) { ar = newAV(); *entry = newRV_noinc((SV*)ar); } else { ar = (AV*)SvRV(*entry); assert( SVt_PVAV == SvTYPE(ar) ); } av_push( ar, val ); } free( r ); } RETVAL = newRV_noinc( (SV*)hv ); } OUTPUT: RETVAL SV* subfields( field ) char *field CODE: { OpenIsisField f; OpenIsisRec *r; HV *hv = newHV(); f.tag = 0; f.val = field; f.len = strlen(field); r = openIsisReadField( NULL, &f ); if ( NULL != r ) { int i; char buf[2]; buf[sizeof(buf)-1] = 0; for ( i=0; i < r->len; i++ ) { buf[0] = (char)r->field[i].tag; hv_store( hv, buf, buf[0] ? 1 : 0, newSVpv( (char*)r->field[i].val, r->field[i].len ), 0 ); } free( r ); } RETVAL = newRV_noinc( (SV*)hv ); } OUTPUT: RETVAL void query( db, key, ... ) int db char *key PPCODE: { long mode = OPENISIS_QRY_SIMPLE; long skip = 0; int got; OpenIsisSet set; set.len = 0; got = (int)openIsisQuery( &set, db, key, mode, skip ); if ( 0 < got ) { int i; EXTEND(SP,got); for ( i=0; i $Id: PureDb.java,v 1.9 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.9 $ @author $Author: kripke $ */ public class PureDb extends Db { public PureDb ( String enc, String dbname, String[] args ) throws IOException { super( enc ); throw new UnsupportedOperationException( "sorry, not implemented" ); } public Rec readRow ( int rowid ) { throw new UnsupportedOperationException( "sorry, not implemented" ); } // readrow public Rec scanRow ( int rowid, int tag, String txt ) { throw new UnsupportedOperationException( "sorry, not implemented" ); } // scanrow public int[] search ( String key, int mode ) { throw new UnsupportedOperationException( "sorry, not implemented" ); } // search public Iterator terms ( String prefix ) { throw new UnsupportedOperationException( "sorry, not implemented" ); } } // PureDb ./Rec.java0100644000113000011300000001246207447676137011276 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ package org.openisis; /** Record implementation of openisis java binding.

$Id: Rec.java,v 1.8 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.8 $ @author $Author: kripke $ */ public class Rec { private int rowid; private Field[] fields; public Rec ( int rowid_, Field[] fields_ ) { rowid = rowid_; fields = fields_; } public int getRowId () { return rowid; } public int getLen () { return fields.length; } public Field getField ( int i ) { return fields[i]; } /** the field selector. format one or more occurences of a field to a StringBuffer, mimicking the ISIS Vn-operator. @param b the StringBuffer to fill @param cpre conditional prefix: printed first, if anything is printed @param rpre repeated prefix: printed before every occ (but not the first, if mode include PP) @param tag the field number (0 = all) @param mode several mode bits as defined in Db + optional subfield char @param occ a 16bit occ | end << 16. if occ is 0, all occurences are printed. if the end (higher bytes) are 0, only this occ is printed, else all up to incl. end (use Db.LOCC for all). @param len a 16bit length constraint | offset << 16 this is passed to Field.v and applied for each occ. @param rsuf repeated suffix: printed after every occ (but not the last, if mode include PS) @param csuf conditional suffix: printed last, if anything was printed @return the number of formatted occurences @see Field#v(StringBuffer,int,String,int) */ public int v ( StringBuffer b, String cpre, String rpre, int tag, int mode, int occ, int len, String rsuf, String csuf ) { int end = occ >>> 16; occ &= 0xffff; int o = 0; // occurences seen int did = 0; // occurences done (after range and subfield selection) int lrsuf = -1; // last pos of repeated suffix // data mode ending should not be used with suffix ? // if ( null != rsuf || null != csuf ) mode &= ~Db.MD; // loop all fields for ( int i=0; i occ && o > end ) break; // System.err.println( "in range"); // seems we are in range int l = b.length(); if ( 0 == did && null != cpre ) b.append( cpre ); if ( null != rpre && (0 fields[i].val.indexOf( new String(sf) ); if ( 0 != (Db.NS & mode) ) // the N absence dummy ok = !ok; } if ( ! ok ) { // subfield not found -- however, it counts as an field occ ... // backup to where we were b.delete( l, Integer.MAX_VALUE ); continue; } did++; // gotcha if ( null == rsuf ) continue; lrsuf = b.length(); b.append( rsuf ); } if ( 0 <= lrsuf && 0 != (Db.PS & mode) ) // backup over lrsuf b.delete( lrsuf, Integer.MAX_VALUE ); if ( 0 != did && null != csuf ) b.append( csuf ); return did; } // v /** format fields to a new StringBuffer, return it's content as String. @return a new String or the String Db.EMPTY, iff no fields where done. @see #v(StringBuffer,String,String,int,int,int,int,String,String) */ public String v ( String cpre, String rpre, int tag, int mode, int occ, int len, String rsuf, String csuf ) { StringBuffer b = new StringBuffer(); return 0 < v( b, cpre, rpre, tag, mode, occ, len, rsuf, csuf ) ? b.toString() : Db.EMPTY; } // v /** format fields to a new StringBuffer, return it's content as String. the conditional pre and suf are null here. @return a new String or the String Db.EMPTY, iff no fields where done. @see #v(StringBuffer,String,String,int,int,int,int,String,String) */ public String v ( String rpre, int tag, int mode, int occ, int len, String rsuf ) { return v( null, rpre, tag, mode, occ, len, rsuf, null ); } // v } // Rec ./Test.java0100644000113000011300000002037007447676137011501 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ package org.openisis; import java.io.IOException; import java.util.Date; import java.util.Iterator; import java.text.DecimalFormat; /** Test of openisis java binding.

$Id: Test.java,v 1.12 2002/03/25 19:36:44 kripke Exp $ @version $Revision: 1.12 $ @author $Author: kripke $ */ class Test extends Thread { static DecimalFormat mfn4 = new DecimalFormat( "0000" ); public static boolean dumpRow ( Db db, Rec r, int m ) { if ( null == r ) { System.err.println( "could not get row " ); return false; } if ( 1 == m ) { // cds1 test special m = Db.MDL | Db.PS; String r13 = "\n ", s = "\n"; System.out.println( "MFN : "+mfn4.format(r.getRowId()) ); System.out.print( r.v("CONFERENCE : ",null,12,m,0,0,r13,s) ); System.out.print( r.v("TITLE : ",null,24,m,0,0,r13,s) ); System.out.print( r.v("AUTHOR(S) : ",null,14,m,0,0,"; "+r13+" ",s) ); System.out.print( r.v("EDITION : ",null,25,m,0,0,r13,s) ); System.out.print( r.v("IMPRINT : ",null,26,m,0,0,r13,s) ); System.out.print( r.v("COLLATION : ",null,30,m,0,0,r13,s) ); System.out.print( r.v("SERIES : ",null,44,m,0,0,r13,s) ); System.out.print( r.v("NOTES : ",null,50,m,0,0,r13,s) ); System.out.print( r.v("CORP. BODY : ",null,71,m,0,0,r13,s) ); System.out.print( r.v("ADDED CONF : ",null,72,m,0,0,r13,s) ); System.out.print( r.v("OTHER TITLE: ",null,74,m,0,0,r13,s) ); System.out.print( r.v("OTHER LANG : ",null,76,m|'*',0,0,r13,s) ); System.out.print( r.v("KEYWORDS : ",null,69,m,0,0,r13,s) ); System.out.print( "\n\n" ); return true; } System.out.println( "got row "+r.getRowId() ); int l = r.getLen(); for ( int i=0; i"+f.v(m)+"" ); if ( 0 == (Db.MHL & m) && '^' == f.val.charAt(0) ) { Field[] s = f.split(); if ( null == s ) continue; for ( int j=0; j" +s[j].v(m) +"" ); } } return true; } // dumpRow public static boolean dumpRow ( Db db, Rec r ) { return dumpRow( db, r, Db.HTU ); } // dumpRow static String[] term, val; static Db db; static int[][] post; int start; Test ( int s ) { start = s; } /** implementation of runnable for crashtest. */ public void run () { long then = (new Date()).getTime(); for ( int i=start+1; i++!=start; ) { // read recs for term i if ( i >= term.length ) i = 0; // System.err.println( "post "+i ); for ( int j=0; j args.length ) break; if ( "-terms".equals(args[a]) ) for ( Iterator i=db.terms(args[a+1]); i.hasNext(); ) System.out.println( i.next() ); else if ( "-row".equals(args[a]) ) dumpRow( db, db.readRow( Integer.parseInt(args[a+1]) ), m ); else if ( "-scan".equals(args[a]) ) for ( int i=1; null != (r = db.scanRow(i,-42,args[a+1])); i++ ) { dumpRow( db, r, m ); i = r.getRowId(); } else if ( "-search".equals(args[a]) || "-query".equals(args[a]) ) { String src = args[a+1]; int mode = 0; int[] set = db.search(src, "-search".equals(args[a]) ? Db.QRY_KEYAT : Db.QRY_SIMPLE ); System.err.println( set.length + " rows" ); for ( int i=0; i /* NULL */ #include /* printf */ #include /* atol */ #include "openisis.h" int main ( int argc, const char **argv ) { long rowid = atol(argv[argc-1]); int db, i; OpenIsisRec *rec; if ( 0L == rowid ) { printf( "usage: demo -db \n\tprints row with number \n" ); return 1; } openIsisLog( 0, NULL ); db = openIsisOpen( NULL, argv, argc ); rec = openIsisReadRow( db, rowid ); for ( i=0; ilen; i++ ) printf( "<%ld>%s\n", rec->field[i].tag, openIsis2Html(rec->field[i].val, rec->field[i].len), rec->field[i].tag ); return 0; } /* demo main */ ./demo.pl0100755000113000011300000000315107447676137011201 0ustar kripkrip#!/usr/bin/perl #/* # openisis - an open implementation of the ISIS database # Version 0.8.x (microversion see file Version) # Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # This software is dedicated to the memory of Eckart Dietrich. # # This software is inspired by (but contains no code of) the iAPI # Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. # See iAPI.txt for what it contains. #EOH */ # # $Id: demo.pl,v 1.7 2002/03/25 19:36:44 kripke Exp $ # demo script for openisis perl XSUB # use OpenIsis; OpenIsis::log(0,''); $db = OpenIsis::open( $ARGV[0] || 'db/cds/cds' ); for (1..OpenIsis::maxRowid( $db )) { $row = OpenIsis::readAsHash( $db, $_ ); for (keys(%$row)) { print "<$_>$row->{$_}\n"; if ( $row->{$_} =~ /^\^/ ) { # split subfields $sub = OpenIsis::fieldAsHash( $row->{$_} ); for $s (keys(%$sub)) { print "<$_$s>$sub->{$s}\n"; } } } } ./iAPI.txt0100755000113000011300000012055107355467174011244 0ustar kripkrip/* this file composed by Klaus Ripke from the iAPI files by Robert Janusz. this is the test app "ix.c" with all the includes slurped in, see // #include "isomething.c" you may run this with: cp iAPI.txt iAPI.c gcc iAPI.c ./a.out */ /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The Example of ISIS (UNIX v.3) Database Handle Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // Linux gcc Compiler conventions ! #include #include #include #include // Global variables +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ static char DBpath [71]; char UpCase [256]; #define NFIND 3 // let's keep it for future #define PACKED __attribute__((packed)) // it shoud work on Linux gcc ;-) // #include "idef.c" /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The Type Definitions for Unix-ISIS databases Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // gcc Linux Compiler conventions ! // *** ONLY UNIX ISIS = the difference between DOS/UNIX structures // *************************** TYPE DEFINITIONS ***************************** // Cross Reference File XRF structure +++++++++++++++++++++++++++++++++++++++ typedef /* Packed */ struct // /* Packed */ and order are necessary for block reading { long int xpos PACKED; // Block nr: 1, 2...; < 0: last block long int xrec [127] PACKED; // References to Master File records... // xrec [...] = 2048 *xrmfb [21 bit] & xrmfp [11 bit] // rec. deleted log. < 0 & > 0 (restore: -xrmfb) // rec. deleted phis. =-1 & = 0 (ref@MST.ctrl) // rec. does not exist = 0 & = 0 // new rec. to invert bit 1024 = 1 // rec. edited to inv. (add & del post.) bit 512 = 1 } xrfBlock; // Master File (MST) record structures... +++++++++++++++++++++++++++++++++++ typedef /* Packed */ struct // The first record in Master File { long int ctlmfn PACKED // Always 0 , nxtmfn PACKED // Next Master File Number , nxtmfb PACKED; // Next block in Master File, the 1st has 1 short int nxtmfp PACKED // Next position in the last block , mftype PACKED; // 0 for user's bases; 1 for messages long int reccnt PACKED // Reserved for future , mfcxx1 PACKED // Reserved for future , mfcxx2 PACKED // LAN, > 0: inversion, update not possible , mfcxx3 PACKED; // LAN, = 1: exists exclusive user } mstControl; typedef /* Packed */ struct // Fixed part of record header that must be... { // included in the same block; // the header can begin only on 0, 2, 4...498 long int mfn PACKED; // MFN number short int mfrl PACKED; // Length of record (allways eaven)... // LAN: < 0 ==> record blocked long int mfbwb PACKED; // Block Pointer | If the record waits for inv... short int mfbwp PACKED; // Position Pointer | ...ref. to old location // mfbwb, mfbwp: = 0 at creation; // after modif. = ref to the old record. // xrmfp bit 1024 = 1 at creation // (= waits to be inverted); // xrmfp bit 512 = 1 at edit // (=waits to be inv. & delete old references) } mstHdrFix; typedef /* Packed */ struct { short int base PACKED // Position of data fields in the record , nvf PACKED // Number of fields in the record , status PACKED; // 0 = active, 1 = deleted logicaly (- xrfb < 0) } mstHdrTxt; typedef /* Packed */ struct { mstHdrFix mhf PACKED; // This header is allways in MST file block mstHdrTxt mht PACKED; } RecHeaders; typedef /* Packed */ struct // Index for every field in the record { // dimension = 6 *nvf; base = 18 + 6 *nvf short int tag PACKED // Label of the field , pos PACKED // Position of the first char in data part: 0, 1... , len PACKED; // Length of the field } mstIndex; // Inverted File structures +++++++++++++++++++++++++++++++++++++++++++++++++ // Control File (CNT) structure.............................................. typedef /* Packed */ struct { short int idtype PACKED // B*tree type; 1 = N01/L01, 2 = N02/L02 , ordn PACKED // = 5; a half of size of key-record in N0x , ordf PACKED // = 5; a half of size of key-record in L0x , n PACKED // = 15; number of buffers for nodes , k PACKED // = 5; number of buffers for 1st index level (k < n) , lev PACKED; // Current number of levels in index; -1: no N0x long int posrx PACKED // Reference to the root in N0x , nmaxpos PACKED // Next record in N0x , fmaxpos PACKED; // Next record in L0x short int abnormal PACKED; // 0: N0x has only the root } cntBlock; // Index of Dictionary (N0x) structures...................................... typedef /* Packed */ struct { long int pos PACKED; // Number of record short int ock PACKED // Number of active keys in the record: 1, 2, 3...2*ordn , it PACKED; // B*tree type } nodeHeader; typedef /* Packed */ struct { char key [10] PACKED; long int ref PACKED; // > 0: reference to next node; // < 0: ref. to leaf: idx [1st].key = key // = 0: inactive } nodeIndex1; typedef /* Packed */ struct { char key [30] PACKED; long int ref PACKED; } nodeIndex2; typedef /* Packed */ struct { nodeHeader hdr PACKED; nodeIndex1 idx [10] PACKED; // Vector of 2*ordn elements } nodeBlock1; typedef /* Packed */ struct { nodeHeader hdr PACKED; nodeIndex2 idx [10] PACKED; // Vector of 2*ordn elements } nodeBlock2; typedef /* Packed */ union { nodeBlock1 nb1 PACKED; nodeBlock2 nb2 PACKED; } nodeBlock; // Leaf File (L0x) structures (all index terms).............................. typedef /* Packed */ struct { long int pos PACKED; // Number of leaf record: 1, 2... short int ock PACKED // Number of active keys in the record: 1..2*ordf , it PACKED; // = 1 for L01; = 2 for L02 long int ps PACKED; // Next record in the order: key [ock] < ps^ idx [1st].key } leafHeader; typedef /* Packed */ struct { char key [10] PACKED; short int xxx PACKED; // *** ONLY UNIX ISIS; long int infb PACKED // Reference to IFP segment *** != ISIS.MANUAL *** , infp PACKED; } leafKey1; typedef /* Packed */ struct { char key [30] PACKED; short int xxx PACKED; // *** ONLY UNIX ISIS; long int infb PACKED // Reference to IFP segment *** != ISIS.MANUAL *** , infp PACKED; } leafKey2; typedef /* Packed */ struct { leafHeader hdr PACKED; leafKey1 idx [10] PACKED; // 2*ordf keys } leafBlock1; typedef /* Packed */ struct { leafHeader hdr PACKED; leafKey2 idx [10] PACKED; // 2*ordf keys } leafBlock2; typedef /* Packed */ union { leafBlock1 lb1 PACKED; leafBlock2 lb2 PACKED; } leafBlock; // Inverted File Posting structures.......................................... // ordained postings organized in segments: Index --> Master File typedef /* Packed */ struct { long int ifblk PACKED // Number of block , ifrec [127] PACKED; // Vector of long int *** != ISIS.MANUAL *** // In 1st block ifrec [1st/2nd] = next pos. in IFP } ifpBlock; typedef /* Packed */ struct // This header and 1st posting - always in IFP block { long int ifpnxtb PACKED // Pointer to the next segment: 1, 2... | = 0: last seg. , ifpnxtp PACKED // 0, 1... | = 0: last seg. , ifptotp PACKED // Tot. number of postings (o.k. only in the 1st segment) // = Sum (segment=1, nseg; ifpsegp) , ifpsegp PACKED // Number of postings in this segment , ifpsegc PACKED; // Max. number of postings in this segment (<= 32768) } ifpHeader; // ifpHeader & 1st ifpPosting always in the same ifpBlock // Postings in Segment are always in chain of IFP blocks typedef /* Packed */ struct // Stored left-->right + 0 --> 8 char { long int pmfn PACKED; // First 3 bytes --> Master File short int ptag PACKED; // Field ident - according to File Selection Table (FST) char pocc PACKED; // Number of occurence of the field short int pcnt PACKED; // Counter of the termin inside the field } ifpPosting; typedef struct { int opened; // Which files are opened (bit spec.)... FILE *mst; // 1 FILE *xrf; // 2 FILE *ifp; // 4 FILE *n01; // 8 FILE *l01; // 16 FILE *n02; // 32 FILE *l02; // 64 mstControl mctrl; // MST ctrl record cntBlock cnt1, cnt2; // Inv. Files ctrl records long int ibm, ipm; // IFP new Segment Bock/Pos char name [72]; // Database name } BaseCtrl; typedef struct // This structer must be allways corelated with BaseCtrl { char st [31]; // Max. string to find short int v; // Field to find; 0: all fields short int it; // Type of B*Tree <== strlen (st) leafBlock lbl; // Block L0x with index terms short int ilk; // Position of term in lbl...idx char *term; // The term in lbl...idx long int ib, ip; // Number of block/position for IFP ifpBlock ibl; // Block IFP with posting/s ifpHeader ihd; // Header for Segment of postings long int iiseg; // Number of posting in current Segment (index) long int iitot; // Number of posting in total (index) long int iall; // Number of posting in all Segments char *ipst; // Ref. to last posting string [8 chars] cntBlock *cntr; // BaseCtrl.cntr1/2 <== it FILE *n0x; // N01 or N02 <== it, = BaseCtrl.n0x FILE *l0x; // L01 or L02 <== it, = BaseCtrl.l0x } TableQuery; #define RECLENGTH 8192 typedef union { char buf [RECLENGTH]; RecHeaders hdrs; } RecCtrl; // *** MAIN DATABASE FILE RELATIONS (MST <--> XRF) *** // 1 2 3 // MST |-mblk-|-mblk-|-mblk-|-mblk-|-mblk-|-mblk-|-mblk-|-mblk-|... // ctrl |----record----| // |--->| // 1 2 3 | pointer: B/P (P in [0, 2, 4... 498]) // XRF |-xblk-|-xblk-|-xblk-|... // MFN= 1... 128... 255... // Record |-->-pos->--| // |-mhf-mht-|-idx[1]...idx[nvf]-|---text...---| // |-------------- record buffer --------------| // *** INVERTED FILE RELATIONS (N0x <--> L0x <-->IFP) *** // N0x |-nbl-|-nbl-|-nbl-|-nbl-|-nbl-|-nbl-|... // -->-root->-| |-->--next-->--| |->-->-| r<0 // | // L0x |--lbl--|--lbl--|--lbl--|--lbl--|--lbl--|--lbl--|... // | // |-<--------------<-------------<-| r<0 // *** POSTING *** | // IFP |---ibl---|---ibl---|---ibl---|---ibl---|---ibl---|---ibl---|... // |next |-ihd-|---Segment---| |-ihd-|---Segment---| // |Seg. |-->------>------>-next->--| |||... // MFN... // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // #include "idef.c" // Let's specify non int header ;-) just to keep order void ShowRec (RecCtrl *rc); void setQuery (BaseCtrl *bc, TableQuery *tq, char *sx, short int fld); void isis (); // #include "iutil.c" /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The UTIL procedures for Unix-ISIS databases Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // gcc Linux Compiler conventions ! // *** ONLY UNIX ISIS = the difference between DOS/UNIX structures // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int ReadMem (void *ptr, FILE *f, long int nr, long int size) { // Read "nr"'s block of size "size" from file "f" into "ptr"... if (fseek (f, nr * size, SEEK_SET) != 0) return (-1); if (fread (ptr, size, 1, f) == 0) return (-2); return (0); // O.K. } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void doUpcase (char *s, char *st, int slen) { int i; for (i = 0; i < slen; i++) { if (i < strlen (st)) s [i] = UpCase [(int) st [i]]; else s [i] = ' '; } s [slen] = 0; } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int sComp (char *s1, char *s2, int len) { int i; for (i = 0; i < len; i++) { if (s1 [i] > s2 [i]) return (1); // .gt. if (s1 [i] < s2 [i]) return (-1); // .lt. } return (0); // .eq. } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int bfOpen (FILE **f, BaseCtrl *bc, char *ext, char *opt) { char st [81]; if (strlen (bc->name) + strlen (ext) > 80) return (-2); strcpy (st, bc->name); strcat (st, ext); if ((*f = fopen (st, opt)) == NULL) return (-1); return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int InitBase (BaseCtrl *bc) // Error return: -1 base file/s; -2 inv. file/s; -3 mst. ctrl rec/s; // -4 cnt param/s; -5 ifp param/s { ifpBlock ib; bc->opened = 0; if (bfOpen (&bc->mst, bc, ".MST", "rb") != 0) return (-1); bc->opened += 1; // MST opened if (bfOpen (&bc->xrf, bc, ".XRF", "rb") != 0) return (-1); bc->opened += 2; // XRF opened if (bfOpen (&bc->ifp, bc, ".CNT", "rb") != 0) return (-2); if (fread (&bc->cnt1, sizeof (cntBlock), 1, bc->ifp) == 0 || fread (&bc->cnt2, sizeof (cntBlock), 1, bc->ifp) == 0) return (-2); if (fclose (bc->ifp) != 0) return (-3); if (bfOpen (&bc->ifp, bc, ".IFP", "rb") != 0) return (-2); bc->opened += 4; // IFP opened if (bfOpen (&bc->n01, bc, ".N01", "rb") != 0) return (-2); bc->opened += 8; // N01 opened if (bfOpen (&bc->l01, bc, ".L01", "rb") != 0) return (-2); bc->opened += 16; // L01 opened if (bfOpen (&bc->n02, bc, ".N02", "rb") != 0) return (-2); bc->opened += 32; // N02 opened if (bfOpen (&bc->l02, bc, ".L02", "rb") != 0) return (-2); bc->opened += 64; // L02 opened if (fread (&bc->mctrl, sizeof (mstControl), 1, bc->mst) == 0) return (-3); if (bc->cnt1.ordn != 5 || bc->cnt1.ordf != 5 || bc->cnt1.n != 15 || bc->cnt1.k != 5 || bc->cnt2.ordn != 5 || bc->cnt2.ordf != 5 || bc->cnt2.n != 15 || bc->cnt2.k != 5) return (-4); if (fread (&ib, sizeof (ifpBlock), 1, bc->ifp) == 0) return (-5); if (ib.ifblk != 1) return (-5); bc->ibm = ib.ifrec [0]; bc->ipm = ib.ifrec [1]; return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void Done (BaseCtrl *bc) // Close the database files { if (bc->opened && 1) fclose (bc->mst); if (bc->opened && 2) fclose (bc->xrf); if (bc->opened && 4) fclose (bc->ifp); if (bc->opened && 8) fclose (bc->n01); if (bc->opened && 16) fclose (bc->l01); if (bc->opened && 32) fclose (bc->n02); if (bc->opened && 64) fclose (bc->l02); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ char UpMe (char c) // ^A = ^a etc. { if (c > 96) c = c - 32; return (c); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void outS (char *st) { char i; if (st == NULL) return; for (i = 0; i < strlen (st); i++) // c = tblconvert [st [i]]; if (st [i] == (char) 145) printf ("<"); // This is HTML < else if (st [i] == (char) 146) printf (">"); // and that is > else printf ("%c", st [i]); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void outC (char ch) { char st [2]; st [0] = ch; st [1] = 0; outS (st); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void outD (double x, int n) { char s [80]; gcvt (x, n, s); outS (s); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void outN (long int x) // long int -> sting @ base=10 { // char st [33]; // ltoa (x, st, 10); outS (st); printf ("%li", x); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // #include "imasterf.c" /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The Master File access to Unix-ISIS databases Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // gcc Linux Compiler conventions ! // *** ONLY UNIX ISIS = the difference between DOS/UNIX structures // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int GetRec (BaseCtrl *bc, long int mfnr, RecCtrl *rc, int bufvol) { char mblk [512]; // Master File block; long int xmfb, xmfp; // Pointer to Master File (last read) record // xMfB < 0 : record deleted (status = 1), -xMfB --> block; // xMfP = 0: deleted phisicaly // = 0 & = 0: does not exist // 1st block: xMfB = 1, xMfP = 0; pointer = xMfB * 2048 + xMfP // ==> mst < 500 MBy; long int xn, xb; int ret, nch; xrfBlock xblk; mstHdrFix *hf = &rc->hdrs.mhf; mstHdrTxt *ht = &rc->hdrs.mht; char *b = rc->buf; if ((mfnr < 1) || (mfnr >= bc->mctrl.nxtmfn)) return (-2); // No record // Find the address in XRF... xn = mfnr - 1; xb = xn / 127; if (ReadMem (&xblk, bc->xrf, xb, sizeof (xrfBlock)) != 0) return (-1); xn = xblk.xrec [xn % 127]; // = address in MST xmfb = xn / 2048; // Master File Block xmfp = xn % 512; // Master File Position // Find the record in MST... if (xmfb < 1) return (1); // Record deleted ret = 0; // Record o.k. if (ReadMem (&mblk, bc->mst, xmfb - 1, sizeof (mblk)) != 0) return (-1); // Copy headers into record buffer... memcpy (b, &mblk [xmfp], sizeof (mstHdrFix)); if (hf->mfn != mfnr) return (-2); // Database corrupted if (hf->mfrl >= bufvol) return (-3); // Buffer too small // Get the rest of the record xmfp += sizeof (mstHdrFix); // Posinion in block xb = sizeof (mstHdrFix); // Position in buf xn = labs (hf->mfrl) - xb; // Number of chars to read if (xn <= 0) return (4); // No fields ?? for ( ; ; ) // We have some chars { // Find number of chars to copy from this block if (xn <= (nch = sizeof (mblk) - xmfp)) nch = xn; memcpy (b + xb, &mblk [xmfp], nch); xb += nch; xn -= nch; xmfp = 0; if (xn <= 0) break; // Nothing more to read if (fread (&mblk, sizeof (mblk), 1, bc->mst) == 0) return (-1); } if (ht->status != 0) ret = 1; // Record deleted logicaly if (hf->mfbwb != 0 || hf->mfbwp != 0) ret = 2; // Record not inv. if (hf->mfrl < 0) ret = 3; // Record blocked return (ret); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int IsF (RecCtrl *rc, short int v, char ch, char *st) { short int n, k, kk, flag; char *b = rc->buf; mstHdrTxt *mht = &rc->hdrs.mht; mstIndex *ind = (mstIndex *) &rc->buf [sizeof (RecHeaders)]; flag = 0; for (n = 0; n < mht->nvf; n++) { if (ind->tag == v) // there is a tag { if (ch == ' ') // field found { flag = 1; break; } else // there is sub-field { flag = 1; kk = 0; k = mht->base + ind->pos; while (b [k] != '^' || b [k + 1] != ch) // convention ;-) { k += 1; kk += 1; if (kk >= ind->len) // out of field return (0); } break; } } ind += 1; // next index ref. } if (flag == 0) return (0); // false if (st == NULL) return (1); // true else if (sComp (&b [mht->base + ind->pos], st, ind->len) == 0) return (1); else return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void RepF (RecCtrl *rc, char nf, ...) // Repeated "nf" fields in record "rc", the left label appears only if: // - begins with "\n", - there was another field and there is defined // filed; the right label appears only if ther was defined field. { va_list pinfo; // for ... parameter list int i, c, flag, n, k, kk, v; int hit = 0; char *sl, *sr; char *b = rc->buf; mstHdrTxt *mht = &rc->hdrs.mht; mstIndex *ind = (mstIndex *) &rc->buf [sizeof (RecHeaders)]; for (n = 0; n < mht->nvf; n++) { va_start (pinfo, nf); for (i = 0; i < nf; i++) { kk = 0; k = mht->base + ind->pos; sl = va_arg (pinfo, char *); // left v = va_arg (pinfo, short int); // field c = va_arg (pinfo, char); // sub-field c = UpMe (c); sr = va_arg (pinfo, char *); // right if (v != ind->tag) // another Tag break; if (c != ' ') // sub-field { flag = 1; while (b [k] != '^' || UpMe (b [k + 1]) != c) // convention ;-) { k += 1; kk += 1; if (kk >= ind->len) { flag = 0; break; } } if (flag) { k += 2; kk += 2; } } else flag = 1; if (flag) { // Reference to NULL = NW error !!! if (sl == NULL) flag = 0; else if (*sl == '\n') flag = 1; else flag = 0; if (hit != 0 || flag) outS (sl); hit += 1; if (c == ' ') while (kk < ind->len) { if (b [k] != '<' && b [k] != '>') // HTML special ;-) outC (b [k]); k += 1; kk += 1; } else while (kk < ind->len && b [k] != '^') // convention ;-) { if (b [k] != '<' && b [k] != '>') // HTML special ;-) outC (b [k]); k += 1; kk += 1; } outS (sr); } } va_end (pinfo); ind += 1; } } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // #include "iinvterm.c" /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The Inv. File Terms access for Unix-ISIS databases Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // gcc Linux Compiler conventions ! // *** ONLY UNIX ISIS = the difference between DOS/UNIX structures // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int FindFirst (TableQuery *tq) { short int i, j // Indexes for idx [] , srec, klen, sidx; // Size (rec), key length, size (idx) long int r; // Reference (record number); < 0: --> L0x --> IFP char *ref; leafHeader *lhdr = &tq->lbl.lb1.hdr; // = ...lb2.hdr nodeBlock nbl; nodeHeader *nhdr = &nbl.nb1.hdr; // = ...nb2.hdr if (tq->it == 1) { klen = 10; srec = sizeof (nodeBlock1); sidx = sizeof (nodeIndex1); } else { klen = 30; srec = sizeof (nodeBlock2); sidx = sizeof (nodeIndex2); } r = tq->cntr->posrx; // Root in N0x while (r > 0L) { if (ReadMem (&nbl, tq->n0x, r - 1, srec) != 0) return (-1); j = nhdr->ock; if (nhdr->pos != r || nhdr->it != tq->it || j < 1 || j > 10) return (-3); // 10 = 2*ordn ref = (char *) &nbl.nb1.idx; // Reference to first elem. of index ref += sidx; // The first key is allways <= st, skip it for (i = 1; i < j; i++) if (sComp (ref, tq->st, klen) > 0) break; else ref += sidx; ref -= sidx; // Correct value r = *(long int *) (ref + klen); // We have the "ref" value if (r > tq->cntr->nmaxpos) return (-3); // Out of N0x } // Now find the term in L0x index if (tq->it == 1) { srec = sizeof (leafBlock1); sidx = sizeof(leafKey1); } else { srec = sizeof(leafBlock2); sidx = sizeof(leafKey2); } r = - r; if (ReadMem (&tq->lbl, tq->l0x, r - 1, srec) != 0) return (-1); j = lhdr->ock; if (lhdr->pos != r || lhdr->it != tq->it || j < 1 || j > 10) return (-2); // 10 = 2*ordf tq->ilk = 0; ref = (char *) &tq->lbl.lb1.idx; // Reference to first elem. of index ref += sidx; // The first key is allways <= s, skip it for (i = 1; i < j; i++) if (sComp (ref, tq->st, klen) > 0) break; else { ref += sidx; tq->ilk += 1; } ref -= sidx; tq->term = ref; // We have the term address if (tq->it == 1) ref += 12; // += 10; *** NOT UNIX else ref += 32; // += 30; *** NOT UNIX tq->ib = *(long int *) ref; // = infb ref += sizeof (long int); tq->ip = *(long int *) ref; // = infp return (0); // O.K. } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int FindNext (TableQuery *tq) { int srec; // Block size long int r; // Reference (record number); < 0: --> L0x --> IFP leafHeader *lhdr = &tq->lbl.lb1.hdr; // = ...lb2.hdr if (tq->it == 1) srec = sizeof (leafBlock1); else srec = sizeof (leafBlock2); tq->ilk += 1; // Next key in the index if (tq->ilk >= lhdr->ock) // Out of index { r = lhdr->ps; // Next L0x record in order if (r <= 0) { tq->ilk -= 1; return (1); } // Nothing more, end of index if (ReadMem (&tq->lbl, tq->l0x, r - 1, srec) != 0) return (-1); if (lhdr->pos != r || lhdr->it != tq->it || lhdr->ock < 1 || lhdr->ock > 10) return (-2); // 10 = 2*ordf tq->ilk = 0; } srec = tq->ilk; if (tq->it == 1) { tq->term = tq->lbl.lb1.idx [srec].key; tq->ib = tq->lbl.lb1.idx [srec].infb; tq->ip = tq->lbl.lb1.idx [srec].infp; } else { tq->term = tq->lbl.lb2.idx [srec].key; tq->ib = tq->lbl.lb2.idx [srec].infb; tq->ip = tq->lbl.lb2.idx [srec].infp; } return (0); // We have the new key } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int Find (BaseCtrl *bc, TableQuery tabq [], int ifind, long int *npg , RecCtrl *rc, long int recvol) { int i; if (ifind <= 0 || ifind > NFIND) return (-1); for (i = 0; i < ifind; i++) if (FindFirst (&tabq [i]) < 0) return (-1); i = Postings (bc, tabq, ifind, npg, rc, recvol); return (i); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int IndexPrep (BaseCtrl *bc, TableQuery *tq1, TableQuery *tq2, char *st) { char sx [31]; // tqx->v contains the status of L0x index int i; if (st == NULL) for (i = 0; i < 30; i++) sx [i] = ' '; else for (i = 0; i < 30; i++) if (i < strlen (st)) sx [i] = st [i]; else sx [i] = ' '; sx [30] = 0; setQuery (bc, tq2, sx, 0); // We have a long term in tq2; v := 0 if (FindFirst (tq2) < 0) return (-1); sx [10] = 0; setQuery (bc, tq1, sx, 0); // We have a short term in tq1; v := 0 if (FindFirst (tq1) < 0) return (-1); while (sComp (tq1->term, tq1->st, 10) < 0) if ((tq1->v = FindNext (tq1)) != 0) break; // At the end or error if (tq1->v < 0) return (-1); while (sComp (tq2->term, tq2->st, 30) < 0) if ((tq2->v = FindNext (tq2)) != 0) break; // At the end or error if (tq2->v < 0) return (-1); return (IndexTest (tq1, tq2)); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int IndexTest (TableQuery *tq1, TableQuery *tq2) { if (tq1->v == 1) // At the end of 1st if (tq2->v == 1) // At the end of 2nd return (0); // All done else return (2); // We have only 2nd else if (tq2->v == 1) return (1); // We have only 1st else if (sComp (tq1->term, tq2->term, 10) <= 0) return (1); else return (2); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int IndexTerm (int i, TableQuery *tq1, TableQuery *tq2) { if (i == 1) tq1->v = FindNext (tq1); // The term was in 1st else if (i == 2) tq2->v = FindNext (tq2); // The term was in 2nd else return (-1); return (IndexTest (tq1, tq2)); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void setQuery (BaseCtrl *bc, TableQuery *tq, char *sx, short int fld) { // Must be activated AFTER the initialization of database tq->v = fld; if (strlen (sx) <= 10) { tq->it = 1; doUpcase (tq->st, sx, 10); tq->cntr = &bc->cnt1; tq->n0x = bc->n01; tq->l0x = bc->l01; } else { tq->it = 2; doUpcase (tq->st, sx, 30); tq->cntr = &bc->cnt2; tq->n0x = bc->n02; tq->l0x = bc->l02; } } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // #include "ipost.c" /* ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ iAPI software: The Inv. File Postings access for Unix-ISIS databases Copyright (C) 2000 by Robert Janusz E-mail: rj@jezuici.krakow.pl Address: Robert Janusz, ul. Kopernika 26, 31-501 Krakow, Poland tel: (0048-12) 4294416/432 ; fax: (0048-12) 4295003. This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ // gcc Linux Compiler conventions ! // *** ONLY UNIX ISIS = the difference between DOS/UNIX structures // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int PostSeg (BaseCtrl *bc, TableQuery *tq) { if (ReadMem (&tq->ibl, bc->ifp, tq->ib - 1, sizeof (ifpBlock)) != 0) return (-1); if (labs (tq->ibl.ifblk) - tq->ib != 0) return (-2); memcpy (&tq->ihd, &tq->ibl.ifrec [tq->ip], sizeof (ifpHeader)); tq->ip += 3; // = long int.s / (header - posting) ***!= ISIS.MANUAL *** tq->iiseg = 0; return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int PostNext (BaseCtrl *bc, TableQuery *tq) { if (tq->iitot >= tq->iall) return (1); // No more postings if (tq->iiseg >= tq->ihd.ifpsegp) // No more postings in this seg. { // Get next Segment... tq->ib = tq->ihd.ifpnxtb; tq->ip = tq->ihd.ifpnxtp; if (PostSeg (bc, tq) != 0) return (-2); } tq->iiseg += 1; tq->iitot += 1; tq->ip += 2; // = Number of long int / posting ***!= ISIS.MANUAL *** if (tq->ip > 125) // ***!= ISIS.MANUAL *** { // Get next block for this segment; we HAVE TO find the right block! tq->ib += 1; tq->ip = 0; if (ReadMem (&tq->ibl, bc->ifp, tq->ib - 1, sizeof (ifpBlock)) != 0) return (-1); if (labs (tq->ibl.ifblk) != tq->ib) return (-3); } tq->ipst = (char *) &tq->ibl.ifrec [tq->ip]; return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void PostMake (long int mfn, short int tag, char occ, short int pcnt , char *s, char *slen) { ifpPosting rnp; char *p = (char *) &rnp; rnp.pmfn = mfn; rnp.ptag = tag; rnp.pocc = occ; rnp.pcnt = pcnt; if (tag == 0) *slen = 3; // Only MFN else *slen = 5; // MFN and TAG s [2] = p [0]; s [1] = p [1]; s [0] = p [2]; // = pmfn s [4] = p [4]; s [3] = p [5]; s [5] = p [6]; s [7] = p [7]; s [6] = p [8]; } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void PostInv (ifpPosting *ifpp, void *ps) { char *p = (char *) ifpp; char *s = (char *) ps; // Posting string: |0 a |1 b |2 c |3 d |4 e |5 f |6 g |7 h | ps *s // ifpPosting: |0 c|1 b |2 a |3 0 |4 e |5 d |6 f |7 h |8 g | ifpp *p // |pmfn |ptag |pocc|pcnt | p [0] = s [2]; p [1] = s [1]; p [2] = s [0]; p [3] = 0; // = pmfn p [4] = s [4]; p [5] = s [3]; p [6] = s [5]; p [7] = s [7]; p [8] = s [6]; } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ int main (int argc, char **argv) // char *argv [] { char c; printf ("ix \n"); printf (" ::= UNIX-ISIS (v.3) MF without .MST\n"); printf ("ix ver. 0.3, Copyright (C) 2000 by Robert Janusz\n"); printf ("ix comes with ABSOLUTELY NO WARRANTY\n"); printf ("License: GPL; see http://www.gnu.org/ for details\n"); for (c = 'A'; c <= 'z'; c++) // Let's prepare it, we use API, not an example UpCase [c] = UpMe (c); if (argv [1] != NULL) { strcpy (DBpath, argv [1]); // Database; no test ! ;-) it's only an example isis (); } return (0); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void isis () { int j, v, k; long int nrc; BaseCtrl bc; RecCtrl rc; char st [31]; TableQuery tabq [NFIND]; strcpy (bc.name, DBpath); InitBase (&bc); // ShowRec but not all... printf ("\n*** ShowRec ***\n\n"); //for (nrc = 1L; nrc < bc.mctrl.nxtmfn; nrc++) { for (nrc = 10L; nrc < 20L; nrc++) { if ((j = GetRec (&bc, nrc, &rc, RECLENGTH)) == 0) { ShowRec (&rc); } } // ShowIndex printf ("\n*** ShowIndex: %s ***\n\n", st); strcpy (st, "TEST"); // just an Inv. File term v = 0; // term counter k = IndexPrep (&bc, &tabq [0], &tabq [1], st); // prepare indexes while (k > 0) { j = 20 * k - 10; // We have the term length ;-) memcpy (&st, &tabq [k - 1].term [0], j); // keep it in st st [j] = 0; if ((v += 1) > 12) // we want 12 terms in a list { printf ("->%s\n", st); // the next term break; } printf ("%s\n", st); k = IndexTerm (k, &tabq [0], &tabq [1]); // Next term } // Find a term & show records printf ("\n*** Search for: %s ***\n\n", st); // Let's use the last term setQuery (&bc, &tabq [0], st, 0); // String to search in a filed 0 = any j = Find (&bc, tabq, 1, &nrc, &rc, RECLENGTH); // 1 term to search for // Clean all printf ("\nO.K.\n"); Done (&bc); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ void ShowRec (RecCtrl *rc) { long int nr; short int n, k, kk; char st [256]; char *b = rc->buf; mstHdrTxt *mht = &rc->hdrs.mht; mstIndex *ind = (mstIndex *) &rc->buf [sizeof (RecHeaders)]; nr = rc->hdrs.mhf.mfn; // Record header printf ("=== %li\n", nr); for (n = 0; n < mht->nvf; n++) { // Show fileds without formating printf ("*** [%li] ", (long int) ind->tag); k = mht->base + ind->pos; for (kk = 0; kk < ind->len; kk++) printf ("%c", b [k++]); printf ("\n"); ind += 1; // Next index } printf ("___\n"); } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ // This procedure is prepared to do a simple AND operator after some // extensions, so it can be localy a little strange ;-) int Postings (BaseCtrl *bc, TableQuery tabq [], int ifind, long int *npg , RecCtrl *rc, long int recvol) { int j, state; long int ipg, rn; ifpPosting ip; TableQuery *tq; if (ifind < 1) goto finish; // nothing to do ipg = 1L; // Index for page break { tq = &tabq [0]; // Let's think only about one term to handle (example) if (PostSeg (bc, tq) != 0) return (-1); tq->iall = tq->ihd.ifptotp; // Only 1st Segment has tot. post. number tq->iitot = 0; if (PostNext (bc, tq) != 0) return (-1); PostInv (&ip, tq->ipst); if (sComp (tq->st, tq->term, 20 * tq->it - 10) != 0) ipg = 0L; // the term not found } if (ipg != 1L) goto finish; for ( ; ; ) // Global loop... { // Is there a field { tq = &tabq [0]; if (tq->v != 0) while (ip.ptag != tq->v) { if (PostNext (bc, tq) > 0) goto finish; // No more postings PostInv (&ip, tq->ipst); } } rn = ip.pmfn; state = 1; if (ip.pmfn != rn) state = 0; if (state) // We have a record to show { if ((j = GetRec (bc, rn, rc, recvol)) == 0) ShowRec (rc); else printf ("Record state = %li\n", j); do // Shift all postings { tq = &tabq [0]; if (PostNext (bc, tq) > 0) goto finish; // No more postings PostInv (&ip, tq->ipst); } while (ip.pmfn <= rn); // MFN equals } else // state == 0, Shift all postings while (ip.pmfn < rn) // The last is to examin { tq = &tabq [0]; if (PostNext (bc, tq) > 0) goto finish; // No more postings PostInv (&ip, tq->ipst); } } finish: return (0); // The output is finished } // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ./index.html0100644000113000011300000004623707450176664011720 0ustar kripkrip OpenIsis 0.8.x current version isis openisis howto about links en espanol

welcome to OpenIsis.org

current version

DEMOS:
standard or try searching for unicode characters ( unicode index)

Available for download:
Sources Binaries
  • win32 (0.8.5) ( mingw32 cross-build) should work on all win32 platforms from win95b on.
    Note: If you want to use java you will need the JDK1.3.x
    The current windows version is not yet thread-safe, so using it with a Java servlet engine under windows requires some care.
  • solaris (0.8.4) ( build on solaris 5.8 )
    Note: the JDK shipped with solaris 5.7 / 5.8 ( java 1.2 ) should work.
Features:
  • 0.8.5.2 March 2002
    Much enhanced PERL binding. See the OpenIsis.pm included in the sources.
  • 0.8.5.1 March 2002
    Java now has support for basic formatting modes like MHL, various HTML-safety modes (like escaping all non-ASCIIs), a Vn-field-selector-style method and several nice utils. Indentation is not properly handled, since there is no easy common solution in HTML. Will build tools for a choice of standard strategies later ...
  • 0.8.5 March 2002
    Finally some implementation of the query language (demo). All the operators are there (including /(tag), but not /(t1,t2...)). Every attempt is made to limit the potential costs of even extremely stupid queries like "$"^"$", so no historical (#n) or intermediate results (for precedence) are stored. Queries are processed strictly left to right on a buffer of 1000 hits.
  • 0.8.4 January 2002
    Nearly complete rewrite of search code with support for NEAR conditions. Fixed alignment problems in IFP, now works with the unesb db (-format aligned) and the cds db as distributed with winisis.
    The cds db we had with previous versions (from an old CDS distribution) has a mixed format: aligned leaf files, others unaligned. Although support for a mixed format is easily achieved with openisis, it will not be included unless somebody has a need for it (send us mail).
    The JSP demo now supports searching the unesb db with over 70.000 rows (note the hosting server is a 500MHz Celeron).
    Searching is limited to 1000 postings, usually resulting in a somewhat lower number of rows (where rows have multiple matching postings). The lowest row number (MFN) that was cut off is recorded, and it is possible (not yet in the JSP) to repeat the search starting from that rowid.
  • 0.8.3 October 2001
    First truly usable release, since we have true search by index now (as prefix or complete word). Search gives a list (array) of sorted MFNs; arithmetic on those lists (and, or, not) is straightforward. The JSP demo shows how a query is refined (narrowed) iteratively by ANDing it with a second query. And thanks to Veronica Lencinas and colleagues, we have a version of this document en espanol.
  • September 2001
    Not a new release yet, but maintenance and testing. New structure logging mechanism. Sources are available via CVS at sourceforge. Windows version openisis.exe running.
  • 0.8.2 August 2001
    openisis now under LGPL, no legacy code. Conversion from file structures governed by abstract dynamic description rather than C-structs, so we can support different file layouts, much larger databases, big endian processors and more. Simple full-scan search available in C-Lib and Java. Given a random read throughput of about 30.000 Records/sec on a lame 300 MHz Notebook this seems to be of practic use. jsp demo under development ;).
  • 0.8.1 June 2001
    Java native interface version available. Java package org.openisis has Db, Rec, Field, Test. NativeDb implemented in libopenjsis.so. Subfield splitting and htmlifying in pure java.
  • 0.8.0 May 2001
    Subfield splitting and htmlifying. Everything also available from perl as an xsub. Record shows up as hash, handy but no repeated fields. Makefile.PL, test.pl etc.
  • 0.7.9 May 2001
    First version: static C-Library libopenisis.a for reading records by rowid(Mfn). Executable "openisis" does test. Logging, argumentparsing, Makefile, demo etc.

what is isis

Isis is a simple, yet powerful database system with a large installed base since the 80s. Since it's well suited for bibliographic data, it's commonly used in libraries, and since it's very low cost, especially in those running on a low budget.

introduction to the isis db

An isis DB is a list of rows of unspecified structure, each identified by a unique number, the rowid (a.k.a. mfn). Each row is a list of fields, and each field has number (tag) and a string value. Within a row there may be zero, one or more fields with a given tag. While the field's value usually is a textual representation of data in one or the other character encoding (commonly one of the IBM/DOS code pages), it may actually contain arbitrary bytes.
subfields
There is a convention to encode multiple fields in one by separating them with a '^' followed by one character tagging the subfield. So the field value '^afoo^bbar^bbaz' represents a field having one 'a' subfield with value 'foo' and two 'b' subfields 'bar' and 'baz'.
formatting
There is a formatting language, with literal text, field and subfield variables, if-else branches (on field existance) and for loops (over field repetitions) (roughly speaking).
indexing
An index is build by converting a row into a list of words (optionally applying formats) and stuffing every word, qualified by the position of it's occurence in the row, into a B-Tree (which is actually spread to six files). Searching for a word or word prefix is possible with or without qualifying the position (field). Since all fields can be combined into one index, it is usually not necessary (but possible) to set up multiple indexes.
queries
A query language allows for combination of word lookups using and, or and not(without) operators.
usage
While isis lacks most features of RDBMS like complex relations between different entities, it's flexibility comes in handy for many catalogues and directories with highly varying records and one single level of substructure, which today are usually modelled in XML documents rather than table rows. The flexible indexing mechanism combines the best of full text searching and structured retrieval.

overview of isis software

The mother of all isis software is a DOS version of "MicroISIS" as an integrated system with textual user interface. There is a BSD version of "CDS/ISIS" which also runs under linux up to some 2.2.x kernels (current 2.4 kernels do not support the iBCS module for COFF binaries). Then there are several versions of "WinISIS" (M$-Windows only).

A shared library version "isis.dll" of functions to access an isis db from your code exists, despite it's name, also in a linux version ("isilux"); however, you need some pretty special libs to make it run. A set of command line tools ("cisis") performs tasks like importing ISO2709 bibliographic databases, inverting (index building) etc. The thing next to an isis database server is "wwwisis", which runs as CGI or from the command line and performs most isis tasks (win and lin versions). However, it actually runs per request, not as a server itself, and thus cannot provide concurrency control.

This "official" isis software, which is maintained by Unesco and/or Bireme, is accompanied by a couple of independent developments, some of which are in the public domain. Javaisis is an AWT-based GUI and a a corresponding server, which in turn uses wwwisis. Robert Janusz wrote a C-lib (iAPI) from scratch, which was the starting point for the openisis software.

what is openisis

So why are we writing the openisis software? Because Isis is not open source software, it's not even free software, and that leads to a whole bunch of problems.

problems resulting from closed software

  1. Availability (in theory)
    Versions of the software exist for some operating systems, library versions and languages. For other environments, there is no version of the software, and there is not much one can do about it.
  2. Availability (in practice)
    You may download most the software, but it's partly protected with passwords, which you have to order at some national distributor. You have to pay some fee and/or declare some good reasons, why you want to use the software. Then you have to wait, e.g. in germany it takes more than a month.
  3. Availability (in legal terms)
    Some parts of the software are accompanied by different documents stating some license terms, others are not. Terms seem to be pretty different between countries. One can not easily figure out, what exactly might be allowed usage.
  4. Availability (of documentation)
    Some documentation is available in english, some only in portugese, espanol or italiano. Only a small part is downloadable at all, most is paperware.
  5. Bugfixing
    There is no way one can fix a bug, and not much one can do about having somebody fix it.
  6. Extending
    The only way one could write a Binding for perl or Java would be using the isis.dll. There are problems with regard to required additional libraries (especially some C++ stuff), there are no statements about thread safety, unicode compatibility and so on. As a consequence, it's practically impossible to write a state-of-the-art web application based on an isis db.
  7. Improving
    Many users develop useful ideas for improvements from practice. Their expertise is lost as they are not able to turn it into improved software.
  8. Enabling
    While open source software enables people all over the world to shape their tools themselves, closed software lets them in dependency.

benefits of open software

To address these problems we feel the need for an open source implementation of isis. Of course it would be best to have all of the existing isis code under one or the other form of open license (GPL, LGPL, artistic or similar as appropriate).

On the other hand, an independent secondary implementation has advantages in it's own right. It may have a different focus and develop strengths in one aspect while another aproach performs better in other situations. For example, openisis will have some support for multithreading and unicode, which is paid for by a certain overhead. A rewrite by developers with a different background might introduce new ideas which finally, after having had their indepent test bed, help improve the standard.

OpenIsis as a software to access isis databases is and will be freely available for everybody with full sourcecode, no fee, no restrictions.

developing openisis

In general, there are no plans to reimplement every piece of code ever written for isis. To be of practical value, OpenIsis has to maintain compatibility in the format of the database files anyway. So, one may use winisis or whatever existing import scripts to create and maintain the database, yet deploy OpenIsis' perl interface to run powerful reports and the Java Native Interface to allow queries from a Servlet based web application.

OpenIsis will focus on providing tools rather than applications. For example, there will be no attempt to mirror functionality of winisis unless the GUI toolkit is done. To achive this, OpenIsis provides access from the most important programming languages: Java for the web, perl for the scripts and, some day, Tcl/Tk for platform independent GUIs. All others can, of course, link the lib.

Next steps:

  • make file layout configurable to allow for larger db (DONE)
  • implement searching (full-scan searching DONE)
  • implement index-based searching (DONE)
  • more performance: try std (DONE, performs badly) and homegrown io buffering, further accelerate loop in ldb's convert function
  • start work on thread-save pure-java implementation (volunteers ?)
  • prepare binary releases for windows (.exe and .dll for java)
  • implement query language
  • implement formatting
  • ...

howto open isis

Start by downloading the Software. By now, it's all source, no binaries. We will build binary distributions when things are more stable. Unpack everything in some arbitrary directory. For the tests, you will also need some isis database, which must be located as files db/cds/cds.*. Try this one. Make sure filenames are lowercase.

If you are on Windows, you should either get yourself the cygwin environment with tools like gmake and gcc or volunteer as a porter and start writing the Makefile for your make and compiler. Erik will build a Windows version using Linux gcc as crosscompiler. If you are on Linux, everything is fine. On a MAC ... no idea.

Type "make" and enjoy the compiler messages. Type "make demo" and enjoy your first open isis record. (You installed a db/cds/cds.*, didn't you? It has 42 rows?) Type "make run" and watch the guts of your db passing by. Type "make test", there should be no difference between the testout.txt and the testres.txt as provided (using this cds database from winisis and this 15 MB 70.000+ row unesb.zip db). Type "make time" to measure performance, subsequent tries are usually much faster. My 800 MHz P3 random-reads more than 80.000 records a second, once the files are in the system cache. Typical values: 

time ./openisis -perf 100000 -db db/cds/cds >/dev/null

real    0m1.851s
user    0m0.930s
sys     0m0.920s
time ./openisis -perf 5000 -db db/unesb/unesb -format aligned >/dev/null

real    0m1.623s
user    0m0.140s
sys     0m0.250s
time ./openisis -fmt mfnf -search 'k$' -db db/unesb/unesb -format aligned >/dev/null
860     rows for        k

real    0m0.223s
user    0m0.050s
sys     0m0.070s
Type "make perl" to build the perl stuff; some perl 5.* must be installed beforehand. Type "make java" or, if you just can't get enough, "make jdump", to see it all happen in your shiny new JDK1.3 Java VM. Some 1.2.* JDKs should do, but tell the Makefile to not look in /usr/java/jdk1.3 by setting JAVAHOME.

installing openisis

libopenisis.a can be linked with your code; no installation necessary. You may wan't to install the 'openisis' binary somewhere in your path for the fun of it; go ahead, just copy, no magic registry entries.

To install the perl stuff for general availability in your /usr/lib/perl5 or whatever, cd to the perl subdir (after "make perl") and issue "make install" (as root or otherwise legitimated). After that, try "perldoc OpenIsis" and the demo.pl script.

Java, like perl, needs to dynamically slurp both some stuff in the own language and a native shared object. The former is openisis.jar, set your CLASSPATH to include it, or specify when invoking java like in the Makefile. The latter is libopenjsis.so on linux (yes, it's jsis). The system dynamic linker must be able to find it; see NativeDb.java for details.

about openisis.org

OpenIsis.org is sponsored by allmaxx.de, a service of merconic, Berlin, Germany. As a student's site, allmaxx supports open software with a focus on education and knowledge management. See also the open community for science.

Currently the site is maintained by Erik and Paul. Volunteers are very welcome. Openisis sources are available at SourceForge side by side with Franck Martin's PHP isis project. Thanks, Frank!

links

openisis and PHP isis at sourceforge
isis core sites:
Unesco
Bireme
documentation:
THE BOOK CDS/ISIS reference manual incl. data formats (en espanol)
people and projects:
Robert Janusz' iAPI
Kafkas Caprazli's EVERYTHING about CDS/ISIS
open source software for libraries
javaisis
Institut Teknologi Bandung IsisOnline in Indonesia
user groups:
Netherlands / international
UK (ISIS PLUS)
Germany (isisnetz)
staff:
Erik Grziwotz
Klaus "Paul" Ripke

documentation

ISIS, charsets and unicode
$Revision: 1.16 $ last changed $Date: 2002/03/22 20:20:59 $ by $Author: kripke $
(this page intentionally left blank :) ./ldb.c0100644000113000011300000011767007447676140010630 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: ldb.c,v 1.20 2002/03/25 19:36:44 kripke Exp $ implementation of general db access functions. */ #include #include #include /* #include toupper */ #include #include /* PATH_MAX */ #ifdef WIN32 #define LACKING_PREAD #define LACKING_MMAP #undef UNIXIO #endif /* io */ #ifdef UNIXIO #define __USE_UNIX98 /* #define _POSIX_MAPPED_FILES */ #include /* or try unixio */ #include #ifndef LACKING_MMAP #include #endif #include #include typedef int file; #else #include typedef FILE *file; #endif /* special */ #if defined( __GNUC__ ) && defined ( alloca ) #include #endif #if defined( __WIN32 ) # define ssize_t size_t # define FILE_SEPARATOR '\\' #else # define FILE_SEPARATOR '/' #endif #include "lstr.h" #include "ldb.h" #define toupper( c ) ( (c<'a'||'z'set[s] ] #else /* simply LSET_MST and LSET_INV */ # define DB_RSET( db, s ) lstrlib[ s ] #endif /* get xstr for record rec in set */ #define DB_XSTR( db, set, rec ) \ DB_RSET( db, set ).desc[ DB_VARI & (db)->flags ][ rec ] /* get record names for record rec in set */ #define DB_RNAM( db, set, rec ) \ DB_RSET( db, set ).name[ rec ] /* ************************************************************ private data */ static Db defdbspace[32]; /* array of open dbs. should expand dynamically. */ static Db *dbs = defdbspace; static int dbs_len = sizeof(defdbspace)/sizeof(defdbspace[0]); /* ************************************************************ private functions */ static Db *getDb ( int id ) { if ( 0 <= id && id < dbs_len && dbs[id].flags ) return &dbs[id]; log_msg( LOG_ERROR, "attempt to access bad db id %d", id ); return NULL; } /* getDb */ /* ************************************************************ start of io section */ #ifdef UNIXIO #define LDB_OPENR( file, name ) (0 <= (file = open( name, O_RDONLY ))) #define LDB_CLOSE( file ) close( file ) #define LDB_SEEK( file, where ) (where == lseek( file, where, SEEK_SET )) #define LDB_READ( file,dst,siz ) read( file, dst, siz ) #ifndef LACKING_PREAD #define THREAD_SAFE #define LDB_PREAD( file,dst,siz,where ) pread( file, dst, siz, where ) #endif #else #define LDB_OPENR( file, name ) (NULL != (file = fopen( name, "rb" ))) #define LDB_CLOSE( file ) fclose( file ) #define LDB_SEEK( file, where ) (0 == fseek( file, where, SEEK_SET )) #define LDB_READ( file,dst,siz ) fread( dst, 1, siz, file ) #endif #ifndef LDB_PREAD /* not thread safe variant -- read after seek */ #define LDB_PREAD( file,dst,siz,where ) \ (LDB_SEEK( file, where ) ? LDB_READ( file,dst,siz ) : -1) #endif static int openfiles ( file *fid, const char *path, const char *name, const char * const *ext, int nfiles ) { int plen = NULL==path ? 0 : strlen(path); int nlen = strlen(name); char filename[ PATH_MAX ]; int i,ret; char *e; if ( sizeof(filename) < (unsigned int)(plen+1+nlen+4+1) ) { log_msg( LOG_ERROR, "path(%d) or filename(%d) too long '%.30s...'", plen, nlen, filename ); return -EINVAL; } if ( plen ) { memcpy( filename, path, plen ); filename[plen++] = FILE_SEPARATOR; } memcpy( filename+plen, name, nlen ); e = filename + plen+nlen; e[4] = 0; for ( i=0; i xstr[LSTR_ILEN] ) { log_msg( LOG_ERROR, "bad ilen %ld need %ld", xstr[LSTR_ILEN], (long)LSTRLEN(*xstr) ); return -EINVAL; } if ( *dst != *xstr ) { log_msg( LOG_ERROR, "bad *dst 0x%08lx need 0x%08lx", *dst, *xstr ); return -EINVAL; } /* clean and re-init */ memset( dst, 0, xstr[LSTR_ILEN] ); *dst = *xstr; mbr = dst+1; buf = ((char*)dst) + LSTRLEN(*dst); /* cvt the fixed part (occ==-1) and each occurrence of repeated part. */ for ( ;/* occ < LSTROCC(*dst) */; ) { /* cvt one part */ int i; /* TODO: this loop is crucial for performance */ for ( i=0; i sbytes ) { log_msg( LOG_ERROR, "srcbuf too short %ld have %ld need %ld occ %d mbr %d", xstr[LSTR_XLEN], sbytes, len, occ, i ); return -EINVAL; } if ( !NEEDSWAP( xmbr ) ) /* for ( j = len; j--; ) num.buf[j] = s[j]; */ switch ( ld ) { case 3: num.x8 = *(b8*)s; break; case 2: num.x4 = *(b4*)s; break; case 1: num.x2 = *(b2*)s; break; case 0: num.buf[0] = *s; break; } else /* swap bytes */ for ( j = len; j--; ) num.buf[j] = s[len - 1 - j]; switch ( len ) { case 8: *mbr = num.ll; break; /* TODO: defines for 16 and 64 bit compilers */ case 4: *mbr = num.i; break; case 2: *mbr = num.s; break; case 1: *mbr = num.buf[0]; break; } if ( LMBRISBITS( xmbr ) ) { /* apply bit shift and mask */ *mbr >>= LMBRBITOFF( xmbr ); *mbr &= ~(-1L << LMBRBITLEN( xmbr )); } continue; } /* else raw data -- that's easy :) */ { long offset = buf - (char*)dst; long need; len = LONG2LEN(xmbr); need = offset + len; if ( need > xstr[LSTR_ILEN] ) { log_msg( LOG_ERROR, "bad buflen %ld need %ld+%d in occ %d mbr %d", xstr[LSTR_ILEN], offset, len, occ, i ); return -EINVAL; } if ( len > sbytes ) { log_msg( LOG_ERROR, "srcbuf too short %ld have %ld need %ld occ %d mbr %d", xstr[LSTR_XLEN], sbytes, len, occ, i ); return -EINVAL; } memcpy( buf, s, len ); *mbr = buf - (char*)dst; buf += len; } } /* for mbrs */ if ( ++occ >= LSTROCC(*dst) ) break; if ( occ ) part += (short)xstr[LSTR_XRLO]; /* adv. rep. part len */ else { /* was the fixed part, setup for repeated */ nmbrs = LSTRREP(*xstr); part += (short)(xstr[LSTR_XRLO]>>16); /* adv. rep. part off */ xmbrs += i; } } return 0; } /* convert */ static int readrec ( long *dst, file fid, long where, long *xstr ) { char *buf = (char *) #ifdef alloca alloca( xstr[LSTR_XLEN] ) #else lmalloc( xstr[LSTR_XLEN] ) #endif ; int got = 0; int ret = 0; if ( NULL == buf ) return -ENOMEM; if ( 0 > where ) where = -where * xstr[LSTR_XLEN]; got = readblk( buf, xstr[LSTR_XLEN], fid, where ); ret = got ? got : convert( dst, buf, xstr ); #ifndef alloca free( buf ); #endif return ret; } /* readrec */ /* read and log */ static int readlog ( long *dst, file fid, long where, Db *db, int set, int rec ) { int ret = readrec( dst, fid, where, DB_XSTR( db, set, rec ) ); if ( !ret && LOG_DO( LOG_TRACE ) ) LOG_REC( dst, lstrlib[ db->set[set] ].name[ rec ] ); return ret; } /* readlog */ /* ************************************************************ access functions for the record types */ static long getOff ( Db *db, long rowid ) { long rowix = rowid - 1; /* mfns count from 1 */ long xrf_block = rowix / 127; long blkix = xrf_block + 1; /* ... so do xrf blocks */ long xr, off; /* TODO: check mmap len */ if ( NULL != db->mmap ) { xr = db->mmap[xrf_block][1+(int)(rowix % 127)]; } else { if ( blkix != db->xrf[LXRF_XPOS] ) { /* THREAD THREAT; in MT environment always read the block */ int ret; LOG_DBG( LOG_VERBOSE, "fetching xrf block %ld had %ld", blkix, NULL == db->xrf ? -1 : db->xrf[LXRF_XPOS] ); ret = readlog( db->xrf, db->mst[MST_XRF], -xrf_block, db, LSET_MST, LSTR_XRF ); if ( ret ) { log_msg( LOG_ERROR, "\twhen fetching xrf block %ld", blkix ); return 0; } if ( blkix == -db->xrf[LXRF_XPOS] ) { LOG_DBG( LOG_DEBUG, "hmmm ... negative" ); db->xrf[LXRF_XPOS] = blkix; } else if ( blkix != db->xrf[LXRF_XPOS] ) { log_msg( LOG_WARN, "bad xrf %ld wanted %ld", db->xrf[LXRF_XPOS], blkix ); return -1; } } xr = db->xrf[ LXRF_XREC + (int)(rowix % 127) ]; } /* 21 bits (<<11) signed for the (512 byte) block ("xrmfb") 1 for the first block (offset 0) 0 means, never had such a record -1 and xrmfp=0: record removed from MST (there is no reoord at pos 0 in 1st block, since there resides the MST header) other negative value -x or pos!=0: record logically deleted, was at +x 1 bit (1<<10): this record is new and not yet inverted 1 bit (1<<9): this record is changed and not yet re-inverted 9 bits for the block-relative position ("xrmfp") */ off = (((xr & 0xfffff800) >> 2) - 0x200) | (0x1ff & xr); if ( 0 < (xr & ~0x600) ) { LOG_DBG( LOG_DEBUG, "offset for rowid %ld is %ld (blk %ld pos %ld) flg 0x%08x at %ld[%d]", rowid, off, (xr>>11)&0xfffff, xr&0x1ff, xr&0x80000600, blkix, rowix%127 ); return off; } /* deleted */ log_msg( LOG_INFO, "offset for rowid %ld is %ld (blk %ld pos %ld) flg 0x%08x at %ld[%d]", rowid, off, (xr>>11)&0xfffff, xr&0x1ff, xr&0x80000600, blkix, rowix%127 ); return 0; } /* getOff */ static long* getMfr ( Db *db, long off, long *nxtoff ) { struct mfcxstr { long xstr[LSTR_LONGS(7+3)]; } my = *(struct mfcxstr *)DB_XSTR( db, LSET_MST, LSTR_MFR ); long head[1+7+3]; long len = 0, base; long *rec = NULL; char *buf = NULL; #ifdef alloca int notalloca = 0; #endif LOG_DBG( LOG_VERBOSE, "getting MFR at off %ld", off ); if ( 498 < off % 512 ) log_msg( LOG_WARN, "blk pos > 498 in offset 0x%08x", off ); *head = *my.xstr; if ( readrec( head, db->mst[MST_MST], off, my.xstr ) ) { log_msg( LOG_ERROR, "\twhen reading MFR head at %ld", off ); return NULL; } len = head[LMFR_RECL]; LOG_DBG( LOG_VERBOSE, "got MFR reclen %ld", len ); if ( NULL != nxtoff ) { *nxtoff = off + (0 < len ? len : -len); /* an odditiy */ if ( 1 & *nxtoff ) /* an odditiy */ (void) *nxtoff++; /* round up to even */ if ( 498 < *nxtoff % 512 ) { *nxtoff += 512; *nxtoff &= ~0x1ff; } if ( *nxtoff > db->mfc[LMFC_NMFB]*512 + db->mfc[LMFC_NMFP] ) { LOG_DBG( LOG_VERBOSE, "at end of db: %ld > %ld*512+%hd", *nxtoff, db->mfc[LMFC_NMFB], db->mfc[LMFC_NMFP] ); *nxtoff = -1; } } if ( len < 0 ) { log_msg( LOG_INFO, "found deleted rec len %hd at offset %ld", len, off ); return NULL; } /* check external base length */ base = LONG2OFF(my.xstr[LSTR_XRLO]) + head[LMFR_NVF]*LONG2LEN(my.xstr[LSTR_XRLO]); if ( 0 > head[LMFR_BASE] || 0 > head[LMFR_NVF] || 0x8fff < head[LMFR_NVF] || len < head[LMFR_BASE] || len < base || (head[LMFR_NVF] && head[LMFR_BASE] < base) ) { log_msg( LOG_ERROR, "bad len %ld base %ld nvf %ld need base %ld at offset %ld", len, head[LMFR_BASE], head[LMFR_NVF], base, off ); /* check alignment problem */ base = LONG2OFF(my.xstr[LSTR_XRLO]) + head[LMFR_STAT]*LONG2LEN(my.xstr[LSTR_XRLO]); if ( 0 > head[LMFR_NVF] || 0 > head[LMFR_STAT] || 0x8fff < head[LMFR_STAT] || len < head[LMFR_NVF] || len < base || (head[LMFR_STAT] && head[LMFR_NVF] < base) ) ; else log_msg( LOG_ERROR, "probably alignment problem, try -format aligned" ); goto cleanup; } /* set up external structure for this rec */ my.xstr[LSTR_SIZE] |= head[LMFR_NVF] << 16; /* occ of rep. part */ my.xstr[LSTR_XLEN] = len; /* internal base length */ base = LSTRLEN( *my.xstr ); /* internal len adjusted for the slightly longer base */ my.xstr[LSTR_ILEN] = len + base - head[LMFR_BASE]; /* the buffer */ rec = nrec( my.xstr ); if ( NULL == rec ) { log_msg( LOG_SYSERR, "could not alloc MFR of len %hd", my.xstr[LSTR_ILEN] ); goto cleanup; } buf = (char *) #ifdef alloca alloca( len ); /* first try faster alloca, but stack may be too limited for large records */ notalloca = NULL == buf; if ( notalloca ) buf = #endif lmalloc( len ); if ( NULL == buf ) { log_msg( LOG_SYSERR, "could not alloc MFR of len %hd", len ); goto cleanup; } if ( readblk( buf, len, db->mst[MST_MST], off ) ) { log_msg( LOG_ERROR, "\twhen reading MFR" ); goto cleanup; } if ( convert( rec, buf, my.xstr ) ) { log_msg( LOG_ERROR, "\twhen converting MFR" ); goto cleanup; } if ( rec[LMFR_STAT] ) { log_msg( LOG_WARN, "found status %hd", rec[LMFR_STAT] ); goto cleanok; } /* do a consistency check */ if ( rec[LMFR_NVF] < 0 || rec[LMFR_BASE] < 0 ) { log_msg( LOG_ERROR, "found neg. field nvf %hd base %hd", rec[LMFR_NVF], rec[LMFR_BASE] ); goto cleanup; } /* now care for the field values */ { char *valsrc = buf+rec[LMFR_BASE]; char *recsta = ((char*)rec); char *valdst = recsta + base; long xbufl = rec[LMFR_RECL] - rec[LMFR_BASE]; long sumlens = 0; int i; for ( i=0; i < rec[LMFR_NVF]; i++ ) { long *d = &rec[LMFR__FL + i*LMFR__RL]; if ( d[LMFR_POS] < 0 || d[LMFR_LEN] < 0 ) { log_msg( LOG_ERROR, "bad field %d at off %ld: negativ pos %hd or len %hd", i, off, d[LMFR_POS], d[LMFR_LEN] ); goto cleanup; } if ( d[LMFR_POS] + d[LMFR_LEN] > xbufl ) { log_msg( LOG_ERROR, "bad field %d at off %ld: pos %hd + len %hd > buf %ld", i, off, d[LMFR_POS], d[LMFR_LEN], xbufl ); goto cleanup; } sumlens += d[LMFR_LEN]; if ( sumlens > xbufl ) { log_msg( LOG_ERROR, "bad fields at off %ld: sum of lengths %ld > buf %ld", off, sumlens, xbufl ); goto cleanup; } memcpy( valdst, valsrc+d[LMFR_POS], d[LMFR_LEN] ); d[LMFR_POS] = valdst - recsta; valdst += d[LMFR_LEN]; } } /* consistency check */ rec[LMFR_BWB] = /* "used" bytes */ rec[LMFR_RECL] = my.xstr[LSTR_ILEN]; rec[LMFR_BWP] = rec[LMFR_NVF]; /* avail fields = used fields */ rec[LMFR_BASE] = base; if ( LOG_TRACE <= log_lev ) LOG_REC( rec, lstrlib[LSET_MST].name[LSTR_MFR] ); goto done; cleanup: if ( NULL != nxtoff ) *nxtoff = -1; cleanok: if ( NULL != rec ) { free( rec ); rec = NULL; } done: if ( NULL != buf #ifdef alloca && notalloca #endif ) free( buf ); return rec; } /* getMfr */ /* ************************************************************ utilities */ static int argchk ( const char *param, const char *n, const char *v ) { return strcmp( param, n ) ? 0 : NULL != v ? 1 : (log_msg( LOG_ERROR, "no value for param '%s'", param ), 0); } /* argchk */ /* ************************************************************ package data */ /* ************************************************************ package functions */ long *ldb_readRecAtOff ( int dbid, lxref off, long *nxtoff ) { long *rec; Db *db = getDb( dbid ); if ( NULL == db ) { log_msg( LOG_ERROR, "\tat ldb_readRecAtOff" ); return NULL; } if ( 0 == off ) off = 64; rec = getMfr( db, off, nxtoff ); if ( NULL == rec ) return NULL; LOG_DBG( LOG_VERBOSE, "db %d off %ld: got %hd bytes", dbid, off, NULL==rec ? -1 : rec[LMFR_RECL] ); return rec; } /* ldb_readRecAtOff */ long *ldb_readRec ( int dbid, long rowid ) { long off; long *rec; Db *db = getDb( dbid ); if ( NULL == db ) { log_msg( LOG_ERROR, "\tat ldb_readRec %ld", rowid ); return NULL; } off = getOff( db, rowid ); log_msg( LOG_INFO, "found xref 0x%08lx for %ld", off, rowid ); if ( 0 >= off ) { log_msg( LOG_INFO, "found deleted xref 0x%08lx for %ld", off, rowid ); return NULL; } rec = getMfr( db, off, NULL ); if ( NULL == rec ) { log_msg( LOG_WARN, "\tno record at %ld rowid %ld", off, rowid ); return NULL; } LOG_DBG( LOG_VERBOSE, "db %d row %ld: got %hd bytes", dbid, rowid, NULL==rec ? -1 : rec[LMFR_RECL] ); if ( rec[LMFR_MFN] != rowid ) { log_msg( LOG_ERROR, "got mfn %ld expected %ld", rec[LMFR_MFN], rowid ); free( rec ); return NULL; } return rec; } /* ldb_readRec */ int ldb_search ( int dbid, const char *key, LdbPost *post, OpenIsisRec *rec ) { int i, j, prefix, idx, ret, ock; long pos; long *leaf, *entry; char *term; long *xstr; struct { /* terms cursor */ char key[LDB_MAX_KEYLEN+1]; /* key or key prefix */ short klen; /* key length to compare */ char imin; /* minimum index to search */ char imax; /* maximum index to search */ long leaf[LDB_INDEXES][LDB_TERMBUF]; /* one leaf buffer per index */ short lpos[LDB_INDEXES]; /* next position in leaf, -1 if done */ } crs; short klen; /* length for initial locate */ long block[128]; /* buffer to read one block */ long blockpos = 0; LdbP *p = NULL; Db *db = getDb( dbid ); if ( NULL == db ) return -ENOENT; if ( NULL == key ) key = "$"; /* prepare cursor struct */ memset( &crs, 0, sizeof(crs) ); /* tabula rasa */ crs.klen = strlen( key ); /* check for prefix match */ if ( NULL != post ) prefix = LDB_PFX & post->mode; else if ( (prefix = crs.klen && '$' == key[crs.klen - 1]) ) crs.klen--; /* check out minimum index to search */ for ( crs.imin=0; crs.klen > db->tlen[(int)crs.imin]; ) if ( LDB_INDEXES == ++(crs.imin) ) { log_msg( LOG_ERROR, "bad keylen %d key '%.64s'", crs.klen, key ); return -EINVAL; } /* prepare key */ memset( crs.key, ' ', sizeof(crs.key)-1 ); { unsigned char *uc = (unsigned char*)crs.key; unsigned char *uk = (unsigned char*)key; for ( i=crs.klen; i--; ) uc[i] = db->ctab[LDB_UCTAB][ uk[i] ]; } if ( prefix ) crs.imax = LDB_INDEXES-1; else { crs.imax = crs.imin; crs.klen = db->tlen[(int)crs.imin]; } log_msg( LOG_INFO, "search for '%.*s'%c", crs.klen, crs.key, prefix?'$':' ' ); key = crs.key; klen = crs.klen; if ( NULL != rec && rec->len ) { /* use last key from record to locate starting position */ key = rec->field[rec->len-1].val; klen = rec->field[rec->len-1].len; rec->len = 0; } for ( i=crs.imin; i<=crs.imax; i++ ) { /* find leaf positions */ int nFile = INV_N01 + 2*i; /* node file index */ int nStr = LSTR_N01 + 2*i; /* node struct index */ long *nstr = DB_XSTR( db, LSET_INV, nStr ); int lvl; short cmplen = klen <= db->tlen[i] ? klen : db->tlen[i]; pos = db->cnt[i][LCNT_POSR]; /* pos of root record */ j = 0; for ( lvl = 0; 0= nstr[LSTR_ILEN] ); *node = *nstr; ret = readlog( node, db->inv[nFile], 1-pos, db, LSET_INV, nStr ); if ( pos != node[LN0X_POS] /* wrong address */ || i+1 != node[LN0X_TYPE] /* wrong type */ || node[LN0X_OCK] < 1 /* no keys */ || 2*db->cnt[i][LCNT_ORDN] < node[LN0X_OCK] /* too many keys */ ) { log_msg( LOG_ERROR, "bad node pos %ld type %ld keys %ld", node[LN0X_POS], node[LN0X_TYPE], node[LN0X_OCK] ); return -ESPIPE; } ock = node[LN0X_OCK]; for ( j=1; jlen ) post->len = sizeof(post->p)/sizeof(post->p[0]); /* standard length */ if ( LDB_NOT & post->mode ) post->mode |= LDB_AND; p = post->p; } xstr = DB_XSTR( db, LSET_INV, LSTR_IFP ); for (;;) { /* loop terms in prefix mode */ /* vars for postings: */ long infb, infp; /* block and pos where to read postings */ int added; /* postings added or marked per term */ int blkno; /* postings block number */ int remain = 0; /* postings to fetch from next block of segment */ long ifp[LIFP__FL]; /* postings header */ idx = -1; /* index to use */ /* compare index terms, load leafes if needed */ for ( i = crs.imin; i <= crs.imax; i++ ) { short cmplen = klen <= db->tlen[i] ? klen : db->tlen[i]; leaf = crs.leaf[i]; if ( leaf[LL0X_OCK] <= crs.lpos[i] ) { /* load */ int lFile = INV_L01 + 2*i; /* leaf file index */ int lStr = LSTR_L01 + 2*i; /* leaf struct index */ long *lstr = DB_XSTR( db, LSET_INV, lStr ); crs.lpos[i] = -1; reread: if ( ! (pos = leaf[LL0X_PS]) ) continue; LOG_DBG( LOG_DEBUG, "leaf %ld", pos ); assert( (long)sizeof(crs.leaf[i]) >= lstr[LSTR_ILEN] ); *leaf = *lstr; ret = readlog( leaf, db->inv[lFile], 1-pos, db, LSET_INV, lStr ); if ( pos != leaf[LL0X_POS] /* wrong address */ || i+1 != leaf[LL0X_TYPE] /* wrong type */ || leaf[LL0X_OCK] < 1 /* no keys */ || 2*db->cnt[i][LCNT_ORDN] < leaf[LL0X_OCK] /* too many keys */ ) { log_msg( LOG_ERROR, "bad leaf pos %ld type %ld keys %ld", leaf[LL0X_POS], leaf[LL0X_TYPE], leaf[LL0X_OCK] ); return -ESPIPE; } ock = leaf[LL0X_OCK]; /* advance to first term which is not too small (should be needed only for first leaf of an index) */ for ( j=0; j crs.lpos[i] ) continue; if ( 0 > idx ) { idx = i; continue; } /* compare this index next term to that of index idx */ /* assume that index w/ lower number has shorter keys */ ret = memcmp( ((char*)leaf)+leaf[LL0X__FL + crs.lpos[i]*LL0X__RL + LL0X_KEY], ((char*)crs.leaf[idx])+ crs.leaf[idx][LL0X__FL + crs.lpos[idx]*LL0X__RL + LL0X_KEY], db->tlen[idx] ); if ( 0 > ret ) idx = i; } if ( 0 > idx ) goto done; j = crs.lpos[idx]; leaf = crs.leaf[idx]; entry = leaf + LL0X__FL + j*LL0X__RL; term = ((char*)leaf) + entry[LL0X_KEY]; if ( memcmp( crs.key, term, crs.klen ) ) goto done; crs.lpos[idx]++; if ( NULL != rec ) { /* record the term */ /* field to assign */ OpenIsisField *f = rec->field + rec->len; short tlen = db->tlen[idx]; /* end of available buffer */ char *b = rec->len ? (char*)f[-1].val /* before previously assigned field */ : ((char*)rec + rec->bytes); /* end of record */ while ( tlen && ' ' == term[tlen-1] ) tlen--; b -= tlen; if ( b < (char*)(f+1) ) goto done; /* probably we're nuking the locator now: */ memcpy( b, term, tlen ); f->tag = 0; f->val = b; f->len = tlen; rec->len++; /* reset key from locator to prefix */ key = crs.key; klen = crs.klen; } if ( NULL == post ) continue; /* collect postings */ infb = entry[LL0X_INFB]; infp = entry[LL0X_INFP]; /* the IFP file is organized in blocks of 128 longs. 1st long is block number followed by 127 data. postings are organized in chained segments so that each segment fits within one such block. a segment has five longs header, giving number of postings and pointer to next segment. */ added = 0; for ( blkno=0; infb; blkno++ ) { /* segments */ LdbP merge[127/2]; /* buffer to collect new postings */ long *base; /* start of data */ long *b; /* start of postings */ long n; /* max postings in this seg's 1st block */ long xlen; /* external length to read */ int f = post->fil - 1; /* highest pos to consider in given postings */ int m = 0; /* fill merge buffer */ int k; /* loop segment */ if ( infp > 127-2-5 ) { log_msg( LOG_ERROR, "found bad IFP pos %ld blk %d for %.*s", infp, blkno, klen, key ); return -ESPIPE; } if ( remain ) { /* consecutive block of same segment */ n = remain; if ( n > 127/2 ) n = 127/2; xlen = 8*n; } else { n = (127 - 5 - infp)/2; xlen = 20 + 8*n; } pos = (infb - 1) * 512 + (infp + 1) * 4; if ( blockpos && !((pos-blockpos) >> 9) /* 0 <= (pos-blockpos) < 512 */ && pos+xlen <= blockpos+ 1 + (0x1ff & ~blockpos) ) base = block + (pos - blockpos)/sizeof(long); else { long blklen = 1 + (0x1ff & ~pos); assert( xlen <= blklen ); assert( blklen <= (long)sizeof(block) ); assert( 0 == (0x1ff & (pos + blklen)) ); ret = readblk( block, blklen, db->inv[INV_IFP], pos ); if ( ret ) { log_msg( LOG_ERROR, "\twhen reading IFP" ); return -ESPIPE; } blockpos = pos; base = block; } if ( remain ) { /* no header to convert */ remain -= n; b = base; /* no header */ } else { assert( (long)sizeof(ifp) >= xstr[LSTR_ILEN] ); *ifp = *xstr; ret = convert( ifp, (char *)base, xstr ); if ( ret ) { log_msg( LOG_ERROR, "\twhen converting IFP header" ); return -EFAULT; } if ( n > ifp[LIFP_SEGP] ) n = ifp[LIFP_SEGP]; remain = ifp[LIFP_SEGP] - n; b = base+5; /* after header */ } LOG_DBG( LOG_VERBOSE, "key %ld.%d '%.*s' blk %d post %d/%d r %d xlen %ld at b/p %ld.%ld=%ld", leaf[LL0X_PS], j, db->tlen[idx], term, blkno, n, ifp[LIFP_TOTP], remain, xlen, infb, infp, pos ); if ( LOG_DO( LOG_TRACE ) ) LOG_REC( ifp, lstrlib[ db->set[LSET_INV] ].name[ LSTR_IFP ] ); assert( (size_t)n <= sizeof(merge)/sizeof(merge[0]) ); for ( k=n; k--; ) { long prow, ptag, ppos; unsigned char *c = (unsigned char *)&b[k*2]; LdbP e; /* the entry */ LdbP samerow; /* highest possible entry w/ same row as e */ #if #cpu (sparc) /* the 8 bytes of a posting are BIG ENDIAN ! */ memcpy(e.bytes,c,8); #else e.bytes[0] = c[7]; e.bytes[1] = c[6]; e.bytes[2] = c[5]; e.bytes[3] = c[4]; e.bytes[4] = c[3]; e.bytes[5] = c[2]; e.bytes[6] = c[1]; e.bytes[7] = c[0]; #endif prow = LDBP_ROW( &e ); ptag = LDBP_TAG( &e ); ppos = LDBP_POS( &e ); LDBP_SETROWTOP( &samerow, &e ); /* for mfn comparison */ LOG_DBG( LOG_VERBOSE, "post %ld.%hd pos %06lx key '%.*s'", prow, ptag, ppos, db->tlen[idx], term ); if ( prow < post->skp ) /* quickly bail out on skip condition */ break; if ( 0 >= ptag /* bad tag */ || !prow || prow >= db->mfc[LMFC_NMFN] /* bad mfn */ || (post->cut && prow >= post->cut) || (post->tag && post->tag != ptag) ) continue; #ifdef TRY_BINSEARCH_SPEEDUP if ( post->fil < 8*n ) { #endif /* simple sweep ... */ while ( f >= 0 && LDBP_GT( p+f, &samerow ) ) f--; #ifdef TRY_BINSEARCH_SPEEDUP } else { assert( NULL == "binsearch not implemented yet" ); } #endif if ( LDB_AND & post->mode ) { int l; /* loop postings for same row, mark all (that are near enough) */ LDBP_SETROWBOT( &samerow, &e ); /* for mfn comparison */ /* NOTE: postings for row are GT than bottom even if marked */ for ( l = f; l>=0 && LDBP_GT( p+l, &samerow ); l-- ) { if ( post->near ) { long dist; if ( ptag != LDBP_TAG( p+l ) ) continue; if ( LDB_NEAR_G != post->near ) { dist = LDBP_POS( p+l ) - LDBP_POS( &e ); if ( dist < 0 ) dist = -dist; if ( 0 < post->near ? post->near < dist : -post->near != dist /* exact $$$$ */ ) continue; } } LDBP_SETMARK( p+l ); added++; } } else { /* OR mode */ int add; if ( ! post->near ) /* add if row not found: ignore details */ add = 0 > f || prow > LDBP_ROW( p+f ); else { /* add if no exact match */ int l; /* NOTE: we don't use mark bit in OR mode, do we ? */ for ( l = f; l>=0 && LDBP_GT( p+l, &e ); l-- ) ; add = 0 > l || LDBP_GT( &e, p+l ); } if ( add ) merge[ m++ ] = e; } } /* for postings in segment */ if ( m ) { /* merge in the merge buffer */ LdbP *mm = merge; added += m; for ( k = post->fil += m; m && k--; ) { LdbP src; if ( k < m || LDBP_GT( mm, &p[k-m] ) ) { src = *mm++; m--; LOG_DBG( LOG_DEBUG, "merging %ld at %d", LDBP_ROW(&src), k ); } else src = p[k-m]; if ( k < post->len ) p[k] = src; else { /* set cut */ long row = LDBP_ROW( &src ); if ( row < post->cut || !post->cut ) post->cut = row; } } if ( post->fil > post->len ) post->fil = post->len; if ( post->cut ) /* postings for cut row are unreliable */ while ( post->fil && post->cut <= LDBP_ROW(p+post->fil-1) ) post->fil--; } if ( remain ) { /* advance to start of next block */ infb++; infp = 0; } else { infb = ifp[LIFP_NXTB]; infp = ifp[LIFP_NXTP]; } } /* for segments */ LOG_DBG( LOG_VERBOSE, "added %d postings for key '%.*s'", added, db->tlen[idx], term ); } /* for terms in prefix/postings mode */ done: if ( NULL != post /* fixup */ && LDB_AND & post->mode && !(LDB_KEEPMARKS & post->mode) ) { int mark = LDB_NOT & post->mode ? 0 : 0x8000; j=0; for ( i=0; ifil; i++ ) if ( mark == LDBP_MARK(p+i) ) { LDBP_CLRMARK(p+i); p[j++] = p[i]; } post->fil = j; } return NULL == rec ? 0 : rec->len; } /* ldb_search */ long ldb_p2s ( OpenIsisSet *set, LdbPost *post ) { long *s = set->id; long last=0, max = set->len; int i; set->len = 0; if ( ! max ) max = OPENISIS_SETLEN; max--; if ( !post->fil ) return 0L; s[0] = LDBP_ROW(post->p); for ( i=1; ifil && last < max; i++ ) { long row = LDBP_ROW(post->p+i); if ( s[last] != row ) s[++last] = row; } return set->len = last+1; } /* ldb_p2s */ LdbCTab *ldb_tabs( int dbid ) { Db *db = getDb( dbid ); return NULL == db ? NULL : db->ctab; } /* ldb_tabs */ /* ************************************************************ public functions */ int openIsisOpen ( const char *dbname, const char **argv, int argc ) { static int init; Db ndb, *db; int dbid, ret = 0, internaldump = 0, reopen = 0, invret = 0; int autoformat = 1; /* guess alignment */ const char *actab = NULL, *uctab = NULL; memset( &ndb, 0, sizeof(ndb) ); /* these should be NULL by memsetting to 0 anyway ... */ ndb.name = NULL; ndb.path = NULL; ndb.format = NULL; ndb.mmap = NULL; ndb.flags |= DB_MMAP; /* set unconditionally ? */ /* check options ... */ if ( NULL != dbname ) ndb.name = dbname; while ( argc ) { const char *n = argv[0], *v = NULL; assert( n ); if ( '-' == n[0] ) n++; if ( 1 == argc || '-' == argv[1][0] ) { /* no value */ argc--; argv++; } else { v = argv[1]; assert( v ); argc -= 2; argv += 2; } if ( !strcmp("v",n) ) openIsisLog( NULL == v ? LOG_ALL : *v, NULL ); else if ( argchk("db",n,v) ) ndb.name = v; else if ( argchk("dbpath",n,v) ) ndb.path = v; else if ( argchk("format",n,v) ) ndb.format = v; else if ( argchk("actab",n,v) ) actab = v; else if ( argchk("uctab",n,v) ) uctab = v; else if ( !strcmp("internaldump",n) ) internaldump = !0; else if ( !strcmp("reopen",n) ) reopen = !0; } /* while argc */ if ( NULL == ndb.name ) return -EINVAL; /* more init AFTER honoring verbosity */ if ( ! init ) { lstr_auto(NULL); init = !0; } for ( dbid=0; dbidname ) db->name = strdup( db->name ); if ( NULL != db->path ) db->path = strdup( db->path ); if ( NULL != db->format ) db->format = strdup( db->format ); if ( NULL == db->format ) ; else if ( !strncmp( "naligned", db->format, 3 ) ) autoformat = 0; else if ( !strncmp( "aligned", db->format, 3 ) ) { autoformat = 0; db->flags |= LVAR_ALI; } else { log_msg( LOG_ERROR, "unknown format '%s'", db->format ); } db->set[ LSET_MST ] = LSET_MST; db->set[ LSET_INV ] = LSET_INV; /* preset record sizes */ db->mfc[0] = *DB_XSTR( db, LSET_MST, LSTR_MFC ); db->xrf[0] = *DB_XSTR( db, LSET_MST, LSTR_XRF ); db->cnt[0][0] = db->cnt[1][0] = *DB_XSTR( db, LSET_INV, LSTR_CNT ); /* isis-1 index term lengths */ db->tlen[0] = 10; db->tlen[1] = 30; /* open files */ if ( (ret = openfiles( db->mst, db->path, db->name, EXT_MST, MST_FILES )) ) goto cleanup; invret = openfiles( db->inv, db->path, db->name, EXT_INV, INV_FILES ); if ( autoformat ) { if ( invret ) log_msg( LOG_WARN, "cannot guess format -- no inverted file" ); else { unsigned long len = flen( db->inv[INV_CNT] ); if ( 56L == len ) db->flags |= LVAR_ALI; else if ( 52L != len ) log_msg( LOG_WARN, "cannot guess format -- bad .cnt len %ld", len ); log_msg( LOG_INFO, "using autoformat %saligned for .cnt len %ld", (db->flags & LVAR_ALI) ? "":"un", len ); } } if ( (ret = readlog( db->mfc, db->mst[MST_MST], 0, db, LSET_MST, LSTR_MFC )) ) goto cleanup; #ifndef LACKING_MMAP if ( DB_MMAP & db->flags ) { db->mmlen = flen( db->mst[MST_XRF] ); if ( db->mmlen && MAP_FAILED == (db->mmap = mmap( NULL, db->mmlen, PROT_READ, MAP_SHARED, db->mst[MST_XRF], 0 )) ) db->mmap = NULL; } #endif /* ctables */ /* TODO: care for actab/uctab params */ { /* standard alphanum table */ memset( db->ctab[LDB_ACTAB]+'0', 1, 10 ); memset( db->ctab[LDB_ACTAB]+'A', 1, 26 ); memset( db->ctab[LDB_ACTAB]+'a', 1, 26 ); memset( db->ctab[LDB_ACTAB]+128, 1, 128 ); } { /* standard upcase/normalization table */ int i; /* C0 controls go blank */ for ( i=0; i<=31; i++ ) db->ctab[LDB_UCTAB][i] = (unsigned char)' '; /* default: leave alone */ for ( i=32; i<=255; i++ ) db->ctab[LDB_UCTAB][i] = (unsigned char)i; /* upcase little ASCIIs */ for ( i='a'; i<='z'; i++ ) db->ctab[LDB_UCTAB][i] = (unsigned char)(i-32); } /* done */ db->flags |= DB_OPEN; if ( internaldump ) { long off = 0; long *r; do { if ( NULL != (r = ldb_readRecAtOff(dbid,off,&off)) ) free( r ); } while ( 0 < off ); } if ( invret ) goto noinv; if ( (ret = readlog( db->cnt[0], db->inv[INV_CNT], 0, db, LSET_INV, LSTR_CNT )) || (ret = readlog( db->cnt[1], db->inv[INV_CNT], -1, db, LSET_INV, LSTR_CNT )) ) goto noinv; /* done */ db->flags |= DB_INVOPEN; noinv: return dbid; cleanup: /* cleanup ... */ return 0 > ret ? ret : ret ? -ret : -1; } /* openIsisOpen */ int openIsisClose ( int dbid ) { Db *db = getDb( dbid ); if ( NULL == db ) return -EBADF; db->flags = 0L; /* TODO: close files :) */ #ifndef LACKING_MMAP if ( NULL != db->mmap ) munmap( db->mmap, db->mmlen ); #endif return 0; } /* openIsisClose */ long openIsisMaxRowid ( int dbid ) { Db *db = getDb( dbid ); if ( NULL == db ) return -EBADF; return db->mfc[LMFC_NMFN] - 1; } /* openIsisMaxRowid */ OpenIsisRec* openIsisTerm ( OpenIsisRec *rec, int dbid, const char *key ) { return 0 > ldb_search( dbid, key, NULL, rec ) ? NULL : rec; } /* openIsisTerm */ ./ldb.h0100644000113000011300000001357007447676140010627 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ #ifndef LDB_H /* $Id: ldb.h,v 1.12 2002/03/25 19:36:44 kripke Exp $ package interface of the general db access functions. */ #include "luti.h" /* #define LDB_MAGIC 0x0FE91515 read OPENISIS */ enum { /* MFR members */ LMFR_MFN = 1, /* the rowid */ LMFR_RECL, /* total external length (even), negative for locked record */ LMFR_BWB, /* block of rec's previous version */ LMFR_BWP, /* pos of " */ LMFR_BASE, /* offset of contents area */ LMFR_NVF, /* number of fields */ LMFR_STAT, /* state, if != 0, about to be deleted */ LMFR__FL, /* offset of repeated part */ LMFR_TAG = 0, LMFR_POS, LMFR_LEN, LMFR__RL /* length of repeated part */ }; /** read a raw isis record by rowid. the memory must be freed after usage. */ extern long *ldb_readRec ( int db, long rowid ); /** numerical type for a records file position. To support large DBs, this may be long long. */ typedef long lxref; /** read a raw isis record by xref. the memory must be freed after usage. */ extern long *ldb_readRecAtOff ( int dbid, lxref off, long *nxtoff ); /* ** ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ** detailed search structures and functions ** ** ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ enum { LDB_MAX_KEYLEN = 31, /* actually, it's 30 for isis-1 */ LDB_TERMBUF = 128, /* longs */ LDB_INDEXES = 2 }; /** the isis-1 posting is an 64bit number. In the file it's in big endian order, to allow ordering using memcmp. In the LdbP we have native order to use native long long. Until we need more bits for postings, we may use the long long type provided by gcc and some other compilers. the 8 bytes are: highest 3 for the rowid, then 2 tag, then 3 pos. the 3 pos bytes in turn are 1 byte for the occurence and 2 bytes for the word count. (e.g. value 2<<16 | 7 if term was found in the 7th word of the 2nd occurence of field 'tag'). we usually don't care, since for a near condition we always want a small distance w/in the same occurence which may be conveniently checked by the difference of 3 byte pos values. BUT NOTE: ... unfortunately we DO NEED one more bit for marking postings during AND operations. we abuse the highest bit of the word counter, since it's for sure useless for any reasonable distance check. *** BE CAREFULL WHEN COMPARING POSTINGS DURING "AND" OP *** use the LDBP_xxM macros below. */ typedef union { char bytes[8]; long long val; } LdbP; /* all macros operate on pointers */ /* access parts */ #define LDBP_ROW( p ) (0xffffffL & (long)((p)->val >> 40)) #define LDBP_TAG( p ) ( 0xffffL & (long)((p)->val >> 24)) #define LDBP_POS( p ) (0xff7fffL & (long)((p)->val)) #define LDBP_MARK( p ) ( 0x8000 & (long)((p)->val)) #define LDBP_SETMARK( p ) ((p)->val |= 0x8000LL) #define LDBP_CLRMARK( p ) ((p)->val &= 0xffffffffffff7fffLL) /* value w/o the mark bit */ #define LDBP_IGNMARK( p ) ((p)->val & 0xffffffffffff7fffLL) /* compare according to rowid, tag, pos */ #define LDBP_EQ( a, b ) ((a)->val == (b)->val) #define LDBP_GT( a, b ) ((a)->val > (b)->val) /* compare IGNORING MARK according to rowid, tag, pos */ #define LDBP_EQM( a, b ) (LDBP_IGNMARK(a) == LDBP_IGNMARK(b)) #define LDBP_GTM( a, b ) (LDBP_IGNMARK(a) > LDBP_IGNMARK(b)) /* manipulation: set bottom / top for row of given posting */ #define LDBP_SETROWBOT( d, s ) ((d)->val = (s)->val & 0xffffff0000000000LL) #define LDBP_SETROWTOP( d, s ) ((d)->val = (s)->val | 0xffffffffffLL) /** postings come in arrays with some header. The standard structure gives a 8k buffer, but member len may give other actual length. */ typedef struct { short mode; /* in: merge flags */ short near; /* in: near distance; in OR mode: collect pos info */ long tag; /* in: tag, to which postings are restricted */ long skp; /* in: ignore mfns < skp */ long len; /* in: length (# of postings) of buffer (if 0 : default length) */ long fil; /* io: number of postings actually used */ long cut; /* io: min mfn ignored due to buffer length */ LdbP p[OPENISIS_SETLEN]; /** 8 bytes as in IFP file: mfn[3],tag[2],occ[1],cnt[2] highest bit of cnt (1LL<<15) is used as mark */ } LdbPost; enum { LDB_OR, LDB_AND, LDB_NOT, /* like AND, but keep unmarked postings */ LDB_PFX = 4, /* prefix match */ LDB_KEEPMARKS = 8 /* do not compact after AND/NOT */ }; enum { LDB_NEAR_F = 0x7fff, /* the (F): same occurence of field */ LDB_NEAR_G = -0x8000 /* the (G): same field */ }; /** */ extern int ldb_search ( int db, const char *key, LdbPost *post, OpenIsisRec *rec ); extern long ldb_p2s ( OpenIsisSet *set, LdbPost *post ); enum { LDB_ACTAB, /* alpha, != 0 for all "word" characters */ LDB_UCTAB, /* each characters uppercase code */ LDB__TABS }; typedef unsigned char LdbCTab[256]; /* get a db's character tables */ extern LdbCTab *ldb_tabs( int db ); #define LDB_H #endif /* LDB_H */ ./lrec.c0100644000113000011300000001003007447676140010772 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: lrec.c,v 1.11 2002/03/25 19:36:44 kripke Exp $ implementation of record cooking. */ #include #include /* free */ #include /* memset et al */ #include "ldb.h" /* ************************************************************ private types */ /* ************************************************************ private data */ /* ************************************************************ private functions */ #define FIXUP( r ) \ { \ char * base = (char*)r; \ int i; \ for ( i=0; i < (r)->len; i++ ) \ (r)->field[i].val = base + (long)(r)->field[i].val; \ } /* ************************************************************ package functions */ /* ************************************************************ public functions */ OpenIsisRec *openIsisReadRow ( int db, long rowid ) { OpenIsisRec *r = (OpenIsisRec *) ldb_readRec( db, rowid ); if ( NULL != r ) FIXUP( r ) return r; } /* openIsisReadRow */ OpenIsisRec *openIsisScan ( int db, long rowid, long tag, const char *txt ) { long max = openIsisMaxRowid( db ); int tlen = strlen( txt ); const char f = *txt; for ( ; rowid <= max; rowid++ ) { int i, found = 0; OpenIsisRec *r = (OpenIsisRec *) ldb_readRec( db, rowid ); char *base = (char*)r; if ( NULL == r ) continue; for ( i=0; i < r->len; i++ ) { const char *c, *e; r->field[i].val = base + (long)r->field[i].val; if ( found || (tag > 0 && tag != r->field[i].tag) || tlen > r->field[i].len ) continue; c = r->field[i].val; e = c + r->field[i].len - tlen; for ( ; c<=e; c++ ) if ( f == *c && !memcmp( c, txt, tlen ) ) { found = !0; break; } } if ( found ) return r; } return NULL; } /* openIsisScan */ OpenIsisRec *openIsisReadField ( OpenIsisRec *r, const OpenIsisField* field ) { long i; long nfields = 0; /* number of subfields */ long size; /* byte length of field list */ const char *p, *e; if ( NULL == field || 2 > field->len || '^' != field->val[0] ) return NULL; /* go counting hats ... */ for ( e = (p=field->val) + field->len - 1; p r->len ) return NULL; size = sizeof(OpenIsisRec) + (r->len - 1) * sizeof(OpenIsisField); if ( nfields > r->len ) nfields = r->len; } else { /* first field already counted in sizeof(OpenIsisRec) */ size = sizeof(OpenIsisRec) + (nfields - 1) * sizeof(OpenIsisField); r = (OpenIsisRec *)lmalloc( size ); if ( NULL == r ) return NULL; } memset( r, 0, size ); r->rowid = 0; r->len = nfields; e = (p = field->val) + field->len; for ( i=0; ifield[ i ].tag = (unsigned char)*++p; assert( pfield[ i ].val = ++p; /* advance in buf */ while ( pfield[ i ].len = p - r->field[ i ].val; } return r; } /* openIsisReadList */ ./lstr.c0100644000113000011300000002313107447676140011037 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: lstr.c,v 1.11 2002/03/25 19:36:44 kripke Exp $ implementation of record cooking. */ #include #include "lstr.h" #include "luti.h" /* ************************************************************ private types */ /* ************************************************************ private data */ static const char * nameMfc[] = { "Mfc", "CTLM", "NMFN", "NMFB", "NMFP", "TYPE", "RCNT", "MFX1", "MFX2", "MFX3" }; static long descMfc[] = { LSTRSIZE( 9, 0, 0 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, LMBRINT, LMBRINT, LMBRSHORT, LMBRSHORT, LMBRINT, LMBRINT, LMBRINT, LMBRINT }; /* descMfc */ static const char * nameMfr[] = { "Mfr", "MFN", "RECL", "BWB", "BWP", "BASE", "NVF", "STAT", "TAG", "'POS", "LEN" }; static long descMfr[] = { LSTRSIZE( 7, 3, 0 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, LMBRSHORT, LMBRINT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT }; /* descMfr */ /* aligned version */ static long descMfrA[] = { LSTRSIZE( 7, 3, 0 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, LMBRSHORT, LSTRLOFF( LMBRINT, 8 ), LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT, LMBRSHORT }; /* descMfr */ static const char * nameXrf[] = { "Xrf", "XPOS", "XREC" }; static long descXrf[] = { LSTRSIZE( 1, 1, 127 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, LMBRINT }; /* descXrf */ static const char ** nameMst[LSTR_MST] = { nameMfc, nameMfr, nameXrf }; static long* descMst[LSTR_MST] = { descMfc, /* MST head */ descMfr, /* MST record */ descXrf /* XRF record */ }; static long* descMstA[LSTR_MST] = { descMfc, /* MST head */ descMfrA, /* MST record */ descXrf /* XRF record */ }; static const char * nameCnt[] = { "Cnt", "TYPE", "ORDN", "ORDF", "N", "K", "LEV", "POSR", "NMAX", "FMAX", "ABNO" }; static long descCnt[] = { LSTRSIZE( 10, 0, 0 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRSHORT, /* TYPE */ LMBRSHORT, /* ORDN */ LMBRSHORT, /* ORDF */ LMBRSHORT, /* N */ LMBRSHORT, /* K */ LMBRSHORT, /* LEV */ LMBRINT, /* POSR */ LMBRINT, /* NMAX */ LMBRINT, /* FMAX */ LMBRSHORT /* ABNO */ }; /* descCnt */ static long descCntA[] = { LSTRSIZE( 10, 0, 0 ), /* sizes (fix, rep, occ) */ 0,28,44, LMBRSHORT, /* TYPE */ LMBRSHORT, /* ORDN */ LMBRSHORT, /* ORDF */ LMBRSHORT, /* N */ LMBRSHORT, /* K */ LMBRSHORT, /* LEV */ LMBRINT, /* POSR */ LMBRINT, /* NMAX */ LMBRINT, /* FMAX */ LMBRSHORT /* ABNO */ }; /* descCntA */ static const char * nameN0[] = { "N0", "POS", "OCK", "TYPE", "'KEY", "REF" }; static long descN01[] = { LSTRSIZE( 3, 2, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ 10, /* KEY */ LMBRINT /* REF */ }; static long descN01A[] = { LSTRSIZE( 3, 2, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ 10, /* KEY */ LSTRLOFF( LMBRINT, 12 ) /* REF */ }; static long descN02[] = { LSTRSIZE( 3, 2, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ 30, /* KEY */ LMBRINT /* REF */ }; static long descN02A[] = { LSTRSIZE( 3, 2, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ 30, /* KEY */ LSTRLOFF( LMBRINT, 32 ) /* REF */ }; static const char * nameL0[] = { "L0", "POS", "OCK", "TYPE", "PS", "'KEY", "INFB", "INFP" }; static long descL01[] = { LSTRSIZE( 4, 3, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ LMBRINT, /* PS */ 10, /* KEY */ LMBRINT, /* INFB */ LMBRINT /* INFP */ }; static long descL01A[] = { LSTRSIZE( 4, 3, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ LMBRINT, /* PS */ 10, /* KEY */ LSTRLOFF( LMBRINT, 12 ), /* INFB */ LMBRINT /* INFP */ }; static long descL02[] = { LSTRSIZE( 4, 3, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ LMBRINT, /* PS */ 30, /* KEY */ LMBRINT, /* INFB */ LMBRINT /* INFP */ }; static long descL02A[] = { LSTRSIZE( 4, 3, 10 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* POS */ LMBRSHORT, /* OCK */ LMBRSHORT, /* TYPE */ LMBRINT, /* PS */ 30, /* KEY */ LSTRLOFF( LMBRINT, 32 ), /* INFB */ LMBRINT /* INFP */ }; static const char * nameIfp[] = { "IfH", "NXTB", "NXTP", "TOTP", "SEGP", "SEGC", "MFN", "INFO" }; static long descIfp[] = { #ifdef CONVERT_POSTINGS /* to properly convert postings, the repeated part needs to be a big-endian 64bit (long long) int however, converting can't be done in a straightforward fashion anyway, since posting segments have holes of one or two longs at block boundaries */ LSTRSIZE( 5, 2, 1 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, LMBRINT, /* */ LMBRINT, /* */ #else LSTRSIZE( 5, 0, 0 ), /* sizes (fix, rep, occ) */ LSTR_AUTOLENGTHS, #endif LMBRINT, /* */ LMBRINT, /* */ LMBRINT, /* */ LMBRINT, /* */ LMBRINT /* */ }; static const char ** nameInv[LSTR_INV] = { nameCnt, nameN0, nameL0, nameN0, nameL0, nameIfp }; static long* descInv[LSTR_INV] = { descCnt, /* CNT record */ descN01, /* N01 record */ descL01, /* L01 record */ descN02, /* N02 record */ descL02, /* L02 record */ descIfp /* Ifp record */ }; static long* descInvA[LSTR_INV] = { descCntA, /* CNT record */ descN01A, /* N01 record */ descL01A, /* L01 record */ descN02A, /* N02 record */ descL02A, /* L02 record */ descIfp /* Ifp record */ }; /* ************************************************************ private functions */ /* ************************************************************ package data */ const LstrSet lstrlib[LSET_SETS] = { { /* Isis 1 MST */ nameMst, { descMst, descMstA } }, { /* Isis 1 INV */ nameInv, { descInv, descInvA } }, }; /* lstrlib */ /* ************************************************************ package functions */ /* ************************************************************ public functions */ int lstr_auto ( long *str ) { static int pow2[] = { 1, 2, 4, 8 }; int ret = 0; int fix,rep,occ,i; long *xmbrs, txlen, tilen; int nmbrs, off = 0, xlen[2] = {0,0}, blen[2] = {0,0}, x=0; if ( NULL == str ) { #define DOALL( x ) \ for ( i=0; i<(int)(sizeof(x)/sizeof(x[0])); i++ ) \ if ( NULL != x[i] ) ret |= lstr_auto( x[i] ) DOALL( descMst ); DOALL( descInv ); DOALL( descMstA ); DOALL( descInvA ); return ret; } fix = LSTRFIX(*str); rep = LSTRREP(*str); occ = LSTROCC(*str); xmbrs = str + LSTR_XMBR; nmbrs = fix; for ( x=0; ; x++ ) { /* fix and rep */ for ( i=0; i> 16) ) str[LSTR_XRLO] |= xlen[0] << 16; else if ( xlen[0] > (short)(str[LSTR_XRLO] >> 16) ) log_msg( LOG_WARN, "short xlen[0] %hd < %d", (short)(str[LSTR_XRLO] >> 16), xlen[0] ); if ( !(short)str[LSTR_XRLO] ) str[LSTR_XRLO] |= 0xffff & xlen[1]; else if ( xlen[1] > (short)str[LSTR_XRLO] ) log_msg( LOG_WARN, "short xlen[1] %hd < %d", (short)str[LSTR_XRLO], xlen[1] ); /* build totals applying occ */ txlen = (short)(str[LSTR_XRLO] >> 16) + (long)occ*(short)str[LSTR_XRLO]; if ( !str[LSTR_XLEN] ) str[LSTR_XLEN] = txlen; else if ( txlen > str[LSTR_XLEN] ) log_msg( LOG_WARN, "short xlen %ld < %ld", str[LSTR_XLEN], txlen ); tilen = LSTRLEN(*str) + blen[0] + (long)occ*blen[1]; if ( !str[LSTR_ILEN] ) str[LSTR_ILEN] = tilen; else if ( tilen > str[LSTR_ILEN] ) log_msg( LOG_WARN, "short ilen %ld < %ld", str[LSTR_ILEN], tilen ); LOG_DBG( LOG_ALL, "%08lx xrlo %08lx xl %ld il %ld", str[0], str[1], str[2], str[3] ); return ret; } /* lstr_auto */ ./lstr.h0100644000113000011300000002232607447676140011051 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ #ifndef LSTR_H /* $Id: lstr.h,v 1.12 2002/03/25 19:36:44 kripke Exp $ definition of ISIS internal structures for openisis lib implementation. This header defines the common internal data structures and their members and external structure and member definition types. A internal data structure is the common in-memory representation of ISIS data; it may be backed by different external (in-file) structures. An in-memory data structure is a contigous long* chunk of memory, consisting of the sizes (one long), an array of members (long) and some buffer (array of char). A data structures sizes consists of the lengths fix and rep of the fixed and repeated part, resp., and the number of occurences of the repeated part. It is used in both an abstract description of a data type and each instance of a data structure. If the number of occurences of the repeated part is not fixed, it is 0 in the abstract case. The lengths are suitable as offsets into the lmbr array. This structure is designed to fit within 32 bits. The sizing is the only common meta-data description of a logical data type. For readability of code, however, the member indexes are enum-erated. When actually used, the type has to match the code's assumptions anyway. The numbers fix and rep are fixed for a given data structure. Although the logical data type has more properties, especially the type of each member (numeric, C-string or raw mem), a representation of this data is needed only when converting external data and thus is stored (somewhat redundantly) with the external properties. There are only two types of members: numeric and memory (mostly some character data). both are represented by a long, which, for memory, denotes an offset (counted in BYTES, not longs) from the records start (NOT offset into the data buffer, as with the isis mst record). The member array consists of a fixed number fix of initial members and a number occ of occurences of member arrays of fixed length rep. While occ is usually fixed, it varies for masterfile records. Note that this layout somewhat resembles the isis record itself, which supports a single level of nesting and repetition. */ /* id of a structure */ /* construction */ #define LSTRID( set, no, vari ) \ (((long)(vari))<<16 | (set)<<8 | (no) ) /* access */ #define LSTRNO( l ) (char)(l) /* no of record type in set */ #define LSTRSET( l ) (char)((l)>>8) /* record set number */ #define LSTRVAR( l ) (short)((l)>>16) /* variant */ /* size of a structure */ /* construction */ #define LSTRSIZE( fix, rep, occ ) \ (((long)(occ))<<16 | (rep)<<8 | (fix)) /* access */ #define LSTRFIX( l ) (char)(l) /* length of fixed part */ #define LSTRREP( l ) (char)((l)>>8) /* length of repeated part */ #define LSTROCC( l ) (short)((l)>>16) /* the members */ /* actual number of members */ #define LSTRMEMS( l ) (LSTRFIX(l) + LSTRREP(l)*LSTROCC(l)) /* in-memory size of members (w/o buffer). */ #define LSTRLEN( t ) ((long)sizeof(long)*(1 + LSTRMEMS(t))) /** Description of a external members layout is encoded as a short "len" and a short offset "off" into the data or repeated part, resp. offset and len are combined into one long. If offsets are 0, they are computed based on the assumption, that members are layouted packed in the declared ordering. For character data, len just gives the length of the member in bytes (up to 2**15), with the highest bit cleared. A length of 0 denotes character data of variable size. Numerical data is marked with the highest bit set. For numbers, the lowest two bits give the ld of the length in bytes (i.e. 0=1,1=2,2=4,3=8 bytes). The offset and length of the actually used bits within these bytes are each encoded in six bits, which is enough for 0..63. A length of 0 (as resulting from 6-bit overflow on '64') means no masking. The 15th bit, if set, denotes high endian data. Note that the only reason for stuffing all that into a short is, that it is sufficient. The amount of space saved is minimal and depending on the actual processor there may be a slight performance penalty for the bit operations. */ #define LONG2LEN( l ) ((short)(l)) #define LONG2OFF( l ) ((short)((l) >> 16)) /* constants */ #define LMBR_FNUM 0x8000 /* flag numeric data */ #define LMBR_FHIE 0x4000 /* flag high endian data */ /* construction */ #define LMBRNUM( ld ) (LMBR_FNUM | ld) /* standard nueric types: the world according to Java :) */ #define LMBRBYTE LMBRNUM(0) #define LMBRSHORT LMBRNUM(1) #define LMBRINT LMBRNUM(2) #define LMBRLONG LMBRNUM(3) /* bit mask construction for numerical data */ #define LMBRBITS( off, len, ld ) (LMBR_FNUM | (off)<<8 | (len)<<2 | (ld)) #define LMBRBITS4( off, len ) (LMBR_FNUM | (off)<<8 | (len)<<2 | 2) /* if you have to specify the offset explicitly */ #define LSTRLOFF( len, off ) ((len) | (off)<<16) /* access */ #define LMBRISNUM( f ) (LMBR_FNUM & (f)) #define LMBRLD( f ) (0x3 & (f)) /* bit access for numerical data */ #define LMBRISBITS( f ) (0x3ffc & (f)) #define LMBRBITLEN( f ) (0x003f & ((f) >> 2)) #define LMBRBITOFF( f ) (0x003f & ((f) >> 8)) /** Description of an external structure layout. This is usually fixed for a given (implementation of a) type; for the isis mst record, however, the occurences of the repeated part and the total external and internal lengths vary for each record. */ enum { LSTR_SIZE, /* sizes */ LSTR_XRLO, /* repeated part byte length and offset <<16; auto */ LSTR_XLEN, /* ext. total length of data; auto */ LSTR_ILEN, /* int. total length of data; auto */ LSTR_XMBR /* members */ }; #define LSTR_AUTOLENGTHS 0,0,0 #define LSTR_LONGS( totmbrs ) (4+(totmbrs)) /* technical variants of a record */ typedef enum { LVAR_PAC, /* packed little endian base variant */ LVAR_ALI, /* aligned variant */ LVAR_BIG, /* big endian aligned */ LVAR_VARI } lstr_variant; /* known record sets */ enum { LSET_MST, /* isis 1 master file */ LSET_INV, /* isis 1 inverted file */ LSET_SETS }; typedef struct { const char ***name; /* an array of names per record type */ long **desc[LVAR_VARI]; /* an array of descs per variant */ } LstrSet; /* data types of ISIS 1 master file */ typedef enum { LSTR_MFC, /* MST head */ LSTR_MFR, /* MST record */ LSTR_XRF, /* XRF record */ LSTR_MST /* count */ } lstr_mst; enum { /* MFC members */ LMFC_CTLM = 1, LMFC_NMFN, LMFC_NMFB, LMFC_NMFP, LMFC_TYPE, LMFC_RCNT, LMFC_MFX1, LMFC_MFX2, LMFC_MFX3, LMFC__FL }; enum { /* XRF members */ LXRF_XPOS = 1, LXRF_XREC }; /* data types of ISIS 1 inverted file */ typedef enum { LSTR_CNT, /* CNT record */ LSTR_N01, /* N01 record */ LSTR_L01, /* L01 record */ LSTR_N02, /* N02 record */ LSTR_L02, /* L02 record */ LSTR_IFP, /* IFP record */ LSTR_INV /* count */ } lstr_inv; enum { /* CNT members */ LCNT_TYPE = 1, /* 1 or 2: N0x */ LCNT_ORDN, /* fix 5 */ LCNT_ORDF, /* fix 5 */ LCNT_N, /* fix 15 */ LCNT_K, /* fix 5 */ LCNT_LEV, /* depth of index */ LCNT_POSR, /* position of root */ LCNT_NMAX, LCNT_FMAX, LCNT_ABNO, LCNT__FL }; enum { /* N0x members */ LN0X_POS = 1, /* record number */ LN0X_OCK, /* number of keys */ LN0X_TYPE, /* type 1 or 2 */ LN0X__FL, /* offset of repeated part */ LN0X_KEY = 0, /* key chars */ LN0X_REF, /* ref to next node (>0) or leaf (<0) */ LN0X__RL /* length of repeated part */ }; enum { /* L0x members */ LL0X_POS = 1, /* record number */ LL0X_OCK, /* number of keys */ LL0X_TYPE, /* type 1 or 2 */ LL0X_PS, /* type 1 or 2 */ LL0X__FL, /* offset of repeated part */ LL0X_KEY = 0, /* key chars */ LL0X_INFB, /* ifp block */ LL0X_INFP, /* ifp pos */ LL0X__RL /* length of repeated part */ }; enum { /* IFP members */ LIFP_NXTB = 1, /* block of next segment */ LIFP_NXTP, /* pos of next segment */ LIFP_TOTP, /* total postings */ LIFP_SEGP, /* postings in this segment */ LIFP_SEGC, /* postings in this segment */ LIFP__FL, /* offset of repeated part */ LIFP_MFN = 0, /* mfn */ LIFP_ADD, /* additional qualifyers */ LIFP__RL /* length of repeated part */ }; extern const LstrSet lstrlib[LSET_SETS]; /** auto-initialise the given structure or all builtins, iff NULL. */ extern int lstr_auto ( long *str ); #define LSTR_H #endif /* LSTR_H */ ./luti.c0100644000113000011300000001460707447676140011040 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: luti.c,v 1.12 2002/03/25 19:36:44 kripke Exp $ implementation of record cooking. */ #include #include #include /* malloc */ #include /* errno */ #include /* strerror */ #include /* isprint */ #include "lstr.h" #include "luti.h" /* ************************************************************ private types */ /* ************************************************************ private data */ log_level log_lev = LOG_ERROR; static FILE *logout = NULL; /* ************************************************************ private functions */ /* ************************************************************ package functions */ void log_msg ( log_level level, const char *fmt, ... ) { va_list ap; if ( level > log_lev ) return; if ( NULL == logout ) logout = stderr; va_start( ap, fmt ); vfprintf( logout, fmt, ap ); va_end( ap ); if ( LOG_SYSERR == level ) { fputs( ": ", logout ); fputs( strerror(errno), logout ); } fputc( '\n', logout ); } /* log_msg */ void log_rec ( log_level level, long *rec, const char **desc ) { int occ = -1; int nmbrs = LSTRFIX(*rec); long *mbr = rec+1; char *base = (char*)rec; if ( level > log_lev || NULL == desc ) return; if ( NULL == logout ) logout = stderr; fprintf( logout, "record %.20s\n", *desc++ ); /* dump the fixed part (occ==-1) and each occurrence of repeated part. */ for ( ;/* occ < LSTROCC(*dst) */; ) { /* dump one part */ int i; for ( i=0; i= LSTROCC(*rec) ) break; if ( ! occ ) { /* was the fixed part, setup for repeated */ nmbrs = LSTRREP(*rec); desc += i; } } } /* log_rec */ void log_hex ( log_level level, const void *mem, int len ) { const char *p = (const char *)mem; int i = 0; if ( level > log_lev ) return; if ( NULL == logout ) logout = stderr; for ( ; i 16 ) left = 16; for ( ; j < left; j++ ) { fprintf( logout, (3 == j%4) ? "%02x " : "%02x", p[j] ); } for ( ; j < 16; j++ ) { fputs( (3 == j%4) ? " " : " ", logout ); } for ( j=0; j < left; j++ ) { fputc( isprint(p[j]) ? p[j] : '.', logout ); } fputc( '\n', logout ); } } /* log_hex */ void * lmalloc ( long siz ) { void *mem = malloc( siz ); if ( NULL == mem ) { fputs( "out of memory\n", stderr ); if ( stderr != logout ) fputs( "out of memory\n", logout ); fprintf( logout, "when allocating %ld bytes: %s\n", siz, strerror(errno) ); } return mem; } /* lmalloc */ /* ************************************************************ public functions */ void openIsisLog ( int level, const char *filename ) { if ( ' ' <= level ) { /* by ascii value */ switch ( level ) { case '-': level = LOG_NOCHANGE; break; case 'o': level = LOG_OFF; break; case 'f': level = LOG_FATAL; break; case 's': level = LOG_SYSERR; break; default: if ( '0' <= level && level <= '9' ) { level -= '0'; break; } case 'e': level = LOG_ERROR; break; case 'w': level = LOG_WARN; break; case 'i': level = LOG_INFO; break; case 'v': level = LOG_VERBOSE; break; case 'd': level = LOG_DEBUG; break; case 't': level = LOG_TRACE; break; case 'a': level = LOG_ALL; break; } } if ( level != LOG_NOCHANGE ) log_lev = (log_level)level; if ( NULL != filename ) if ( NULL == (logout = fopen( filename, "a" )) ) { logout = stderr; log_msg( 0, "could not open logfile '%s'\n", filename ); } } /* openIsisLog */ char *openIsis2Html ( const char *str, long len ) { long l; char *p, *e, *ret; if ( NULL == str ) return NULL; if ( 0 > len ) len = strlen(str); l = len + 1; for ( e = (p=(char*)str) + len; p': l += 3; break; case '&': l += 4; break; case '"': l += 5; break; /* do not replace ' w/ ' -- many clients don't grok it */ } ret = lmalloc( l ); if ( NULL == ret ) return NULL; for ( p=ret; str': *p='&'; p[1]='g'; p[2]='t'; p[3]=';'; p+=4; break; case '&': *p='&'; p[1]='a'; p[2]='m'; p[3]='p'; p[4]=';'; p+=5; break; case '"': *p='&';p[1]='q';p[2]='u';p[3]='o';p[4]='t';p[5]=';';p+=6;break; default: *p++ = *str; } *p = 0; return ret; } /* openIsis2Html */ int openIsisValidUTF8 ( void *mem, int len, int *tof ) { unsigned char *c = (unsigned char *)mem; int f = 0; /* expected followers */ int l = len; if ( NULL != tof ) f = *tof; for ( ; l--; c++ ) { unsigned char u = *c; int tofollow = u < 128 ? 0 : u < 192 ? -1 : u < 224 ? 1 : 2; if ( f ) { if ( 0 > tofollow ) { f--; continue; } break; } if ( 0 <= tofollow ) { f = tofollow; continue; } goto croak; } if ( NULL != tof ) *tof = f; if ( ! f ) return 0; if ( 0 > l && NULL != tof ) /* exhausted buf, want follower */ return 0; log_msg( LOG_ERROR, "expected follower at %d got %x", len-l-1, (int)*c ); return len-l; croak: log_msg( LOG_ERROR, "expected no follower at %d got %x", len-l-1, (int)*c ); return len-l; } ./luti.h0100644000113000011300000000572707447676140011050 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ #ifndef LCOMMON_H /* $Id: luti.h,v 1.8 2002/03/25 19:36:44 kripke Exp $ common header for openisis lib implementation. */ #include #include "openisis.h" typedef enum { LOG_NOCHANGE = -1, /* leave as is */ LOG_OFF = 0, /* don't log anything */ LOG_FATAL, /* fatal internal errors: we can't go on */ LOG_SYSERR, /* problem with system ressources: bad file, no mem */ LOG_ERROR, /* unusable input, database or query */ LOG_WARN, /* bad input */ LOG_INFO, /* some major event like opening a db */ LOG_VERBOSE, /* any event like reading a record */ LOG_TRACE, /* database content (log_rec) */ /* highest levels only with debug built */ LOG_DEBUG, /* lots of processing details */ LOG_ALL /* just everything, even built-in content */ } log_level; extern log_level log_lev; #define LOG_DO( lev ) ((lev) <= log_lev) #define LOG_DONT( lev ) ((lev) > log_lev) /** print some log message to stderr or some configured logdevice. @param level loglevel necessary for output to occurr. */ extern void log_msg ( log_level level, const char *fmt, ... ); #ifndef NDEBUG # define LOG_DBG log_msg #else # ifdef __GNUC__ # define LOG_DBG( args... ) # else # define LOG_DBG (void) /* compiler should dispose statement off */ # endif #endif /* content logging is usually on level LOG_TRACE */ #define LOG_REC( rec, desc ) log_rec( LOG_TRACE, rec, desc ) #define LOG_HEX( mem, len ) log_hex( LOG_TRACE, mem, len ) /** dump a record @param level loglevel necessary for output to occurr. */ extern void log_rec ( log_level level, long *rec, const char **desc ); /** hexdump memory @param level loglevel necessary for output to occurr. */ extern void log_hex ( log_level level, const void *mem, int len ); /** do a malloc and print error if out of memory. */ extern void *lmalloc ( long size ); /* more specific log functions in log.h */ #define LCOMMON_H #endif /* LCOMMON_H */ ./openisis.c0100644000113000011300000002631607447676140011714 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: openisis.c,v 1.17 2002/03/25 19:36:44 kripke Exp $ main file of openisis executable. */ #ifdef HAVE_PTHREAD #define HAVE_THREADS #endif #include #include /* NULL */ #include /* printf */ #include /* free */ #include /* strcmp */ #include /* isprint */ #include /* gettimeofday */ #include /* gettimeofday */ #ifdef HAVE_PTHREAD #include /* threaded crashtest */ #endif #include "openisis.h" /* ************************************************************ private types */ typedef enum { /* what to do */ DO_DUMP, DO_SCAN, /* simple full scan */ DO_SEARCH, /* basic index based searching */ DO_TERMS, /* list terms */ DO_PERF, /* do random reads for performance checking */ DO_CRASH, /* do multi-threaded crashtest */ DO_VUTF /* validate UTF-8 input */ } todo; typedef enum { FMT_MFN, /* rowid only */ FMT_MFNF, /* rowid, 1st field */ FMT_PROP, /* property style */ FMT_XML /* pseudo XML style */ } format; /* ************************************************************ private data */ /* ************************************************************ private functions */ static int argchk ( const char *param, const char *n, const char *v ) { return strcmp( param, n ) ? 0 : NULL != v ? 1 : (fprintf( stderr, "no value for param '%s'", param ), 0); } /* argchk */ static long print ( OpenIsisRec *r, int freeit, format f ) { int i; if ( NULL != r ) { if ( FMT_MFN == f ) printf( "%ld\n", r->rowid ); else if ( FMT_MFNF == f ) printf( "%ld %.*s\n", r->rowid, 0 == r->len ? 1 : (int)r->field[0].len, 0 == r->len ? "-" : r->field[0].val ); else for ( i=0; ilen; i++ ) { printf( "%ld.%ld=%.*s\n", r->rowid, r->field[i].tag, (int)r->field[i].len, r->field[i].val ); if ( r->field[i].len && '^' == *r->field[i].val ) { /* split subfields */ OpenIsisRec *rf = openIsisReadField( NULL, r->field+i ); if ( NULL != rf ) { int j; for ( j=0; jlen; j++ ) printf( "%ld.%ld.%c=%.*s\n", r->rowid, r->field[i].tag, isprint( (int)rf->field[j].tag ) ? (int)rf->field[j].tag : ' ', (int)rf->field[j].len, rf->field[j].val ); free( rf ); } } } if ( freeit ) free( r ); } fflush( stderr ); fflush( stdout ); return NULL == r ? -1 : r->rowid; } /* print */ static void printid ( int db, long id, format f ) { if ( FMT_MFN == f ) printf( "%ld\n", id ); else print( openIsisReadRow( db, id ), !0, f ); } /* printid */ /* timing utility. set the timeval, return milliseconds since last call. */ static long millis ( struct timeval *tv ) { struct timeval otv = *tv; gettimeofday( tv, NULL ); return (tv->tv_sec - otv.tv_sec)*1000 + (tv->tv_usec - otv.tv_usec)/1000; } /* millis */ static const char **term, **val; static OpenIsisSet *post; long nterm, nval; static int db; /* (p)thread routine */ static void * run ( void *arg ) { struct timeval tv; int start = *(int *)arg; int i; millis( &tv ); for ( i=start+1; i++!=start; ) { int j; if ( i >= nterm ) i = 0; for ( j=0; j= r->len ) fprintf( stderr, "no fields for %ld\n", mfn ); else if ( r->field[0].len != (long)strlen(val[mfn]) || memcmp( r->field[0].val, val[mfn], r->field[0].len ) ) fprintf( stderr, "mismatch on %ld\n", mfn ); free( r ); } } printf( "thread %d terminated after %.3f seconds\n", start, millis(&tv)/1000. ); return NULL; } /* run */ /* multithreaded crashtest */ static int crash ( const char *pre ) { struct timeval tv; union { OpenIsisRec r; char buf[10000]; } x; long l; int p = 0; int i, pass; millis( &tv ); x.r.len = 0; x.r.bytes = sizeof(x); nterm = 0; while ( NULL != openIsisTerm( &x.r, db, pre ) && x.r.len ) nterm += x.r.len; printf( "%ld terms\n", nterm ); printf( "%.3f sec\n", millis(&tv)/1000. ); term = (const char **)malloc( nterm * sizeof(*term) ); post = (OpenIsisSet *)malloc( nterm * sizeof(*post) ); nterm = 0; nval = 0; while ( NULL != openIsisTerm( &x.r, db, pre ) && x.r.len ) { for ( i=0; ilen = 0; openIsisQuery( set, db, c, OPENISIS_QRY_KEYEQ, 0 ); if ( 0 >= set->len ) { fprintf( stderr, "no results for '%s'\n", c ); return 1; } for ( cnt = 0; cnt < set->len; cnt++ ) if ( nval < set->id[cnt] ) nval = set->id[cnt]; p += set->len; } } printf( "%d postings max mfn %ld\n", p, nval ); printf( "%.3f sec\n", millis(&tv)/1000. ); val = (const char **)malloc( (1+nval) * sizeof(*val) ); for ( i=1; i<=nval; i++ ) { OpenIsisRec *r = openIsisReadRow( db, i ); val[i] = NULL; if ( NULL == r ) { fprintf( stderr, "no rec %d\n", i ); continue; } if ( 0 < r->len ) { char *c = malloc( r->field[0].len + 1 ); memcpy( c, r->field[0].val, r->field[0].len ); c[ r->field[0].len ] = 0; val[i] = c; } free( r ); } l = millis(&tv); printf( "sequential read %ld rows in %.3f seconds %ld rows per sec\n", nval, l/1000., nval*1000/l ); i = 0; run( &i ); l = millis(&tv); printf( "in-thread run in %.3f seconds %ld rows per sec\n", l/1000., p*1000/l ); #ifdef HAVE_THREADS #define passes 3 { static int nThreads[] = { 8, 2, 1, 4 }; int res[ sizeof(nThreads)/sizeof(nThreads[0]) ]; pthread_t th[ 8 /* max. nThreads */ ]; int start[ sizeof(th)/sizeof(th[0]) ]; for ( i=0; i<(int)(sizeof(nThreads)/sizeof(nThreads[0])); i++ ) res[i] = 0; for ( pass=0; pass
  • db <name>
    basename of database. same as param dbname.
  • dbpath <path>
    path to database. usefull when opening secondary indexes or other files whose names are not based on the db basename.
  • v <level>
    set verbosity level
    • @param dbname basename of database. the dbhome arg, if given, will be prepended, and the ISIS file extensions appended to build the actual filename. Therefore, depending on the value of dbhome and location of files, this may need to include a path. db may be NULL, if argv includes a dbname arg. @param argv array of names and values. May be NULL. argv contains parameter names, which may be prefixed by a dash '-'. Depending on the actual parameter, the next string may or must contain a corresponding parameter value. An optional parameter value may be omitted, if at end of argv or the next name is prefixed with a dash. To avoid ambiguity, values never start with a dash. See above for a list of supported parameter names. Unrecognized parameter names are ignored. @param argc length of argv. You may supply -1 to indicate that argv is NULL terminated. @return some non-negative dbid on success, some negative errorcode on error. Errorcodes include -ENOENT, -ENOMEM, -EACCESS and others returned by file access functions. */ extern int openIsisOpen ( const char *dbname, const char **argv, int argc ); /** close a database. @param dbid id returned by openIsisOpen @return 0 on success, some negative errorcode else. */ extern int openIsisClose ( int dbid ); /** get highest rowid in db @param dbid id returned by openIsisOpen @return positive rowid on success, 0 if unknown, negative on error */ extern long openIsisMaxRowid ( int dbid ); /* ************************************************************ record access */ /** cooked version of an ISIS field. * values are *NOT* terminated by a 0 byte. */ typedef struct { /* although isis-1 dbs have only 2 bytes for field tags (numbers), we use longs with the lower 3 bytes for the tag. The highest byte may have special usage in some context. */ long tag; const char *val; long len; } OpenIsisField; /** cooked version of an ISIS Record. */ typedef struct { long x1; /* sizes 7 | 3<<8 | len<<16 */ long rowid; long bytes; /* total avail bytes */ long used; /* total used bytes (originally BWB) */ long fields; /* avail number of fields (originally BWP) */ long base; /* byte offset of contents area (after fields) */ long len; /* used number of fields */ long state; OpenIsisField field[1]; } OpenIsisRec; /** read a cooked row. free the returned pointer after usage. @param db id returned by openIsisOpen @param rowid the mfn @return an OpenIsisRec or NULL, if row not available. */ extern OpenIsisRec *openIsisReadRow ( int db, long rowid ); /** simple full scan search. read the first row with rowid >= given rowid and containing txt in subfield tag (any, if < 0). free the returned pointer after usage. @param db id returned by openIsisOpen @param rowid the mfn @param tag field in which to look for key, 0 for any @return an OpenIsisRec or NULL, if row not available. */ extern OpenIsisRec *openIsisScan ( int db, long rowid, long tag, const char *key ); /** create a record from a field, i.e. split subfields. if a rec buffer is given, it is filled up to it's rec->len and returned. else an appropriately allocated rec is returned, which must be freed after usage. The rec does NOT have it's own data buffer, but instead field values are pointers into the input field's value. The returned rec will therefore become invalid, if the inpur field is freed. @param rec a rec buffer to fill or NULL @param field some string to be split up at '^' characters @return an OpenIsisRec or NULL, if splitting failed. */ extern OpenIsisRec *openIsisReadField ( OpenIsisRec *rec, const OpenIsisField* field ); /** get a term for key w/ or w/o the postings. prefix mode is determined by a trailing '$' in key. for prefix mode, the last preset field in the record gives a starting point, i.e. terms up to and including it are ignored. thus, if there are more matching terms than fit in the record, the search can be continued by passing the same record. @return an OpenIsisRec or NULL */ extern OpenIsisRec* openIsisTerm ( OpenIsisRec *rec, int db, const char *key ); #ifndef OPENISIS_SETLEN #define OPENISIS_SETLEN 1000 #endif /** record set type as returned from openIsisSearch. first entry is the set length n, followed by rowids 1..n. actual array length is thus n+1. */ typedef struct { long len; long id[OPENISIS_SETLEN]; } OpenIsisSet; /* query mode */ enum { /* search given string using index */ OPENISIS_QRY_KEYEQ, /* index scan key equal */ OPENISIS_QRY_KEYPF, /* index scan key prefix */ OPENISIS_QRY_KEYAT, /* index scan key auto (checks for '$') */ /* fulltext scan for given string */ OPENISIS_QRY_SCANE=64, /* fulltext scan for equal */ OPENISIS_QRY_SCANC, /* fulltext scan for contains */ /* parse string as query expression */ OPENISIS_QRY_SIMPLE=128, /* simple left-to-right binding */ OPENISIS_QRY_PROPER /* proper binding using precedence, () */ }; /** query the db. @param set set buffer to fill. set->len must contain the actual buffer length (# of ids). 0 means default length OPENISIS_SETLEN. @param db id returned by openIsisOpen @param key keyword or query expression to search for @param mode query mode, optionally |ed with a field tag<<16. a field tag affects key and scan modes. @param skip mfns < skip are ignored, useful to continue a query @return the number of rowids in set (= set->len) on success, <0 on error. */ extern long openIsisQuery ( OpenIsisSet *set, int db, const char *key, long mode, long skip ); /* ************************************************************ utilities */ /** set logging level and device. @param level the logging level may be given numerical or as ascii char in -ofsewivtda for nochange(-1), off (0), fatal (1), syserr, error, warn, info, verbose, trace, debug, all(9) default is set to error @param filename specifies, if not NULL, a file to append log to */ extern void openIsisLog ( int level, const char *filename ); /** convert string to html by replacing the four characters <,>,& and ". free the returned pointer after usage. XML has a fifth standard entity apos, but many HTML clients don't grok it. */ extern char *openIsis2Html ( const char *str, long len ); extern int openIsisValidUTF8 ( void *mem, int len, int *tof ); extern OpenIsisRec* openIsisFmt ( OpenIsisRec *buf, int dbid, char *fmt, const OpenIsisRec *r ); #ifdef __cplusplus } #endif /* extern "C" */ #define OPENISIS_H #endif /* OPENISIS_H */ ./openjsis.c0100644000113000011300000001347207447676140011714 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: openjsis.c,v 1.10 2002/03/25 19:36:44 kripke Exp $ main file of openjsis java native lib. */ #include #include /* NULL */ #include /* printf */ #include /* free */ #include /* isprint */ #include "openisis.h" #include "org/openisis/NativeDb.h" /* ************************************************************ private types */ /* ************************************************************ private data */ /* ************************************************************ private functions */ static jobjectArray rec2bytes (JNIEnv * env, OpenIsisRec *r ) { jobjectArray jarr = NULL; jintArray ia; jint ji; jbyteArray ba; int i; if ( NULL == r ) return NULL; jarr = (*env)->NewObjectArray( env, 1+r->len, (*env)->FindClass( env, "java/lang/Object" ), NULL ); if ( NULL == jarr ) return NULL; ia = (*env)->NewIntArray( env, 1+r->len ); (*env)->SetObjectArrayElement( env, jarr, 0, ia ); ji = r->rowid; (*env)->SetIntArrayRegion( env, ia, 0, 1, &ji ); for ( i=0; ilen; i++ ) { OpenIsisField *f = &r->field[i]; ba = (*env)->NewByteArray( env, f->len ); if ( NULL == ba ) break; ji = f->tag; (*env)->SetIntArrayRegion( env, ia, i+1, 1, &ji ); (*env)->SetByteArrayRegion( env, ba, 0, f->len, (jbyte*)f->val ); (*env)->SetObjectArrayElement( env, jarr, i+1, ba ); } return jarr; } /* rec2bytes */ /* ************************************************************ package functions */ /* ************************************************************ public functions */ JNIEXPORT jshort JNICALL Java_org_openisis_NativeDb_nopen (JNIEnv *env, jclass cls, jstring jdbname, jobjectArray jargs) { int db; const char *dbname = NULL; const char **argv = NULL; int argc = 0; jsize i; (void)cls; dbname = NULL==jdbname ? NULL : (*env)->GetStringUTFChars( env, jdbname, NULL ); if ( NULL != jargs ) { argc = (*env)->GetArrayLength( env, jargs ); argv = malloc( argc * sizeof(*argv) ); if ( NULL != argv ) for ( i=0; iGetStringUTFChars( env, (*env)->GetObjectArrayElement( env, jargs, i ), NULL ); } db = openIsisOpen( dbname, argv, argc ); fprintf( stderr, "org.openisis.Db::open '%s'\n", NULL==dbname ? "" : dbname ); if ( NULL != dbname ) (*env)->ReleaseStringUTFChars( env, jdbname, dbname ); if ( NULL != argv ) for ( i=0; iReleaseStringUTFChars( env, (*env)->GetObjectArrayElement( env, jargs, i ), argv[i] ); return db; } /* Java_org_openisis_Db_open */ JNIEXPORT jobjectArray JNICALL Java_org_openisis_NativeDb_nreadRow (JNIEnv * env, jclass cls, jshort db, jint rowid, jint tag, jbyteArray txt ) { OpenIsisRec *r; jobjectArray jarr = NULL; (void)cls; if ( NULL == txt ) r = openIsisReadRow( db, rowid ); else { jsize l = (*env)->GetArrayLength( env, txt ); char *search = malloc( l+1 ); (*env)->GetByteArrayRegion( env, txt, 0, l, (jbyte*)search ); search[l] = 0; r = openIsisScan( db, rowid, tag, search ); free( search ); } jarr = rec2bytes( env, r ); if ( NULL != r ) free( r ); #ifndef NDEBUG fflush( stderr ); #endif return jarr; } /* Java_org_openisis_Db_readRow */ JNIEXPORT jobjectArray JNICALL Java_org_openisis_NativeDb_nTerms (JNIEnv * env, jclass cls, jshort db, jbyteArray term, jbyteArray start ) { OpenIsisRec *r; jobjectArray jarr = NULL; jsize lterm = (*env)->GetArrayLength( env, term ); char *cterm = malloc( lterm+1 ); union { OpenIsisRec r; char buf[4096]; } x; x.r.len = 0; x.r.bytes = sizeof(x); (void)cls; (*env)->GetByteArrayRegion( env, term, 0, lterm, (jbyte*)cterm ); cterm[lterm] = 0; if ( NULL != start ) { char *cstart; jsize lstart = (*env)->GetArrayLength( env, start ); if ( 128 < lstart ) lstart = 128; cstart = x.buf + sizeof(x.r); (*env)->GetByteArrayRegion( env, start, 0, lstart, (jbyte*)cstart ); x.r.field[0].val = cstart; x.r.field[0].len = lstart; x.r.len = 1; } r = openIsisTerm( &x.r, db, cterm ); free( cterm ); jarr = rec2bytes( env, r ); #ifndef NDEBUG fflush( stderr ); #endif return jarr; } /* Java_org_openisis_Db_Terms */ JNIEXPORT jintArray JNICALL Java_org_openisis_NativeDb_nsearch (JNIEnv * env, jclass cls, jshort db, jbyteArray key, jint mode) { jsize l; char *search; OpenIsisSet set; jintArray ia; (void)cls; if ( NULL == key ) return NULL; l = (*env)->GetArrayLength( env, key ); search = malloc( l+1 ); (*env)->GetByteArrayRegion( env, key, 0, l, (jbyte*)search ); search[l] = 0; set.len = 0; openIsisQuery( &set, db, search, mode, 0 ); free( search ); if ( 0 >= set.len ) return NULL; ia = (*env)->NewIntArray( env, set.len ); (*env)->SetIntArrayRegion( env, ia, 0, set.len, set.id ); return ia; } /* Java_org_openisis_Db_search */ ./test.pl0100755000113000011300000000606607447713242011231 0ustar kripkrip# #/* # openisis - an open implementation of the ISIS database # Version 0.8.x (microversion see file Version) # Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU Lesser General Public # License along with this library; if not, write to the Free Software # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA # # This software is dedicated to the memory of Eckart Dietrich. # # This software is inspired by (but contains no code of) the iAPI # Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. # See iAPI.txt for what it contains. #EOH */ # # Before `make install' is performed this script should be runnable with # `make test'. After `make install' it should work as `perl test.pl' ######################### We start with some black magic to print on failure. # Change 1..1 below to 1..last_test_to_print . # (It may become useful if the test is moved to ./t subdirectory.) BEGIN { $| = 1; print "1..6\n"; } END {print "not ok 1\n" unless $loaded;} use OpenIsis; $loaded = 1; print "ok 1\n"; ######################### End of black magic. # Insert your test code below (better if it prints "ok 13" # (correspondingly "not ok 13") depending on the success of chunk 13 # of the test code): sub pok { print $_[1] ? '' : 'not ', 'ok ', $_[0], ' (', $_[2], ") \n"; } OpenIsis::log(0,''); pok( 2, 1, 'unfortunately the effect of logging cannot be tested here' ); $db = OpenIsis::open( "cds", "-dbpath", "../db/cds" ); pok( 3, $db >= 0, $db ); $maxrow = OpenIsis::maxRowid( $db ); pok( 4, $maxrow > 0, $maxrow ); $row = OpenIsis::read( $db, 28 ); for (keys(%$row)) { next if 'mfn' eq $_; $a = $row->{$_}; OpenIsis::MHL( @$a ); print STDERR "\t$_=",join( "\n\t", @$a ),"\n"; } pok( 5, "HASH" eq ref($row), $row ); $row = OpenIsis::subfields( '^ap. 233-238 ^billus.' ); for (keys(%$row)) { print STDERR "\t$_=$row->{$_}\n"; } pok( 6, "HASH" eq ref($row), $row ); @res = OpenIsis::query( $db, 'plant * water' ); print STDERR "mfns for 'plant * water': ", join(',',@res), "\n"; pok( 7, 2 == @res, scalar(@res) ); @res = OpenIsis::query( $db, 'development', $OpenIsis::QRY_KEYEQ ); print STDERR "mfns for 'development': ", join(',',@res), "\n"; pok( 8, 7 == @res, scalar(@res) ); for (@res) { $row = OpenIsis::read( $db, $_ ); $title = $row->{'24'}; OpenIsis::MHL( @$title ); print STDERR "mfn ", $row->{'mfn'}, " title: ", $title->[0], "\n"; } @res = OpenIsis::terms( $db, 'a$' ); print STDERR 'terms for "a$": ', join('; ',@res), "\n"; $str = OpenIsis::2html( 'lt: < gt: > amp: & quot: "' ); print STDERR "\t$str\n"; ./testres.txt0100644000113000011300000010754207425516376012152 0ustar kripkrip47.24=Hydrological achievements and social problems 47.26=^c1966 47.26.c=1966 47.30=^ap. 357-359 47.30.a=p. 357-359 47.44=Scientific problems of the humid tropical zone deltas and their implications: proceedings of the Dacca Symposium 47.69=Paper on: 47.70=Versluys, J.D.N. 50.24=Influence of man's traditional activities on soils and vegetation 50.26=^c1966 50.26.c=1966 50.30=^ap. 301-304 50.30.a=p. 301-304 50.44=Scientific problems of the humid tropical zone deltas and their implications: proceedings of the Dacca Symposium 50.69=Paper on: 50.70=Boesch, H. 51.24=Deltas: a basis of culture and civilization 51.26=^c1966 51.26.c=1966 51.30=^ap. 295-300 51.30.a=p. 295-300 51.44=Scientific problems of the humid tropical zone deltas and their implications: proceedings of the Dacca Symposium 51.69=Paper on: 51.70=B<=ue>del, J. 71.24=Agriculture with special reference to rice cultivation in humid tropical zone deltas 71.26=^c1966 71.26.c=1966 71.30=^ap. 305-316 71.30.a=p. 305-316 71.44=Scientific problems of the Dacca Symposium 71.50=Incl. bibl. 71.69=Paper on: 71.70=Goor, G.A.W. van de 73.24=Need for land-use studies in East Pakistan 73.26=^c1966 73.26.c=1966 73.30=^ap. 329-332 73.30.a=p. 329-332 73.44=Scientific problems of the humid tropical zone deltas and their implications: proceedings of the Dacca Symposium 73.50=Incl. bibl. 73.69=Paper on: 73.70=Ahmad, Nazir 73.70=Khan, F. Karim 79.76=La Politique culturelle en R‚publique unie du Cameroun^zfre 79.44=Studies and documents on cultural policies 79.50=Incl. bibl. 79.69= - 79.24=Cultural policy in the United Republic of Cameroon 79.26=^aParis ^bUnesco Press^c1976 79.26.a=Paris 79.26.b=Unesco Press 79.26.c=1976 79.30=^a91 p.^billus.^c24 cm. 79.30.a=91 p. 79.30.b=illus. 79.30.c=24 cm. 79.70=Bahoken, J.C. 79.70=Atangana, Engelbert 86.24=Higher education and the labour market in Zambia: expectations and performance 86.26=^aParis^bUnesco Press^bIIEP^aLusaka^bUniversity of Zambia 86.26.a=Paris 86.26.b=Unesco Press 86.26.b=IIEP 86.26.a=Lusaka 86.26.b=University of Zambia 86.30=^a373 p.^billus., map^c24 cm. 86.30.a=373 p. 86.30.b=illus., map 86.30.c=24 cm. 86.50=Incl. bibl. 86.69= - 86.70=Sanyal, Bikas C. 86.70=Case, John H. 86.70=Dow, Philip S. 86.70=Jackman, Mary Elizabeth 86.71=University of Zambia 86.71=IIEP 87.24=Innovation in science education - world-wide 87.26=^aParis^bUnesco Press^c1976 87.26.a=Paris 87.26.b=Unesco Press 87.26.c=1976 87.30=^a249 p.^billus.^c24 cm. 87.30.a=249 p. 87.30.b=illus. 87.30.c=24 cm. 87.70=Baez, Albert V. 87.50=Incl. bibl. 87.69= - 87.76=L'Innovation dans l'enseignement des sciences: synthŠse mondiale^zfre 93.24=Broadcast training techniques 93.26=^aParis^bUnesco Press^c1976 93.26.a=Paris 93.26.b=Unesco Press 93.26.c=1976 93.30=^a122 p.^billus.^c22 cm. 93.30.a=122 p. 93.30.b=illus. 93.30.c=22 cm. 93.50=Incl. bibl. 93.69= - 93.70=Dance, F. Robert 93.76=T‚cnicas de formaci¢n del personal de comunicaci¢n^zspa 100.24=Micropolitan development: theory and practice of greater-rural economic development 100.26=^aAmes^bIowa State University Press^c1976 100.26.a=Ames 100.26.b=Iowa State University Press 100.26.c=1976 100.30=^a456 p.^bmap 100.30.a=456 p. 100.30.b=map 100.50=Incl. bibl. 100.69= - 100.70=Tweeten, Luther G. 100.70=Brinkman, George Lorris 105.76=Les Statistiques de la science et de la technologie en Am‚rique latine ^zfre 105.76=Las Estad¡sticas de la ciencia y la tecnolog¡a en Am‚rica Latina^zspa 105.24=Statistics on science and technology in Latin America; experience with Unesco pilot projects, 1972-1974 105.26=^aParis^bUnesco Press^c1976 105.26.a=Paris 105.26.b=Unesco Press 105.26.c=1976 105.30=^a76 p.^c27 cm. 105.30.a=76 p. 105.30.c=27 cm. 105.70=Th‚baud, Schiller 105.44=Statistical reports and studies^v20 105.50=Incl. bibl. 105.69= - 105.72=Coloquio sobre los Aspectos Nacionales e Internacionales de los Sistemas de Datos para las Estad¡sticas relativas a la Ciencia y la Tecnolog¡a en Am‚rica Latina^pCaracas^d1974 108.24=Comunica‡ao/incomunica‡ao no Brasil 108.26=^aSao Paulo ^bEdi‡oes Loyola^c1976 108.26.a=Sao Paulo 108.26.b=Edi‡oes Loyola 108.26.c=1976 108.30=^a207 p.^billus. 108.30.a=207 p. 108.30.b=illus. 108.50=(Biblioteca Universit ria de Comunica‡ao, vol.1). Incl. bibl. 108.69= - 108.70=Melo, Jos‚ Marques de 108.71=Uniao Crista Brasileira de Comunica‡ao Social 111.24=Multinational corporation and social change 111.26=^aNew York ^bPraeger Publishers^c1976 111.26.a=New York 111.26.b=Praeger Publishers 111.26.c=1976 111.30=^a234 p. 111.30.a=234 p. 111.50=Incl. bibl. 111.69= - 111.70=Apter, David Ernest 111.70=Goodman, Louis Wolf 114.24=Educational development; a new discipline for self-renewal 114.26=^aEugene, Or.^bCenter for the Advanced Study of Educational Administration^c1973 114.26.a=Eugene, Or. 114.26.b=Center for the Advanced Study of Educational Administration 114.26.c=1973 114.30=^a343 p.^billus. 114.30.a=343 p. 114.30.b=illus. 114.50=(CASEA monograph, no.24). Incl. bibl. 114.69= - 114.70=Hemphill, John Knox 114.70=Rosenau, Fred S. 114.71=Far West Laboratory for Educational Research and Development (USA) 114.71=University of Oregon (USA). Center for the Advanced Study of Educational Administration 118.12=Seminario Iberoamericano de Pol¡tica Cient¡fica y Tecnol¢gica^pAlcal  de Henares and Madrid^d1974 118.24=(Ponencias y otras documentos) 118.26=^aMadrid^bServicio de Publicaciones del Ministerio de Educac¡on y Ciencia^c1976 118.26.a=Madrid 118.26.b=Servicio de Publicaciones del Ministerio de Educac¡on y Ciencia 118.26.c=1976 118.30=^a244 p. 118.30.a=244 p. 118.69= - 118.71=OAS 119.12=Meeting on the Implementation of the Recommendations of the Third Regional Conference of Ministers of Education and Ministers Responsible for Economic Planning in the Arab States^pCairo^d1976 119.24=Selected resolutions and recommendations of recent conferences and meetings of relevance to topics likely to be discussed at the meeting 119.26=^c17 Sept. 1976 119.26.c=17 Sept. 1976 119.30=^a25 p. 119.30.a=25 p. 119.69= 120.12=Meeting on the Implementation of the Recommendations of the Third Regional Conference of Ministers of Education and Ministers Responsible for Economic Planning in the Arab States^pCairo^d1976 120.24= Croissance des effectifs scolaires dans les pays arabes; tendances et projections jusqu'en 1985 120.26=^cJuly 1976 120.26.c=July 1976 120.30=^a96 p. ^billus. 120.30.a=96 p. 120.30.b=illus. 120.69= - 121.12=Meeting of Experts on the Content of Education in the Context of Life-long Education^pParis^d1975 121.24=Final report 121.26=^c6 Feb. 1976 121.26.c=6 Feb. 1976 121.30=^a(18 p. in various pagings) 121.30.a=(18 p. in various pagings) 121.69= - 123.12=Meeting on the Implementation of the Recommendations of the Third Regional Conference of Ministers of Education and Ministers Responsible for Economic Planning in the Arab States^pCairo^d1976 123.24=Aspects quantitatifs de la scolarisation du second degr‚ dans les pays arabes 123.26=^c27 Aug. 1976 123.26.c=27 Aug. 1976 123.30=^a25 p. 123.30.a=25 p. 123.69= - 123.70=Sammak, A. 123.71=Unesco Regional Office for Education in the Arab States (Lebanon) 124.12=Meeting on the Implementation of the Recommendations of the Third Regional Conference of Ministers of Education and Ministers Responsible for Economic Planning in the Arab States^pCairo^d1976 124.24=D‚veloppement quantitatif de l'enseignement primaire dans les pays arabes … la lumiŠre de la r‚solution de la Conf‚rence de Marrakech sur l'enseignement obligatoire 124.26=^c27 Aug. 1976 124.26.c=27 Aug. 1976 124.30=^a(44 p. in various pagings)^billus. 124.30.a=(44 p. in various pagings) 124.30.b=illus. 124.69= - 124.71=Unesco Regional Office for Education in the Arab States (Lebanon) 125.12=Regional Seminar on Training^n2nd^pDakar^d1975 125.24=Final report 125.26=^c25 June 1976 125.26.c=25 June 1976 125.30=^a(17 p. in various pagings) 125.30.a=(17 p. in various pagings) 125.69= - 125.71=Unesco Regional Office for Education in Africa (Senegal) 127.69= - 127.71=IBE 127.12=Meeting of National Directors and Chief Technical Advisers of the Projects for the Training of Educational Personnel^n7th^pParis^d1975 127.24=Report 127.26=^c15 June 1976 127.26.c=15 June 1976 127.30=^a(88 p. in various pagings)^billus. 127.30.a=(88 p. in various pagings) 127.30.b=illus. 128.69= - 128.24=Desarrollo y universidad 128.26=^aLa Paz^bLibrer¡a Editorial "Juventud"^c1975 128.26.a=La Paz 128.26.b=Librer¡a Editorial "Juventud" 128.26.c=1975 128.30=^a206 p. 128.30.a=206 p. 128.70=Anaya, Ricardo 130.12=Joint FAO/WHO Expert Committee on Nutrition^n9th^pRome^d1974 130.24=Food and nutrition strategies in national development 130.26=^aRome^bFAO ^c1976 130.26.a=Rome 130.26.b=FAO 130.26.c=1976 130.30=^a64 p. 130.30.a=64 p. 130.50=(FAO nutrition meetings report series, no.56). WHO technical report series, no.584 130.69= - 130.71=FAO 130.71=WHO 130.76=Strat‚gies de l'alimentation et de la nutrition dans le d‚veloppement national^zfre 131.24= Measurement of scientific and technical activities - Proposed standard practice for surveys of research and experimental development 131.26=^aParis^bOECD^c1976 131.26.a=Paris 131.26.b=OECD 131.26.c=1976 131.30=^a138 p. 131.30.a=138 p. 131.69= 131.71=OECD 131.74=Proposed standard practice for surveys of research and experimental development 131.76=La Mesure des activit‚s scientifiques et techniques^zfre 132.12=UNDP/ESCAP Regional Meeting on Technical Cooperation among Developing Countries^pBangkok^d1976 132.24=Conclusions and recommendations and extracts from statements 132.26=^aBangkok^bESCAP^c1976 132.26.a=Bangkok 132.26.b=ESCAP 132.26.c=1976 132.30=^a76 p. 132.30.a=76 p. 132.69= 132.71=ESCAP 141.24=Energy for rural development: renewable resources and alternative technologies for developing countries 141.26=^aWashington^bNational Academy of Sciences^c1976 141.26.a=Washington 141.26.b=National Academy of Sciences 141.26.c=1976 141.30=^a306 p.^billus. 141.30.a=306 p. 141.30.b=illus. 141.50=(PB-260-606). Incl. bibl. 141.69= - 141.71=National Academy of Sciences (USA). Ad Hoc Panel on Renewable Energy Resources 141.71=National Research Council (USA) 141.71=National Academy of Sciences (USA). Board on Science and Technology for International Development 147.24=Employment, growth and basic needs; a one-world problem 147.26=^aGeneva^bILO^c1976 147.26.a=Geneva 147.26.b=ILO 147.26.c=1976 147.30=^a177 p. 147.30.a=177 p. 147.50="Report of the Director-General." Incl. bibl. 147.69= - 147.71=ILO 147.72=Tripartite World Conference on Employment, Income Distribution and Social Progress and the International Division of Labour^pGeneva^d1976 147.76=L'Emploi, la croissance et les besoins essentiels; problŠme mondial^zfre 147.76=Empleo, crecimiento y necesidades esenciales; problema mundial^zspa 149.12=Symposium on the Psychological Bases of Programmed Learning ^pTbilisi, USSR^d1976 149.24=For a training project based on programmed learning in the developing countries: objectives, means and resources, organization and management, development 149.26=^c14 June 1976 149.26.c=14 June 1976 149.30=^a18 p. 149.30.a=18 p. 149.69= - 149.70=Pocztar, Jerry 150.24=Micropolitan development: theory and practice of greater-rural economic development 150.26=^aAmes^bIowa State University Press^c1976 150.26.a=Ames 150.26.b=Iowa State University Press 150.26.c=1976 150.30=^a456 p.^bmap 150.30.a=456 p. 150.30.b=map 150.50=Incl. bibl. 150.69= - 150.70=Tweeten, Luther G. 150.70=Brinkman, George Lorris ABBAS, B.M. ABEYWICKRAMA, B.A. ABOUT ABSENCE ABSORPTION ACCOMPANYING ACCOUNT ACCOUNTING ACHIEVEMENTS ACID ACTION ACTIVITIES ACTUAL ADDRESSES ADMINISTRATIVE REFORM ADMISSION ADMISSION CRITERIA ADULT ADULT EDUCATION AERIAL AERIAL PHOTOGRAPHY AESTHETICS AFFECTIVE AFGHANISTAN AFRICA AFRICAN LANGUAGES AGE AGE GROUPS AGENT AGENTS AGRICULTURAL DEVELOPMENT AGRICULTURAL TRAINING AGRICULTURE AGRONOMY AHMAD, MAJEED AHMAD, NAZIR ALLUVIAUX ALLUVIONS ALTERNATIVE AMAZON AMERICA ANALYSIS ANALYTICAL ANAYA, RICARDO ANCIENT CIVILIZATIONS ANIMAL ANNA ANNOTATED ANNUAL ANTI ANTIQUITIES APERCU APPARATUS APPLICATION APPROACH APPROPRIATE TECHNOLOGY APRIL APTER, DAVID ERNEST AQUIFERS ARAB COUNTRIES ARABES ARCHITECTURE AREA AREAS ARID ARMAMENTS ARMS CONTROL ARMS SALES ART BOOKS ART HISTORY ARTISTIC CREATION ARTS ASIA ASPECTS ASPIRATION ASSIMILATION ASSURANCES AT ATANGANA, ENGELBERT ATTITUDE AUDIT AUSTRALIA AUSTRALIAN AUTOMATIC AVAILABLE AWAY AYALA, FRANCISCO JOSE BAEZ, ALBERT V. BAHOKEN, J.C. BALANCE BANGLADESH BARRS, H.D. BARS BASED BASEL BASIC BASIC EDUCATION BASIS BAUMGARTNER, ALBERT BE BEHAVIOUR BELOW BENGAL BETWEEN BIBLIOGRAPHIE BIBLIOGRAPHIES BIBLIOGRAPHY BIOLOGICAL EVOLUTION BIOLOGICAL RESEARCH BIOLOGY BIOMASS BITSIOS, DIMITRI S. BJELICA, MIHALO BLACKS BLOOM, JOSEPH BOARDING SCHOOLS BOESCH, H. BOLIVIA BONDURANT, JOAN V. BOOK BORDIA, ANIL BORICHANSKY, L.S. BORING BOROBUDUR BOSIAN, G. BOURDEAU, PHILIPPE F. BOWRA, SIR CECIL MAURICE BRACKISH BRACKISH WATER BRAIN DRAIN BRASIL BRAZIL BRINKMAN, GEORGE LORRIS BRIX, H. BROADCAST BROADCASTING BROTHERS BUDDHISM BUDEL, J. BUDGET BUILDING BURMA BUSINESS MANAGEMENT C CALCULATION CAMEROON CAMEROON UR CANADA CARACTERISTIQUES CARBON CARBON DIOXIDE CARBONIQUE CARIBBEAN AREA CARLIER, G. CARMEL CARTE CARTOGRAPHY CASE STUDIES CASE, JOHN H. CASPERS, H. CAT CATALOGUES CATSKY, J. CENTRE CEREALS CEREMONY CEYLON CHAMBER CHANCELLOR CHANDI CHANGE CHANGES CHANGING CHANGING SOCIETY CHAO CHAPMAN, VALENTINE J. CHEMICAL ANALYSIS CHEMICAL PROPERTIES CHEMICAL/BIOLOGICAL WARFARE CHI CHILDREN CHILDREN'S BOOKS CHIMIQUE CHO CHOWDHURY, M.I. CHURCH CHURCHILL, STACY CIVILIZATION CLASSICAL CLASSIFICATION CLAYS CLIMATE CLIMATIC CLIMATIC DATA CLUBS CO COASTAL COASTAL ZONES COLOMBIA COLORIMETRIC COMMUNICATION COMMUNICATION HISTORY COMMUNICATION IMPACT COMMUNICATION LEGISLATION COMMUNICATION PERSONNEL TRAINI COMMUNICATION PLANNING COMMUNICATION POLICY COMMUNICATION PROCESS COMMUNICATION RESEARCH COMMUNICATION STATISTICS COMMUNITIES COMMUNITY COMMUNITY DEVELOPMENT COMMUNITY EDUCATION COMPARATIVE COMPARATIVE ANALYSIS COMPARISON COMPULSORY EDUCATION COMPUTER APPLICATIONS COMPUTER HARDWARE COMPUTER SOFTWARE COMUNICACAO CONCENTRATION CONCLUSIONS CONDITIONS CONFERENCE CONFERENCES CONFLICT CONFLICT RESOLUTION CONFORM CONQUEST CONSULTANCY CONTEMPORARY SOCIETY CONTRIBUTES CONTROL CONTROLLED CORPORATION COUGHLAN, MARGARET N. COUNTRIES COUNTRY REPORTS COURSES COVER COVERS CRAIN, N. CRITICISM CROISSANCE CROP CROPPED CROSS CUBA CULTIVATION CULTURAL CULTURAL ACTIVITIES CULTURAL DEVELOPMENT CULTURAL FACILITIES CULTURAL FACTORS CULTURAL HISTORY CULTURAL IDENTITY CULTURAL INSTITUTIONS CULTURAL PLANNING AND ADMINIST CULTURAL POLICY CULTURAL PROGRAMMES CULTURE CURRENT CURRENTS CURRICULUM DEVELOPMENT CURRICULUM PLANNING CYPRUS D DACCA DANCE, F. ROBERT DANS DATA COLLECTION DATA PROCESSING DAVE DAVE, RAVINDRAKUMAR H. DE DECENTRALIZATION DECISION DECISION MAKING DEFICIT DEFINIES DEFINITIONS DEGRE DEGREES DEGUCHI, K. DELIVERED DELTA DELTAIC DELTAS DEMAND DEMOCRATIC KAMPUCHEA DEMOCRATIZATION OF EDUCATION DES DESARROLLO DESCRIPTION DESIGN DETERMINATION DETERMINING DEVELOPED COUNTRIES DEVELOPING DEVELOPING COUNTRIES DEVELOPMENT DEVELOPMENT PLANNING DEVELOPMENT STRATEGIES DEVELOPPEMENT DEW DIFFERENT DIFFUSION DIOXIDE DIPLOMAS DIRECTOR DIRECTORIES DISARMAMENT DISC DISCHARGE OF RIVERS DISCIPLINE DISCUSSED DISPOSITION DISSEMINATION OF INFORMATION DOBZHANSKY, THEODOSIUS GRIGORI DOCUMENTATION DOCUMENTATION CENTRES DOCUMENTOS DOTY, M.S. DOW, PHILIP S. DRAINAGE DRAPER, JAMES A. DROUGHT DRY DU DUE DUKE, CHRISTOPHER E EAST EASTERN EUROPE EAUX ECOLOGY ECONOMIC ECONOMIC AND SOCIAL DEVELOPMEN ECONOMIC BEHAVIOUR ECONOMIC CONCENTRATION ECONOMIC CONDITIONS ECONOMIC GROWTH ECONOMIC POLICY ECONOMICS OF EDUCATION ECONOMY ECOSYSTEMS EDUCATION EDUCATION AND DEVELOPMENT EDUCATION AND EMPLOYMENT EDUCATIONAL EDUCATIONAL ADMINISTRATION EDUCATIONAL ADMINISTRATIVE STR EDUCATIONAL ADMINISTRATORS EDUCATIONAL ADVISERS EDUCATIONAL ASSISTANCE EDUCATIONAL COSTS EDUCATIONAL DEMAND EDUCATIONAL DEVELOPMENT EDUCATIONAL ENVIRONMENT EDUCATIONAL EQUIPMENT EDUCATIONAL EXPENDITURE EDUCATIONAL EXPERIMENTS EDUCATIONAL GOALS EDUCATIONAL HISTORY EDUCATIONAL INNOVATIONS EDUCATIONAL INSTITUTIONS EDUCATIONAL LEVELS EDUCATIONAL MANAGEMENT EDUCATIONAL NEEDS EDUCATIONAL OUTPUT EDUCATIONAL PERSONNEL TRAINING EDUCATIONAL PLANNING EDUCATIONAL POLICY EDUCATIONAL PROGRAMMES EDUCATIONAL PSYCHOLOGY EDUCATIONAL RADIO EDUCATIONAL REFORM EDUCATIONAL RESEARCH EDUCATIONAL STATISTICS EDUCATIONAL STRATEGIES EDUCATIONAL SUPERVISION EDUCATIONAL SYSTEMS EDUCATIONAL TECHNOLOGY EDUCATIONAL TELEVISION EDUCATIONAL TRENDS EDUCATIVES EFFECT EFFECTIFS EFFECTS EGOROV, V.V. ELECTRIC ELECTRICAL ENGINEERING ELEMENT ELKANA, YEHUDA EMISSION EMPLOYERS EMPLOYMENT EN ENERGY ENERGY BALANCE ENERGY CONVERSION ENERGY RESOURCES ENROLMENT ENROLMENT PROJECTIONS ENROLMENT RATIOS ENSEIGNEMENT ENVIRONMENTAL ENVIRONMENTAL CHANGES ENVIRONMENTAL CONTROL ENVIRONMENTAL EDUCATION ENVIRONMENTAL QUALITY EQUATION ESCAP ESTABLISHMENT ESTUARIES ESTUARINE ESTUARY ET ETHICS ETUDE EUROPE EVALUATING EVALUATION METHOD EVALUATION OF EDUCATION EVAPORATION EVAPOTRANSPIRATION EVERYDAY LIFE EXAMINATIONS EXCHANGE EXISTENCE EXPECTATIONS EXPERIENCE EXPERIMENT EXPERIMENTAL EXPERIMENTS EXPERTS EXTRACTS FACTORS FAJARDO, JOSE CARLOS FAMILY LIFE FAUNA FAURE, EDGAR FEATURES FELLOWSHIPS FERTILIZERS FIELD FIELDS FILMS FINAL FIRST FISH FISHERIES FLOOD FLOOD CONTROL FLOODING FLOODS FLORA FLORAS FLOW MEASUREMENT AND INSTRUMEN FOLKLORE FOOD FOOD PRODUCTION FOOD RESOURCES FORCE FOREIGN INVESTMENT FOREIGN TRADE FOREST FORESTS FORMATION FORMERLY FOSBERG, F. RAYMOND FRADIER, GEORGES FRANCE FRANCO, C.M. FRANEKER FREEDOM FRESH FRESHWATER FULLY FUTURE GALE, J. GANDHIAN GANGES GASEOUS GAUGES GAZ GENERAL GENESIS GEODYNAMICS GEOLOGICAL GEOLOGY GEOMORPHOLOGIE GEOMORPHOLOGY GEOTHERMAL ENERGY GERMANY FR GHANI, Q. GOODMAN, LOUIS WOLF GOOR, G.A.W. VAN DE GRADUAL GRADUATES GRASS GREAT GREATER GREECE GRIEVE, B.J. GROOT, A.J. DE GROUND GROUNDWATER GROUP DISCUSSIONS GROWTH GUIDANCE SERVICE GUIDE GUIDES GUTTMANN, LUDWIG HALLAK, JACQUES HANDBOOK HAVELOCK, MARY C. HAVELOCK, RONALD G. HEALTH HEAT HEAT TRANSFER HEEMST, H.D.J. VAN HEMPHILL, JOHN KNOX HERVIEU, J. HIGH HIGHER HIGHER EDUCATION HIGHER TECHNICAL PERSONNEL HISTOIRE HISTORIC MONUMENTS HISTORICAL ANALYSIS HISTORY HOLDINGS HOLLANDER, JACK M. HOLLERWOGER, F. HOLT, MICHAEL HOME HOOK, SIDNEY HORLAMUS, SEPP HOUSE HOUSING HUDSON, J.P. HUISMAN, L. HUMAN HUMAN ACTIVITIES EFFECTS HUMAN ECOLOGY HUMAN RESOURCES DEVELOPMENT HUMAN RIGHTS HUMAN SETTLEMENT HUMID HUMID ZONES HUMIDITE HUMIDITY HUNGARY HYDRATURE HYDRAULIC HYDRAULIC ENGINEERING HYDRODYNAMICS HYDROGEOCHEMISTRY HYDROGEOLOGY HYDROGRAPHY HYDROLOGICAL HYDROLOGICAL CYCLE HYDROLOGY HYDROMETEOROLOGICAL HYDROMETEOROLOGY HYGROMETER HYGROMETERS IBE IDEAL IMPLICATIONS IMPORTANT IMPROVEMENT IN-SERVICE TEACHER TRAINING INCLUDING INCOME INCOME DISTRIBUTION INCOMUNICACAO INDEX INDIA INDIAN INDIRECT INDIVIDUAL INDONESIA INDUSTRIAL PRODUCTS INDUSTRIALIZATION INDUSTRIES INFLUENCE INFORMATION PROCESSING AUTOMAT INFORMATION SERVICES INFORMATION SOURCES INFORMATION SYSTEMS INFORMATION USERS INFORMATION/LIBRARY FINANCING INFORMATIQUE INFRA INNOVATION INNOVATION BEHAVIOUR INSTRUCTIONAL INTEGRATED INTEGRATED CURRICULUM INTERACTION INTERDISCIPLINARY APPROACH INTERGOVERNMENTAL ORGANIZATION INTERNAL INTERNATIONAL INTERNATIONAL CONFLICT INTERNATIONAL COOPERATION INTERNATIONAL LAW INTERNATIONAL ORGANIZATIONS INTERNATIONAL RELATIONS INTERNATIONAL STANDARDS INTERNATIONAL TRADE INTERNATIONALE INVERTEBRATA INVOLVED IRAN (ISLAMIC REPUBLIC) IRRAWADDY IRRIGATION ISLAM, M. AMIRUL ISRAEL IT ITALY JACKMAN, MARY ELIZABETH JAVA JOBORU, MAGDA JOURNALISM JOURNALISTS JUSQU KARAMAZOV KARENINA KARIM, A.Q.M.B. KENYA KHAN, F. KARIM KHUDA, M. QUDRAT KIDD, JAMES ROBBINS KLAUSING, O. KLEINFELD, JUDITH S. KRAMER, P.J. KREEB, K. L LA LABORATORY LABOUR LABOUR MARKET LABOUR MIGRATION LABOUR POLICY LABOUR RELATIONS LAND LAND RECLAMATION LAND USE LANGE, O.L. LANGUAGE BEHAVIOUR LANGUAGE OF INSTRUCTION LATIN LATIN AMERICA LAW LE LEADERSHIP LEAF LEARNING LEARNING PROCESSES LEAST DEVELOPED COUNTRIES LEAVES LEBLOND, C. LECTURES LEGISLATION LEIDEN LEKOVIC, ZDRAVKO LEROY, GEORGES LES LEVITT, J. LIBERATION MOVEMENTS LIETH, H. LIFE LIFE-LONG EDUCATION LIFELONG LIKELY LIST LITERACY PROGRAMMES LITERARY CRITICISM LITERATURE LIVING CONDITIONS LONG LOSS LUMIERE LYSIMETER M MADAGASCAR MAGALHAES, A.C. MAHEU MAIN MAKING MAKKINK, G.F. MAN MANAGEMENT MANAGEMENT INFORMATION SYSTEMS MANAGEMENT OPERATIONS MANGANESE MANGOKY MANGROVE MANGROVES MANKIND MANPOWER NEEDS MANUEL MANUFACTURING INDUSTRIES MAQUIS MARJORAM, D.T.E. MARKET MARRAKECH MARSHES MASS MASS CULTURE MASS MEDIA MASTER MATHEMATICAL MATHEMATICAL LOGIC MATHEMATICAL MODELS MATHEMATICS MATTER MAY, WILLIAM H. MCQUAIL, DENIS MEANING MEANS MEASUREMENT MEASUREMENT AND INSTRUMENTS MEASUREMENTS MEASURING MEDIA MEDICINAL PLANTS MEETING MEETINGS MELO, JOSE MARQUES DE MEMORIAL MESURE METABOLISM METEOROLOGICAL METEOROLOGY METHOD METHODOLOGIE METHODOLOGY METHODS MICHAELI, A. MICHIGAN MICROBIOLOGY MICROCLIMATE MICROCLIMATIC MICROPOLITAN MIDDLEMARCH MIKHAILOV, V.N. MILITARY ENGINEERING MINERAL DEPOSITS MINERAL RESOURCES MINERALOGIQUES MIRON, MURRAY S. MISE MODEL MODELS MODIFICATIONS MOISTURE MOLECULAR BIOLOGY MOLLUSCA MONGOLIA MONOLITHS MONUMENT MOORMANN, F.R. MORPHOLOGY MORPHOLOGY (LINGUISTICS) MOUNTAINS MOUTH MR MUCHEKE MUD MUELLER-DOMBOIS, D. MULTINATIONAL MULTIRACIAL SOCIETIES NAGARAJA, V.N. NAMIBIA NAQVI, SIBTE NABI NATIONAL NATIONAL DEVELOPMENT NATIONAL PLANNING NATIONAL POLICY NATIONALISM NATIONS NATURAL NEED NEEDS NETHERLANDS NEW NEWLY-INDEPENDENT STATES NEWS AGENCIES NEWSPAPERS NIGER NO NON-VIOLENCE NORTH AMERICA NOTES NOVEL NOVELS NUCLEAR NUCLEAR WEAPONS NUTRIENT NUTRIENTS NUTRITION OBJECTIVES OBLIGATOIRE OCCUPANT OCCUPATIONAL QUALIFICATIONS OCCURENCE OCEAN CURRENTS OCEANIA OHYA, MASAHIKO OIAPOQUE OKATCHA, F.M.M.O. ONE ONTARIO OPEN OPENING OPERATIONS ORGANES ORGANIC MATTER ORGANIZATION ORGANIZATIONAL OSGOOD, CHARLES EGERTON OTHER OTRAS OUEST PACIFIC ISLANDS PAKISTAN PAR PARASITES PART PART-TIME COURSES PATEL, A.M. PAYS PECS PERDU PERFORMANCE PERIODICALS PERRY, WALTER PERSONAL PERSONNEL MANAGEMENT PERSPECTIVES PERU PERUVIAN PESTS PETTIGREW, ANDREW M. PHENOMENOLOGY PHILIPPINES PHILOSOPHICAL PHILOSOPHY PHOTOGRAPHS PHOTOSYNTHESIS PHYA PHYSICAL EDUCATION PHYSICAL PROPERTIES PHYSIOLOGY PIED PILOT PILOT PROJECTS PINE PIRES, J. MURCA PLACE PLAINS PLAN PLANKTON PLANNING PLANT PLANT ECOLOGY PLANT EVAPOTRANSPIRATION PLANT PHOTOSYNTHESIS PLANT PHYSIOLOGY PLANT TRANSPIRATION PLANTS POCZTAR, JERRY POINT POLICIES POLICY POLITICAL BEHAVIOUR POLITICAL CONFLICT POLITICAL ECONOMY POLITICAL PARTICIPATION POLITICAL PARTIES POLITICAL SYSTEMS POLITICAL THOUGHT POLITICS POLITIQUES POLJAKOFF-MAYBER, A. POLLUTION POLSTER, H. PONENCIAS POPULATION POPULATION DENSITY POPULATION DYNAMICS POROMETER PORTUGAL POST-GRADUATE COURSES POTENTIAL POUR POVERTY POWER INDUSTRY PRACTICE PRATIQUE PRESENTED PRESERVATION OF CULTURAL PROPE PRESERVATION OF MONUMENTS PRESS PRESSURE PREVAILING PRIMAIRE PRIMARY EDUCATION PRIMARY SCHOOLS PROBLEM PROBLEMES PROBLEMS PROCEEDINGS PRODUCT PRODUCTION PRODUCTIVITY PROFESSIONAL ASSOCIATIONS PROFESSIONAL TRAINING PROGRAMMED PROGRAMMED INSTRUCTION PROGRAMMED MATERIALS PROGRAMMES PROGRAMS PROGRESS PROJECT PROJECTIONS PROJECTS PROPOSED PROWSE, G.A. PSYCHOANALYSIS PSYCHOLINGUISTICS PUBLIC PUBLIC EDUCATION PUBLIC HEALTH PUBLIC OPINION QUALITY QUALITY OF LIFE QUANTITATIF QUANTITATIFS QUESTIONNAIRES QURESHI, M. RAHIMULLAH R RACE RACE RELATIONS RACIAL SEGREGATION RADIATION MEASUREMENT AND INST RADIO RAIN RAINFALL RATES READINGS RECENT RECENTES RECENTS RECHERCHE RECOMMENDATIONS RED REDUCTION REFERENCE REFORM REFRACTIVE REGARD REGIME REGIME OF WATERS REGIONAL COOPERATION REGIONAL PLANNING REGIONS REGULATION RELATED RELATING RELATION RELATIVE RELEVANCE RENE RENEWABLE RENEWABLE RESOURCES RENEWAL REPORT REPUBLIC RESEARCH RESEARCH AND DEVELOPMENT RESEARCH CENTRES RESEARCH PRIORITIES RESEARCH WORKERS RESISTANCE RESOLUTION RESOLUTIONS RESOURCE CONSERVATION RESOURCES RESPONSE RESTORATION REVIEW RHODESIA RHODESIAN RICE RIEPE, DALE MAURICE RIGHT TO INFORMATION RIGHTS RIVER RIVER BASINS RIVER CONTROL RIVERS ROLE ROLE OF EDUCATION ROONWAL, M.L. ROSENAU, FRED S. RUN-OFF RURAL RURAL AREAS RURAL DEVELOPMENT RURAL POPULATION RURAL YOUTH S SA, ARTUR MOREIRA DE SAFETY SAINT ANTONIN, CLAUDE SALINE SALINE WATER SALINITY SAMMAK, A. SANCTIONS SANTEMA, P. SANYAL, BIKAS C. SATELLITE SATELLITE BROADCASTING SATURATION SCALE SCHMID, MAURICE SCHOELLER, MARC SCHOLARSHIPS SCHOOL LABORATORIES SCHOOL MAPPING SCHOOL-AGE POPULATION SCHOOLS SCIENCE SCIENCE AND DEVELOPMENT SCIENCE AND TECHNOLOGY SCIENCE EDUCATION SCIENCE FINANCING SCIENCE POLICY SCIENCE STATISTICS SCIENTIFIC SCIENTIFIC ACTIVITIES SCIENTIFIC DEVELOPMENT SCIENTIFIC INSTITUTIONS SCIENTIFIC PERSONNEL SCIENTIFIC PROGRAMMES SCIENTIFIC PROGRESS SCIENTIFIC RESEARCH SCOLAIRE SCOLAIRES SCOLARISATION SCULPTURE SEA SEA LEVEL SEA WATER SECOND SECONDARY EDUCATION SECONDARY SCHOOL CURRICULUM SECONDARY SCHOOLS SEDIMENT SEDIMENT TRANSPORT SEDIMENTATION SEDIMENTS SELECTED SELF SELF-TEACHING METHODS SEMANTICS SEMI SENEGAL SEPTEMBER SERVICES SEX SHACHORI, A.Y. SHIFTING SHIPWORMS SHUI SIGNIFICANCE SIGNIFICANT SIMMONS, MELVIN K. SINGH, B.N. SIOLI, HAROLD SKILLED WORKERS SLATYER, R.O. SLAVIK, B. SOCIAL SOCIAL CHANGE SOCIAL ENVIRONMENT SOCIAL FACTORS SOCIAL INTEGRATION SOCIAL LIFE SOCIAL PARTICIPATION SOCIAL PLANNING SOCIAL REFORM SOCIAL SCIENCE RESEARCH SOCIAL SECURITY SOCIAL STATUS SOCIAL STRATIFICATION SOCIAL SYSTEMS SOCIALES SOCIALISM SOCIO-ECONOMIC FACTORS SOCIOLOGY SOCIOLOGY OF COMMUNICATION SOCIOLOGY OF SCIENCE SOEKMONO, R. SOIL SOIL EROSION SOIL FERTILITY SOIL GENESIS SOIL MECHANICS SOIL MOISTURE SOIL SCIENCE SOIL SURVEYS SOIL TYPES SOILS SOLAR ENERGY SOLAR RADIATION SOLS SOME SOUTERRAINES SOUTH EAST ASIA SOUTHERN AFRICA SPAIN SPECIAL SPORT SRI LANKA STAKE, ROBERT E. STANDARD STANDARDIZATION STANHILL, G. STATEMENT STATEMENTS STATES STATISTICAL ANALYSIS STATISTICAL DATA STATISTICAL METHODOLOGY STATISTICS STATUS STELLING-MICHAUD, SVEN STOMATAL STONE, E.C. STORM STORMS STRATEGIES STRATEGY STRESS STRUCTURAL STUDENT ATTITUDE STUDENT BEHAVIOUR STUDENT SELECTION STUDENT SOCIOLOGY STUDIES STUDY SUCTION SUD SULPHATE SUNDERBANS SUR SURFACE SURGES SURVEY ANALYSIS SURVEYS SURVIVAL SWITZERLAND SYMPOSIUM SYSTEMS ANALYSIS TAIWAN TEACHER BEHAVIOUR TEACHER EDUCATORS TEACHER GUIDES TEACHER ROLE TEACHER TRAINING TEACHING METHODS TEACHING SKILLS TECHNICAL TECHNICAL AND VOCATIONAL EDUCA TECHNICAL ASSISTANCE TECHNICAL PERSONNEL TECHNICAL TRAINING TECHNIQUE TECHNIQUES TECHNOLOGIES TECHNOLOGY TECHNOLOGY ASSESSMENT TECHNOLOGY TRANSFER TELEVISION TELEVISION PROGRAMMES TEMPERATE TEMPERATURE TEMPLES TEMPS TENDANCES TENTATIVE TEREDINID TERMS TERRITORY TEXTURALES THAILAND THEBAUD, SCHILLER THEIR THEORY THERMAL PROPERTIES OF SUBSTANC THREE TIDAL TIDES TIME TISON, LEON J. TOOL TOPICS TOPOGRAPHY TOPOLOGY TOWNS TRACTS TRADITIONAL TRAINING TRAINING ABROAD TRAINING CENTRES TRAINING COURSES TRANSNATIONAL CORPORATIONS TRANSPIRANTS TRANSPIRATION TRANSPORT TRICART, J. TROPICAL TROPICAL ZONES TROPICAUX TROPICS TURGIDITY TURKEY TWEETEN, LUTHER G. TYPE TYPES TYPOLOGY U UNDER UNDERDEVELOPMENT UNESCO UNITED UNIVERSALS UNIVERSIDAD UNIVERSITES UNIVERSITIES UNIVERSITY UNIVERSITY COOPERATION UNIVERSITY COURSES UNIVERSITY CURRICULUM UNIVERSITY EXTENSION URBAN AREAS URBAN DEVELOPMENT URBAN LIFE URBAN PLANNING URBAN POPULATION URBAN RENEWAL URUGUAY USA USE USING USSR V VALEUR VAPOUR VARIABILITY VASAK, KAREL VEGETATION VEGETAUX VELOCITY VERSLUYS, J.D.N. VERSTAPPEN, H.TH. VICE VIET NAM SR VILLAGE VILLAGES VIOLENCE VISSER, W.C. VITALITY VOLKER, ADRIAAN VULNERABLE WANIEWICZ, IGNACY WAR WATER WATER BALANCE WATER YIELD WAVES WAY WEINRICH, A.K.H. WENT, F.W. WEST WESTERN WESTERN EUROPE WETLANDS WIDE WILTING WIND WIND POWER WOMEN WOOD WOODWELL, GEORGE M. WORKERS EDUCATION WORKING POPULATION WORKS WORLD WORLDWIDE WYNTER, HECTOR Y YIELDS YOSUFZAI, H.K. YOUTH YOUTH ORGANIZATIONS YUGOSLAVIA ZACKLIN, RALPH ZAMBIA ZIMBABWE ZONE 86 Higher education and the labour market in Zambia: expectations and performance 87 Innovation in science education - world-wide 100 Micropolitan development: theory and practice of greater-rural economic development 111 Multinational corporation and social change 114 Educational development; a new discipline for self-renewal 118 Seminario Iberoamericano de Pol¡tica Cient¡fica y Tecnol¢gica^pAlcal  de Henares and Madrid^d1974 124 Meeting on the Implementation of the Recommendations of the Third Regional Conference of Ministers of Education and Ministers Responsible for Economic Planning in the Arab States^pCairo^d1976 127 - 128 - 130 Joint FAO/WHO Expert Committee on Nutrition^n9th^pRome^d1974 131 Measurement of scientific and technical activities - Proposed standard practice for surveys of research and experimental development 132 UNDP/ESCAP Regional Meeting on Technical Cooperation among Developing Countries^pBangkok^d1976 133 Consultancy services available in developing ESCAP countries 134 Training courses available in developing ESCAP countries 141 Energy for rural development: renewable resources and alternative technologies for developing countries 147 Employment, growth and basic needs; a one-world problem 149 Symposium on the Psychological Bases of Programmed Learning ^pTbilisi, USSR^d1976 150 Micropolitan development: theory and practice of greater-rural economic development ./tpl.c0100644000113000011300000000321507447676141010654 0ustar kripkrip/* openisis - an open implementation of the ISIS database Version 0.8.x (microversion see file Version) Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA This software is dedicated to the memory of Eckart Dietrich. This software is inspired by (but contains no code of) the iAPI Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl. See iAPI.txt for what it contains. EOH */ /* $Id: tpl.c,v 1.7 2002/03/25 19:36:44 kripke Exp $ implementation of general db access functions. */ #include #include "ldb.h" /* ************************************************************ private types */ /* ************************************************************ private data */ /* ************************************************************ private functions */ /* ************************************************************ package functions */ /* ************************************************************ public functions */ ./.nfs000142a4000000010100664000113000011300000007510707447610241012175 0ustar kripkripPK*gy, META-INF/þÊPKPK*gy,META-INF/MANIFEST.MFóMÌËLK-.Ñ K-*ÎÌϳR0Ô3àår.JM,IMÑuª ë*h—æ)øf&åW—¤æ+xæ%ëiòrñrPK 2ÇDDPK *gy, org/openisis/PKwr,org/openisis/Charset.javaµWßwÚ¸~¶ÿŠ©OLƒ“%›’Sš&-{²MÛÓÓæA¶V16+ÉPºÍÿ¾3² $›fÜ{_Y£™ùæ›ÑŒh½´­lÁS¡„‚&°è Ä|‘ð9O5Ó"ý è˜Ã`4AÄ4 ˜â¶õ.IÛÞ‘×ñ|Û:Ïk)¦±÷¼ûí¶ßÄ?û¬áBŠ¼•ßÄ*ÓßÀñóUå×ËäÔ¶­qŒH&׀ˉäT6Ñ+&yÖY!â“<JK䚃Ð9jeÒ¶æY$&kÚÉÓˆKXs9Wú·ïoáŠ+…²·<å’%p“‰mëJ„ Æï®oÇÐÿ>ô‡ÃþûñÇ.Õq†R¾ä…!Ê®@»‘d©^#jÛúõbxþú¯WƒñGB~9¿¿àòz}¸éǃóÛ«þnn‡7×£ `ÄyE.Òø»0A‹ó 9Œ¸f"QõGLªBpI1[rLnÈÅ¡1±˜þIê’,šPQcKeÄÒL7`%ŒÎþœTÛÚfµƒ4ôÐ9†1§K7 1‘£œÔÚ x)M'í´÷}ßoúíŸnGý*‘UÙšLbÁ†ŒòX:Ÿs¤ÁÄvΘÔðFpÌu{O©‹T-„,êÑ¥$‡^KÜÅ°pq4T+ÒÚ¿whÄ% 57 çhä~ËÇ2”ÍÉ‘â¿Kš:–ÙJÁàúâkÈM7´-r÷î&V[‰é:׋\#‘œÍ ‘ £µÒ|îak€s;¾l9@þv  ‚*zÞ½„§Sã7qYEv€£§Í¹O‚¢·¬•gz„ ¼î|wê.A)λeÄ ^«ÕÏiéúÞ&¥I’«Ø-c|ˆEB…ý|ô›ŠaÒËÖ/îýNs‰©w¸”™¤E³îl˜h|§‰TÌ™¦m–ˆiÊ#î 盢 ¿ ÌUuÁ‰‚VXpõµŒûÿ1§hƒHQžâL†1òÛ€váÈÂîìBšã,;ÅÀáûwðá®J?• «L?’à-ЛN(Š€E818õ´î˜ŽQùÇ-^z°¨w‰4çæ‹Rf y²€„% ³bøÔ¾{ “|Bhf K0Ÿ¤„mý#@Æã>œô¦\_aŠjDÅí^ žDnûG¿ö×\Mè$¾‡Ò‹Ó¸‚ <‚´eÍ$oâi6%˜/¸ÇËY¢\Ü[bú»±<œº1SwNi…ÊFÍB¸ÿþ#àþðý-ð¿ Ñÿ¿@4`^tmÈ{²ý™¦3À\(l aü_@*Ç5øš†ŽËw|Å\߀›ICHqRe3ãUes¾m?/?¡GŽ¤×Yã_üõ}Ùz˽;‡étw+ª¦¶»#.Œ!—ô±Óúp¿UüóH‚L­Ðή<×ç%Çáþp©†P ÑÒñvŽ°à‘»ÍÔ|ÎéƒfVµhÎ"úÝ¡Z¹™€N/Öóä¬cS;Ãy‡²:nÎñå±Ö‹&fY,O?;çX.ø3±9^/øg§UIâõMN׉âq¹\NÀB ÜXÄ Âã(–’t4JD,´ˆRòÀ_,}¥“X¹i"I%`Ù?Šâriùj´à/ièËØ0œÈxªsîßvïèZjµ·2”±¨—ºòÊ¥kåÉPKšfüIO¤Ï\ó±+fc±AWÐR$ÖAyžéáØ©ç´2À*E1UDÂÌÇÐ,ŸÛÇ x£ì¤³Eú¥>©Ð€N 0<B>¨ WRªå( ªå¶Òá»Û»!µºïéV¿ßêß7°5™DX•siغ ¸(a²×åÒM»ñZ¿v®;Ã÷ÌùUgØmtuÛ§õZýaçâîºÕ§Þ]¿w;h;D)såBÛ´›ë‚F@œFС/¡ÍR¿‡Q5˜ |šˆ¹„q=©æ`MgúÓQ86¢âÄR• R# £¤J±‚Ã$Ñ—F-—–V­R'ôœ*üDCÉA@½@x0ä åã¯^Õªôk¤ÞyÓ"ª×ëõÃú«Úk¢»A+7dî¶Æ’pXO°3âS 5ÙÚÞ½ˆºT¶ö&ζã*Ô3[¬°‘½a‰¯ ϾО5k«×Ù„5>Ù\ J¿‰0Õˆ¿ø¯7ÉO©ò”s‹ûèÁ™N¹ÄÖd'yLŒ½2oËi:åöí;Ú?*—Ë3æÇ <’å2|+¡¿Ä\8*r:·íGOÇo¬­¥‰ œ‚@$QŒså£ýýLz/ZÃf±ÔHAš³’ÉO¾ëðÛKRøÀF–âQ(9\Œ( ¶›³ŸË¥çÿŒ.]‡¨Î©îœ²~Žj¯Žê§TuvrrV;¡ûXÍî%µgô¼\z“‡÷ó¾œ+~:3'yI¤ˆ¬˜èyË<œåGŸ—¡¢™uá"Áp&Ö¥KÿÀÌÖØÌ—#‘ˆÍ¦TáÒ~‰W r :i߀kÏE‡xÖÜžžžütX†í TÊHiV„G#B9Ù±ËöUëîzøßv÷âö²Ó}Kçk à ŸDÄ>Á瑲³±LÒ8´®§‘=8úš¾B¶}ÓC­ŒÂ>¬âËGÒœÂïå‚äßlÁ§Päþ½ÿþ¿ÿn¿oÿ˜Zc+ÝIe#§Änªù÷ŒËƒPA>®|]ɽþm¯Ý7Ä~ʽp¤$jÍüŒ&Rä)gÐ]H7ï®ÙëȤ¹(Ü Ñ(cª ËÑH"ÐŽ¢~7“7—d Ÿ„6ÜUTè©/uÁ4Sü´åúÕ6ètÝzèá,¾á'ØŸwì‡Ý`ß¡R‹w²o©Ý’Z°×ÛÀl°" ¦"IrÍí†ëX›œZ¸ ¼ú.ªá]·ƒdÚ¦wÛkÇü>DR‰‚‰¸jKßLúÎNBï†wK¿ú‚ñS¦³ÌÓ–T¹TÚ ¢SBèMD¬iKÓU¢ED3zr²ÆËÓ…Â2ÓYºË̼ffZƒ‹Nçûù¨¿þ.>ZKcêGØ3è¤é£²´? RÍãŠi!8Bú¨küçy»Ã£×[^!ï&Žž&ƒbþ-t+6Þ ã§Ó©)aš3 l€ä —áNÈËÁ2·C¢ãXGìîFì–ÿ…Ò!b8Œ h÷Ò·±¹ô;q¯o/. òÿ¨ÙDôp£gÐÍ”YôuÙH™uw£(¢ŽV;1Ù ÒH èy6ÐÄ%îP' ¢™ˆš4igåR3 Ðç5õó¡ïÒ‹ i„X|1NM7ÆJ‰Éð'î¾ ²¤ù Œ…6“w€™æ€ ¸™@]bH~X4ß¡“%œÉtÏÒÎÓ,‹–¨Ä¾™î8)I´%Ø&âJ F“i‰[‘ÙÕÑg‡3Ý¢K¹ìÍ gš´`…5-ž1ÝH+tufuýXÞvšÓxY;ËÞS4¦,”™D™‡E‚žºè]aÁÍ.sƒ»\Èw×ù›6ÚxÎ.è7sp»‹…¹Dç JÌÆ ú‘1ø›UÃÑVÕjp±­ãq•'Ã1p1ÉåÃôŒcÖñ«&¥wlÀé0kZœÙlx7UÝœÍ%¼=³;4²ÆÞ*Dâ3Ư­9mKÏ\f\fyF ì#ëU;ÑNÅ‚BiIfÆdö>¦³ðÑä¡ðçØ<2FRH<§¢‘¹®ðÙ)ôgöð€N3?O†OÍTnž ÁkætÑmaiq ã &ÜœG›Á¥om n„žÐË×]n*)ÓiW5_CØ‚}ÉNŒÊ· ©.FUsƒ#¹Î" ·dȈ÷Â,ìâgVɦ*IØX… ¾¹,±ÂFqÁ‹‘’ý3—̶±V2ã‰y¤½¦®§ˆÇj¦WœGŒrúŒ“ÍS< 7šÛÛAâ¼;ZI†zæCw!rw4Õ§/×M^QãÉaôÆŽx@åϦ•4„Çñ Äé§(ðSYLð,_2‰£‡pGÍ“¦N´\‡¶¥§Ð ,è žÛs³Rl`{³CÝ……í,¿{¶5`ÌŒJ>^Zï­f¯>²ëjÚ3An¹º]ü‡5i"¡$m¦«ûa ¦‡Ô’ç4–¼ëWˆýþu¾¤Ub£TL­S絩&/9þq2ÁëÁÝf?+²í3ÇLwºb >¨´G/^¢&­ ëÛ£Ìù&Q5²i W˜É]z§*«Åá@škœqçáû°»Â‰œ\¨ïÜØŸ_?Ô?6²Å5^¨ð×½—­—ÙgÞh•Y!·šIpP‡ Ù«âå‚ýü™$tI™&lAئ‡U‘WM‘Ä©Ì :‘SGƱ3IR#ØR²) :¯-Ò–sø¿3¿/(ðÂ/T¹t÷Œ&ìÇ »Kµp¶¥ÝÏ–;óÚ´u/è}fAØy¹óY÷j°Õ·º—Ö‡ðŒz]ÍC®ÝVöƒàÖNü/'¦*TÓtÊa1s8Q¸òö ­¼œ­-Ë°óŠóZ•4ÿ Ϲ£,!W£³‚Yšbe?\T7×ßÃæ*`f;cc|þ á?ç†ä‡ðcaY†ü عÌ.öÛ·]¢ý’°¬É0–@ñ‡=uêÚy9áË . £µ=.ÈÛÅû?ÉÇ}ò™ÂŒäÒ0¹Mè¢Ù3ç¸ÇL¼ ¸—‹Îù¢“xòƒÝØ——‹æ††ïݳ?ÖðÕ[q{­mûÂX¥¼¥Š—ÝxäɃê?x…† 1'bobAa»]yÞ4û G¯V†7#øæÁüOÙß‹£ÙÝŸ11Òð?PK.8>AØ $PKwr,org/openisis/Field.javaÅXmsGþ¼û+BY’×’)‡œeùPŒ JÛeË$TŠP£ÕH´ÚÝì‹düßïé™}“l —»º£€ZÍt÷t?ý:³÷Ô¶‚Pú*V1í’ð‰‘Z„ž\H?‰ °6¡d&ip=¸¦±HÄHÄÒ¶ÞÊ(æݶóƒsàtlë$בšÎªŸ4h¿Ýîìâ¿}­é4Rsú)ú¤VAò©E?_äç:A4µmk8ƒ žE"Z>'‘”“d%"Ù¥u’ ý"9Vq©QšHR Tï‘m-‚±š¬y%õÇ2Ò '2ZĹö?ßЙŒcìý$} .Ó‘§\Û:S®ôcI"¦—♳ÖÌöŠÕ¸ÎÔ W¤kPº$öqò2Ãaßéäge[DT +Yæk@ã5yºQÆé<`}i䘔¯…Î> F®”çÑHRËIêµl ¤ôË`øúâfHýówôKÿêª>|×i2 °+—Òbï*È…E‘ð“5´¶­7§W'¯ÁÐÿqp6¾cÍ_ †ç§××ôêâŠútÙ¿NnÎúWtysuyq}ê]K™ƒ B7Ç‚&¸€áX&By1[ýN¡œ7¦™XJ8וj Õ¹¦Çu^àOµ©à(¡ì’š$-ZE “÷j[¥W[4ð]§Eÿ ¡ä$ KO¸päuÊìÏžµ[ôc'Lù¦OÔÞït:»gíçD7×ýÜ‘yØjO"`]Á~Ì_HÀ m;uç"J襒ðµ;sbW~ªÈÄcìHK¬Â,|%5Œ[û—ƒ’°ÍœWÁH⤟…ŸÆÈ¿èã‹òSª\åÌ#1VNè9¶ÅÞd)Nr›h­²hËÏtìÓ‹×ôt϶íP@ù)N¦NžÉ]ÛFl8è£X 'M”ç\Ã4: æ ù$£.ííQŒøK cï)ÊÏ+%áþû§(K,‹FÊC”ìSÆs¹R‹EŠ‚G!_R7I#8+#F™Ói)¼T;_P"XÈ ¡0 –j,cøù1ŽµÁø· ;K¸.".÷™àØGá±m=Œ«ÖZRÇyÎHïﵟíu~ Î³ÃƒƒÃöÍ#Î%Þ†ôĶ^ä…âÉ•\*þ:Ôœ¼%Rè=éëÃœõ‰ °C“H®' 1þO giø,í#A1ì ½Í…’}–•É̈·Œi$’ Ö‹PDbA£¥ÓÉ„ 'P =ÇkI¶àH»¸ÚuƒÐÝh æÈ 9F{â‰i Vk,'Ê7ìåˆ+µi0ÌŒŽÓQ¦í G¸(ˆµBñV:J™J Oò~çûâßSd>LF€1¡ÏÐnË„v¼¤Ëÿ@ɼ‘Dˆø4Š†šL Âü]y‹zËJ­Ð "ùG*cD:Ó#ÂP-à+sIÌáêÒ(< Ó–TßÄrÔ"V†Ákå¦hËÌ:›Ð€/- UªNmzÔ£úË‘óæ×ÚÑ\ ì#aV_K'Çý#¥«`£l êÁNÜÀ{Ñ Zt½ÑÅ>\°ãßÞ“[¡;ÁR`]¥cµ\¯ç:RÞ`VƬuþn°b¼Á´AQö\¯»a“ËÌbíizÅ2›4QQœp3¡¡”tLÚÙ¡ÚïšÅý­ýžzß  Â>d݇üYò}¼ y¶IC˜ŒK/D4Éq#ÜXxRÄbHìiŒ€wôn7³-;ÛõXÓÇUÃK—:é 38`Û#¶-h6aÎU姲ûŸÕT„Ž")æFâÿîi qçàtÌ£~p¦[öša5S¨%Z‡cx$ó†ÖXæÞÍ&Ó²T­ÒJƒHzr‰¡BωºF'y&º °èE¹/e&˜¨BbšÅãc„Ã÷Z)þù¹GíÛ þè•€š=¦íÚÖ¶0¨Ì‘4µd£0›Ç¿sµ³x;Ò(3I4§¹Æ¹¨ Üw1$kPåɾ˜AÇÛë3†½ž}f¡×­RªŒr@%> D×Ö”¯‡79%>@)8Xˈ@oF/#® Ás™Ä‡pq2ؽÜÚGT‡ÞŸ?ã¤FøÈ1õîÆÀŠlÞÝm<2ÌÊjžZ@ Ï¿cÀm–xr‘±+B©Ã³n,ê—õ+ úOêì?§Ã á $lîÂ2Ißôýð¶vsš×#Õ Ššu åÚÝ2>WÏÔg<!ŠOàóðÄŽ ØÓã"òÄÇ£W׳‹‹ËCʲ^5›Õ¢¦èÈ$‡1ûZó‘îoê}#‹¹©;ímŽ¶ÅUˆjk‡d¾vð¥ÅAƒW[`Pém°ëµ¾ž n¹0²‡zéè–“ðö¨ösMo´x£æÔò±Á²JwPáí"8î{¨Ì è¸YXiw—â¹Ò{¬9󆉤1m’í¥¬Á@c§qIÑãòÍ Ø}UL(cèÓ<-4mÆÈIw®Gl¤ã£ÝP¨¨Ô «y+½¡tØ#],ì-DïLM¸˜i†bãÞ#Ó÷²) +ïàïÒãã»(&Û ±ªÇ{÷¢õ®Œ¾‚Oi>m—iÎ[ä<ÂãÎ'oóÕ-Qÿæš^qWký—}Æ÷*.¬DìßócY†îtÍ1Ï/ËÁáåÙæ̪§'þ½‘ûe~Me2\‡:·ä.;f£*”t×ÃþÕðÃåÍùÉð¦?\œ>@tzþò[$'çç§'Ë«o^ _ŸÞ'ªF •S‚“w‘mb§¤ÖØmN$wìçevÎ.ˆå ÃÓ.£¨/–±”ôݲ^½ µP®[f?]î2i³dá×»ìzj0ß¼ñÁùÜdª‹õìÊe®Tõ5é™1jYç+¢™òZùÍ°ÍùÀ5Ç[‰u¬m¥Õ^9òëæPb1B±5§é{œÆ„•Õ°ìñ?Šq{æIÔë-›~(SÓyøÝU¿lð£XDa„Æ­ÍZÜ2ø[^ûýt1Òw&Ï5¬P"*Ráyk~ÑC8—WN(ÐÝZ.Ÿn°Sì™çzÎô¡U¡û9„­éé]1dõô6£“­_ ÌS yLò“àxSKM»³á©W.ì~êéK™º}—Ž®Þ*˜¸[„Kñ l„L±QgQ-zü{–¹“ŒÜü»ã©Ÿh¾g¾×—yXÉ Äí.©£I~¡GijæÅ¢x\™C&ùòÖÈ©W¦+m$ "S¡<¶Ñ¸ñ¹e£5árYQ,…˜’ýÞOêíFK3åØ„k§a,»+ƒy’GpþDXÍlqú¯š^+¹ÿÊ“MS¦šÉUó”£=ӦƗjÐÿZÓíç¤/©¬)¾®´ˆ+Áø·Î2 À‡ôû %s#Š‚ùUÃ0ûU‹!†@TÖÓ7—Ãwÿ“ïyÂhûÍ ©t­ÿžb¦ymk”½.lu ý©sØþPKߟTU PKwr,org/openisis/NativeDb.javaÕX]sÛ6}&Å­6ÓJ±LKö&Ûµã4Jb'Úqmlo6“ñt ’`S¤€$+mþ{Ï@‰þh»û¸/±â~Ÿ{îevžÇQ9“…2ÊÐ6‰‚ø‰Ôt–Ë©,¬°ªÄÙˆìDRÿ¢A™°b(ŒŒ£Kmøm'ù1y‘tãè]9[i5žXj¾kÑn§ÓÝÆ?»4\Ñ‘V·ôAUËÒ~m“Äã›ÊnRêqG—¸«¡zEø9ÒR’)Gv)´< U9§þi™)cµέ$eár¶Sê8š–™­ød^dR;‡­ÔSSyÿáôŠN¤1x÷AR‹œÎçÃ\¥qt¢RYIÂÐŒÌDfì5‹³Á :.¡Ý%値Â{X^„<ì&ÝÊVPئRSSXv^#³,ׂÇ+Ê|£ ™<ý&ÈŒTá”N0ü€:¹TyNCIs#Gó¼G¸JŸú—Ï®.©wú™>õƒÞéåç\µ“oåBzE\]½ˆH‹Â®àuý|4x÷½·ý“þågöü¸yztqAÇgêÑyopÙwuÒÐùÕàüìâ(!º²J.ÒøTv«\Ч%r˜I+Tn8êÏ(ªsyF±(n*Õ® J¦ÿ¥tyYŒ]¨Ø¤ò€ÔˆŠÒ¶i©cËÇE£MUÛÔ/Ò¤M/þI—’›€Îs‘¢sßÛë´émi,ßü¹GÔÙív»ÛݽÎ?ˆ®.zU!+غJ°©à:ãS‰4¸ØŽÒ[¡-½WµN'ÉSâª03¥=›\ä´D[âaáw&¡¨åËÚ;ï?Ñ„–”C KÿÅÜ ÿôÍ›ùu®R•Üjq[.“YžÄW“µ$öκz-Ú*›I|tö‘žïÄñLÀ÷1ŒëqR5òAZ%ì܈…HT™ôÏŽîRépððݱÊåii]îÿøÖUaæ3>‘ÙQpU1þƒËs«ò¤¶¶ÔO¼:-/æéäÈóZMGï<ŸæÂÎ:ç³"ò .ô·Þ“øÕdïu¿0Vä¹{ûj¬ Ì5\µª¥œ¤$©AÓ¹±Üºy)21Ì%VñW§ýÿÐÅÊX9mÓTÜBÇ\‡ŽgFHë«4%¦Œ#-Ê$Ã2%µ .p˜Ýp˜,J—A ¡[Eë¼ÿå¤ÿvÐ|þå¼wù‘;Zv¤Mwò ÊT}”PõGŽ}oØïL—3Fßœ½XШ©Ê…fÀE|{*V¾§z=/\GO§`kø†ÐòŒµ«1r8{íðIY¹4mP°¥uŒhΔS¹ÕÊŠ ÙÝ ø¬ŸíÓ©« ÂÕn/¨›t» ýÝÎÞN÷Gêîí¿x±ßyI·ZÍ`üènFÏâèMÅÜÏr¡ø×¾åwbÖÔDÏzîÇ~%û,ügžÚ<*ë$ï¬,2FýŠVžiµ@ß“aä¤dVE:AÔWÆc+Ž@~iá†n“.@`±lXˆ)sŽ{ürMB µÕPI &H”ºÔ®Äº\ª (¢çyOãvŒ3¨)Ïžã<ð†++¿\·´QE*i ÒÓS`¹rMùöA ££l)VÓVŒ¹{˜˜Ä1Äyð± fdksÆb¦DáEÞÌàÍñ2v‡Ţ`)ÓÒÎuá̹©ßvÑúõ÷›âVÐt„ÉÆnÔœS¸ ËAåeyëØ ,×F¨cŸ/>A<÷$Aƒk9Ã:RNCÎ!4,Y ðo½÷š—(¬Žáφ7èH³ï.D¾‹5ÚH™{×Ta ÷wÎS™g˜Wà¼Ù—¼q@­àëæo”Ä}P[„\•Ì»gÀîÛÆ!Z¡Ò{ ícmP.MÔlØfg½þ'~ ¹– Ú}É¢»kÑ ë¦…“µËr-[Ùm |{(*ç[´E&ê­[VÇ쇤6îñ[üðèÿþ~àŸú9ç¦P`ñôìí{c¤ |UÄáMÛ¬W“5QÀJû/öŒ8Äa¨¶¾Ç'žKD%ÞK íC¿½4×Úªe%à¿,âZë~zž\þ›Ñ dJÓ[?wÖ#c8…RlúêðÐ׊Ëçθ *ãnmº‡®~é\‡—aÄò•pzÌcB£Ðàþ™-„ŽÝî’»XïÐ.wèæJ­UG_Ôv÷º®«éŒ©ë6YŸsŽÈœ_h‹–ÏZ„‡f5jG~ 0 y(óŽ³.3çk3©7Áùt….¡ÍõHoº!”owÃNÓz8lXµIEñ@umô?š@ÿ…='È9€Të±Q_»õLLòº­0ÿ½ Ö‹»­özä×uû×ê[q³)ñÕ+sæ—™–#uǵ©ƒ±ÂQqgy©¨ôßÓ¼öÝ«¨¨$h4ØWÿ°ÕxÖ¿Q6,Ë\b œsŠ¯ j÷& wf ü³ncÕ  çò`#æîu6¯G"7þ=¿:˜f§B߶ýGÖšT÷e0,§C¾ÊFÃçÓ‚j;ò­wçOÞÓý{x¯7Õu˜úú·ß¨K¯ïågq°š} „M,ß6uêûPHF=;¬h¹‡)þ®Ê<ÏjÚÐ×Óÿ—ÐlÕ =jq8³µuMŠ¼(ѪZNK N¶^³S›Lg3ƬÔÍë©{ <Öë§àW#˜:X›ë[¾aÕT$þPKAï‹o )PKwr,org/openisis/PureDb.java­UÛnã6}¿b°P;PäÒMí¢ˆ6k'*²¶!Û]Ehil1–E¤|IÐïP¶âÝ­ûP /Eræœ9gFj\2Gæ˜ -4\ÏÀ¾Xç)®13ÜI{ 0 B0 &sÃç\#sþ@¥íiÓ»ñ®½sîd¾Wb™¨ÝÕ¡Ýl¶®èцùúJ¬à^½ˆ­4/. ½ÞV¸žTKÆœiBR1W\í– …Z.Ì–+ìÁ^?…±ÐF‰ya„!ÊqC*æ¬e,{»Sd1ª’°AµÖûûá Qk:»Ç Oa\ÌS1çQD˜i®!·[:Áز¶aKcr¤IÙKQz€‚Î ysÔ¡íµ*¬cB¤‚7–¼"em\ï!åÄ Ž‘Þ™êOEÆ ²2iB‚Ñ‚ÒQ‘[‘¦0G(4.ŠÔe]…¯Áôa4›‚?|‚¯~úÃéS®šDÒ)nðȺ+(/U¤xföÄš9_úáÝøŸ‚Ç`úd™‚é°?™À`‚c?œw³G?„ñ,&}`‚X‰K2žS·Ò”q-Ià ©¶U?‘©šÈ¥1$|ƒdn„bCÔ8DÔLÿǺTf˲TŠ8IÙ±€L¶JPÃùoS™srÕ… ‹<®)Ú!€qÊ#2rRØðN§éÂ'©½ùÅh¶[­ÖU«Óü0›ø•‘UÛ–NRÃFÜúx_#ÉPÖÖV\ø,¼Žï\¸Èt.Ô¡kÖäHÒXÒ.•Eë)Qý`«?Î aÓF†rŽ„ô;Ï Mó§žoŸñ¥‘ðVŠ¯äÖËS9ÖM›Å3;Súµ=v[…é±þè.Œåœ¸/ \-½j{ŒQkIÂyæî é£þ.²ï{?ž DŠCiJíÿãVaDê4)ÜHEÙYãòò(Q”r­­>¶ò¼ ­lÄ™×áâç9•7˨&SddFºw©®ŸHjc‰¬¦1èÖدùo̹â.5˜BŠ²YÝ ´¼«e»Ñì4Z7Ðêt¯¯»ÍŸa¥D¾Bèïr¸`Îmõ)¸q#ìª[FÚ#^Ð*€ ¿\t«Ð Fræ‡Q9p= î f±¥¯ÔÇ+ÇÃL¨e¨ã1‹ÜjÏ3¾ÆêõÏ¿€«¥†:s“(¹ÕðÌy¥}]ä¨j6 Ô{Õ=Èp ³ŒÎ¬rkż×àƒ–J‘†4Z'Í1þP¦ùûD7Ĉ†šÇ!¥­Q/ C^ßÎi4JJö=²¦ÆÈn¹4|ù¦šíõw§c‘¿£C¨dˆF®¢ääÞ ÷Bk;ÈïÏ¢„;‘¨Féøc|£‘+\ˆÝûâ3VR8ô+ûPK²¸îìhPKªv,org/openisis/Rec.javaÕWksÓHý,ýŠ K™8ŠjvfcÌ`Bo…$e'ÌRKÉRËn"«]-Ù&<ö·ï¹Ý-K6™©ÙªÝK–ºïûžûÐá#ßS ‘ËBt@QNüFr¾ÈÄ\äeTJ…³”Ê™ áx8¦$*£ITß{+tÁ·ð—ð§°ë{'jq«åtVRpÒ¢£N§{€ÿŽhrK§ZÞÐ+ýE®Uù¥M¯Ï*½¡ÒSß÷®f0!“é[Âcª… B¥å:Ò¢G·jI1ìÓ"‘E©ådY ’%LN•ö½¹JdzË'Ë<Ú\ =/*ë__Ó™( ܽ¹ÐQF—ËI&cß;“±È AQA >*f"a«™í%›1vfÐKé&(=÷мrq8 »•.'°MJS•l¼Fd™¯‹o)‹`9Îðïk'’¹:CÀðqpr-³Œ&‚–…H—YÛ÷@J¿ ¯^_\_Ñàüý6çWïz -g ·b%¬ ή„\x¤£¼¼…Õ¾÷ættò ƒçóáÕ;¶üåðêüt<¦—#Ðå`t5<¹>Œèòzty1> ‰ÆBTÁEïŠn J!q®ÃD”‘Ì öú’ZÀ¸,¡Y´Hn,ä ¦ELÿIê2•O«à¨CÙ#™R®Ê6­µ`JõcR}¯Îj›†y¶é§¿Ñ•à" Ë,Š‘Èñ’Ù?î´é¹*J¦|3 êu»ÝƒîãÎÏD×ãA•È ¶&“lqò¹@Œo§ñM¤Kz!rÏ»Øe^,¤¶x 8ɱBYâná9Ô²i\ï(ÂsŽÔD@Óߣ|Y þô§gŸÄ—¥Œex££µYè{œM––ŸK“¯µC[¥3ôO/^Ó£Cß_D°} åzV…ÜóýÃGh(#+ÜÑD6æS´Šh"óDæÓвxê{†É13ä»öŠºáÏlýÑaçñáÑñi¹Ñrq#èôó‚øÞ³ªøŒÄJòÓ±áä«h Ük¢óp\±>ðáÀ‚3΢¢`µôÁ_h¹Š¸­ä%iµ–I¯>{)E–¼ÿ@)ÿÂUWVs5ÏÇöíGjAºç™[ê;*Hðì=Ž!ξû¹,q*Ê‘Z åQ.uîL£IÏPàMB+6ÌD>-g[ ÆBf±Ö|I?ð¾—,k@fŽ©™ˆK¥CvBé9P¢rƒ­pÇK-òX˜æ9&À?¢1žOŸ/ÓTht-o.ç2¾ÁQ=aÞ抎œüg‹HGsš‚&; LÑkšxåÀj"qèxOåçcüÂ?ÔP*u^€ž€&Œ>µ@£»­åh–£ÅB˜²Ý2);‰vÊU£ yž©Lô£JËœëSæq¶Äïåe«VQFÓF<óåõIAXˆ²¬Ag$¬ ‰, žT ¬Êítx1¡}7^@U,'Vj<‹t- –"þÝ¿‚ß<#‘'´—•=þ‡ ¶£ùQA§ƒ)Í\rGrA¨hÙÌÐràÁä¶EËP‚_åÙ­mÇN¦ãæÄ{"3m;£å‚3ÉQ ­,Ì4¸ž]œœ˜.Äi pÞ8b¡Í9ǸŒÄß¹´eÓ3VgÌ`Pð¶è‡+Þ (ZØ‘ÈêDÏØà†J],ÓxÙD”ò0ÿ}< Ç܇q#Í1+h"wWÇFƸëh ¹®lYŸCJÏÖ&ó×idâB¸†ö—U°U‘׶üÑ*›Mf…V±UƒÎ¥=1å×vצ†øŽ¹ö¶açØ'ØcÁ†ôF„ løêÄ08úJOŸ>EZ{æy¯OÏ)þô™Q§G‡‡MìÂãÜÝ'¦ ÿ@‘p l.±a¶106Åd[/pNLf@ѧƒ®‘Ä ¢…2o)hŸ(xs¶fðU›ÃÄnr‰]`,ýjÙó)E¡Üë[ ~û¶y·!²Rˆ¡lÞ¼è9…™R Sa¶—Û^]õú> ŸìL¹¿ï†•gÔvX·ª½½z „|àÎ9žÇëÌ—‚3à©ý}ªà‘ªœÙŒÇØ´Jö=ÕjN]¦éø¶(Å<Z‡ÑYÐ}ˆ?¦ûûøÙ¿ÏÌü¢¨ÕÛ6ŽÐr™tiË0RJc—!SôÄR™£m[mrdO-œöÌ#cÍqL´ˆnzd*Z°Q}¿U‘nøòX Ó «kc9#¨™¸˜[õû°a“`EÖIˆ.»wX3nÐÁç`:O ÆN:ý~ÀàØ00Z?ˆÒµ¨‰R™à/À›“‚Ü/Æßðÿù¸E{n-v,¡Ér>¿5bÕÍf—aœ¬´WóÜ´[ˆf†±`¢G6Qu¬> gWÖ-ÆûÃGïºiÕjKœ:‹€ò.ª±ªÝŠ¯­‹XÎ .Þ\¬Í˜|ôÁ¢Hßw>àâá?ö@ò¾Ë/“´v”÷jݦáv”…XmÅç‹40 l; 6¸WÓà70AÝŽ)WÌ9E“‚S#¼VÙ=—Ÿï›$ÝCʪ²5à«zw–”¿mèàŸkQm»Ï£ ͹MÏ`? ÃJÆû½ÌkÌuÁP^ -z4ÃR”ñ÷R)¦B‡oÿøøvpv}Zù¸UhÆX`Òõ†©*Òmüö]w»£¥T­v§h(6Œ|ÈŠ\tŸô]FElb}¹kç§Bd,µ¿í H¿ãdÆݪÝ8Ò(ÚnT'æûâ;G{å6l·K»ï³0×r#ºZÐeù°0føÂâLZ¢°± 4™¹&êš×«Ó7—Wïx¥àäJ¥M6°ÚvW·Ô[ÂÖ¿­ÛíýÁ©®Wˆÿé°½¥¸RoÍ\-dÛ•µÉcÍ°&õ¬Úi¬3ü+`Y*Wã-:ÞĶ‘Üÿfv9‹;ß8nSIÍ´1ä4þ_@¡‘Iò?“}jä¾J·óse›ÉŸH  S«‘#ó‹oyÿßPK‹.s3ÀPKvzx,org/openisis/Test.java¥iSÛHö³ô+^\©‰Œ…|@æÀ$3lïÃØf³T†ÝjËmÜ KÞ–Ì1þû¾×ݲ$Ï$U‰ÔýîûÉõ-ÛŠ–<±ˆaXôb± ø‚‡ KD„g3Hæú£þ¦,asÛú—1Ý6¼½·^Ó¶¢åóœƒ*´æ6þÓ‚Éô¤¸‚òq%¸Àñõ—”¯É Û¶Æs!ÉäàãLrq4Kn˜äm¸‹Và£|’OEœH1Y%D‚"Oë‘´­E4³;:Y…S.•À —‹8•þÃàŽxãÝrÉ8YMáÛÖ‘ðys`1,é(žó)IMh‡$ÆȈ‡RWFixœ¯Z^3åeºIpXBÂK´,áUQâ;ÊÓ+Ñ>Sr "TDçh0|@r¨ä˜pXÅ|¶ \ÛBPøÜ<>CgpŸ;Ãag0>k#h2ð–_sMˆ¼+.j$Y˜Ü¡Ô¶õ©7<øˆ_ûGýñI~Øz£¡'á¸pzÔÂÉéðäxÔóFœ§ÆE3–Y7µÌâ"BNyÂD“ÖgèÔ… ¦0g×ësq¢1ð1˜6q]…JUÄÈLÙ1ƒ0J\¸‘&‰;Õ¶2¯ºÐ}Ï…·?Á˜SÀIÀ|tähEè;; ~â„ ?u­f³¹ÝÜiüp:ꤎLÃVyÖgäGÃ|ÁÑ J·žÅd]ÁÑ×þÜ+Ca¼RÇ£CNö#LK÷ÆÏE×ß[Ø#LÏÚ°§zÆQ÷ØïÐǧŠw‘Ǻçênƒ†§õÀtN;ëÇÄ'{E³|9GÈ%Ž|ÔzÉÚx%Õ‹jíÚ±‘IÝ¡;c⎠8ž”ìRr†lè‘Ø—,žSŸÄi§†Ôב˜ 8š²oqÊ ‘º£ž°¡Q0Å‚?N%K­©²à•~k§ÍY!8lÇJ²ˆu, xÿN™x2#sCy ”Î d%ÌXaÿ(@éþ‹8/†©I5¦ÌH;…¤ã\ù¼$-‰ÀÓ‰Gº¨ têðv>¼‹âÈŒZëÁHiqœc@Q~E±ð¯Î=þ¿Î7N¾X`ŽW)“áy ãÔáÏ}瓦rdˆAýœKs3ÑÓcjfôü•”XúÍQRÕðž|'Bµr°홄â8Ät[ÅPµÞÄqÒÃÆ«˜c]™Æ•,e0ìžLI®h+3²-qI!¾([tãò„ìäj‰¬×ƒ¿m‘‡i"Œ‚€û‰ÙÊi÷¼3ÕzÂr!¤V1ZZ*âõ mªA¨¢ME°>§Ô1÷éx- »Ì¿,Øí_—]‡¾Š÷ð\sÌ™ôçŽV:ZÀ*¤Zª÷Ûðì¿Ø”{¿™èZBÍdN¸Î¯§s0¥ Šaú_Cé—Ô±&À< ó ¥ïh ˜±ÌÉZò›éA/†^I¦åÈ&2'™SbžØø¸ÜʵÛzž?òQ;åR žRË¡â’¨FZó6QIè]F"Lù¾¡ÚwrIŽsð±êäµØšPXÏhEìŸV*ílZàoq¨‘teq¬"ÙRˉ’+)‚®›ö7†ÕS‹D¹ôFðš£yÖu<—ä™ö]É쬱ý¨O«¹qÁ0÷lÐeò".´é쳜ûLÏÖŸŽÞ™‘:myL5<š"Ùh6‹y‚wÓ‰¥¯pºÀº†q¡ª?5<*ôJ ÿÓuåf.pBvݾ"³FÕç3SÆ_©«/ì\gIüY$s§²]©¦ƒ.CA´åÏ:åI«°7ä;Ùã‚£hLÆ_ÃiºôyKÇÊ=øjÊsŠ¾þN·¶pä¯Y­¦1 ÛÛ}¦C©‹L…íÅí­ùí ëÓ-cBÔ†Yw+¾J²5€Y=[Ùêiù »Ö›ù›½ÔÁ¸·¶a‚F¸jç!¦9ˆn)DÓ@`íoé¯~´ñÐGg21-ñ[õÞ”ÏØ*H4ZÃÞgºí”éFëôJ­Ó´ÚYë½€¯ZП¶ÿ†éçIÎöó¤`û”…I‡ç~Á;œ!”!Súý2[³H§òáVÙ&·TÒ ' n­ñŒ#‚xÐ1ÔDõTΓY%´¬—]@é‰Ì"úÍ9vá yH¿>©_mèG,«…þù$äê·!LM¶0$„Ç=LÒc­c«Æà}±j(!Œ¹r¶ÐKÁccä´/›è5 ¬çúâfXhéüþhn¬lc’<%æeŠdʪ<›Øgáóº®=~1JçcBUžv·w[nƪZª¬‡_cÖõR}>ÈË3eô‘Œjz,åׯx‰¯¼+ ]=Fè4–>¤eÂ즗ѯeë’£§Rì]…Í ‘]-ðÓ²ü ¹¬3†½ôuÔÿtrÔËe­Y¦a™¶û’Í p!»ÒUTÕð•ß“5¹ÒN»1³'cÐðÌ…Û#ª1åÉj£¿&Ð×/]$èÕÉ\—'ª²–ÑpÖRË'徚Ì%È35=8eÒåQEW ¡„û€V%Ü 4{èGB×ÜN@ù \|ÍÉOȺ(›‡V·©“ˆ¼[ )W£®²/DÝrT5\QM6Üó˜ š†;‡RCSq8ØRä9tº¢ªE7hÞI‘á¾%ê¶ .CÍÁ%_dMC=«Šóp[+ïÞîUAnå¶P£š÷YMŠ¶ˆ"ÛR#éûrx5á`ðtÔÖ]gš Õð DUÞÖ ÍPËððÕ˜ý\ÊEÝ­»ËfsP Šõ誮®ã½º¦këxŸõžót>ßyl0»^‚§—œyu/+kÁ§,lÔ}º9O V,¸tW´ˆÀËÑ£ØÐ0n‘‹â}ÑÀË8f¾IÀ!n[hì¦QíÌM4¢±‡ÆÍßOcŸá›ç,„ ÏœøŒ…Ã?'ÎXðPª,q’¢©‹(Éã-vð2„‹ûb…òdl6uÿ•(°„â`ã½–¸ËA±c¶&[›³þÀÁ–s°½á`;hêAòØká}S/ɯþÂ!9-!ål± pGÞêÍ`‹à,6Z(åõF x`¶ê(“Áz‚¬`lyä^´44Û Ï›íÄæVÞË«8u+2u=`hÁ‘`«*Ô§]¦¾!/Þïho̳wÞóؤDýÌõq*8ÔÔÁ=NÄ?æ#’’u½L7tƒ› ‘›T¦cnz…r²•†A£”Fxý0õÍùˆ^S/å•r‘óŽ;‰°Ë}½2v¡wcµE)QN鯤Ô×PÚ·c/ýîÁ½Ø‡NzôÒj€J4‰û0ƒûñ,:ðIΡ _¤yâä÷[èÆ«èÁ2µßp×ð0~>üGð7Å?ñˆÐpLøÐ/ <**1 ª0(Ú0B¸FE'=7b\ ã¸È!)¾Ž q )qi±ŒIqñ¦Ä¯èûö;L‹?ÐçëO8)Þ¥¯Ê¿0#®ã´Ô„'¥6ÌJqFêÃÓÒž‘’ø¤ô>%}Ÿ–rxVzÏIoàéM|Vú!>'½sÒ_ñyé|‰^V/Ê>|Y.ÅKræäHÈ»ðU¹óòå4.ÈXò ^¡K.J™´/9ÊžB!P¾ŒPŸ¹„¹.£¬£V×Lù Ê{k—¾´Zóß¡ù»ØL9üÁs<ÝA~X0/ã³ì5ÜjÖ½†Šoß0Öù]‰7‰~Ÿ ¼EN~@’ÝTļƒ¨tã‚’j¾ŠŠ (–y&HtŠK˸­y}ËeTv¬Ur³…Û‰©Þ­ˆr[äB Õ…—QÕGWð¶†ÚŒ\FM÷YY„뮾¼r­níP&=JŸPKý”úògÔN?G-5Ávü‚õKj¢·© ®aïÅJYo%„ì«-g`œ®ýJ½ð{Û`Ï:eÍ \Àà϶A³c°ß1ˆØÅÉ'îO׶2fËÉüۨF|ÉškgòÚE}¾l·=îu<ÞJˆY¢še”˜ÚK ÿ¢Qú­*Kö®jêÚê>¬üo¢-öwtßPKÇÁ de= PK(gy,org/openisis/Db.classUmsU=ÛÝtÓ%•XµZð-MÚPj¡ˆ„$¥+y# …R6ÉR‚i6l6@Õ:Óÿ èŒBGíÇP¨æ»èoÏnRXJf´mrÏ9÷yî}^nï}øϽDŒáS/æ½ø@„eœ±Ç³^œëƒ†¢%eè2Î+P° ã‚NVøq±[𑌪ŒEñÄtôD²p6‘Žeâjú¨ò¢vY‹TµÚB$o™•Ú”€þ˜QkXZÍšÕªM]€'‘Ê漨 è;ž›;{,1—8.@PEð牘¶A@o6—˜VO=™‰왞ŽEÓ [8ìb¶ 8‚šÊ&“Ï:J6—É&r¶ò¹15“¹1ÿzRq=6SqŠbž:!²Pœ!ôt å¶c÷:âLâ@RÝÝQuÇ4›{ÐFyQh£x^”Ú(½’’™XL|ôÈÆ^½V2Ê,&e£®³n“Ág =ÿ¬4’4Ì…ˆíRiT‘x‘ÝbF™MØœ¬Ôôts±¨›­X¥¢$®–ôºUa³d :šŽsïà¼:¯ŽÌ«lÃÁJ­bè²ûȬÙÔµrθb[¨öÎé%n.7JZͱUõ?n;õ6tÍ,]°£Ë¾íÐ<–n.6ìU»­éHM«R¨´Ó,ÃäªJÞhš%}ºbç.Ç‹ã¶e5Ÿ›œÜ·lOÓØzå}ìÞ%ù«ûIÿ±zÓÔËE ,4ìj¦¹4:Ü™®Öð’n WëU}Q¯YzYÆe® +`ëSYgé/Ú+_e%ŸšJkVå²3¹„m‹O|˜Æ6¶sC£Ÿ 5S¼¨—,ç|ouÔŠQ3ÛÍ ë—šZµ±¡³m·©‘Óvåçtï¹»"K Kç½ ê&KH®o•¥±E][œrEà’YÀºÍªŒå@—þ¿ÃÎhú4ÓÔ–JF}I@¨K.jIµÅàȬ´“·›Ÿÿ}/`[±å Ø× ÇAlwñäÏó³Îmû]ü%â¡ üe…xØÅwïrñW‰_sñ׉ßpñ7‰ƒ.>Brñ0ñ¨‹»x„x·‹ï!Þëâo¿íâûˆ'\üâIßO|Àŧˆºø»Ä‡\ü=âÃ.%>ââ1⸋'Øžrb}8Šj*Ùßèå/°ìRâ!!ü=4qBZEÁßH{ïB¼†=)Ü’Ê+J¼<ƒq Z¸inÐCéÜÞ5xN¶Qj;ü½=7݆ì÷ÞEß²$Ø‹ÜxôãÐ5 ܇27 ¯aÓ*úïÃ×&ý7[û}~O Ÿß_ðéø’Å5>¤_ñAøš]ü†]ú–•¿ÎìoÐv³øg8?à½$®‘dŽ)¤‰ìçvŽ—B­pkÞPkžpëÂŒ™¬8áYžP@<ã×±}thYÈôxfÙ#0§õÙ'•UôRåb[RˆƒðØÙý1ô@96*†ÄPë7<Ú˜ÐOlÂÏlÊMç[<‚·yD~aÛe{î0ø5†|E|÷`€5æý”í¤bËìgO ­as(|·¯ÿœýÊâOÚ?dêIŽ#ÇZÈ£àŒ'X({<‰SŽ×œs,Nÿ PK3F]ÌÕPK(gy,org/openisis/Rec.class¥UÍS[UÿÜ|ç%yI¹¥¯|Ym5_@¥+`UPÚ(‚P[„jm /1˜&t´â+7:ºsÆ¡­Ðl\èLfZ§ãÆ{·þ.\¹l<÷‘¡SHgœfλ÷w~÷wλ眗ßïß¹nLyq=èUæ¸êužFŸpB™g„ €ÐØxÙѯ¼IžõBÃIežnEø¤^¯+þ€ Þº0¨6=^VR«çÝ8¥6/¸ð¢ /åÒj>C Á™Í›…ÌA^+•s½¥E³˜_Ê/õŽ*| Cùb¾rŠ`DRM)ÑóûH)c‚cù¢9¾|yÎ,¿™ž+0âΙ•©ÒjŠ£‰HTÅc`Ì,îx,Bk$mœV¹ÈØBz%Ý[Hs½g+å|17¼œÍšåÁ}x$Åÿ…§r»´?ÒÿQ܆š„h.Øô¸÷li¹‘ÔlI¿HªÔ)¤}RéÉ@ß-8ÔÖY%±î#!è”>é¼ÁþV«MøùáÝTÀ_ñœÉ Ú5(±OeWŽqÇ/ŽúÅsFÈnù¾9'vSöÝ…6c„¶á¯!° —½ »Hê"äXJý»]P­ƒq ë5„¦«h_׈ ÷Mõ:ºõ:þ¸áV©®H¬’\¿ÿ§þ E8l)jqéßà—Ü€N†g Þ¸áQç¤ö „7¹àÑ`!žßL¢ÓÜoq­fÐYœÄÛ8…wø‹qgð.Îã{æy•ÁL,"‹uäð%òø–‘*ÞÇð+Šø %üÁŒðê(“Ò±J®P;>¤.|DÇp•"ø˜z°Fý˜¦a|J“øŒfñ9eñ]fuÕ5±F‹†ó€ø]˜ÙFË€GÄ .l‡ä›—NÃ¥®GÞ€O½îÁ*áÖm赺ó+‰¯-ÑxC4ˆ‹ŸzŒâí–’á¤ímàïÙ&¬©ìþPK6<¯PK(gy,org/openisis/PureDb.classR]Kã@=ӦƪݪëÝ}±µj|ðATDØU¿@|JÓ¡Ž´3a’¸úË úîïTЊA6s'‡sÏÍ™™ç—ûGd±‚yLÙ˜ÀO³œ±1ËßRÄ; ›•úµã»m_¶Ü“X ÙÚúÊ\~¥ªç ÖÕä …ºü é4¸>õmbœ½Û€‡±P2²1Ç`kî7Õ?†RÅ«Ö•n¹*äRD"ry°EŠ(ðeOQ©x^ʸ´¦|Ä}\1L¥¤ðª—C.æº×4Ï•Ä¢íz¤óc¥ÉÕ9Q‰ø¾0I†ŽÍÿ6Vr6æ?ŒÎd”„¡Ò1o†Æ€¿Gg˜Œ”ÖwËe©â²è„mÞá’¤ ÅOaÞFÐ>~b SìÊõûlKiYÎñ 9:móä@Š:ðAúªÑU°¨–j]°d.&²]XODQXBs3—ÚÖ0D+‹øazG0Jh,~“…Ñ8)ÝyªÀ:ac}zë[ýá8&úôÙoõÛ„EüøïÿÙ%,QÍ`òPK+ÀD:’PK(gy,(org/openisis/NativeDb$TermIterator.classuTÙRQ=72d¶QpdI†%î *›¢Ê Z<è$¹ÀPa&53¡ðW,_\pÅ ‚Uà³eÙwˆ`AÌCßÛ}OŸ>éîä×ïí]øÑ…IatQ‡n1EÄ„é)Åqö*èÃEñ|I˜ËÂ\ R쪌zñvM¡Èuý ªDjdÜPPƒ.ƒ2nËbŸdm>g¬0øfÉõ'ss 5³‹ú²Ëèæ|l2¹ÈSn?½™+.g¸ †ÓÒÃpb²çcV–›†c8±¸îË|$Ià`â™é.p×H|À0 w¡3òü?å®m˜óýÑÇ Ò°•æ •†Éã¹¥$·§ôd†"ò‚îĹPãDghzNm$ZLwÀæKÖ2÷ÀĪ$¬œâc†`*ÿ+¡[$ªh‚¦â,Î1„JÊÍÍq[Å0F¨ -*F1&㎊»Wqõ*pJÅiœQq÷ULàŠV´14zd9×ÈÄâV"—ZÍð%nº£+)žu Ë,q†öâL'—ÍZ¶ËÓ“Ynëugh.ÚÈ–)n/»nÙ êwÜ4¹=œÑ‡; UG{Å:Ôy˜гT'íïøœŽ…öûD}/u­ýÈÑÉRêŠ~ Tj™Ä„‹•KêK†%h”z*ÅÚÄÚņHbvhv(ZtwÃz9NGó®£_-2$@ âCsôN%ÙXÂ4z1‰nMh&{ž¼Qòýt¶j[`ZÇ&|ZÇüÓ[:ó( Èä!çQº‰à:ZÈVxI¯ÄòW)JkR |Ý€,Ó6 ¬¢šŽ2qÝ}…iMx/Pâ_Ó|›'×·•Ž ‡ ™½CH\½)Ýûå?P± ¥@¨JÞËKB0Š“DLÒÚº6Ò%t„ñ¾øGŠ}ÂC|F_0¯0°ß ÝŽHAõXAµ¦åQùe;¨¢&Tï }ž˜iÒ=#=¥JBP¡oõøÈR¨‰ˆB+p6R\p–î †Èj÷2ökmÓ{>tâ–ÇC+Eÿs7ÁþPKŒ÷]kFPK(gy,org/openisis/NativeDb.classUëwEÿMóØív)’bi ¡TH“¶)Qy …V¢¥Å†‡%*n6›vKº[6ÛB}!PQ䥠¢x“ñ9nÓY!X†¾­ôm£ŸŸ0·u‡&M¾ñ%·FÀ<'c¶3Ô—råÈt›v§9b¤ç%YÆ+XPÐN]˦ùN»Œ=ØÏcùŠb\\tο+c'ž—ÑN.»WÆ.PÙÈ–ŠÑ8ÿ>àÚ_S¹Ô IÉø†ÇtÕ¤Z,àsNU)±xϼtÄÈ””Û)û5»}Ìæ_&{”hóòý¸¤ÔÜ„m8 k®G=èfz´†î×E{þ¬fôÛN;ÇvÄXÎÖ†hC³¨ƒ]¥¼’®M4eˆ|ÖòülÌU.Jt ‡ùŠßYËUŽ'»–ö†³G¨¹ÖÊå.ãâYSIwé)K±Æ°‘ž†Õ¼KiVÉ"¼i‰%ñŽrF:µÎH-åÈRÝGó.xéÂÑȯ(ËÃ3yd¾¾øû¦ Ä<Ê åyHS¨xHz@9ý½4{‰æʈž$Î)Çòþ‚eF… Çø=:»w·f ÷E=uÜØÝ*¬åG¬ð´äQù|-“žÞ ¤~ÁÊ¢ãhлý>ÄÀª Äø|Õ£ïiµzÕ?|˜@•³ú—¯ª&à ¬¡8A"œŸGu`m!ð<ž÷² ·îÁãûšIO“ê=ú—RmEQ…K!HïsÒô’kôbgp…Æ[0q›öïâ,iÙ¤uíúe‚ÙKã†Ht ë"Í-Ó¨ý urY÷*fPOQ¬ø³Sî¬ÚAï"ÑK¨ÄeZc=]½‰Ë:D#]Å:^ƒHa ý >6õl{„ Gš=­û¢³ÞôŸíòzwú&°©ÆôyÓ3õ5}­‘hÐG’óh˜Â¦Ä¸}ÑÙÿžAc_}w ÏNÎ…´™Š º%}¸ .ÝJrÀuÔâ5âM ä Œ²=\ l IóYá™Ö–±ilÎcË£~æ;Dãx¥¨%.«ª T¡F »+Þ%ú*µqAq3¡ÌÛ¹’ëE¢¤U7¦Å:ß=‚î¢N¹âJ3ˆôñêDË?$p{è*¹¡èCXmž[,¼GÁ"^Cïœ æðüÒhyRãÂÙé%ˆzh– yŽa«³Ã¨­ZÑö?PK²ì"¼È PK)gy,org/openisis/Test.classX |TÕ•ÿŸ7_/Ã$L^2`œÆOB  Âw „ &6¤Û2$C28™Ig&ˆnײÛÐí¶ÛZµ¡v—PeªÐª`,Jmw—mµß­l­®V]]ÚZ×êÚZ¿²ÿûf&’Ð_ócÞ»÷ÜóuÏ=çÏ㉾yTËõ¸ urâK¸Û"@Ç—uü³¢ÿ‹‡œë8¢Þ_)À ¸Ç‰{qÔ‰¾ªh÷é¸_QŽ)Çu|MÇ×u< ãAé8¡ã¤Ž‡u|CGZÇ)§u<¢ã›:ÎèxTixL‰ŸUoéx¼ßÆwtü«“ïÓñï ˆçœØˆÿPäï*©ïYàœtè ':0¬\{Òï;q†ÕãŠòCõø‘zü؉Ÿà§:~¦&?WºžÒq^Ç*é_(Oëø¥}åm+¡þáÏ*©ÿš‚çð¼züJÇ ¼èÀKŠþß:^ÖñŠŽÿÑqA üZÇoø­¯*¿~§4¿¦ãu¼®†¿×ñ†Ž7uüŸ~KÇ”tâmüÉwt¼«æïYx.ügUñ¾óÔd@M>Ð1 t]4*‹.V]lºØuqè¢ëR@ËâtÈ]\NÜ$…kÿÎèu‚²–]ÁÝÁÚdhO²¶)ÔîFÖÆâýÁäR²$Cñ~AIW†'ŒöÖ¶'ãáh/-»ƒÖ³CPÜ‹÷ÖÆBÑp"œ¨mÚ¡db‰$¹ººü["Œs&;zûÚb7 fUN»˜Ðê^ꟽÊÖÄzB‚©-áh¨u°G(ÞÜ!åÚ¿D…Ò`o GÃÉåTU韽…~Å£|Vª±­;Lô <•÷©dÍ{ºCÉp,špH‘Š\0Lái•“Äeö‡LåY4vG²í±ÁxwhmXù[ÐJ$k””CÜ.)C`tÇ#=¾h,éë %}ñØM>‡”¸¤T<‚"§/ÿ!tºdš›6ÞöêÁ;Cq>Ï 7­mÍ 5ø\2].sáüCÊ\r¹xRî’ ™á’™B­…k­k›Ûš[×4›ìWÈ•.¹J9PØáïhiÎ)â|Õ ëm•í³3sm©rJ-47ù;üÖQFÿ¦ÍmþÖŽÑùš@K˪ ‡9oonó7·)n td§9þ¶Í5¾Õ¦Î¬á¦¦æ&Ÿr43t¬onó™îåÍ[Vµ®Ë¬olîÜhkjÏêÓœNžKo,a‘«]rx]r­ÌâRé’Ùâx¹Š@ek]¸Uæ¸d®T»¤Fj•Ü<öá“.|Bñ™Ç0˜ Gj›‚ÉKæK Ãߺðwø{>Ž½Yà’ëd!s?óÅCÝ>*%ƒÔË"«?œ`¹u÷ùbQºéHöÅCÁ:¸X–(k ÌŸ*Äp”ú{|Áœ˜þ³Êt_"Ô‹ö$\Ò(ËÊñ²Ò%«d5sÞKÜãS…;ëò»d4)åªRILøúƒ{|DzáN„>:Š&ÃÁˆÏt‡©«â–ð…£æ8kÖô£™ÁÎ,Ð3®\d±ÃÜA⢺Tu Rõ3*ŒÌWÝDˆ2¤û2!àžÖª%Ç®Ë^­LÍ­dƒÀâ¥Ð“u²žgÇsòã6‡lpÉFiÌs%x­iÆ¢ºß%›ÄK<¨î#JÙªD1~ÕfüT%¶²ê«ã ´lÕ‰î`Ô%ÙLת¡`¼»Oñ2^ñ›¹nF‚~ð‚Rt\\ønL¿ÖRû<þ1 ªäfŒyìÒ…øà#“çp‰ÉŽÕúyÔüS¾9‘ ¹-&®µäø7óð“LP°ižš<2÷4 f‘è%ðPaglÛƒŒ}e¶4jìRf? { ƒ–zG ½œzu÷¢ëÍeïH£6c]&s`gÆ™!‡xeö³Ã#†¬â±V TXCu Ÿâs?®á³6~çb>¦bJùñ: 1õX…E؂ŸKp 8Ž¥ünÄy,ÃoÁ¬VJVÉ ¬–­X#4IͲë䬗ðË—±AîÅFy-ò66ÉZ5šŽÍZ®×¦£M‹q| üÚ'hQ•Î?fJ‡%h¦ ¬jŽ1ï4æyoWßæØÆû»,wy·³êꪼßÀ‚‡Fù‹Ô§-zøm¢…¤þ>›‘“ùÔæàê gpaaõ+«Æëöå)|²â†Í’I”O`qEÇZSo“XâáÙ6t6ðd}¬ìÜ9.å!¨•lš¥Pw[]™)q 3#e‡P‘'±üb óÀLK<¾ÏW YD9txdpÌÅEùˆ±‚⧱2UÆj§Yg†>]Š5±4šµ£1Žås¡?6£}4²ŽG·è´Ú6k Óî4–ž}ÔÙPd¯Ÿj©w§Äb©/Ná²BOqÍcèh0òwj©/Ib OÉÜÐé)QÕÐg²FNaKMm*O‰Iy:Ïï¿R¥ÈÊõÎ1¬/M¡ˆKëÒØ6T*žÒ¬ðkù0i}y[ûT½'O{W¾öMZ‹FY‘§øC5ÏöÀP±xŠ†á×[†€eúYU)ñ¼ª/ Žä3x ÌâJäXŒ¡ñ(Áá‘gT—œ4¥ˆ³e™mRÂY“Û£ ›&ïË)L7sÁؽuHÓʫοÿ±‡˜±^ÞjuØ‘­Ïwx¿Wˆ… ßažƒß%×äz’MÐ÷Ùüü€MÏÑŒŸ €Ÿòîû»þŸ³ŠŸbÕžgÅþÃxGñK܇gØ=ÇZ}ò~<‡p/âu¼„·ð2ÞÆ+x¿;~#WàU¹¿“YxCjñ¦Ôá-Y†?°~ÿ(ÛøîÅÛÇŸä3xGöã]¹ï±}z_Žq|#ò¬@^‘WDÓ4±ib×®‡¶’ï¢kíR uŠS‹ð}‹¸øÕQ¨}NŠµÛqN; %f Û™Ó_`ëÄ”lÄ›ßbf|áÜÔiì9…›OÂ5Ö0dú­¹|î7KâÀÿPK|ª9ßcÇPK*gy,org/openisis/Charset.classVÛs×ÿÝv½¬±á"›á†Ö–,#Ëjc‚Ç6¦È Sâ•´²–JZ±ZÜÒ$NCÒ& MÚ$¤)\zM€Èn î%N§ÿBgúÒ§Ng:}èô1ô;º`K–yèË9{¾ó]~ßõì_>ûxVøñO6᫈Š8&a¢ ý8.àk8Á—§DL P8=&AB\D‚ÓU ILñ%%BqRÄ×E¤EdDd%èÈñåWnˆÈsSDAÂ4Nó›3"f8ñ¾‰³|yZĹ&<ƒoñåYnë9Ï‹˜ñ‚ˆo‹x‘ÓÎKx /‹øŽ„0NpXß•hyEÄ«"¾'â5D|Ÿ;“â¯óå ?ñCo xKÀÛ Mj6®'´ìTžaýÄÈIeZ ¤•ìT bDíc´¼žÒ¦R –‰+ 0¸rÌdo^=ELGlûõ„ÊÐ2¢eÕƒ…LL5Æ•Xš(Ò3q5gjz6/à"ƒO)†©æMGHËjf˜aCÇJ\©UÏŸfØS¹ÕôÀXÁÌLâP•L_gCò“†fªGX2¤Ä¶6VPá,¡Ï(Z–acGƒ¨ð{1OW°J½`ÄÕA;'ï'yÕÜÁ¥ZW7#à?» ö#ãƒþ^#ø±Œ/âKd¶Þæ@!™T Î2(ã.3°³ Îz6b€s]!IÆ{x_ÀOd\ŨŒk¤,ú§É jºAé÷WóOÁñ'u#£P%­MeÕå9 ÄËþTws2~Šë2~†ŸËøÇ/Æ”„ÇPóí— k=¤ÊSUíð+¿æ>À‡Tgq½Nx²ºI2$˜IfK‚7Ü”q É(bžŒs­IMM'ò=[b° ã7øXÆm<&ã>¡€ßcóìô×ý„§Ê_s»‹ŽK‘öd´u¸¬‘¨àz ]"îÞl±öϱ¿†-Ý}~k›ƒ6æ¶]…dsÛ/¡óÜw\­„Ûm+¢Íµ…¾üU/œc—|n›uGíÌm¿ß2©­%)~ëY!7ewÛ‹Øö>6‘o¿Šfú"íµJ>w%íeÑ ÃævÜÂ×ÑâçÛ‹øüEX¦ä \ gáZ:*‡í<#««Ç§eAØ $org/openisis/Db.javaPKwr,ߟTU 4org/openisis/Field.javaPKwr,Aï‹o )ƒorg/openisis/NativeDb.javaPKwr,²¸îìh[)org/openisis/PureDb.javaPKªv,‹.s3À-org/openisis/Rec.javaPKvzx,h)Gs¡ Ú 6org/openisis/Test.javaPK(gy,ÇÁ de= uBorg/openisis/Field.classPK(gy,3F]ÌÕ Jorg/openisis/Db.classPK(gy,6<¯/Oorg/openisis/Rec.classPK(gy,+ÀD:’¯Sorg/openisis/PureDb.classPK(gy,Œ÷]kF(ˆUorg/openisis/NativeDb$TermIterator.classPK(gy,²ì"¼È òXorg/openisis/NativeDb.classPK)gy,|ª9ßcÇ÷^org/openisis/Test.classPK*gy,X$¨{o– Ÿmorg/openisis/Charset.classPKÛVu./.index.html.swp0100600000113000011300000011000007450176671012550 0ustar kripkripb0VIM 6.0z´ý <ì@5kripkahless.ds9~krip/oi/cvs/openisis/index.html3210#"! Utpÿ,**PSU£ZøUR§ad' ë ,À¹²gG?8ø×¼¡†_Z98 ý É Á Š d $   ç Þ Ø ˆ ~ x ¦ Y ' j c X R 6 ë ¤ f * ð¼ˆAúµŽE)ÞŸ[Õ=!à•UËŒpTïÁ‚Iï½pm we have a version of this document en espanol. And thanks to Veronica Lencinas and colleagues, by ANDing it with a second query. shows how a query is refined (narrowed) iteratively The JSP demo arithmetic on those lists (and, or, not) is straightforward. Search gives a list (array) of sorted MFNs; (as prefix or complete word). First truly usable release, since we have true search by index now
  • 0.8.3 October 2001
    starting from that rowid. and it is possible (not yet in the JSP) to repeat the search The lowest row number (MFN) that was cut off is recorded, somewhat lower number of rows (where rows have multiple matching postings). Searching is limited to 1000 postings, usually resulting in a with over 70.000 rows (note the hosting server is a 500MHz Celeron).
    searching the unesb db The JSP demo now supports it will not be included unless somebody has a need for it (send us mail).
    Although support for a mixed format is easily achieved with openisis, has a mixed format: aligned leaf files, others unaligned. The cds db we had with previous versions (from an old CDS distribution) (-format aligned) and the cds db as distributed with winisis.
    Fixed alignment problems in IFP, now works with the unesb db Nearly complete rewrite of search code with support for NEAR conditions.
  • 0.8.4 January 2002
    Queries are processed strictly left to right on a buffer of 1000 hits. results (for precedence) are stored. stupid queries like "$"^"$", so no historical (#n) or intermediate Every attempt is made to limit the potential costs of even extremely All the operators are there (including /(tag), but not /(t1,t2...)). (demo). Finally some implementation of the query language
  • 0.8.5 March 2002
    standard strategies later ... common solution in HTML. Will build tools for a choice of Indentation is not properly handled, since there is no easy and several nice utils. a solaris (0.8.4) ( build on solaris 5.8 )
    Note: the JDK shipped with solaris 5.7 / 5.8 ( java 1.2 ) should work.
    • servlet engine under windows requires some care. The current windows version is not yet thread-safe, so using it with a Java
  • win32 (0.8.5) ( mingw32 cross-build) should work on all win32 platforms from win95b on.
    Note: If you want to use java you will need the JDK1.3.x
      Binaries
  • Current version 0.8.5.2
      • Sources Available for download:


      unicode index) ( searching for unicode characters or try standard DEMOS:

      current version

      welcome to OpenIsis.org

      en espanollinksabouthowtoopenisisisiscurrent version OpenIsis 0.8.x adM ½ ȧ‰wCÔ»‡j^Í Ì ¢ t O J ù ô Í Å ½ ¼ (this page intentionally left blank :)
      $Revision: 1.16 $ last changed $Date: 2002/03/22 20:20:59 $ by $Author: kripke $
      ISIS, charsets and unicode

      documentation

      Klaus "Paul" Ripke
      Erik Grziwotz
      staff:
      Germany (isisnetz)
      UK (ISIS PLUS)
      Netherlands / international
      user groups:
      IsisOnline in Indonesia
      Institut Teknologi Bandung       adÒ*ä¨l ÈŒlRê £ \  ð § ‹ @  ½ s 7 ï Ÿ ƒ B ÷ · i - îÒ¶qQ#ä«uQÒ we have a version of this document en espanol. And thanks to Veronica Lencinas and colleagues, by ANDing it with a second query. shows how a query is refined (narrowed) iteratively The JSP demo arithmetic on those lists (and, or, not) is straightforward. Search gives a list (array) of sorted MFNs; (as prefix or complete word). First truly usable release, since we have true search by index now
    • 0.8.3 October 2001
      starting from that rowid. and it is possible (not yet in the JSP) to repeat the search The lowest row number (MFN) that was cut off is recorded, somewhat lower number of rows (where rows have multiple matching postings). Searching is limited to 1000 postings, usually resulting in a with over 70.000 rows (note the hosting server is a 500MHz Celeron).
      searching the unesb db The JSP demo now supports it will not be included unless somebody has a need for it (send us mail).
      Although support for a mixed format is easily achieved with openisis, has a mixed format: aligned leaf files, others unaligned. The cds db we had with previous versions (from an old CDS distribution) (-format aligned) and the cds db as distributed with winisis.
      Fixed alignment problems in IFP, now works with the unesb db Nearly complete rewrite of search code with support for NEAR conditions.
    • 0.8.4 January 2002
      Queries are processed strictly left to right on a buffer of 1000 hits. results (for precedence) are stored. stupid queries like "$"^"$", so no historical (#n) or intermediate Every attempt is made to limit the potential costs of even extremely All the operators are there (including /(tag), but not /(t1,t2...)). (demo). Finally some implementation of the query language
    • 0.8.5 March 2002
      standard strategies later ... common solution in HTML. Will build tools for a choice of Indentation is not properly handled, since there is no easy and several nice utils. a Vn-field-selector-style method various HTML-safety modes (like escaping all non-ASCIIs), Java now has support for basic formatting modes like MHL,
    • 0.8.5.1 March 2002
      ad _Pè²k(ùÞœQÕ ž \ # Ø Ñ ¸ W - û ô Ü · … L 0 )  ¼ ™ i b [ Z 1 ê ¦ f 8 7 ýňIÉ‹P-Ó‰@öáš[ÿËR·s=+ì«ŸOÍ’_^ modelled in XML documents rather than table rows. one single level of substructure, which today are usually many catalogues and directories with highly varying records and between different entities, it's flexibility comes in handy for While isis lacks most features of RDBMS like complex relations
      usage
      operators. and, or and not(without) A query language allows for combination of word lookups using
      queries
      necessary (but possible) to set up multiple indexes. Since all fields can be combined into one index, it is usually not word prefix is possible with or without qualifying the position (field). Searching for a word or into a B-Tree (which is actually spread to six files). qualified by the position of it's occurence in the row, (optionally applying formats) and stuffing every word, An index is build by converting a row into a list of words
      indexing
      and for loops (over field repetitions) (roughly speaking). variables, if-else branches (on field existance) There is a formatting language, with literal text, field and subfield
      formatting
      one 'a' subfield with value 'foo' and two 'b' subfields 'bar' and 'baz'. So the field value '^afoo^bbar^bbaz' represents a field having them with a '^' followed by one character tagging the subfield. There is a convention to encode multiple fields in one by separating
      subfields
      actually contain arbitrary bytes. encoding (commonly one of the IBM/DOS code pages), it may textual representation of data in one or the other character fields with a given tag. While the field's value usually is a and a string value. Within a row there may be zero, one or more Each row is a list of fields, and each field has number (tag) each identified by a unique number, the rowid (a.k.a. mfn). An isis DB is a list of rows of unspecified structure,

      introduction to the isis db

      especially in those running on a low budget. it's commonly used in libraries, and since it's very low cost, base since the 80s. Since it's well suited for bibliographic data, Isis is a simple, yet powerful database system with a large installed

      what is isis

    Logging, argumentparsing, Makefile, demo etc. Executable "openisis" does test. static C-Library libopenisis.a for reading records by rowid(Mfn). First version:
  • 0.7.9 May 2001
    • Makefile.PL, test.pl etc. Record shows up as hash, handy but no repeated fields. Everything also available from perl as an xsub. Subfield splitting and htmlifying.
  • 0.8.0 May 2001
    • Subfield splitting and htmlifying in pure java. NativeDb implemented in libopenjsis.so. Java package org.openisis has Db, Rec, Field, Test. Java native interface version available.
  • 0.8.1 June 2001
    • jsp demo under development ;). lame 300 MHz Notebook this seems to be of practic use. Given a random read throughput of about 30.000 Records/sec on a Simple full-scan search available in C-Lib and Java. much larger databases, big endian processors and more. rather than C-structs, so we can support different file layouts, Conversion from file structures governed by abstract dynamic description openisis now under LGPL, no legacy code.
  • 0.8.2 August 2001
    • Windows version openisis.exe running. sourceforge. Sources are available via CVS at New structure logging mechanism. Not a new release yet, but maintenance and testing.
  • September 2001
    adUÀ›š`é½Dÿ Í h , ç ¥ l 3 õ º œ ˜ a <  ä » ™ f I (  Ë Ê ™ k # õ­§…I(ê¾·“D Ñ®jc<ùÌ–QJ!ôƈnJ ùÀ¢a%ôºƒ|i(êÖϽ~ While open source software enables people all over the world
  • Enabling
    • improved software. Their expertise is lost as they are not able to turn it into Many users develop useful ideas for improvements from practice.
  • Improving
    • state-of-the-art web application based on an isis db. As a consequence, it's practically impossible to write a thread safety, unicode compatibility and so on. (especially some C++ stuff), there are no statements about There are problems with regard to required additional libraries would be using the isis.dll. The only way one could write a Binding for perl or Java
  • Extending
    • and not much one can do about having somebody fix it. There is no way one can fix a bug,
  • Bugfixing
    • Only a small part is downloadable at all, most is paperware. some only in portugese, espanol or italiano. Some documentation is available in english,
  • Availability (of documentation)
    • One can not easily figure out, what exactly might be allowed usage. Terms seem to be pretty different between countries. stating some license terms, others are not. Some parts of the software are accompanied by different documents
  • Availability (in legal terms)
    • Then you have to wait, e.g. in germany it takes more than a month. why you want to use the software. You have to pay some fee and/or declare some good reasons, which you have to order at some national distributor. You may download most the software, but it's partly protected with passwords,
  • Availability (in practice)
    • and there is not much one can do about it. For other environments, there is no version of the software, library versions and languages. Versions of the software exist for some operating systems,
  • Availability (in theory)

      problems resulting from closed software

      and that leads to a whole bunch of problems. Because Isis is not open source software, it's not even free software, So why are we writing the openisis software?

      what is openisis

      which was the starting point for the openisis software. wrote a C-lib (iAPI) from scratch, Robert Janusz which in turn uses wwwisis. is an AWT-based GUI and a a corresponding server, Javaisis some of which are in the public domain. is accompanied by a couple of independent developments, Bireme, Unesco and/or This "official" isis software, which is maintained by

      provide concurrency control. runs per request, not as a server itself, and thus cannot most isis tasks (win and lin versions). However, it actually which runs as CGI or from the command line and performs The thing next to an isis database server is "wwwisis", ISO2709 bibliographic databases, inverting (index building) etc. A set of command line tools ("cisis") performs tasks like importing however, you need some pretty special libs to make it run. also in a linux version ("isilux"); to access an isis db from your code exists, despite it's name, A shared library version "isis.dll" of functions

      Then there are several versions of "WinISIS" (M$-Windows only). (current 2.4 kernels do not support the iBCS module for COFF binaries). also runs under linux up to some 2.2.x kernels There is a BSD version of "CDS/ISIS" which as an integrated system with textual user interface. The mother of all isis software is a DOS version of "MicroISIS"

      overview of isis software

      searching and structured retrieval. The flexible indexing mechanism combines the best of full textad–ZÁ´­¦¥k,Ñrn.ñ ¶ ƒ B  Ý ¢ s o ( à ß ¬ q 7 þ Ç Ž T  ì è ¦ g + íµ„ZVICûÇÀ”W:¹²piKD*#  Þº“R"ë½”pl*æªe%!óº}Aø×–• (using this cds database from winisis and the testres.txt as provided Type "make test", there should be no difference between the testout.txt Type "make run" and watch the guts of your db passing by. (You installed a db/cds/cds.*, didn't you? It has 42 rows?) Type "make demo" and enjoy your first open isis record. Type "make" and enjoy the compiler messages.

      If you are on Linux, everything is fine. On a MAC ... no idea. Erik will build a Windows version using Linux gcc as crosscompiler. and start writing the Makefile for your make and compiler. environment with tools like gmake and gcc or volunteer as a porter If you are on Windows, you should either get yourself the cygwin

      Make sure filenames are lowercase. Try this one. which must be located as files db/cds/cds.*. For the tests, you will also need some isis database, Unpack everything in some arbitrary directory. We will build binary distributions when things are more stable. By now, it's all source, no binaries. Start by downloading the Software.

      howto open isis

    1. ...
    2. implement formatting
    3. implement query language
    4. prepare binary releases for windows (.exe and .dll for java)
    5. start work on thread-save pure-java implementation (volunteers ?)
      6. further accelerate loop in ldb's convert function and homegrown io buffering,
    6. more performance: try std (DONE, performs badly)
    7. implement index-based searching (DONE)
    8. implement searching (full-scan searching DONE)
    9. make file layout configurable to allow for larger db (DONE)
        Next steps:

        All others can, of course, link the lib. some day, Tcl/Tk for platform independent GUIs. languages: Java for the web, perl for the scripts and, OpenIsis provides access from the most important programming of winisis unless the GUI toolkit is done. To achive this, For example, there will be no attempt to mirror functionality OpenIsis will focus on providing tools rather than applications.

        queries from a Servlet based web application. powerful reports and the Java Native Interface to allow the database, yet deploy OpenIsis' perl interface to run whatever existing import scripts to create and maintain the database files anyway. So, one may use winisis or OpenIsis has to maintain compatibility in the format of of code ever written for isis. To be of practical value, In general, there are no plans to reimplement every piece

        developing openisis

        available for everybody with full sourcecode, no fee, no restrictions. OpenIsis as a software to access isis databases is and will be freely

        indepent test bed, help improve the standard. introduce new ideas which finally, after having had their A rewrite by developers with a different background might which is paid for by a certain overhead. openisis will have some support for multithreading and unicode, performs better in other situations. For example, and develop strengths in one aspect while another aproach advantages in it's own right. It may have a different focus On the other hand, an independent secondary implementation has

        or similar as appropriate). under one or the other form of open license (GPL, LGPL, artistic Of course it would be best to have all of the existing isis code implementation of isis. To address these problems we feel the need for an open source

        benefits of open software

    • dependency. to shape their tools themselves, closed software lets them inad sU¹d%üë䪩˜‡v*)ö ž „ ƒ r a P H  ð ® v =  × H  Ä } ?  ÿ ¿ ‘ R  Û§‡†V8Ñ•EÛŽŠe-ìº}BþýÚ•fPû¸¤`ù»g1ì¿sr javaisis
    open source software for libraries
    Kafkas Caprazli's EVERYTHING about CDS/ISIS
    Robert Janusz' iAPI
    people and projects:
    THE BOOK     CDS/ISIS reference manual incl. data formats (en espanol)
    documentation:
    Bireme
    Unesco
    isis core sites:
    openisis and PHP isis at sourceforge

    links

    side by side with Franck Martin's PHP isis project. Thanks, Frank! width="88" height="31" border="0" alt="SourceForge"> Openisis sources are available at Volunteers are very welcome. Erik and Paul. Currently the site is maintained by

    See also the open community for science. education and knowledge management. As a student's site, allmaxx supports open software with a focus on a service of merconic, Berlin, Germany. width="114" height="38" border="0" alt="allmaxx.de">, OpenIsis.org is sponsored by

    about openisis.org

    see NativeDb.java for details. The system dynamic linker must be able to find it; The latter is libopenjsis.so on linux (yes, it's jsis). or specify when invoking java like in the Makefile. The former is openisis.jar, set your CLASSPATH to include it, the own language and a native shared object. Java, like perl, needs to dynamically slurp both some stuff in

    After that, try "perldoc OpenIsis" and the demo.pl script. and issue "make install" (as root or otherwise legitimated). /usr/lib/perl5 or whatever, cd to the perl subdir (after "make perl") To install the perl stuff for general availability in your

    for the fun of it; go ahead, just copy, no magic registry entries. You may wan't to install the 'openisis' binary somewhere in your path libopenisis.a can be linked with your code; no installation necessary.

    installing openisis

    look in /usr/java/jdk1.3 by setting JAVAHOME. Some 1.2.* JDKs should do, but tell the Makefile to not to see it all happen in your shiny new JDK1.3 Java VM. Type "make java" or, if you just can't get enough, "make jdump", some perl 5.* must be installed beforehand. Type "make perl" to build the perl stuff; sys 0m0.070suser 0m0.050sreal 0m0.223s860 rows for ktime ./openisis -fmt mfnf -search 'k$' -db db/unesb/unesb -format aligned >/dev/nullsys 0m0.250suser 0m0.140sreal 0m1.623stime ./openisis -perf 5000 -db db/unesb/unesb -format aligned >/dev/nullsys 0m0.920suser 0m0.930sreal 0m1.851stime ./openisis -perf 100000 -db db/cds/cds >/dev/null 
    	Typical values:	once the files are in the system cache.	My 800 MHz P3 random-reads more than 80.000 records a second,	subsequent tries are usually much faster.	Type "make time" to measure performance,	and this 15 MB 70.000+ row unesb.zip db)../unicode.jsp0100640000113000011300000001056007440777755012060 0ustar  kripkrip<%@page import="org.openisis.*,java.io.IOException,java.util.Date,java.util.Iterator,java.net.URLEncoder" contentType="text/html;charset=UTF-8"%><%!
	static final String EMPTY = "";
	static Db db;
	static String dberr = EMPTY;
	static {
		try {
			String[] args = new String[] { "-v", "9", "-encoding", "UTF-8",
				"-format", "aligned" };
			db = Db.open( "/var/db/come2uni/come2uni", args );
			if ( db instanceof NativeDb )
				System.err.println( "db.db = "+((NativeDb)db).db );
		} catch (IOException e) {
			dberr = e.toString();
		}
	};
	static String NV ( String x ) { return null==x ? EMPTY : x; }
	static int ROWS = 30; // number of rows to show at once
	static String vif ( String pre, Rec r, int t, String post ) {
		StringBuffer ret = null;
		int l = r.getLen();
		for ( int i=0; i<%
	String search = NV( request.getParameter( "search" ) );
	// brute force ...
	search = new String(search.getBytes("ISO-8859-1"), "UTF-8");
	int off = 0;
	int rows = ROWS;
	try {
		off = Integer.parseInt( request.getParameter( "off" ) );
	} catch ( Exception e ) {}
	try {
		rows = Integer.parseInt( request.getParameter( "rows" ) );
	} catch ( Exception e ) {}
	int[] set = (int[])session.getAttribute( "set" );
%>

	
  OpenIsis unicode demo


	<%= dberr %>
	
    
	<%-- method="POST" enctype="multipart/form-data"
		buys us nothing -- the ;charset=UTF-8 is parsed by newer tomcat,
		but not transmitted by Mozilla, so we have to do conversion manually anyway
	--%>
		
		 as prefix
		
		 rows at once
		
    
		 show index terms, not records
	
    
	
	text excerpts are from
	
	the invitation to the Tenth International Unicode Conference.
	

    
<%
	if ( EMPTY != search ) {
		if ( null != request.getParameter( "terms" ) ) {
			Iterator t = db.terms( search );
			while ( t.hasNext() ) {
				String s = (String)t.next();
				if ( 0 == s.length() ) continue;
				String u = URLEncoder.encode(
					new String(s.getBytes("UTF-8"), "ISO-8859-1") );
%>
<%=s%>
    
<%
			}
%>
<%
			return;
		} // list terms

		long then = (new Date()).getTime();
		int mode = null==request.getParameter( "prefix" ) ? 0 : Db.QRY_KEYPF;
		int[] nset = db.search( search, mode );
		long now = (new Date()).getTime();
		if ( null == nset ) {
%>
	sorry, no results for <%=search%>
<%
			session.removeAttribute( "set" );
			return;
		} else {
%>
	got <%=nset.length%> rows for <%=search%>
	in <%= 0==mode ? "word" : "prefix" %> mode
	in <%=(now - then)/1000.%> seconds.
    
<%
			set = nset;
			session.setAttribute( "set", set );
		}
	} // EMPTY != search
	if ( null == set )
		return;
	if ( 0 < off ) {
		int boff = off-rows;
		if ( boff < 0 ) boff = 0;
%>
		<<rows <%=boff+1%> to <%=boff+rows%>
<%
	}
	int end = off + rows;
	if ( end >= set.length )
		end = set.length;
	else {
%>
		rows <%=end+1%> to <%=end+rows%>>>
<%
	}
%>
	
     rows <%=off+1%> to <%=end%> 
    
<%-- start output --%>
	
<%
	for ( int i=off; i
	
<%
	} // for rows
%>
	
      <%=name%>  
    
	
      lang=<%=lang%>><%=head%> 
    
	
      lang=<%=lang%>> <%=body%>  
    

./a.out0100775000113000011300000003326607447361113010666 0ustar  kripkripELF„4˜*4 (44€4€ÀÀôô€ô€€€ØØØؕؕô,,–,–    /lib/ld-linux.so.2GNU
	6tƒ>z„ƒ")”ƒp<¤ƒ¬"0´ƒÚhăÊÔƒ"Täƒ+YÔ… __gmon_start__libc.so.6__cxa_finalizemallocsleepmlock__deregister_frame_infoatoi_IO_stdin_used__libc_start_main__register_frame_infoGLIBC_2.1.3GLIBC_2.0si	ii
œ(–
–––––– –$–U‰åƒìèÍècèÉÃÿ5–ÿ%–ÿ%–héàÿÿÿÿ%–héÐÿÿÿÿ%–héÀÿÿÿÿ%–hé°ÿÿÿÿ%–h é ÿÿÿÿ%–h(éÿÿÿÿ% –h0é€ÿÿÿÿ%$–h8épÿÿÿ1í^‰áƒäðPTRh°…hLƒQVh…è£ÿÿÿô‰öU‰åSPè[Ã΋ƒ,…ÀtÿЋ]üÉÉöU‹ä•‰åƒì…ÒuI‹à•‹…Àtt&B£à•ÿ‹à•‹
…Éu긤ƒ…Àtƒìhè•èÿÿÿƒÄ¸£ä•‰ì]ÃvU‰åƒì‰ì]öU‰å¸„ƒƒì…ÀtƒìhÌ–hè•è£þÿÿƒÄ‰ì]ô&U‰åƒì‰ì]öU‰åƒìƒì‹EƒÀÿ0èÎþÿÿƒÄ‰À‰ÀÁà‰EüƒìÿuüèfþÿÿƒÄ‰À‰Eøƒìÿuüÿuøè0þÿÿƒÄ‰À…Àuƒìh'èZþÿÿƒÄ¸ÉÃU¡ì•‰åSƒìƒøÿ»ì•tv¼'ƒëÿЋƒøÿuôX[]ÃU‰åƒì‰ì]öU‰åSRè[ÃBvè‡þÿÿ‹]üÉÃø•ÿÿÿÿÿÿÿÿ,–zƒŠƒšƒªƒºƒʃÚƒêƒLƒ
°…(‚h
ü•@ƒƒþÿÿoÔ‚ÿÿÿoðÿÿo¾‚¢ƒd$„d$„9<H€r€Œ€»€ó€0€€Ò€ý€,€V€€™€´€Õ€€1€V€€€©‚¢¢	‚cV$‚ï[L‚b‚y‚¢¢¢‚ØƀǢڀ ñ€!€"€#3€%K€&a€1x€2€3§€4À€5Ø€6ñ€8	€9"€;B€=X€>n€?„€@š€A±€BÉ€C߀Dö€E€F$€G;€HT€Ii€NÏ€Qç€R€S€T9€UU€Vm€X…€[Ÿ€^·€eÍ€hç€l	€q	€r5	€uP	€vm	€yˆ	€z¥	€}½	€€Ö	€ƒñ	€„
€‡&
€Š@
‚Ë”t
‚Fœ
€¢Ò
€€#V€Y€4u€<Â€Cú€F
€S©
€Zç
€^€Ù€lù€tM€yn€ö€†4€Œ¢¢‚
L€b€8¢w‚Š‚b‚¢œ‚¢É€K¢¢L€€#Ô‚ç‚5ÁLÂwŠ‚Âœ¢Âø€×€€H8€Kg€L˜€UË€Z€^?€aw€b¯€\€€û€r€­¢¢–€5	€7!€89€9S€:¢m d$„init.c/usr/src/build/45423-i386/BUILD/glibc-2.2.4/csu/gcc2_compiled.int:t(0,1)=r(0,1);-2147483648;2147483647;char:t(0,2)=r(0,2);0;127;long int:t(0,3)=r(0,3);-2147483648;2147483647;unsigned int:t(0,4)=r(0,4);0000000000000;0037777777777;long unsigned int:t(0,5)=r(0,5);0000000000000;0037777777777;long long int:t(0,6)=@s64;r(0,6);01000000000000000000000;0777777777777777777777;long long unsigned int:t(0,7)=@s64;r(0,7);0000000000000;01777777777777777777777;short int:t(0,8)=@s16;r(0,8);-32768;32767;short unsigned int:t(0,9)=@s16;r(0,9);0;65535;signed char:t(0,10)=@s8;r(0,10);-128;127;unsigned char:t(0,11)=@s8;r(0,11);0;255;float:t(0,12)=r(0,1);4;0;double:t(0,13)=r(0,1);8;0;long double:t(0,14)=r(0,1);12;0;complex int:t(0,15)=s8real:(0,1),0,32;imag:(0,1),32,32;;complex float:t(0,16)=r(0,16);8;0;complex double:t(0,17)=r(0,17);16;0;complex long double:t(0,18)=r(0,18);24;0;__builtin_va_list:t(0,19)=*(0,20)=(0,20)../include/libc-symbols.h/usr/src/build/45423-i386/BUILD/glibc-2.2.4/build-i386-linux/config.h../sysdeps/gnu/_G_config.h../sysdeps/unix/sysv/linux/bits/types.h../include/features.h../include/sys/cdefs.h../misc/sys/cdefs.h/usr/lib/gcc-lib/i386-redhat-linux/2.96/include/stddef.hsize_t:t(8,1)=(0,4)__u_char:t(4,1)=(0,11)__u_short:t(4,2)=(0,9)__u_int:t(4,3)=(0,4)__u_long:t(4,4)=(0,5)__u_quad_t:t(4,5)=(0,7)__quad_t:t(4,6)=(0,6)__int8_t:t(4,7)=(0,10)__uint8_t:t(4,8)=(0,11)__int16_t:t(4,9)=(0,8)__uint16_t:t(4,10)=(0,9)__int32_t:t(4,11)=(0,1)__uint32_t:t(4,12)=(0,4)__int64_t:t(4,13)=(0,6)__uint64_t:t(4,14)=(0,7)__qaddr_t:t(4,15)=(4,16)=*(4,6)__dev_t:t(4,17)=(4,5)__uid_t:t(4,18)=(4,3)__gid_t:t(4,19)=(4,3)__ino_t:t(4,20)=(4,4)__mode_t:t(4,21)=(4,3)__nlink_t:t(4,22)=(4,3)__off_t:t(4,23)=(0,3)__loff_t:t(4,24)=(4,6)__pid_t:t(4,25)=(0,1)__ssize_t:t(4,26)=(0,1)__rlim_t:t(4,27)=(4,4)__rlim64_t:t(4,28)=(4,5)__id_t:t(4,29)=(4,3)__fsid_t:t(4,30)=(4,31)=s8__val:(4,32)=ar(4,33)=r(4,33);0000000000000;0037777777777;;0;1;(0,1),0,64;;__daddr_t:t(4,34)=(0,1)__caddr_t:t(4,35)=(4,36)=*(0,2)__time_t:t(4,37)=(0,3)__useconds_t:t(4,38)=(0,4)__suseconds_t:t(4,39)=(0,3)__swblk_t:t(4,40)=(0,3)__clock_t:t(4,41)=(0,3)__clockid_t:t(4,42)=(0,1)__timer_t:t(4,43)=(0,1)__key_t:t(4,44)=(0,1)__ipc_pid_t:t(4,45)=(0,9)__blksize_t:t(4,46)=(0,3)__blkcnt_t:t(4,47)=(0,3)__blkcnt64_t:t(4,48)=(4,6)__fsblkcnt_t:t(4,49)=(4,4)__fsblkcnt64_t:t(4,50)=(4,5)__fsfilcnt_t:t(4,51)=(4,4)__fsfilcnt64_t:t(4,52)=(4,5)__ino64_t:t(4,53)=(4,5)__off64_t:t(4,54)=(4,24)__t_scalar_t:t(4,55)=(0,3)__t_uscalar_t:t(4,56)=(0,5)__intptr_t:t(4,57)=(0,1)__socklen_t:t(4,58)=(0,4)../linuxthreads/sysdeps/pthread/bits/pthreadtypes.h../sysdeps/unix/sysv/linux/bits/sched.h__sched_param:T(10,1)=s4__sched_priority:(0,1),0,32;;_pthread_fastlock:T(9,1)=s8__status:(0,3),0,32;__spinlock:(0,1),32,32;;_pthread_descr:t(9,2)=(9,3)=*(9,4)=xs_pthread_descr_struct:__pthread_attr_s:T(9,5)=s36__detachstate:(0,1),0,32;__schedpolicy:(0,1),32,32;__schedparam:(10,1),64,32;__inheritsched:(0,1),96,32;__scope:(0,1),128,32;__guardsize:(8,1),160,32;__stackaddr_set:(0,1),192,32;__stackaddr:(0,19),224,32;__stacksize:(8,1),256,32;;pthread_attr_t:t(9,6)=(9,5)pthread_cond_t:t(9,7)=(9,8)=s12__c_lock:(9,1),0,64;__c_waiting:(9,2),64,32;;pthread_condattr_t:t(9,9)=(9,10)=s4__dummy:(0,1),0,32;;pthread_key_t:t(9,11)=(0,4)pthread_mutex_t:t(9,12)=(9,13)=s24__m_reserved:(0,1),0,32;__m_count:(0,1),32,32;__m_owner:(9,2),64,32;__m_kind:(0,1),96,32;__m_lock:(9,1),128,64;;pthread_mutexattr_t:t(9,14)=(9,15)=s4__mutexkind:(0,1),0,32;;pthread_once_t:t(9,16)=(0,1)_pthread_rwlock_t:T(9,17)=s32__rw_lock:(9,1),0,64;__rw_readers:(0,1),64,32;__rw_writer:(9,2),96,32;__rw_read_waiting:(9,2),128,32;__rw_write_waiting:(9,2),160,32;__rw_kind:(0,1),192,32;__rw_pshared:(0,1),224,32;;pthread_rwlock_t:t(9,18)=(9,17)pthread_rwlockattr_t:t(9,19)=(9,20)=s8__lockkind:(0,1),0,32;__pshared:(0,1),32,32;;pthread_spinlock_t:t(9,21)=(0,1)pthread_barrier_t:t(9,22)=(9,23)=s20__ba_lock:(9,1),0,64;__ba_required:(0,1),64,32;__ba_present:(0,1),96,32;__ba_waiting:(9,2),128,32;;pthread_barrierattr_t:t(9,24)=(9,25)=s4__pshared:(0,1),0,32;;pthread_t:t(9,26)=(0,5)wchar_t:t(11,1)=(0,3)wint_t:t(11,2)=(0,4)../include/wchar.h../wcsmbs/wchar.h../sysdeps/unix/sysv/linux/i386/bits/wchar.h__mbstate_t:t(13,1)=(13,2)=s8__count:(0,1),0,32;__value:(13,3)=u4__wch:(11,2),0,32;__wchb:(13,4)=ar(4,33);0;3;(0,2),0,32;;,32,32;;_G_fpos_t:t(3,1)=(3,2)=s12__pos:(4,23),0,32;__state:(13,1),32,64;;_G_fpos64_t:t(3,3)=(3,4)=s16__pos:(4,54),0,64;__state:(13,1),64,64;;../include/gconv.h../iconv/gconv.h :T(17,1)=e__GCONV_OK:0,__GCONV_NOCONV:1,__GCONV_NODB:2,__GCONV_NOMEM:3,__GCONV_EMPTY_INPUT:4,__GCONV_FULL_OUTPUT:5,__GCONV_ILLEGAL_INPUT:6,__GCONV_INCOMPLETE_INPUT:7,__GCONV_ILLEGAL_DESCRIPTOR:8,__GCONV_INTERNAL_ERROR:9,; :T(17,2)=e__GCONV_IS_LAST:1,__GCONV_IGNORE_ERRORS:2,;__gconv_fct:t(17,3)=(17,4)=*(17,5)=f(0,1)__gconv_init_fct:t(17,6)=(17,7)=*(17,8)=f(0,1)__gconv_end_fct:t(17,9)=(17,10)=*(17,11)=f(0,20)__gconv_trans_fct:t(17,12)=(17,13)=*(17,14)=f(0,1)__gconv_trans_context_fct:t(17,15)=(17,16)=*(17,17)=f(0,1)__gconv_trans_query_fct:t(17,18)=(17,19)=*(17,20)=f(0,1)__gconv_trans_init_fct:t(17,21)=(17,22)=*(17,23)=f(0,1)__gconv_trans_end_fct:t(17,24)=(17,25)=*(17,26)=f(0,20)__gconv_trans_data:T(17,27)=s20__trans_fct:(17,12),0,32;__trans_context_fct:(17,15),32,32;__trans_end_fct:(17,24),64,32;__data:(0,19),96,32;__next:(17,28)=*(17,27),128,32;;__gconv_step:T(17,29)=s56__shlib_handle:(17,30)=*(17,31)=xs__gconv_loaded_object:,0,32;__modname:(17,32)=*(0,2),32,32;__counter:(0,1),64,32;__from_name:(4,36),96,32;__to_name:(4,36),128,32;__fct:(17,3),160,32;__init_fct:(17,6),192,32;__end_fct:(17,9),224,32;__min_needed_from:(0,1),256,32;__max_needed_from:(0,1),288,32;__min_needed_to:(0,1),320,32;__max_needed_to:(0,1),352,32;__stateful:(0,1),384,32;__data:(0,19),416,32;;__gconv_step_data:T(17,33)=s36__outbuf:(17,34)=*(0,11),0,32;__outbufend:(17,34),32,32;__flags:(0,1),64,32;__invocation_counter:(0,1),96,32;__internal_use:(0,1),128,32;__statep:(17,35)=*(13,1),160,32;__state:(13,1),192,64;__trans:(17,28),256,32;;__gconv_info:T(17,36)=s8__nsteps:(8,1),0,32;__steps:(17,37)=*(17,29),32,32;__data:(17,38)=ar(4,33);0;-1;(17,33),64,0;;__gconv_t:t(17,39)=(17,40)=*(17,36)_G_iconv_t:t(3,5)=(3,6)=u44__cd:(17,36),0,64;__combined:(3,7)=s44__cd:(17,36),0,64;__data:(17,33),64,288;;,0,352;;_G_int16_t:t(3,8)=(0,8)_G_int32_t:t(3,9)=(0,1)_G_uint16_t:t(3,10)=(0,9)_G_uint32_t:t(3,11)=(0,4)_IO_stdin_used:G(0,1)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-81)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-81)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-81)GCC: (GNU) 2.96 20000731 (Red Hat Linux 7.1 2.96-98)01.0101.0101.0101.0101.0101.01.symtab.strtab.shstrtab.interp.note.ABI-tag.hash.dynsym.dynstr.gnu.version.gnu.version_r.rel.got.rel.plt.init.plt.text.fini.rodata.data.eh_frame.ctors.dtors.got.dynamic.sbss.bss.stab.stabstr.comment.noteô€ô# 1((@7hh°?‚¦Gÿÿÿo¾‚¾TþÿÿoÔ‚Ô0c	ƒl	ƒ@uLƒL{dƒd€„°†°…°ŒÐ…Дؚؕè•è¤ì•ì«ô•ô²ü•ü0·,–, ÀÌ–ÌÆÌ–ÌË̤ÑpƒÚó'Dã7)x¯)éH/;	X4^ô€(h‚¾‚Ô‚ƒƒ	Lƒ
dƒ„°…
Ð…Ø•è•ì•ô•ü•,–Ì–Ì–ñÿ$„$„+ñÿ2ñÿP„=à•Aô•Oä•[P„qè•„°„Ì–˜À„¤ð„¯è•½ì•2ñÿp…Ëp…á𕤠…¯è•îø•ûè•ñÿ°…	ñÿ…,–tƒ>+„ƒ"LÐ…SLƒ
Y”ƒpk¤ƒ¬"Ž„•´ƒÚ¦Ì–ñÿ²…d·ăÊÔØ• ß°…
åÔƒ"äƒ+Ì–ñÿü•.ä–ñÿ3Ô…BØ•O initfini.cgcc2_compiled.call_gmon_startinit.ccrtstuff.cp.0__DTOR_LIST__completed.1__do_global_dtors_aux__EH_FRAME_BEGIN__fini_dummyobject.2frame_dummyinit_dummyforce_to_data__CTOR_LIST____do_global_ctors_aux__CTOR_END____DTOR_END____FRAME_END__mlock.c_DYNAMICmlock@@GLIBC_2.0__register_frame_info@@GLIBC_2.0_fp_hw_initmalloc@@GLIBC_2.0__deregister_frame_info@@GLIBC_2.0_startsleep@@GLIBC_2.0__bss_startmain__libc_start_main@@GLIBC_2.0data_start_fini__cxa_finalize@@GLIBC_2.1.3atoi@@GLIBC_2.0_edata_GLOBAL_OFFSET_TABLE__end_IO_stdin_used__data_start__gmon_start__./Charset.java0100644000113000011300000001010407447676137012145 0ustar  kripkrip/*
	openisis - an open implementation of the ISIS database
	Version 0.8.x (microversion see file Version)
	Copyright (C) 2001-2002 by Erik Grziwotz, erik@openisis.org

	This library is free software; you can redistribute it and/or
	modify it under the terms of the GNU Lesser General Public
	License as published by the Free Software Foundation; either
	version 2.1 of the License, or (at your option) any later version.

	This library 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
	Lesser General Public License for more details.

	You should have received a copy of the GNU Lesser General Public
	License along with this library; if not, write to the Free Software
	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

	This software is dedicated to the memory of Eckart Dietrich.

	This software is inspired by (but contains no code of) the iAPI
	Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl.
	See iAPI.txt for what it contains.
EOH */

package org.openisis;

import java.io.*;
import java.util.Arrays;

/**
	Charset tests and utils for openisis java binding.

    
	$Id: Charset.java,v 1.5 2002/03/25 19:36:44 kripke Exp $
	@version $Revision: 1.5 $
	@author  $Author: kripke $
*/
public class Charset {

	static final String[] encodings = {
		"ISO-8859-5", // cyrillic
		"ISO-8859-7", // greek
		"ISO-8859-9", // turkish
	};

	// bytes 160(=-96) to 255(=-1)
	static final byte[] isohigh = new byte[96];
	static {
		for ( int b=0; b<96; b++ )
			isohigh[b] = (byte)(b-96);
	}

	static void utf8seq ()
		throws IOException
	{
		Writer w = new OutputStreamWriter( System.out, "UTF-8" );
		for ( int i=0; i r.getLen() || null == r.getField(0) || null == r.getField(1) ) {
				System.err.println( "bad fields on mfn "+n[0]+" for encoding "+e );
				continue;
			}
			Field f = r.getField(0);
			if ( 1 != f.tag || !e.equals( f.val ) ) {
				System.err.println( "bad field 0 "+f.tag+"="+f.val
					+" on mfn "+n[0]+" for encoding "+e );
				continue;
			}
			f = r.getField(1);
			if ( 2 != f.tag ) {
				System.err.println( "bad field 1 "+f.tag+"="+f.val
					+" on mfn "+n[0]+" for encoding "+e );
				continue;
			}
			if ( ! f.val.equals( new String(isohigh,e) ) ) {
				System.err.println( "UTF-8 mismatch on mfn "+n[0]+" for encoding "+e );
				continue;
			}
			byte[] b = f.val.getBytes(e);
			if ( ! Arrays.equals( b, isohigh ) ) // ok for some encodings
				System.err.println( "note: no round-trip for encoding "+e );
		}
	}


	public final String enc;

	public Charset ( String encoding ) { enc = encoding; }

	public OutputStreamWriter osw ( OutputStream s )
		throws IOException
	{
		return new OutputStreamWriter( s, enc );
	}

	public void chartab ( OutputStreamWriter w )
		throws IOException
	{
		if ( null == w )
			w = osw( System.out );
		w.write( "\n"
		+ "\n"
		+ "
    \n"
		);
		byte[] b = new byte[1];
		for ( b[0] = -96; b[0]<-1; b[0]++ ) {
			w.write( (256+(int)b[0]) + " = "
				+ new String( b, enc ) + "\n" );
		}
		w.write( "
    " );
		w.flush();
	}

	public static void main ( String[] args )
		throws IOException
	{
		// (new Charset("ISO-8859-7")).chartab(null);
		if ( 0 < args.length )
			utf8seq();
		else
			chartest();
	}
}	// Charset
./index-es.html0100644000113000011300000004126507357337016012315 0ustar  kripkrip
OpenIsis



versión actual 
isis openisis howto sobre enlaces 

    


    bienvenido a OpenIsis.org
    

    version actual
    
Disponible para "bajar": ver Version 0.8.2. 
    
Características: 

      
  
    • 0.8.2 Agosto 2001
      
    openisis se encuentra ahora bajo la LGPL, no queda código legado. La 
    conversión de estructuras de archivo se maneja ahora mediante una descripción 
    abstracto y dinámica más que estructuras-C. De esta manera podemos 
    dar soporte a diferentes configuraciones de archivos, bases de datos más 
    grandes, grandes procesadores endian y más aún. Disponibilidad 
    de búsqueda simple en texto libre mediante C-Lib y Java. Obteniendo 
    unos 30.000 registros/seg en una lectura aleatoria en una lenta Notebook de 
    300 MHz Notebook parece ser de utilidad en la práctica. Una demo jsp 
    demo está en desarrollo ;). 
      
  
  
    • 0.8.1 Junio 2001
      
    Versión con interfaz nativa Java. Package Java org.openisis incluye Db, Rec, 
    Field, Test. NativeDb implementada en libopenjsis.so. Extracción de subcampos 
    y traducción de entidades html en java puro. 
  
    • 0.8.0 Mayo 2001
      
    Extracción de subcampos y traducción de entidades html. Acceso general desde 
    Perl también mediante un xsub. El registro aparece como hash, manuable pero 
    sin campos repetibles. Makefile.PL, test.pl etc. 
  
    • 0.7.9 Mayo 2001
      
    Primer versión: librería-C estática (C-Library) libopenisis.a para leer registros 
    a partir de la clave de fila (Mfn). Ejecutable "openisis" hace test. Logeado, 
    lectura de argumentos, Makefile, demo etc. 

    

    qué es isis
    
Isis es un sistema de bases de datos sencillo pero potente, que cuenta con una 
importante base de usuarios desde los 80. Debido a su buena adaptabilidad a datos 
bibliográficos, se usa generalmente en bibliotecas y por su bajo costo, especialmente 
en aquellas con escaso presupuesto. 

    introdución a bases de datos isis
    

    Una base de datos isis consiste en filas de estructura no específica, identificada 
  con un número único, la clave de fila (mfn). Cada fila contiene una lista de 
  campos, con un número de campo (tag) y un valor de cadena. Dentro de una fila 
  puede haber cero, uno o más campos con un número de campo determinado. El valor 
  del campo generalmente es la representación textual de datos en una u otra codificación 
  de caracteres (generalmente una de las páginas de código IBM/DOS), pero también 
  puede contener bytes arbitrarios.
    

    subcampos
    
Hay una convención que consiste en codificar campos múltiples dentro de un solo 
campo, separándolos con un ' ^ ' seguido por un caracter identificador del subcampo. 
De esta manera el valor del campo ' ^afoo^bbar^bbaz' representa un campo con un 
subcampo 'a' con valor 'foo' y dos subcampos 'b': 'bar' y 'baz' respectivamente.

    formateo
    
Hay un lenguaje de formateo con variables de texto, campos y subcampos, estructuras 
de control if-else (según existencia de campos) y búcles for (sobre repetición 
de campos) (dicho de manera sencilla). 

    indización
    

    Se construye un índice, convirtiendo una fila en una lista de palabras (aplicando 
  formatos opcionales) y ubicándolas según su posición de su ocurrencia en la 
  fila, en un árbol B (que se extiendo sobre seis archivos). Se puebe buscar una 
  palabra o un prefijo indicando - o no - la posición (campo). Debido a que todos 
  los campos pueden ser combinados en un índice, no es necesario (pero posible) 
  generar múltiples índices.
    

    consultas
    

    Un lenguaje de consultas permite la combinación de palabras usando los operadores 
  "y" (and), "o" (or) y "no" (not).
    

    uso
    

    Mientras que isis carece de la mayoría de las características de un sistema 
  de gestión de bases de datos relacionales (RDBMS), como relaciones complejas 
  entre diferentes entidades, su flexibilidad resulta práctico para catálogos 
  y directorios con registros altamente variables y un solo nivel de subestructura, 
  los que actualmente se vierten en documentos XML más que en filas. El mecanismo 
  flexible de indización combina lo mejor de búsqueda en texto completo con recuperación 
  estructurada. 
    

    resúmen de software isis
    

    La madre de todo el software isis es una versión DOS de "MicroISIS", un sistema 
  integrado con interfaz de texto. Hay una versión BSD de "CDS/ISIS" que también 
  corre bajo linux hasta kernels 2.2.x (los kernels 2.4 actuales no permiten el 
  módulo iBCS para binarios COFF). Además hay varias versiones de "WinISIS" (sólo 
  para M$-Windows).

    Existe una librería compartida de funciones de acceso a bases de datos isis 
  "isis.dll" que, a pesar de su nombre, también se distribuye en una versión para 
  linux "isilux". Sin embargo se necesitan algunas librerías muy especiales para 
  usarla. Un conjunto de utilitarios de línea de comando ("cisis") realizan tareas 
  tales como la importación de archivos de intercambio de bases de datos bibliográficas 
  - ISO2709, construcción de archivos invertido, etc. Lo más cercano a un servidor 
  de bases de datos isis es "wwwisis", que corre como un CGI o bien desde la línea 
  de comandos y realiza la mayoría de tareas de isis (versiones win y lin). Sin 
  embargo, corre sólo por encargo, no como un servidor propiamente dicho y no 
  puede proveer control de procesos simultáneos.

    Este software "oficial" de isis, es mantenido por Unesco y/o Bireme, y ha sido complementado por 
  aportes independientes, algunos de dominio público. Javaisis es una interfaz gráfica 
  basada en AWT con su correspondiente servidor, que usa wwwisis. Es un software 
  bueno y abierto que se concentra sobre un frontend multiplataforma, pero sin 
  acceso directo a la base de datos. Robert 
  Janusz escribió una librería C de cero (iAPI), que fué el punto de partida 
  para el software openisis.

    qué es openisis
    
¿Y entonces, porqué estamos haciendo openisis? Porque Isis no es un software de 
fuente abierta, ni siquiera es gratuito, y esto conduce a una serie de problemas. 

    problemas resultantes de software cerrado
    

      
  
    1.  Disponibilidad (en teoría)
      
    Existen versiones para algunos sistemas operativos, determinadas versiones 
    de librerías e idiomas. Para otros entornos, no hay versiones disponibles, 
    y nada se puede hacer al respecto. 
  
    2. Disponibilidad (en la práctica)
      
    Puede bajar la mayoría del software pero está protegido, en parte, con contraseñas 
    que se deben solicitarse a algún distribuidor nacional. Existen algunos aranceles 
    y/o la condición de exponer las razones de la necesidad del software, hecho 
    lo cual hay un tiempo de espera hasta conseguirlo, por ejemplo en Alemania 
    más de un mes. 
  
    3. Disponibilidad (en términos legales)
      
    Algunas partes del software incluyen información sobre las licencias bajo 
    las cuales se distribuyen, otras no. Los términos de las mismas difieren según 
    el país. No es fácil establecer exactamente cuál puede ser el uso permitido. 
  
    4. Disponibilidad (de documentación)
      
    Alguna documentación está disponible en inglés, otra solamente en portugués, 
    castellano o italiano. Sólo una pequeña parte se puede "bajar", la mayoría 
    consta en papel. 
  
    5. Control de fallas (bugs)
      
    No hay forma de corregir una falla y tampoco se puede hay mucho que se pueda 
    hacer para que alguien la corrija. 
  
    6. Extensión
      
    La única forma de escribir una asociación (Binding) para perl o Java sería 
    mediante isis.dll. Hay problemas respecto la necesidad de librerías adicionales 
    (especialmente en C++), no hay información respecto a seguridad de procesos, 
    compatibilidad con unicode, etc. En consecuencia es practicamente imposible 
    escribir una aplicación web para bases de datos isis con las tecnologías corrientes. 
  
    7. Mejoramiento
      
    Con la práctica, muchos usuarios desarrollan ideas útiles para el mejoramiento 
    del software. Su experiencia se pierde cuando no son capaces de transferirla 
    a un software mejorado. 
  
    8. Habilitación
      
    Mientras que software de fuente abierta permite a personas de todo el mundo 
    a adaptar sus herramientas a sus necesidades, el software cerrado los mantiene 
    dependientes. 

    

    beneficios de software de fuentes abiertas
    

    Para encarar estos problemas, percibimos la necesidad de una implementación 
  abierta de isis. Sin duda lo mejor sería de contar con el código existente para 
  isis bajo una u otra forma de licencia abierta (GPL, LGPL, artística o similar, 
  según sea apropiado).

    Por otro lado, una implementación secundaria e independiente, tiene sus ventajas. 
  Permitiría un enfoque diferente, desarrollando determinadas potencialidades, 
  mientras que en otras situaciones el abordaje sería distinto. Por ejemplo, openisis 
  tendrá algún soporte para procesos múltiples y unicode, pagando un cierto costo. 
  Realizar una recodificación por un desarrollador con un bagaje de conocimientos 
  diferentes, puede aportar nuevas ideas que, luego de haber sido probadas, pueden 
  ayudar a mejorar el estándar.

    OpenIsis como software para acceder bases de datos isis está y estará disponible 
  gratuitamente para cualquiera, con código fuente completo, sin aranceles ni 
  restricciones. 

    desarrollando openisis
    

    En términos generales, no está planeado reimplementar cada línea de código 
  escrita para isis. Para ser útil, OpenIsis debe mantener la compatibilidad con 
  el formato de los archivos de la base de datos. De esta manera, se puede usar 
  winisis o cualquier otro script existente para crear y mantener la base de datos, 
  empleando la interfaz perl de OpenIsis para un motor de consultas potentes y 
  la interfaz nativa de Java para aplicaciones web basada en servlets.

    OpenIsis privilegiará la provisión de herramientas más que aplicaciones. Por 
  ejemplo, no intentará recrear la funcionalidad de winisis hasta que el conjunto 
  de herramientas GUI haya sido completado. Para alcanzar este objetivo, OpenIsis 
  provee acceso a los lenguajes de programación más importantes: Java para web, 
  perl para scripts y, algún día, Tcl/Tk para interfaces gráficas independientes 
  de la plataforma. Todos los demás (lenguajes) pueden por cierto, utilizar enlaces 
  a la librería.

    Nos interesaría cooperar en particular con quienes desarrollan javaisis para 
  crear una implementación alternativa de su servidor en un ambiente integro de 
  fuente abierta.

    Proximos pasos:

      
  
    • hacer un diseño de archivos configurable para permitir bases de datos 
    más grandes y de implementación exclusiva en java (HECHO)
  
    • implementar la búsqueda (búsqueda en texto libre HECHO)
  
    • implementar búsqueda en base a archivo invertido
  
    • mayor rendimiento: probar std y homegrown io buffering, además de 
    acelerar bucles en la función de conversión de ldb's 
  
    • implementar el lenguaje de consulta
  
    • implementar formateo
  
    • ... 
      • 

    

    howto open isis
    

    Se comienza bajando el software. Hasta ahora es todo fuente, sin binarios. 
  Crearemos distribuciones binarias cuando se logre mayor estabilidad. Se desempaca 
  todo en algún directorio cualquiera. Para las pruebas, se necesitará también 
  alguna base de datos isis que deberá ser ubicada como archivo db/cds/cds.*. 
  Pruebe ésta. Controlar que 
  los nombres de archivo estén en minúsculas.
    

     Si se está en Windows, deberá contar con un entorno cygwin con herramientas 
  como gmake y gcc o portar el código y escribir el archivo make para su make 
  y compilador. Erik armará una versión Windows empleando Linux 
  gcc como compilador cruzado. Si se está en Linux, está todo bien. Con un MAC 
  ... ni idea.
    

    Tipee "make" y disfrute de los mensajes del compilador. Tipee "make demo" y 
  disfrute de su primer registro openisis. (Ya instaló una base db/cds/cds.*, 
  no es así? Tiene 42 registros?) Tipee "make run" y observe el contenido de su 
  base de datos. Ttipee "make test", no debería haber diferencia entre 
  testout.txt y testres.txt como se entregan (usando esta base de datos cds). 
  Tipee "make time" para medir el rendimiento, pruebas subsiguientes generalmente 
  son mucho más rápidas. Mi 800 MHz P3 logra en lectura aleatoria 
  más de 80.000 registros por segundo, una vez que los archivos estén 
  en el cache del sistema.
    

    $ make time
time ./openisis -v 3 -perf 100000 -db db/cds/cds
0.63user 0.61system 0:06.20elapsed 19%CPU (0avgtext+0avgdata 0maxresident)k
0inputs+0outputs (95major+11607minor)pagefaults 0swaps
$ make time
time ./openisis -v 3 -perf 100000 -db db/cds/cds
0.71user 0.53system 0:01.23elapsed 100%CPU (0avgtext+0avgdata 0maxresident)k
0inputs+0outputs (95major+11607minor)pagefaults 0swaps
	
    

    Tipee "make perl" para armar el material para perl. Se sobreentiende que previamente 
  deberá haberse instalado algún tipo de perl 5.*. Tipee "make java" o, si no 
  le alcanza, tipee "make jdump", para verlo aparecer en su nuevo y brillante 
  JDK 1.3 Java VM. Algún 1.2.* JDK debería hacerlo también, pero indíquele al 
  Makefile que no busque en /usr/java/jdk1.3, seteándolo a JAVAHOME. 
    

    instalando openisis
    

    libopenisis puede enlazarse con tu código; no es necesario instalarlo. Si desea 
  instalar los binarios 'openisis' en alguna ubicación de su path, simplemente 
  cópielo, no hay registros de configuración mágicos.

    Para instalar openisis para su disponibilidad general en su /usr/lib/perl5 
  o donde esté instalado, cambie al subdirectorio perl (después de "make perl") 
  e ingrese "make install" (como root o legitimado de otra manera). Después pruebe 
  "perldoc OpenIsis" y el script de demostración demo.pl.

    Java, like perl, needs to dynamically slurp both some stuff in the own language 
  and a native shared object. The former is openisis.jar, set your CLASSPATH to 
  include it, or specify when invoking java like in the Makefile. The latter is 
  libopenjsis.so on linux (yes, it's jsis). The system dynamic linker 
  must be able to find it; see NativeDb.java for details. 

    sobre openisis.org
    

    OpenIsis.org es esponsoreado por allmaxx.de, un servicio de merconic, Berlin, Alemania. Como un sitio 
  destinado a estudiantes, allmaxx apoya software de fuente abierto dirigido a 
  la educación y el manejo de conocimientos. Véase también la open 
  community for science.
    

    Actualmente el sitio es mantenido por Erik y Paul. Voluntarios son calurosamente bienvenidos. 
  Planeamos dar pronto las fuentes a sourceforge, Franck Martin nos invitó 
  a unirnos a su proyecto PHP isis.
    

    enlaces
    
Unesco
    Bireme
    Robert Janusz
    oss4lib
    javaisis
    Erik Grziwotz
    Klaus "Paul" Ripke
    

    
$Revision: 1.1 $ last changed $Date: 2001/10/05 14:05:02 $ by $Author: kripke $ 

    
(this page intentionally left blank :) 
./openjsis.def0100644000113000011300000000243507362537657012232 0ustar  kripkrip;
;	openisis - an open implementation of the ISIS database
;	Version 0.8.3
;	Copyright (C) 2001 by Erik Grziwotz, erik@openisis.org
;
;	This library is free software; you can redistribute it and/or
;	modify it under the terms of the GNU Lesser General Public
;	License as published by the Free Software Foundation; either
;	version 2.1 of the License, or (at your option) any later version.
;
;	This library 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
;	Lesser General Public License for more details.
;
;	You should have received a copy of the GNU Lesser General Public
;	License along with this library; if not, write to the Free Software
;	Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
;
;	This software is dedicated to the memory of Eckart Dietrich.
;
;	This software is inspired by (but contains no code of) the iAPI
;	Copyright (C) 2000 by Robert Janusz, rj@jezuici.krakow.pl.
;	See iAPI.txt for what it contains.
;EOH

; $Id: openjsis.def,v 1.1 2001/10/15 10:51:27 erikisis Exp $
; export definition file for win32 dll
;
EXPORTS
Java_org_openisis_NativeDb_nopen
Java_org_openisis_NativeDb_nreadRow
Java_org_openisis_NativeDb_nsearch

./doc/0040775000113000011300000000000007450172142010444 5ustar  kripkrip./doc/charsets.html0100664000113000011300000001445007450172142013147 0ustar  kripkrip


       
  
  ISIS charsets and unicode

  
 

     some notes on the use of charsets with ISIS  
    
 

    what are charsets?
    
 Since computers can store nothing but numbers, but we want them to store 
characters, there has to a table telling which character is stored as which 
number, or, vice versa, which number is to display and print as which character.
 such tables are called charsets.
    
 Since the smallest unit of number storage is a byte, which can hold 256
different numbers from 0 to 255, many charsets are based on one
byte and thus can hold up to 256 characters. such charsets are called 
one-byte-charsets .
    
 For many scripts, like the various versions of latin, greek, cyrillic, hebrew 
and arabic, 256 characters are more than enough.
    
 For others, namely chinese, japanese and korean (
 CJK
 ) scripts with several thousand characters, it's not enough. The modern
 vietnamese 
 script is based on latin letters but needs a vast amount of accented letters, 
so 256 isn't enough. Those scripts don't get by with one byte per character,
 so they need multi-byte-charsets, where two or more bytes are needed 
to encode one character.
    
 

    what is UNICODE
    
 UNICODE
  is a big multi-byte-charset designed to include all 
 characters
  needed in the world (over 40.000 by now), even for some ancient languages. 
The problems having several charsets are a) you have to know which charset 
is used in a given text, b) computer systems need to be aware of all possible 
charsets and c) it's not possible to have a text or database contain characters 
which are encoded in different charsets. Having all text in unicode solves 
those problems. Check out 
this sample page
 - with a 21st century browser like Mozilla 5 (Netscape 6) you will see most
or all of the letters.
    
 

    ASCII-compatible charsets and encodings
    
 Many charsets use the numbers 0 to 127 in the same way: to represent the 
basic set of latin characters defined by 
 ASCII
 . Whenever there's a byte with a number in that range, this byte has the 
meaning of the corresponding ASCII-character. For example, the number 43 always
is a plus sign +, which is important if a query expression is scanned for
such characters.
    
 All ISO-8859-x
  charsets are ASCII-compatible. Older 
 Cyrillic
  charsets are NOT compatible with ASCII. Some of the eastern multi-byte-charsets 
are, some are not.
    
Some of the multi-byte-charsets have different encodings, that is, 
there is only one table mapping numbers to letters, but distinct ways to use
multiple bytes to express such a number, some of which use the numbers in
the ASCII-range only for ASCII characters, others don't. UNICODE has two widely
used encodings, UTF-8
  and UTF-16 (UCS-2). UTF-8 is ASCII-compatible, UTF-16 is not.
    
 

    so what about ISIS
    
 

      
   
    • the ISIS database format itself is capable of storing anything and 
thus can store text in any charset/encoding.
      
 tools like biremes mx may store and retrieve (by MFN) text in nearly any 
encoding (but depending on how the programming is done, UTF-16 may not work 
because it may use bytes with value 0).
      
   
      • 
   
    • the ISIS query and formatting language depends on special ASCII-characters 
 having special meaning and therefore will require an ASCII-compatible
encoding. All the ISO-8859-x charsets will do as will UTF-8 encoded
unicode (although some care must be taken when multiple bytes representing
one character are cut off in the midth). At least in theory, mx and
    wwwisis are able to search for records in any ASCII-compatible
encoding including UTF-8 unicode (given carefull web-programming).
      • 
   
    • winisis doesn't know about the possibility of one character
having multiple bytes. It will work with any ASCII-compatible one-byte-charset
, as long as it doesn't have to know what it does. That is, if your computer
has some preferred charset installed, you will see all characters displayed
according to that charset, and a character possibly entered as the german
ä could show up as greek delta :). No support for multi-byte-charsets,
especially not unicode.
      • 
   
    • Like any Java software, 
JavaISIS
     is - in theory - able to handle unicode characters and even to do
the transformation between unicode and most of the other charsets.
 Some limitations may result from the underlying wwwisis. In practice, version
3.5 claims to give "Multi-language encoding support", but unfortunately it's
in beta since March 2001 (sources made available in Feb 2002).
      • 
   
    • openisis supports any charset and with it's Java-binding,
    especially unicode and all the conversions. openisis alone can
do it on the web, and in combination with JavaISIS (once new sources are
available) also with a winisis-like interface.
      
   
      • 
 

    
 
    
 

     some other resources on unicode 
    

To see all those characters, you need fonts to tell your display
or printer how they look like.
Here's a
 very fine page 
on how to acquire and install those fonts (and some more advice).
If you for some reason have to waste your time with M$ products,
you may want to check out
 this page .
Especially there's the one-size(23 MB)-fits-all fat font

Arial Unicode MS  (TM, (c), ... expect the worst)
containing nearly all unicode glyphs, which is also included
with newer Windoze and/or Ophice versions.



./doc/gizmo.txt0100664000113000011300000000133507420627543012340 0ustar  kripkripa gizmo is a masterfile containing text replacements.
gizmo records have fields with tags 1 and 2.
every occurence of the contents of field 1 is replaced
by the contents of the associated field 2.

gizmo translation can be used
- to perform charset translation, e.g. Cp850 to ISO-8859-1
- to translate special chars like <> with something nicer like /
- to htmlify output like with < to <
- to replace certain keywords that might be used in field contents

if a gizmo record has a field 11,
and it contains the three characters:
- asc	then field 1 is used as decimal number giving a char value
- hex	then field 1 is used as hex number (e.g. d7) giving a char value
in the same way field 21 may control interpretation of field 2.

./doc/mx.txt0100664000113000011300000000552407420627543011643 0ustar  kripkripmx overview

running mx with no params yields:
=========
CISIS Interface v3.33/GC/M/30000/10/30/I - Utility MX
Copyright (c) BIREME/PAHO 1997. All rights reserved.

mx [cipar=] [{mfrl|fmtl}=] 
   {|{in|cgi|seq|iso[=]}=|tmp} [