Browse Source

Sorting entries lexicographically within the same quantity buckets.

M. Ian Graham 19 years ago
parent
commit
432c06f65d
1 changed files with 9 additions and 2 deletions
  1. 9 2
      direct/src/showbase/ContainerReport.py

+ 9 - 2
direct/src/showbase/ContainerReport.py

@@ -156,13 +156,20 @@ class ContainerReport:
         count = 0
         count = 0
         stop = False
         stop = False
         for l in lengths:
         for l in lengths:
-            len2ids[l].sort()
+            #len2ids[l].sort()
+            pathStrList = list()
             for id in len2ids[l]:
             for id in len2ids[l]:
                 obj = self._id2container[id]
                 obj = self._id2container[id]
-                print '%s: %s' % (l, self._id2pathStr[id])
+                #print '%s: %s' % (l, self._id2pathStr[id])
+                pathStrList.append(self._id2pathStr[id])
                 count += 1
                 count += 1
                 if limit is not None and count >= limit:
                 if limit is not None and count >= limit:
                     return
                     return
+            pathStrList.sort()
+            for pathstr in pathStrList:
+                if pathstr.find("reload") == -1:
+                    print '%s: %s' % (l, pathstr)
+
 
 
     def _output(self, **kArgs):
     def _output(self, **kArgs):
         print "===== ContainerReport: \'%s\' =====" % (self._name,)
         print "===== ContainerReport: \'%s\' =====" % (self._name,)