Skip to main content

Browse the archive

https://github.com/python/cpython
07 April 2024, 05:56:27 UTC
Revision 81af174221e1e1fbf1e358488043082e28f1865a authored by Georg Brandl on 18 September 2009, 09:15:58 UTC, committed by Georg Brandl on 18 September 2009, 09:15:58 UTC 
Blocked revisions 74901 via svnmerge
 
........
  r74901 | georg.brandl | 2009-09-18 11:14:52 +0200 (Fr, 18 Sep 2009) | 1 line

  #6905: use better exception messages in inspect when the argument is of the wrong type.
........
1 parent a359474
Raw File
Tip revision: 81af174221e1e1fbf1e358488043082e28f1865a authored by Georg Brandl on 18 September 2009, 09:15:58 UTC
Blocked revisions 74901 via svnmerge
Tip revision: 81af174
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