Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 5a2fd0499fd9f3580e457922ae7239ab68e781d1 authored by R. David Murray on 20 November 2010, 21:23:45 UTC, committed by R. David Murray on 20 November 2010, 21:23:45 UTC 
Blocked revisions 86611 via svnmerge
 
........
  r86611 | r.david.murray | 2010-11-20 16:18:51 -0500 (Sat, 20 Nov 2010) | 4 lines

  #10453: compileall now uses argparse instead of getopt, so -h works.

  Patch by Michele Orrù.
........
1 parent 4fadd53
Raw File
Tip revision: 5a2fd0499fd9f3580e457922ae7239ab68e781d1 authored by R. David Murray on 20 November 2010, 21:23:45 UTC
Blocked revisions 86611 via svnmerge
Tip revision: 5a2fd04
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