Staging
v0.8.1
v0.8.1
Revision f55c3ae657595d12ce78aca76c9c6b998d632424 authored by Ned Deily on 13 October 2018, 05:33:33 UTC, committed by Ned Deily on 13 October 2018, 06:08:48 UTC
For 3.7.1rc1 and 3.6.7rc1 we used a pre-release development snapshot of Tk 8.6 to pick up some post-8.6.8 fixes for macOS. But the snapshot introduced at least one regression (bpo-34927). For rc2, revert to using the standard release 8.6.8 for now. This reverts commit adf493227f1efd5d6b34f46b854142bf3b5a411c.
1 parent 69e6ad6
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 ...