import queue def GetItemList(q): ret = [] n = q.qsize() while n>0: ret.append(q.get()) n -= 1 return ret l = 'apple,banana,orange' #queue test q = queue.Queue() for x in l.split(','): print(x) q.put(x) print( GetItemList(q) ) #stack case #LIFO last in first out q = queue.LifoQueue() for x in l.split(','): q.put(x) print( GetItemList(q) ) #priorityQueue q = queue.PriorityQueue() q.put((5,"apple")) q.put((10,"banana")) q.put((1,"orange")) print( GetItemList(q) ) """ out put is... ['apple', 'banana', 'orange'] ['orange', 'banana', 'apple'] [(1, 'orange'), (5, 'apple'), (10, 'banana')] """
3/18/2014
Python Study, queue, stack, priority queue, example source code
Subscribe to:
Post Comments (Atom)
-
This is data acquisition source code of LMS511(SICK co.) Source code is made by MFC(vs 2008). The sensor is communicated by TCP/IP. ...
-
Image size of origin is 320*240. Processing time is 30.96 second took. The result of stitching The resul...
-
In past, I wrote an articel about YUV 444, 422, 411 introduction and yuv rgb converting example code. refer to this page -> http://feel...
-
Open Source License Commercial Use Guide Understanding Commercial Rights in Open Source Licenses π Legend ✅ Free : Comm...
-
Created Date : 2007.1 Language : C/C++ Tool : Microsoft Visual C++ 6.0 Library & Utilized : OpenCV 1.0 Reference : Learning Ope...
-
OpenCV has AdaBoost algorithm function. And gpu version also is provided. For using detection, we prepare the trained xml file. Although...
-
Visual Studio 2012 Update (at least ver 2, this should be version 4): http://www.microsoft.com/en-us/downlo... Git for Windows: http://git-s...
-
I am wondering that two hog features can compare or not. There was a article about this question on this page -> http://stackoverflow...
-
C++ Template Parameter Packs with sequence Simple Explanation sequence<x,x,x> is a template that holds a compile-time list of int...
-
A C++ pattern where you create a temporary object and immediately call its function operator in one line. The syntax Class<Template...
No comments:
Post a Comment