Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 86150d39c888579b65841f4391d054b7b3eff9f2 authored by Yurii Karabas on 29 November 2020, 12:50:57 UTC, committed by GitHub on 29 November 2020, 12:50:57 UTC 
bpo-42392: Remove deprecated loop parameter from docs (GH-23552)
 
 
 
 
 1 parent   c642374 
  
 
 
  
  
 
   Raw File                
 
 
   
   
 
  
 Tip revision:  86150d39c888579b65841f4391d054b7b3eff9f2  authored by  Yurii Karabas  on 29 November 2020, 12:50:57 UTC 
 bpo-42392: Remove deprecated loop parameter from docs (GH-23552) 
 
 
 
 
  
 Tip revision:  86150d3  
 
 
 
 
 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