javascript - Django: how to poll a django application for updates on an asynchronous task? (noob edition) -


note: noob edition i.e. requires thoroughly explained answer myself , others can use reference.

a demo project available on gitlab , github

context

i have simple application in django consists of form , results page. after form submitted there processing can take quite time.

naturally, nice to:

  1. run computation asynchronously user results page faster
  2. provide updates user of progress of request.

so have tried figuring out how , hasn't gone well.

to understanding should following:

  • install celery
  • make app in celery task computation
  • have task output progress either log file or update model (if model has status field)
  • use js , jquery or angular.js or node.js , socket.io somehow poll application progress.

and there whatever else told or can find either glosses on how works, assumes know how works , can adapt use case, or if try explain it.

i not understand answers (so referencing them doesn't any)

question

how can status updates asynchronous task run in django application?

how answer

since other posts have not been enough me understand how (and given number of other posts related this, not alone), made demo project (gitlab, github) in django has setup referring (a page form , page show status of results until results ready). looking explain via this demo project how poll server status of asynchronous task (and generous comments).

don't want use celery? want use redis instead of rabbitmq? use of node.js , socket.io? fine , fair game. comment changes made , make clear how additions make possible run asynchronous task , query status.

about demo project

in demo project have 2 views index , query. index has simple form 2 integers. when form submitted, redirect query view.

there file called tasks.py has simple task adding 2 integers provided in form.

how modify simple demo project such can asynchronously run task , query view realtime updates status of computation.

since computation here simple, pause statements might necessary or task might have changed (e.g. recursively add 2 number 10000 times)

thank understanding , in teaching how important feature.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more