Staging
v0.8.1
v0.8.1
Revision 87bc22051fcfcf181160d06a57ac2b16ee071f8f authored by Miss Islington (bot) on 07 August 2020, 16:15:37 UTC, committed by GitHub on 07 August 2020, 16:15:37 UTC
gdb 9.2 on Fedora Rawhide is not reliable, see: * https://bugs.python.org/issue41473 * https://bugzilla.redhat.com/show_bug.cgi?id=1866884 (cherry picked from commit e27a51c11e10d5df79b3e48dc3e7bfedfad5a794) Co-authored-by: Victor Stinner <vstinner@python.org>
1 parent dc98a54
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 ...