Staging
v0.5.1
v0.5.1
https://github.com/python/cpython
Revision c642374b3ef72f6f300616f07aea2a3f9ed83e51 authored by Mark Dickinson on 29 November 2020, 09:34:36 UTC, committed by GitHub on 29 November 2020, 09:34:36 UTC
* Improve description of 'e', 'f' and 'g' presentation types * Drop the 'E' from Scientific 'E' notation; remove >= 0 qualifications * Fix false statement that the alternate form is valid for Decimal * Nitpick: remove the Harvard/Oxford comma * Add note that the decimal point is also removed if no digits follow it, except in alternate form
1 parent 00a6568
Tip revision: c642374b3ef72f6f300616f07aea2a3f9ed83e51 authored by Mark Dickinson on 29 November 2020, 09:34:36 UTC
bpo-39096: Improve description of 'e', 'f' and 'g' presentation types (#23537)
bpo-39096: Improve description of 'e', 'f' and 'g' presentation types (#23537)
Tip revision: c642374
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 ...