Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 4dd2112a1d26e03b605bed0f89e3678041ad1490 authored by Miss Islington (bot) on 20 November 2020, 07:28:21 UTC, committed by GitHub on 20 November 2020, 07:28:21 UTC 
bpo-42416: Use inspect.getdoc for IDLE calltips (GH-23416)
 

Inspect.getdoc(ob) sometimes gets docstrings when ob.__doc__ is None.
(cherry picked from commit 7ddbaa7a1b3e61847ee99658be6a7268a049e302)

Co-authored-by: Terry Jan Reedy <tjreedy@udel.edu>
1 parent 1051ca4
Raw File
Tip revision: 4dd2112a1d26e03b605bed0f89e3678041ad1490 authored by Miss Islington (bot) on 20 November 2020, 07:28:21 UTC
bpo-42416: Use inspect.getdoc for IDLE calltips (GH-23416)
Tip revision: 4dd2112
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