Group items matching
in title, tags, annotations or urlSourceForge.net: pywinauto-users - 1 views
PARLEY -- python actor library - 0 views
WhatsNew083 - IPython - 0 views
Generator Tricks for Systems Programmers - 0 views
pydot - Google Code - 0 views
g :: Dynamic Function Signatures - 0 views
code.enthought.com - Traits - 0 views
PyImport_ImportModule/embedding: surprising behaviors - 0 views
simple? embedding question - Object Mix - 0 views
-
PyObject *mainmod = PyImport_AddModule("__main__"); PyObject *foo = PyImport_ImportModule("foo"); Py_INCREF(foo); //Increment foo module since PyModule_AddObject() steals reference PyModule_AddObject(mainmod, "foo", foo);
Mutagen - quodlibet - Google Code - Mutagen tagging library - 0 views
-
Mutagen is a Python module to handle audio metadata. It supports ASF, FLAC, M4A, Monkey's Audio, MP3, Musepack, Ogg FLAC, Ogg Speex, Ogg Theora, Ogg Vorbis, True Audio, WavPack and OptimFROG audio files. All versions of ID3v2 are supported, and all standard ID3v2.4 frames are parsed. It can read Xing headers to accurately calculate the bitrate and length of MP3s. ID3 and APEv2 tags can be edited regardless of audio format. It can also manipulate Ogg streams on an individual packet/page level.
dbtxt (page 43) python database module - 0 views
-
I wrote dbtxt because I needed a small, flat database in a python environment that didn't depend upon any external libraries. Most libraries are contaminated with the GPL, and this needed to be OK for commercial distribution without any complications. So that's what we have here - a complete (though small) database system that depends on nothing at all other than the Python language and its internal libraries. The entire database comes in at about 20k bytes (that's right, "k", not hundreds of k or megabytes) and I was able to implement all the functions I needed. So I was happy. Will you be happy? Well, download it and read the docs and see what you think. The download, zipped, is about 13k. Yep. 13k. :-) By all means, if you have a need for the same kind of thing, feel free to make any use of dbtxt you please. I have released it as PD, so you can use it in projects that are commercial, GPL, BSD, PD, private, government... whatever you like. Below you'll find a basic description taken from beginning of the docs; in the archive you'll download there is complete documentation, two sample databases, a test program and the database engine itself.
[IPython-user] ipython1 and farm tasking - 0 views
-
[IPython-user] ipython1 and farm tasking Brian Granger ellisonbg.net@gmail.... Wed Feb 27 16:29:03 CST 2008 Previous message: [IPython-user] ipython1 and farm tasking Next message: [IPython-user] yet another leopard/readline question Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Alex, First, I would suggest updating your ipython1 install from our svn repository. We are about to push out a major new version and the documentation is _much_ better. Also, there are many new features that will hopefully help you. Here is a simple example (using the latest svn of ipython1): In [1]: from ipython1.kernel import client In [2]: mec = client.MultiEngineClient(('127.0.0.1',10105)) In [3]: tc = client.TaskClient(('127.0.0.1',10113)) In [4]: def fold_package(x): ...: return 2.0*x ...: In [5]: mec.push_function(dict(fold_package=fold_package)) Out[5]: [None, None, None, None] In [6]: tasks = [client.Task("y=fold_package(x)",push={'x':x},pull=('y',)) for x in range(128)] In [7]: task_ids = [tc.run(t) for t in tasks] In [8]: tc.barrier(task_ids) In [9]: task_results = [tc.get_task_result(tid) for tid in task_ids] In [10]: results = [tr.ns.y for tr in task_results] In [11]: print results [0.0, 2.0, 4.0, 6.0, 8.0, 10.0, 12.0, 14.0, 16.0, 18.0, 20.0, 22.0, 24.0, 26.0, 28.0, 30.0, 32.0, 34.0, 36.0, 38.0, 40.0, 42.0, 44.0, 46.0, 48.0, 50.0, 52.0, 54.0, 56.0, 58.0, 60.0, 62.0, 64.0, 66.0, 68.0, 70.0, 72.0, 74.0, 76.0, 78.0, 80.0, 82.0, 84.0, 86.0, 88.0, 90.0, 92.0, 94.0, 96.0, 98.0, 100.0, 102.0, 104.0, 106.0, 108.0, 110.0, 112.0, 114.0, 116.0, 118.0, 120.0, 122.0, 124.0, 126.0, 128.0, 130.0, 132.0, 134.0, 136.0, 138.0, 140.0, 142.0, 144.0, 146.0, 148.0, 150.0, 152.0, 154.0, 156.0, 158.0, 160.0, 162.0, 164.0, 166.0, 168.0, 170.0, 172.0, 174.0, 176.0, 178.0, 180.0, 182.0, 184.0, 186.0, 188.0, 190.0, 192.0, 194.0, 196.0, 198.0, 200.0, 202.0, 204.0, 206.0, 208.0, 210.0, 212.0, 214.0, 216.0, 218.0, 220.0, 222.0, 224.0, 226.0, 228.0, 230.0, 232.0, 234.0, 236.0, 238.0, 240.0, 242.0, 244.0, 246.0, 248.0, 250.0, 252.0, 254.0] Or if you don't need load balancing: # This sends the fold_package function for you! results = mec.map(fold_package, range(128)) Let us know if you run into other problems. Cheers, Brian
Manipulate simple polynomials in Python - 0 views
python interval Module - 0 views
Using lpsolve from Python - 0 views
unit step (heaviside) function in sympy? - sympy | Google Groups - 0 views
-
On Mon, May 5, 2008 at 8:22 PM, Reckoner <recko...@gmail.com> wrote: > is there a unit step (heaviside) function in sympy? > I need to work a conditional into a symbolic expression. We have sign which is basically the same thing:
Most efficient unzip - inverse of zip? - 0 views
-
I'm declaring this one to be the winner! (Not that my opinion counts for anythin, but I'm just impressed: a1, b1 = zip(*ab) (or a1, b1 = apply(zip,ab)?) BTW: this process isn't 100% inverse. It has the side effect of turning lists or strings (non-tuple sequences) into tuples, if they are supplied as the original sequences.
« First
‹ Previous
101 - 120 of 247
Next ›
Last »
Showing 20▼ items per page