Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 00d7abd7ef588fc4ff0571c8579ab4aba8ada1c0 authored by Victor Stinner on 01 December 2020, 08:56:42 UTC, committed by GitHub on 01 December 2020, 08:56:42 UTC 
bpo-42519: Replace PyMem_MALLOC() with PyMem_Malloc() (GH-23586)
 
No longer use deprecated aliases to functions:

* Replace PyMem_MALLOC() with PyMem_Malloc()
* Replace PyMem_REALLOC() with PyMem_Realloc()
* Replace PyMem_FREE() with PyMem_Free()
* Replace PyMem_Del() with PyMem_Free()
* Replace PyMem_DEL() with PyMem_Free()

Modify also the PyMem_DEL() macro to use directly PyMem_Free().
1 parent b2d0c66
Raw File
Tip revision: 00d7abd7ef588fc4ff0571c8579ab4aba8ada1c0 authored by Victor Stinner on 01 December 2020, 08:56:42 UTC
bpo-42519: Replace PyMem_MALLOC() with PyMem_Malloc() (GH-23586)
Tip revision: 00d7abd
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);
back to top