mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 11:37:35 +00:00
d26d7ae0e4
Building o//third_party/python now takes 5 seconds on my PC This change works towards modifying Python to use runtime dispatching when appropriate. For example, when loading the magnums in the socket module, it's a good idea to check if the magnum is zero, because that means the local system platform doesn't support it.
35 lines
1.2 KiB
C
35 lines
1.2 KiB
C
#ifndef COSMOPOLITAN_THIRD_PARTY_PYTHON_MODULES_ROTATINGTREE_H_
|
|
#define COSMOPOLITAN_THIRD_PARTY_PYTHON_MODULES_ROTATINGTREE_H_
|
|
#if !(__ASSEMBLER__ + __LINKER__ + 0)
|
|
COSMOPOLITAN_C_START_
|
|
/* clang-format off */
|
|
|
|
/* "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.
|
|
*/
|
|
|
|
#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);
|
|
|
|
COSMOPOLITAN_C_END_
|
|
#endif /* !(__ASSEMBLER__ + __LINKER__ + 0) */
|
|
#endif /* COSMOPOLITAN_THIRD_PARTY_PYTHON_MODULES_ROTATINGTREE_H_ */
|