Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision ef1173ab141ba5387598f8859ba96f98d20d743e authored by Miss Islington (bot) on 25 September 2018, 15:49:28 UTC, committed by GitHub on 25 September 2018, 15:49:28 UTC 
bpo-33937: Catch ENOMEM error in test_socket (GH-9557)
 

Fix test_socket.SendmsgSCTPStreamTest: catch ENOMEM error.
testSendmsgTimeout() and testSendmsgDontWait() randomly fail on
Travis CI with: "OSError: [Errno 12] Cannot allocate memory".
(cherry picked from commit 46f40be8b907854deb81c6132b7cb038e9e5202a)

Co-authored-by: Victor Stinner <vstinner@redhat.com>
1 parent 321f28c
Raw File
Tip revision: ef1173ab141ba5387598f8859ba96f98d20d743e authored by Miss Islington (bot) on 25 September 2018, 15:49:28 UTC
bpo-33937: Catch ENOMEM error in test_socket (GH-9557)
Tip revision: ef1173a
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