#ifndef lint static char rcsid[] = "@(#$Id: docseqhist.cpp,v 1.4 2008-09-29 08:59:20 dockes Exp $ (C) 2005 J.F.Dockes"; #endif /* * 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., * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #include #include #include #include "docseqhist.h" #include "rcldb.h" #include "fileudi.h" #include "internfile.h" #include "base64.h" #include "debuglog.h" #include "smallut.h" // Encode document history entry: // U + Unix time + base64 of udi // The U distinguishes udi-based entries from older fn+ipath ones bool RclDHistoryEntry::encode(string& value) { char chartime[20]; sprintf(chartime, "%ld", unixtime); string budi; base64_encode(udi, budi); value = string("U ") + string(chartime) + " " + budi; return true; } // Decode. We support historical entries which were like "time b64fn [b64ipath]" // Current entry format is "U time b64udi" bool RclDHistoryEntry::decode(const string &value) { list vall; stringToStrings(value, vall); list::const_iterator it = vall.begin(); udi.erase(); string fn, ipath; switch (vall.size()) { case 2: // Old fn+ipath, null ipath case unixtime = atol((*it++).c_str()); base64_decode(*it++, fn); break; case 3: if (!it->compare("U")) { // New udi-based entry it++; unixtime = atol((*it++).c_str()); base64_decode(*it++, udi); } else { // Old fn + ipath. We happen to know how to build an udi unixtime = atol((*it++).c_str()); base64_decode(*it++, fn); base64_decode(*it, ipath); } break; default: return false; } if (!fn.empty()) { // Old style entry found, make an udi, using the fs udi maker make_udi(fn, ipath, udi); } LOGDEB1(("RclDHistoryEntry::decode: udi [%s]\n", udi.c_str())); return true; } bool RclDHistoryEntry::equal(const DynConfEntry& other) { const RclDHistoryEntry& e = dynamic_cast(other); return e.udi == udi; } bool historyEnterDoc(RclDynConf *dncf, const string& udi) { LOGDEB1(("historyEnterDoc: [%s] into %s\n", udi.c_str(), dncf->getFilename().c_str())); RclDHistoryEntry ne(time(0), udi); RclDHistoryEntry scratch; return dncf->insertNew(docHistSubKey, ne, scratch, 200); } list getDocHistory(RclDynConf* dncf) { return dncf->getList(docHistSubKey); } bool DocSequenceHistory::getDoc(int num, Rcl::Doc &doc, string *sh) { // Retrieve history list if (!m_hist) return false; if (m_hlist.empty()) m_hlist = getDocHistory(m_hist); if (num < 0 || num >= (int)m_hlist.size()) return false; int skip; if (m_prevnum >= 0 && num >= m_prevnum) { skip = num - m_prevnum; } else { skip = num; m_it = m_hlist.begin(); m_prevtime = -1; } m_prevnum = num; while (skip--) m_it++; if (sh) { if (m_prevtime < 0 || abs (float(m_prevtime) - float(m_it->unixtime)) > 86400) { m_prevtime = m_it->unixtime; time_t t = (time_t)(m_it->unixtime); *sh = string(ctime(&t)); // Get rid of the final \n in ctime sh->erase(sh->length()-1); } else sh->erase(); } bool ret = m_db->getDoc(m_it->udi, doc); if (!ret) { doc.url = "UNKNOWN"; doc.ipath = ""; } return ret; } bool DocSequenceHistory::getEnclosing(Rcl::Doc& doc, Rcl::Doc& pdoc) { string udi; if (!FileInterner::getEnclosing(doc.url, doc.ipath, pdoc.url, pdoc.ipath, udi)) return false; return m_db->getDoc(udi, pdoc); } int DocSequenceHistory::getResCnt() { if (m_hlist.empty()) m_hlist = getDocHistory(m_hist); return m_hlist.size(); }