Comments on: Data structures example: the queue class http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/ game development blog Thu, 15 Jul 2010 15:28:54 +0200 http://wordpress.org/?v=2.9.2 hourly 1 By: daylyn http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/comment-page-1/#comment-179753 daylyn Sat, 20 Feb 2010 03:45:41 +0000 http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/#comment-179753 so good these articles. so good these articles.

]]> By: Ajeet http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/comment-page-1/#comment-176802 Ajeet Sat, 23 Jan 2010 08:55:17 +0000 http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/#comment-176802 IT's not a good example.. IT’s not a good example..

]]> By: Visual Harmonics » Post Topic » AS3 conversion of “Modelling Rays for Line of Sight in an Object-Rich World” http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/comment-page-1/#comment-129690 Visual Harmonics » Post Topic » AS3 conversion of “Modelling Rays for Line of Sight in an Object-Rich World” Mon, 26 Jan 2009 21:58:03 +0000 http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/#comment-129690 [...] Another very important thing if you wish to use the code (and it is noted in the updated code comments) is to make sure you use a far superior option for queuing that Adobe’s pathetically slow “Array as a queue wannabe by using shift()”. Array is Array, and that means that by definition it does not do what linked lists, queues, stacks etc. do with anywhere near the same efficiency. I can suggest Mike Baczynski’s Queue implementation. [...] [...] Another very important thing if you wish to use the code (and it is noted in the updated code comments) is to make sure you use a far superior option for queuing that Adobe’s pathetically slow “Array as a queue wannabe by using shift()”. Array is Array, and that means that by definition it does not do what linked lists, queues, stacks etc. do with anywhere near the same efficiency. I can suggest Mike Baczynski’s Queue implementation. [...]

]]> By: The collections package at dpdk Open Source http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/comment-page-1/#comment-102275 The collections package at dpdk Open Source Thu, 09 Oct 2008 12:43:43 +0000 http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/#comment-102275 [...] using the great opensource package from Michael Baczynksy at polygonal.de for the use of lists, queues, stacks and trees . While it works great, it has some explicit design decisions that we do not want [...] [...] using the great opensource package from Michael Baczynksy at polygonal.de for the use of lists, queues, stacks and trees . While it works great, it has some explicit design decisions that we do not want [...]

]]> By: Nicolas http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/comment-page-1/#comment-78214 Nicolas Thu, 24 Jul 2008 21:17:46 +0000 http://lab.polygonal.de/2007/05/23/data-structures-example-the-queue-class/#comment-78214 Good job at creating a containers lib for Action, when i first started doing flash,i was amazed there was now STL like stuff in the core. Thanks very much. Good job at creating a containers lib for Action, when i first started doing flash,i was amazed there was now STL like stuff in the core.

Thanks very much.

]]>