Staging
v0.5.1
v0.5.1
https://github.com/python/cpython
Revision 9db66a2b5ab6a302bc46421712f13b0afd94654b authored by Miss Islington (bot) on 29 August 2019, 14:54:37 UTC, committed by GitHub on 29 August 2019, 14:54:37 UTC
Adds a link to `dateutil.parser.isoparse` in the documentation. It would be nice to set up intersphinx for things like this, but I think we can leave that for a separate PR. CC: @pitrou [bpo-37979](https://bugs.python.org/issue37979) https://bugs.python.org/issue37979 Automerge-Triggered-By: @pitrou (cherry picked from commit 59725f3badb3028636c8906ecac4ceb0a37f3982) Co-authored-by: Paul Ganssle <paul@ganssle.io>
1 parent 384c6d7
Tip revision: 9db66a2b5ab6a302bc46421712f13b0afd94654b authored by Miss Islington (bot) on 29 August 2019, 14:54:37 UTC
bpo-37979: Add alternative to fromisoformat in documentation (GH-15596)
bpo-37979: Add alternative to fromisoformat in documentation (GH-15596)
Tip revision: 9db66a2
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);
Computing file changes ...