Similar to mpipe, this short module lets you string together tasks so that they are executed in parallel.
The difference is that it lets you use generators, functions which yield results instead of returning them. Each yielded item gets passed to the next stage.
You can specify that one or more copies of the workers operate on the input queue.
| ''' | |
| This module provides functions for easily generating PKCS11 bindings. | |
| Intended call method is: | |
| generate_pxd(headers_directory, vendor_top_level_include_header) | |
| ''' | |
| import re | |
| import collections | |
| import parsimonious.grammar |
by Bjørn Friese
Beautiful is better than ugly. Explicit is better than implicit.
I frequently deal with collections of things in the programs I write. Collections of droids, jedis, planets, lightsabers, starfighters, etc. When programming in Python, these collections of things are usually represented as lists, sets and dictionaries. Oftentimes, what I want to do with collections is to transform them in various ways. Comprehensions is a powerful syntax for doing just that. I use them extensively, and it's one of the things that keep me coming back to Python. Let me show you a few examples of the incredible usefulness of comprehensions.
| #!/usr/bin/env python | |
| # -*- coding: utf-8 -*- | |
| r"""Support for IEEE 754 half-precision binary floating-point format: binary16. | |
| >>> [binary16(f) for f in [0.006534, -.1232]] == [b'\xb0\x1e', b'\xe2\xaf'] | |
| True | |
| """ | |
| from __future__ import division | |
| import struct | |
| from math import copysign, frexp, isinf, isnan, trunc |
| #!/usr/bin/python3 | |
| # By Steve Hanov, 2011. Released to the public domain. | |
| # Please see http://stevehanov.ca/blog/index.php?id=115 for the accompanying article. | |
| # | |
| # Based on Daciuk, Jan, et al. "Incremental construction of minimal acyclic finite-state automata." | |
| # Computational linguistics 26.1 (2000): 3-16. | |
| # | |
| # Updated 2014 to use DAWG as a mapping; see | |
| # Kowaltowski, T.; CL. Lucchesi (1993), "Applications of finite automata representing large vocabularies", | |
| # Software-Practice and Experience 1993 |
| #define _GNU_SOURCE | |
| #include <stdio.h> | |
| #include <dlfcn.h> | |
| # define LM_ID_BASE 0 /* Initial namespace. */ | |
| # define LM_ID_NEWLM -1 /* For dlmopen: request new namespace. */ | |
| void __attribute__ ((constructor)) init(void); |
NOTE: This is a working copy. This tutorial is unfinished and may contain inaccuracies.
I've written the title of this tutorial in Chinese, as I suspect that its contents may, at first glance, appear similarly incomprehensible to the audience.
However, just as I can sketch for you the following...
可執行文件 = (可 = can) + (執行 = execute) + (文件 = file) = executable (file)
| /* | |
| Functional programming in C | |
| ``````````````````````````` | |
| This is an example of how to use executable memory to get partial function | |
| application (i.e. bind1st()) in C. (Well, this actually only compiles as C++ | |
| since i'm using a varargs typedef, but there's no classes or templates.) | |
| To proceed, we need to be comfortable with the cdecl and stdcall calling | |
| conventions on x86, and just a little assembly. |
