Staging
v0.8.1
v0.8.1
https://github.com/python/cpython
Revision bcf042ff98b6261b7780c1e40fa1681ef30502f9 authored by Miss Islington (bot) on 12 September 2017, 23:14:09 UTC, committed by Victor Stinner on 12 September 2017, 23:14:09 UTC
* test_thread.test_forkinthread() now waits until the thread completes. * Check the status in the test method, not in the thread function * Don't ignore RuntimeError anymore: since the commit 346cbd351ee0dd3ab9cb9f0e4cb625556707877e (bpo-16500, os.register_at_fork(), os.fork() cannot fail anymore with RuntimeError. * Replace 0.01 literal with a new POLL_SLEEP constant * test_forkinthread(): test if os.fork() exists rather than testing the platform. (cherry picked from commit a15d155aadfad232158f530278505cdc6f326f93)
1 parent c0e7736
Tip revision: bcf042ff98b6261b7780c1e40fa1681ef30502f9 authored by Miss Islington (bot) on 12 September 2017, 23:14:09 UTC
[3.6] bpo-31234: Enhance test_thread.test_forkinthread() (GH-3516) (#3519)
[3.6] bpo-31234: Enhance test_thread.test_forkinthread() (GH-3516) (#3519)
Tip revision: bcf042f
rotatingtree.h
/* "Rotating trees" (Armin Rigo)
*
* Google "splay trees" for the general idea.
*
* It's a dict-like data structure that works best when accesses are not
* random, but follow a strong pattern. The one implemented here is for
* access patterns where the same small set of keys is looked up over
* and over again, and this set of keys evolves slowly over time.
*/
#include <stdlib.h>
#define EMPTY_ROTATING_TREE ((rotating_node_t *)NULL)
typedef struct rotating_node_s rotating_node_t;
typedef int (*rotating_tree_enum_fn) (rotating_node_t *node, void *arg);
struct rotating_node_s {
void *key;
rotating_node_t *left;
rotating_node_t *right;
};
void RotatingTree_Add(rotating_node_t **root, rotating_node_t *node);
rotating_node_t* RotatingTree_Get(rotating_node_t **root, void *key);
int RotatingTree_Enum(rotating_node_t *root, rotating_tree_enum_fn enumfn,
void *arg);
Computing file changes ...