Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 9603428755a644c01ebfd356e2f90864291a26a8 authored by Ezio Melotti on 19 February 2010, 14:51:06 UTC, committed by Ezio Melotti on 19 February 2010, 14:51:06 UTC 
Merged revisions 78239 via svnmerge from
 
svn+ssh://pythondev@svn.python.org/python/branches/py3k

........
  r78239 | ezio.melotti | 2010-02-19 16:49:02 +0200 (Fri, 19 Feb 2010) | 1 line

  urllib.urlparse -> urllib.parse.urlparse
........
1 parent a8dbb24
Raw File
Tip revision: 9603428755a644c01ebfd356e2f90864291a26a8 authored by Ezio Melotti on 19 February 2010, 14:51:06 UTC
Merged revisions 78239 via svnmerge from
Tip revision: 9603428
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