/* * SimpleCollectionDatabase.java * Copyright (C) 2008 New Zealand Digital Library, http://www.nzdl.org * * 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; either version 2 of the License, or * (at your option) any later version. * * 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ package org.greenstone.gsdl3.util; import org.apache.log4j.*; public class SimpleCollectionDatabase { static Logger logger = Logger.getLogger(org.greenstone.gsdl3.util.SimpleCollectionDatabase.class.getName()); /* just read access, many readers can share a database */ public final static int READ = FlatDatabaseWrapper.READ; /* read/write, exclusive access */ public final static int WRITE = FlatDatabaseWrapper.WRITE; protected FlatDatabaseWrapper coll_db = null; public SimpleCollectionDatabase(String db_type) { if (db_type.equalsIgnoreCase("gdbm")) { this.coll_db = new GDBMWrapper(); } else if (db_type.equalsIgnoreCase("jdbm")) { this.coll_db = new JDBMWrapper(); } else { logger.error("Couldn't create SimpleCollectionDatabase of type "+db_type); } } /** open the database filename, with mode mode - uses the FlatDatabaseWrapper modes */ public boolean openDatabase(String filename, int mode){ return this.coll_db.openDatabase(filename, mode); } /** close the database */ public void closeDatabase() { this.coll_db.closeDatabase(); } /** Returns a DBInfo structure of the key-value pairs associated with a particular main key in the database */ public DBInfo getInfo(String main_key) { // logger.warn("All the entries of the db are:"); // this.coll_db.displayAllEntries(); String key_info = this.coll_db.getValue(main_key); if (key_info == null || key_info.equals("")) { return null; } DBInfo info = new DBInfo(); String [] lines = key_info.split("\n"); String key; String value; for (int i=0; i'); if (a==-1 || b==-1) { logger.error("bad format in db"); } else { key=lines[i].substring(a+1, b); value=lines[i].substring(b+1); logger.debug("key="+key+", val="+value); info.addInfo(key, value); } } return info; } /** converts a greenstone OID to internal docnum */ public String OID2Docnum(String OID) { DBInfo info = getInfo(OID); if (info != null) { return info.getInfo("docnum"); } return null; } /** converts a greenstone OID to an internal docnum, returning a Long - convenience method*/ public long OID2DocnumLong(String OID) { DBInfo info = getInfo(OID); if (info != null) { long real_num = Long.parseLong(info.getInfo("docnum")); return real_num; } return -1; } /** converts a docnum to greenstone OID */ public String docnum2OID(String docnum) { DBInfo info = getInfo(docnum); if (info!=null){ String oid = info.getInfo("section"); return oid; } else{ return null; } } /** converts a docnum to greenstone OID - convenience method */ public String docnum2OID(long docnum) { return docnum2OID(Long.toString(docnum)); } /** converts an external id to greenstone OID */ public String externalId2OID(String extid) { DBInfo info = getInfo(extid); if (info != null) { String oid = info.getInfo("section"); return oid; } return null; } /** translates relative oids into proper oids: * .pr (parent), .rt (root) .fc (first child), .lc (last child), * .ns (next sibling), .ps (previous sibling) * .np (next page), .pp (previous page) : links sections in the order that you'd read the document * a suffix is expected to be present so test before using */ public String translateOID(String oid) { int p = oid.lastIndexOf('.'); if (p != oid.length()-3) { logger.info("translateoid error: '.' is not the third to last char!!"); return oid; } String top = oid.substring(0, p); String suff = oid.substring(p+1); // just in case we have multiple extensions, we must translate // we process inner ones first if (OID.needsTranslating(top)) { top = translateOID(top); } if (suff.equals("pr")) { return OID.getParent(top); } if (suff.equals("rt")) { return OID.getTop(top); } if (suff.equals("np")) { // try first child String node_id = translateOID(top+".fc"); if (!node_id.equals(top)) { return node_id; } // try next sibling node_id = translateOID(top+".ns"); if (!node_id.equals(top)) { return node_id; } // otherwise we keep trying parents sibling String child_id = top; String parent_id = OID.getParent(child_id); while(!parent_id.equals(child_id)) { node_id = translateOID(parent_id+".ns"); if (!node_id.equals(parent_id)) { return node_id; } child_id = parent_id; parent_id = OID.getParent(child_id); } return top; // we couldn't get a next page, so just return the original } if (suff.equals("pp")) { String prev_sib = translateOID(top+".ps"); if (prev_sib.equals(top)) { // no previous sibling, so return the parent return OID.getParent(top); } // there is a previous sibling, so its either this section, or the last child of the last child.. String last_child = translateOID(prev_sib+".lc"); while (!last_child.equals(prev_sib)) { prev_sib = last_child; last_child = translateOID(prev_sib+".lc"); } return last_child; } int sibling_num = 0; if (suff.equals("ss")) { // we have to remove the sib num before we get top p = top.lastIndexOf('.'); sibling_num = Integer.parseInt(top.substring(p+1)); top = top.substring(0, p); } // need to get info out of collection db - String doc_id = top; if (suff.endsWith("s")) { doc_id = OID.getParent(top); if (doc_id.equals(top)) { // i.e. we are already at the top return top; } } DBInfo info = getInfo(doc_id); if (info==null) { logger.info("info is null!!"); return top; } String contains = info.getInfo("contains"); if (contains.equals("")) { // something is wrong return top; } contains = contains.replaceAll("\"", doc_id); String [] children = contains.split(";"); if (suff.equals("fc")) { return children[0]; } else if (suff.equals("lc")) { return children[children.length-1]; } else { if (suff.equals("ss")) { return children[sibling_num-1]; } // find the position that we are at. int i=0; while (i