Update sort.py

This commit is contained in:
Ahmed Abdelaal 2016-11-11 16:45:39 +03:00 committed by GitHub
parent 60734b11e8
commit ebab050c3b
1 changed files with 22 additions and 25 deletions

47
sort.py
View File

@ -15,35 +15,32 @@
def main():
# First, we load the current README into memory as an array of lines
# First, we load the current README into memory
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
read_me = read_me_file.read()
# Separating the 'table of contents' from the contents (blocks)
table_of_contents = ''.join(read_me.split('- - -')[0])
blocks = ''.join(read_me.split('- - -')[1]).split('\n# ')
for i in range(len(blocks)):
if i == 0:
blocks[i] = blocks[i]+'\n'
else:
blocks.append([line])
last_indent = None
blocks[i] = '#' + blocks[i]+'\n'
# Sorting the libraries
inner_blocks = sorted(blocks[0].split('##'))
for i in range(1 , len(inner_blocks)):
if inner_blocks[i][0] != '#':
inner_blocks[i]='##'+inner_blocks[i]
inner_blocks=''.join(inner_blocks)
# Replacing the non-sorted libraries by the sorted ones and gathering all at the final_README file
blocks[0] = inner_blocks
final_README = table_of_contents + '- - -'+ ''.join(blocks)
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))
sorted_file.write(final_README)
if __name__ == "__main__":