Python - RSS torrent downloaderChromium Nightly Build DownloaderTorrent File RemoverTkinter RSS feedPython...

ESPP--any reason not to go all in?

Why can't we use freedom of speech and expression to incite people to rebel against government in India?

Learning to quickly identify valid fingering for piano?

Should I use HTTPS on a domain that will only be used for redirection?

Affine transformation of circular arc in 3D

Paper published similar to PhD thesis

The past tense for the quoting particle って

Can a Mexican citizen living in US under DACA drive to Canada?

Naming Characters after Friends/Family

Quitting employee has privileged access to critical information

DC input on op amp integrator

How can friction do no work in case of pure rolling?

Is there a way to find out the age of climbing ropes?

Is there a math equivalent to the conditional ternary operator?

Called into a meeting and told we are being made redundant (laid off) and "not to share outside". Can I tell my partner?

School performs periodic password audits. Is my password compromised?

Can a space-faring robot still function over a billion years?

Why is, for a group scheme of finite type, "smooth" (resp. irreducible) equivalent to "geometrically reduced" (resp. geometrically irreducible)?

Rationale to prefer local variables over instance variables?

Can you run a ground wire from stove directly to ground pole in the ground

Ultrafilters as a double dual

Why is there an extra space when I type "ls" on the Desktop?

Python function to ask for a multiple-choice answer

How do you make a gun that shoots melee weapons and/or swords?



Python - RSS torrent downloader


Chromium Nightly Build DownloaderTorrent File RemoverTkinter RSS feedPython Document DownloaderVIM colors downloader in PythonVIM colors downloader in Python, using multiprocessingSimple Python job vacancies downloaderMagpi Magazine DownloaderFinding torrents and adding to torrent Clients using python scriptPython YouTube downloader with tkinter













0












$begingroup$


Just looking for any tips on improving what I have. It does exactly what I want but i'm still learning Python and was wondering if there's something I can do to make it more efficient or simplify anything.



    import feedparser
import os
import urllib
import re

dwnLoc = 'C:/Downloads/'

#shows currently watching
shwOne = 'RSS LINK'
shwTwo = 'RSS LINK2'
aniLst = [shwOne, shwTwo]

#the episodes currently on
oneCur = [72,73]
twoCur = [13]
allEpi = [oneCur, twoCur]

#parse rss feed to
#create lists for episodes to download, their download links, and file names
newEpi =[]
dwnLnk = []
filNme = []
for shows,epi in zip(aniLst,allEpi):
dump = feedparser.parse(shows)
epiTrk = []
for post in dump.entries:
epiNum = [int(item) for item in post.title.split() if item.isdigit()]
if len(epiNum) == 1:
if epiNum[0] > epi[len(epi)-1]:
dwnLnk.append(post.link)
filNme.append(post.title + '.torrent')
epiTrk.append(epiNum[0])
newEpi.append(epiTrk)

#downloads and runs torrent
for link,name in zip(dwnLnk,filNme):
fileDownloaded = dwnLoc + name + '.torrent'
urllib.request.urlretrieve(link,fileDownloaded)
os.startfile(fileDownloaded)

#rewrites script to increment current episodes if one was downloaded
content = []
with open(__file__,"r") as f:
for line in f:
content.append(line)

with open(__file__,"w") as f:
counter = 0
for i,item in enumerate(content):
if all(str1 in item for str1 in ['Cur',']']) and not any(str2 in item for str2 in ['all','if']):
endFnd = item.find(']')
epiLst = newEpi[counter]
itmAdd = item[:endFnd]
for epiAdd in reversed(epiLst):
itmAdd += ',' + str(epiAdd)
content[i] = itmAdd + ']n'
counter += 1
for j in range(len(content)):
f.write(content[j])








share







New contributor




qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    0












    $begingroup$


    Just looking for any tips on improving what I have. It does exactly what I want but i'm still learning Python and was wondering if there's something I can do to make it more efficient or simplify anything.



        import feedparser
    import os
    import urllib
    import re

    dwnLoc = 'C:/Downloads/'

    #shows currently watching
    shwOne = 'RSS LINK'
    shwTwo = 'RSS LINK2'
    aniLst = [shwOne, shwTwo]

    #the episodes currently on
    oneCur = [72,73]
    twoCur = [13]
    allEpi = [oneCur, twoCur]

    #parse rss feed to
    #create lists for episodes to download, their download links, and file names
    newEpi =[]
    dwnLnk = []
    filNme = []
    for shows,epi in zip(aniLst,allEpi):
    dump = feedparser.parse(shows)
    epiTrk = []
    for post in dump.entries:
    epiNum = [int(item) for item in post.title.split() if item.isdigit()]
    if len(epiNum) == 1:
    if epiNum[0] > epi[len(epi)-1]:
    dwnLnk.append(post.link)
    filNme.append(post.title + '.torrent')
    epiTrk.append(epiNum[0])
    newEpi.append(epiTrk)

    #downloads and runs torrent
    for link,name in zip(dwnLnk,filNme):
    fileDownloaded = dwnLoc + name + '.torrent'
    urllib.request.urlretrieve(link,fileDownloaded)
    os.startfile(fileDownloaded)

    #rewrites script to increment current episodes if one was downloaded
    content = []
    with open(__file__,"r") as f:
    for line in f:
    content.append(line)

    with open(__file__,"w") as f:
    counter = 0
    for i,item in enumerate(content):
    if all(str1 in item for str1 in ['Cur',']']) and not any(str2 in item for str2 in ['all','if']):
    endFnd = item.find(']')
    epiLst = newEpi[counter]
    itmAdd = item[:endFnd]
    for epiAdd in reversed(epiLst):
    itmAdd += ',' + str(epiAdd)
    content[i] = itmAdd + ']n'
    counter += 1
    for j in range(len(content)):
    f.write(content[j])








    share







    New contributor




    qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      0












      0








      0





      $begingroup$


      Just looking for any tips on improving what I have. It does exactly what I want but i'm still learning Python and was wondering if there's something I can do to make it more efficient or simplify anything.



          import feedparser
      import os
      import urllib
      import re

      dwnLoc = 'C:/Downloads/'

      #shows currently watching
      shwOne = 'RSS LINK'
      shwTwo = 'RSS LINK2'
      aniLst = [shwOne, shwTwo]

      #the episodes currently on
      oneCur = [72,73]
      twoCur = [13]
      allEpi = [oneCur, twoCur]

      #parse rss feed to
      #create lists for episodes to download, their download links, and file names
      newEpi =[]
      dwnLnk = []
      filNme = []
      for shows,epi in zip(aniLst,allEpi):
      dump = feedparser.parse(shows)
      epiTrk = []
      for post in dump.entries:
      epiNum = [int(item) for item in post.title.split() if item.isdigit()]
      if len(epiNum) == 1:
      if epiNum[0] > epi[len(epi)-1]:
      dwnLnk.append(post.link)
      filNme.append(post.title + '.torrent')
      epiTrk.append(epiNum[0])
      newEpi.append(epiTrk)

      #downloads and runs torrent
      for link,name in zip(dwnLnk,filNme):
      fileDownloaded = dwnLoc + name + '.torrent'
      urllib.request.urlretrieve(link,fileDownloaded)
      os.startfile(fileDownloaded)

      #rewrites script to increment current episodes if one was downloaded
      content = []
      with open(__file__,"r") as f:
      for line in f:
      content.append(line)

      with open(__file__,"w") as f:
      counter = 0
      for i,item in enumerate(content):
      if all(str1 in item for str1 in ['Cur',']']) and not any(str2 in item for str2 in ['all','if']):
      endFnd = item.find(']')
      epiLst = newEpi[counter]
      itmAdd = item[:endFnd]
      for epiAdd in reversed(epiLst):
      itmAdd += ',' + str(epiAdd)
      content[i] = itmAdd + ']n'
      counter += 1
      for j in range(len(content)):
      f.write(content[j])








      share







      New contributor




      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      Just looking for any tips on improving what I have. It does exactly what I want but i'm still learning Python and was wondering if there's something I can do to make it more efficient or simplify anything.



          import feedparser
      import os
      import urllib
      import re

      dwnLoc = 'C:/Downloads/'

      #shows currently watching
      shwOne = 'RSS LINK'
      shwTwo = 'RSS LINK2'
      aniLst = [shwOne, shwTwo]

      #the episodes currently on
      oneCur = [72,73]
      twoCur = [13]
      allEpi = [oneCur, twoCur]

      #parse rss feed to
      #create lists for episodes to download, their download links, and file names
      newEpi =[]
      dwnLnk = []
      filNme = []
      for shows,epi in zip(aniLst,allEpi):
      dump = feedparser.parse(shows)
      epiTrk = []
      for post in dump.entries:
      epiNum = [int(item) for item in post.title.split() if item.isdigit()]
      if len(epiNum) == 1:
      if epiNum[0] > epi[len(epi)-1]:
      dwnLnk.append(post.link)
      filNme.append(post.title + '.torrent')
      epiTrk.append(epiNum[0])
      newEpi.append(epiTrk)

      #downloads and runs torrent
      for link,name in zip(dwnLnk,filNme):
      fileDownloaded = dwnLoc + name + '.torrent'
      urllib.request.urlretrieve(link,fileDownloaded)
      os.startfile(fileDownloaded)

      #rewrites script to increment current episodes if one was downloaded
      content = []
      with open(__file__,"r") as f:
      for line in f:
      content.append(line)

      with open(__file__,"w") as f:
      counter = 0
      for i,item in enumerate(content):
      if all(str1 in item for str1 in ['Cur',']']) and not any(str2 in item for str2 in ['all','if']):
      endFnd = item.find(']')
      epiLst = newEpi[counter]
      itmAdd = item[:endFnd]
      for epiAdd in reversed(epiLst):
      itmAdd += ',' + str(epiAdd)
      content[i] = itmAdd + ']n'
      counter += 1
      for j in range(len(content)):
      f.write(content[j])






      python





      share







      New contributor




      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.










      share







      New contributor




      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.








      share



      share






      New contributor




      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 3 mins ago









      qrsqrs

      1




      1




      New contributor




      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      qrs is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "196"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });






          qrs is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214972%2fpython-rss-torrent-downloader%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          qrs is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          qrs is a new contributor. Be nice, and check out our Code of Conduct.













          qrs is a new contributor. Be nice, and check out our Code of Conduct.












          qrs is a new contributor. Be nice, and check out our Code of Conduct.
















          Thanks for contributing an answer to Code Review Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214972%2fpython-rss-torrent-downloader%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown