Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 62674f3a36ec55f86a5f20ee028a37fbd549bd6c authored by Miss Islington (bot) on 11 December 2018, 07:05:13 UTC, committed by GitHub on 11 December 2018, 07:05:13 UTC 
bpo-35454: Fix miscellaneous minor issues in error handling. (GH-11077)
 

* bpo-35454: Fix miscellaneous minor issues in error handling.

* Fix a null pointer dereference.
(cherry picked from commit 8905fcc85a6fc3ac394bc89b0bbf40897e9497a6)

Co-authored-by: Serhiy Storchaka <storchaka@gmail.com>
1 parent 3b9a018
Raw File
Tip revision: 62674f3a36ec55f86a5f20ee028a37fbd549bd6c authored by Miss Islington (bot) on 11 December 2018, 07:05:13 UTC
bpo-35454: Fix miscellaneous minor issues in error handling. (GH-11077)
Tip revision: 62674f3
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