Staging
v0.5.1
v0.5.1
Revision db23206367e2bfbbdfb29b7699f25a14ba353ae7 authored by Miss Islington (bot) on 25 September 2018, 04:44:11 UTC, committed by GitHub on 25 September 2018, 04:44:11 UTC
The GlobalLock() call in UpdateDropDescription() was not checked for failure. https://bugs.python.org/issue34770 (cherry picked from commit f6c8007a29b95b3ea3ca687a9b4924769a696328) Co-authored-by: Zackery Spytz <zspytz@gmail.com>
1 parent bbdf872
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 ...