skuzzymiglet

import json

f = open("raw", "r")

d = {}

for l in f.readlines():
    fields = l.split("  ")
    for f in fields:
        f = f.split(" ")

skuzzymiglet

ffbatch

features

• edit videos inplace
• batch processing
• conditionals
• simple ffprobe access
• file extension changing

skuzzymiglet

ffbatch

features

• edit videos inplace
• batch processing
• conditionals
• simple ffprobe access
• file extension changing

skuzzymiglet

{"NU": "^@", "SH": "^A", "": "OK", "SX": "^B", "EX": "^C", "ET": "^D", "EQ": "^E", "AK": "^F", "BL": "^G", "BS": "^H", "HT": "^I", "LF": "^@", "VT": "^K", "FF": "^L", "CR": "^M", "SO": "^N", "SI": "^O", "DL": "^P", "D1": "^Q", "D2": "^R", "D3": "^S", "D4": "^T", "NK": "^U", "SY": "^V", "EB": "^W", "CN": "^X", "EM": "^Y", "SB": "^Z", "EC": "^[", "FS": "^\\", "GS": "^]", "RS": "^^", "US": "^_", "Nb": "#", "DO": "$", "At": "@", "<(": "[", "//": "\\", ")>": "]", "'>": "^", "'!": "`", "(!": "{", "!!": "|", "!)": "}", "'?": "~", "DT": "^?", "PA": "<80>", "HO": "<81>", "BH": "<82>", "NH": "<83>", "IN": "<84>", "NL": "<85>", "SA": "<86>", "ES": "<87>", "HS": "<88>", "HJ": "<89>", "VS": "<8a>", "PD": "<8b>", "PU": "<8c>", "RI": "<8d>", "S2": "<8e>", "S3": "<8f>", "DC": "<90>", "P1": "<91>", "P2": "<92>", "TS": "<93>", "CC": "<94>", "MW": "<95>", "SG": "<96>", "EG": "<97>", "SS": "<98>", "GC": "<99>", "SC": "<9a>", "CI": "<9b>", "ST": "<9c>", "OC": "<9d>", "PM": "<9e>", "AC": "<9f>", "NS": " ", "!I": "¡", "~!": "¡", "C

skuzzymiglet

Compare with https://repl.it/@skuzzymiglet/Anagram-Solver-V2

1. Only tests for cases capitalized, upper and lower

Example: Fox FOX Fox only > drastic reduction in time

2. Cuts list to search down to words of anagram's length AND same letters - the need to search a million times is gone!

3. Only searches a list of words containing same letters as anagram > extreme improvement