Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 9acae51be2d9e17ecab3e174cb32dd05e1097c1f authored by Antoine Pitrou on 27 October 2010, 19:52:40 UTC, committed by Antoine Pitrou on 27 October 2010, 19:52:40 UTC 
Merged revisions 85864 via svnmerge from
 
svn+ssh://pythondev@svn.python.org/python/branches/py3k

........
  r85864 | antoine.pitrou | 2010-10-27 21:45:43 +0200 (mer., 27 oct. 2010) | 5 lines

  In open(), only set the buffer size from st.st_blksize when it is greater
  than 1.  This matches the pure Python implementation in _pyio and should
  fix a couple of failures on the NetBSD buildbot.
........
1 parent 43ffd5c
Raw File
Tip revision: 9acae51be2d9e17ecab3e174cb32dd05e1097c1f authored by Antoine Pitrou on 27 October 2010, 19:52:40 UTC
Merged revisions 85864 via svnmerge from
Tip revision: 9acae51
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