Make build process deterministic by sorting files

reinerh · Povilas Kanapickas · commit b7eb1813166e · 2015-08-26T05:28:45.000+03:00
diff --git a/Makefile b/Makefile
@@ -175,7 +175,7 @@ output/qch-help-project-cpp.xml: output/cppreference-doc-en-cpp.devhelp2
 
 	pushd "output/reference" > /dev/null; \
 	find . -type f -not -iname "*.ttf" \
-		-exec echo "<file>"'{}'"</file>" >> "../qch-files.xml" \; ; \
+		-exec echo "<file>"'{}'"</file>" \; | LC_ALL=C sort >> "../qch-files.xml" ; \
 	popd > /dev/null
 
 	echo "</files>" >> "output/qch-files.xml"
diff --git a/build_link_map.py b/build_link_map.py
@@ -37,7 +37,7 @@ def build_link_map(directory):
 
     link_map = LinkMap()
 
-    for fn in html_files:
+    for fn in sorted(html_files):
         f = open(fn, "r")
         text = f.read()
         f.close()
diff --git a/index2doxygen-tag.py b/index2doxygen-tag.py
@@ -21,6 +21,7 @@
 from index_transform import IndexTransform
 from xml_utils import xml_escape
 from link_map import LinkMap
+from functools import total_ordering
 import sys
 
 if len(sys.argv) != 4:
@@ -51,6 +52,7 @@ class ItemKind:
     TYPEDEF = 3,
     NAMESPACE = 4
 
+@total_ordering
 class Item:
 
     def __init__(self):
@@ -60,6 +62,12 @@ def __init__(self):
         self.link = ""
         self.members = {}
 
+    def __eq__(self, other):
+        return self.full_name == other.full_name
+
+    def __lt__(self, other):
+        return self.full_name < other.full_name
+
 ns_map = Item()
 
 def add_to_map(full_name, full_link, item_kind):
@@ -108,7 +116,7 @@ def add_to_map(full_name, full_link, item_kind):
 
 def print_members(out_f, curr_item):
     global link_map
-    for item in curr_item.members.values():
+    for item in sorted(curr_item.members.values()):
         if link_map:
             link = link_map.get_dest(item.link)
             if link == None and item.kind != ItemKind.NAMESPACE:
@@ -151,12 +159,12 @@ def print_map_item(out_f, curr_item):
     print_members(out_f, curr_item)
     out_f.write('  </compound>\n')
 
-    for item in curr_item.members.values():
+    for item in sorted(curr_item.members.values()):
         if item.kind in [ ItemKind.NAMESPACE, ItemKind.CLASS ]:
             print_map_item(out_f, item)
 
 def print_map(out_f, ns_map):
-    for item in ns_map.members.values():
+    for item in sorted(ns_map.members.values()):
         if item.kind in [ ItemKind.NAMESPACE, ItemKind.CLASS ]:
             print_map_item(out_f, item)
         else:
