# -*- coding: iso-8859-1 -*- # Copyright (C) 2000-2004 Bastian Kleineidam # # 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. import time from linkcheck import Config, i18n from linkcheck.StringUtil import xmlify from linkcheck.log import strtime, strduration from StandardLogger import StandardLogger from Logger import Logger class XMLLogger (StandardLogger): """XML output mirroring the GML structure. Easy to parse with any XML tool.""" def __init__ (self, **args): super(XMLLogger, self).__init__(**args) self.nodes = {} self.nodeid = 0 def init (self): Logger.init(self) if self.fd is None: return self.starttime = time.time() self.fd.write('\n') if self.has_field("intro"): self.fd.write("\n\n") self.fd.write('\n\n') self.fd.flush() def newUrl (self, urlData): """write one node and all possible edges""" if self.fd is None: return node = urlData if node.url and not self.nodes.has_key(node.url): node.id = self.nodeid self.nodes[node.url] = node self.nodeid += 1 self.fd.write(' \n") if self.has_field("realurl"): self.fd.write(" \n" % xmlify(node.url)) self.fd.write(" \n") if node.dltime>=0 and self.has_field("dltime"): self.fd.write(" %f\n" % node.dltime) if node.dlsize>=0 and self.has_field("dlsize"): self.fd.write(" %d\n" % node.dlsize) if node.checktime and self.has_field("checktime"): self.fd.write(" %f\n" \ % node.checktime) if self.has_field("extern"): self.fd.write(" %d\n" % \ (node.extern and 1 or 0)) self.fd.write(" \n") self.fd.write(" \n") self.writeEdges() def writeEdges (self): """write all edges we can find in the graph in a brute-force manner. Better would be a mapping of parent urls. """ for node in self.nodes.values(): if self.nodes.has_key(node.parentName): self.fd.write(" \n") if self.has_field("url"): self.fd.write(" \n" % xmlify(node.urlName)) self.fd.write(" \n") if self.has_field("result"): self.fd.write(" %d\n" % \ (node.valid and 1 or 0)) self.fd.write(" \n") self.fd.write(" \n") self.fd.flush() def endOfOutput (self, linknumber=-1): if self.fd is None: return self.fd.write("\n\n") if self.has_field("outro"): self.stoptime = time.time() duration = self.stoptime - self.starttime self.fd.write("") self.fd.flush() self.fd = None