Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 063eba280a11d3c9a5dd9ee5abe4de640907951b authored by Abhilash Raj on 07 September 2019, 05:24:05 UTC, committed by larryhastings on 07 September 2019, 05:24:05 UTC 
[3.5] bpo-34155: Dont parse domains containing @ (GH-13079) (#15317)
 
https://bugs.python.org/issue34155
(cherry picked from commit 8cb65d1381b027f0b09ee36bfed7f35bb4dec9a9)

Co-authored-by: jpic <jpic@users.noreply.github.com>
1 parent afe3a49
Raw File
Tip revision: 063eba280a11d3c9a5dd9ee5abe4de640907951b authored by Abhilash Raj on 07 September 2019, 05:24:05 UTC
[3.5] bpo-34155: Dont parse domains containing @ (GH-13079) (#15317)
Tip revision: 063eba2
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