Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision b25b7254d909697bb7f3aa893b740cb650547cb6 authored by wim glenn on 06 June 2017, 19:32:14 UTC, committed by Mariatta on 06 June 2017, 19:32:14 UTC 
bpo-30583: Fix typo in datetime dateutil documentation (GH-1972) (GH-1974)
 
Replace `datetuil` into `dateutil`
(cherry picked from commit 53f2af16551eb3a080da313257603c31ef8b93b4)
1 parent 68e5af8
Raw File
Tip revision: b25b7254d909697bb7f3aa893b740cb650547cb6 authored by wim glenn on 06 June 2017, 19:32:14 UTC
bpo-30583: Fix typo in datetime dateutil documentation (GH-1972) (GH-1974)
Tip revision: b25b725
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