| %s | " % (source) print ""
for vers in version.split():
- print "%s " % (source, utils.html_escape(vers), utils.html_escape(vers)) + print "%s " % (source, utils.html_escape(vers), utils.html_escape(vers)) print " | "
print "%s | " % (arch) print "" @@ -430,16 +454,16 @@ def process_changes_files(changes_files, type, log): age = Cnf["Queue-Report::Options::Age"] if Cnf.has_key("Queue-Report::Options::New"): # If we produce html we always have oldest first. - direction.append([4,-1,"ao"]) + direction.append([5,-1,"ao"]) else: if Cnf.has_key("Queue-Report::Options::Sort"): for i in Cnf["Queue-Report::Options::Sort"].split(","): if i == "ao": # Age, oldest first. - direction.append([4,-1,age]) + direction.append([5,-1,age]) elif i == "an": # Age, newest first. - direction.append([4,1,age]) + direction.append([5,1,age]) elif i == "na": # Name, Ascending. direction.append([0,1,0]) @@ -448,10 +472,10 @@ def process_changes_files(changes_files, type, log): direction.append([0,-1,0]) elif i == "nl": # Notes last. - direction.append([3,1,0]) + direction.append([4,1,0]) elif i == "nf": # Notes first. - direction.append([3,-1,0]) + direction.append([4,-1,0]) entries.sort(lambda x, y: sortfunc(x, y)) # Yes, in theory you can add several sort options at the commandline with. But my mind is to small # at the moment to come up with a real good sorting function that considers all the sidesteps you @@ -495,7 +519,7 @@ def process_changes_files(changes_files, type, log): log.write("\n") if Cnf.has_key("Queue-Report::Options::New"): - direction.append([4,1,"ao"]) + direction.append([5,1,"ao"]) entries.sort(lambda x, y: sortfunc(x, y)) # Output for a html file. First table header. then table_footer. # Any line between them is then a |