Update sort.py

Ahmed Abdelaal · web-flow · commit 53cc1fafd01b · 2016-11-11T17:57:50.000+03:00
diff --git a/sort.py b/sort.py
@@ -12,9 +12,7 @@
     This could be extended by having nested blocks, sorting them recursively
     and flattening the end structure into a list of lines. Revision 2 maybe ^.^.
 """
-
-
-def main():
+def sort_blocks():
     # First, we load the current README into memory
     with open('README.md', 'r') as read_me_file:
         read_me = read_me_file.read()
@@ -42,6 +40,40 @@ def main():
     with open('README.md', 'w+') as sorted_file:
         sorted_file.write(final_README)
 
+def main():
+    # First, we load the current README into memory as an array of lines
+    with open('README.md', 'r') as read_me_file:
+        read_me = read_me_file.readlines()
+
+    # Then we cluster the lines together as blocks
+    # Each block represents a collection of lines that should be sorted
+    # This was done by assuming only links ([...](...)) are meant to be sorted
+    # Clustering is done by indentation
+    blocks = []
+    last_indent = None
+    for line in read_me:
+        s_line = line.lstrip()
+        indent = len(line) - len(s_line)
+
+        if any([s_line.startswith(s) for s in ['* [', '- [']]):
+            if indent == last_indent:
+                blocks[-1].append(line)
+            else:
+                blocks.append([line])
+            last_indent = indent
+        else:
+            blocks.append([line])
+            last_indent = None
+
+    with open('README.md', 'w+') as sorted_file:
+        # Then all of the blocks are sorted individually
+        blocks = [''.join(sorted(block, key=lambda s: s.lower())) for block in blocks]
+        # And the result is written back to README.md
+        sorted_file.write(''.join(blocks))
+        
+    # Then we call the sorting method
+    sort_blocks()
+    
 
 if __name__ == "__main__":
     main()
