Timeline for How do you work with Asynchronous functions, recursively?
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2011 at 3:57 | vote | accept | Devdatta Tengshe | ||
| Oct 21, 2011 at 3:57 | vote | accept | Devdatta Tengshe | ||
| Oct 21, 2011 at 3:57 | |||||
| Oct 21, 2011 at 3:56 | vote | accept | Devdatta Tengshe | ||
| Oct 21, 2011 at 3:56 | |||||
| Oct 20, 2011 at 15:52 | comment | added | kylben | @DevdattaTengshe, sounds like a decent approach to me, though I might look at implementing the pending calls as a stack instead of an array, first for cleaner popping, second because it probably works better with filling out your tree. FIlling out your tree as you go, along with maintaining some kind of pointer to the current location in it might be cleaner still. Your query function can go to the bookmark, query with that, add the results, and move the bookmark to the first child. If no children, move it to a sibling, or go up the tree looking for unexplored branches. | |
| Oct 20, 2011 at 15:38 | answer | added | David | timeline score: 2 | |
| Oct 20, 2011 at 15:35 | comment | added | Daenyth | @DevdattaTengshe: I was talking more about using some kind of library to manage it rather than doing it by hand - such a library may have some kind of provisions for a situation like yours | |
| Oct 20, 2011 at 15:09 | answer | added | P.Brian.Mackey | timeline score: 1 | |
| Oct 20, 2011 at 14:51 | comment | added | Devdatta Tengshe | @Daenyth The input and result arrays that I mentioned, are a form of a queue. Or am I missing something, and you are talking of something else? | |
| Oct 20, 2011 at 14:48 | comment | added | Daenyth | Maybe some kind of Queueing setup would help? | |
| Oct 20, 2011 at 14:47 | comment | added | ChrisF | It's not a Stack Overflow question - primarily because there's no code! Design and algorithm questions are definitely on topic here. | |
| Oct 20, 2011 at 14:44 | comment | added | Devdatta Tengshe | If this question seems to be better suited for stackoverflow, mods, please migrate it there. | |
| Oct 20, 2011 at 14:43 | history | asked | Devdatta Tengshe | CC BY-SA 3.0 |