iamevn

// ==UserScript==
// @name         CDR insert links
// @namespace    http://tampermonkey.net/
// @version      2024-02-12_v3
// @description  inject external download links on cdromance
// @author       iamevn
// @match        https://cdromance.com/*
// @grant        GM.xmlHttpRequest
// @connect      cdromance.org
// @updateURL    http://gist.github.com/iamevn/3afea03de61fa351bcde666f7c6d13f6/raw/cdromance-download-links.user.js

iamevn

#!/usr/bin/env python3
# split out AMAZON/NETFLIX STYLE TYPESETTING
#by iamevn
import sys, re

def find_nth(string, substring, n, start=0):
    """find nth occurance of substring in string starting at position start.
    (uses string.find) n starts at 1, start starts at 0"""
    found = string.find(substring, start)
    if n == 1 or found == -1:

iamevn

{ pkgs, ... }:
### Plex Media server
# Uses plexpass version if plexpass.json exists

let
  plexpass-overlay = import ./plexpass-overlay.nix;
in {
  # Plex is unfree, allow it anyways
  imports = [ ./allowed_unfree.nix ];
  allowedUnfreePkgs = [ "plexmediaserver" ];

iamevn

#!/usr/bin/env python3

# combine adjacent lines with the same timecodes
import sys
from datetime import datetime, timedelta

def find_nth(string, substring, n, start=0):
    """find nth occurance of substring in string starting at position start.
    (uses string.find) n starts at 1, start starts at 0"""
    found = string.find(substring, start)

iamevn

import re
import webbrowser

from tweet import gen_tweet
from tweepy_api import get_api


def last_rt(user, tweet_id):
  api = get_api()
  timeline = api.user_timeline(user, max_id=tweet_id, count=100)

iamevn

#/usr/bin/env python3

import tkinter as tk
import random
import threading
from wrapt import synchronized
from typing import Callable, Sequence, Union

class ScaledCanvasWindow:
    '''

iamevn

iamevn

def generate_ranges(lower, upper, count, pre=None):
  if pre is None:
    pre = []
  if count > 1:
    for i in range(lower, upper):
      yield from generate_ranges(lower, upper, count - 1, pre + [i])
  elif count == 1:
    for i in range(lower, upper):
      yield pre + [i]
  else:

iamevn

javascript:var coding = "abcdefghijklmnopqrstuvwxyzabcdefghijklmABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLM"; function rot13(t) { for (var r = "",i=0;i<t.length;i++) { character = t.charAt(i); position = coding.indexOf(character); if (position > -1) character = coding.charAt(position + 13); r += character; } return r; } S=window.getSelection(); function t(N) { return N.nodeType == N.TEXT_NODE; } function r(N) { if (t(N)) N.data = rot13(N.data); } for (j=0;j<S.rangeCount;++j) { var g=S.getRangeAt(j), e=g.startContainer, f=g.endContainer, E=g.startOffset, F=g.endOffset, m=(e==f); if(!m||!t(e)) { /* rot13 each text node between e and f, not including e and f. */ q=document.createTreeWalker(g.commonAncestorContainer, NodeFilter.SHOW_ELEMENT | NodeFilter.SHOW_TEXT, null, false); q.currentNode=e; for(N=q.nextNode(); N && N != f; N = q.nextNode()) r(N); } if (t(f)) f.splitText(F); if (!m) r(f); if (t(e)) { r(k=e.splitText(E)); if(m)f=k; e=k;} if (t(f)) g.setEnd(f,f.data.length); } void 0

iamevn

Play this game by pasting the script in http://www.puzzlescript.net/editor.html