Search results

doc it

we're going higher order func on this mofo def greet(name): return f"Hello, {name}!" def call_function(func, *args): return func(*args) # Usage example: result = call_function(greet, "Alice") print(result) # Output: Hello, Alice! shit in the aaaaaaaaass! :s53:

we have reached a point where we have many skills. not great not terrible. thing is, now we need a catalog, to serve as a quick reference as well as a roadmap of shit to come ********** *defconic* ********** motivational philosophy spider sense hunger home returner ****************...

def my_function(*args): for arg in args: print(arg) my_list = [1, 2, 3, 4, 5] my_function(*my_list)

@fukurou

import ast def list_classes_in_file(file_path): with open(file_path, "r") as file: tree = ast.parse(file.read(), filename=file_path) class_names = [node.name for node in ast.walk(tree) if isinstance(node, ast.ClassDef)] return class_names # Example usage if __name__ ==...

done for today

summoning the Kraken!

all files jizzed, preparing to summon Kraken!

let take a look at the Python ver

swift nxt jizzzzzzzzz

IG kotlin is next tihs ni eht ssa

I got 30 fucking search results on the Java ver, better get to it.

\\b(\\w+)\\b(?=.*\\b\\1\\b) @the living tribunal

(?:http|https)://[^:/]+(?::(\\d+))? port extract

^[a-zA-Z0-9._%+-]+@([a-zA-Z0-9.-]*element[a-zA-Z0-9.-]*)\.[a-zA-Z]{2,}$ ^*@provider.[a-zA-Z]{2,}$

(0x)?[0-9a-fA-F]+ hex \\b[01]+\\b binary (?<=0.).* 0 stripper ^M{0,3}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})$ roman numerals [0-9]{1,3}(,[0-9]{3})*\.[0-9]+ numbers with thousand separator

[0-9]{1,2}:[0-9]{1,2}:[0-9]{1,2} [A-Z0-9a-z._%+-]+@[A-Za-z0-9.-]+\\.[A-Za-z]{2,6}

[0-9]{1,2}:[0-9]{1,2}