Bartosz Sławecki johnslavik

The best of rejected PEPs

A collection of my best findings when looking through rejected Python Enhancement Proposals (as of Jan 6, 2024).

PEP 204: Range Literals

(2000, Python 2.0)

>>> [1:10]
[1, 2, 3, 4, 5, 6, 7, 8, 9]
>>> [:5]
[0, 1, 2, 3, 4]

Introduction

This Gist aims to centralise the most relevant public sources of information related to the HTTP/2 Rapid Reset vulnerability. This vulnerability has been disclosed jointly by Google, Amazon AWS, and Cloudflare on 10 October 2023 at 12:00 UTC.

Please help us make this page as comprehensive as possible by contributing relevant references, vendor advisories and statements, mitigations, etc.

References

CVE-2023-44487, CIRCL CVE Search
How AWS protects customers from DDoS events, AWS

\b(?:(?<fizzbuzz>(?:(?:[369]|[258][0369]*[147]|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*(?:[28]|[147][0369]*[147]))*(?:0|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*5))+)|(?<buzz>\d*[05])|(?<fizz>(?:[0369]|[258][0369]*[147]|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*(?:[258]|[147][0369]*[147]))+))\b

insanity, as i'd like to call it. although it isn't fizzbuzz per se, it's the best you can get with regex. here's a regexr link to it with sample text.

this matches a number (within word boundaries) if it falls under any of the three groups:

fizzbuzz, which picks up numbers divisible by both 3 and 5, i.e. 15;
buzz, which picks up numbers divisible by 5; and
fizz, which picks up numbers divisible by 3.

	MIT License

	Copyright (c) 2023 Françoise CONIL

	Permission is hereby granted, free of charge, to any person obtaining a copy
	of this software and associated documentation files (the "Software"), to deal
	in the Software without restriction, including without limitation the rights
	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
	copies of the Software, and to permit persons to whom the Software is
	furnished to do so, subject to the following conditions:

	from __future__ import annotations

	from collections.abc import Callable, Iterable
	import sys
	from typing import (
	Any,
	Generic,
	Literal,
	LiteralString,
	SupportsIndex,

	{
	'variables': {
	'configuring_node%': 0,
	'asan%': 0,
	'werror': '', # Turn off -Werror in V8 build.
	'visibility%': 'hidden', # V8's visibility setting
	'target_arch%': 'ia32', # set v8's target architecture
	'host_arch%': 'ia32', # set v8's host architecture
	'want_separate_host_toolset%': 0, # V8 should not build target and host
	'library%': 'static_library', # allow override to 'shared_library' for DLL/.so builds

	#------------------------------------------------------------------------------
	# Top 20K hashes from the Troy Hunt / haveibeenpwned Pwned Passwords list v6 (2020-06-19)
	# with frequency count and cracked plaintext passwords
	#
	# The latest version of this file can be found here:
	# https://gist.github.com/roycewilliams/226886fd01572964e1431ac8afc999ce
	# The equivalent of this file, but based on v2 of the Pwned Passwords, is here:
	# https://gist.github.com/roycewilliams/281ce539915a947a23db17137d91aeb7
	#------------------------------------------------------------------------------
	# Notes and references:

	import json
	import operator

	# Original version by tau0 and st3v3n on codeforces
	# Go the URL below on your browser and download the file to the same directory as this script
	# https://codeforces.com/api/problemset.problems

	data = json.load(open("/Users/tau0/Downloads/problemset.problems.json"))
	counter = dict()
	problems = data["result"]["problems"]

	@font-face {
	font-family: 'JetBrains Mono';
	src: url('https://cdn.jsdelivr.net/gh/JetBrains/JetBrainsMono/web/woff2/JetBrainsMono-Bold-Italic.woff2') format('woff2'),
	url('https://cdn.jsdelivr.net/gh/JetBrains/JetBrainsMono/web/woff/JetBrainsMono-Bold-Italic.woff') format('woff');
	font-weight: 700;
	font-style: italic;
	font-display: swap;
	}

	@font-face {