mathdatech/awesome-python
1
0
Fork 0
mirror of https://github.com/vinta/awesome-python.git synced 2024-11-23 20:11:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix sort.py

Browse Source
This commit is contained in:
Vinta 2016-11-12 22:26:46 +08:00
parent 6041c0b211
commit 3a3a01150d
1 changed files with 11 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
sort.py
View File

@ -12,31 +12,32 @@
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 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()
# 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'
blocks[i] = blocks[i] + '\n'
else:
blocks[i] = '#' + blocks[i]+'\n'
# Sorting the libraries
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[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)
final_README = table_of_contents + '- - -' + ''.join(blocks)
with open('README.md', 'w+') as sorted_file:
sorted_file.write(final_README)
@ -70,10 +71,10 @@ def main():
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()