Kenny2github

// ==UserScript==
// @name         When2meet Copy-Paste
// @match        https://www.when2meet.com/?*
// @version      2024-03-06
// @description  Copy your when2meet responses from one when2meet to the other.
// @author       AbyxDev
// @icon         https://www.google.com/s2/favicons?sz=64&domain=when2meet.com
// @grant        none
// @updateURL    https://gist.github.com/Kenny2github/c614b71dd67a5e80abcadfab3e54b4f0/raw/when2meet-copier.user.js
// @downloadURL  https://gist.github.com/Kenny2github/c614b71dd67a5e80abcadfab3e54b4f0/raw/when2meet-copier.user.js

Kenny2github

ECE253 Past Finals ARM to RISC-V translations

These are an attempt to translate ARM code appearing in ECE253 past finals and/or their solutions into RISC-V due to the use of the latter in newer iterations of the course. Each file is named as follows: YYYYM-Q##.s (or YYYYM-Q##X.s where X is a version letter) and may be updated as errors are discovered and corrected. If you discover an error or have feedback, leave a comment.

Translations

Legend: ☑️ Done 🟨 WIP 🟦 To-do

• ☑️ 2021 Fall*
  • Q3
  • Q4
  • Q10
• Q11

Kenny2github

@echo off
if "%1"=="" (
	echo usage: git del-branches ^<glob pattern^>
) else (
	for /f "usebackq" %%b in (`git branch --list %1`) do (
		git branch -d %%b
	)
)

Kenny2github

from enum import Flag

class SetLikeFlag(Flag):
    """Flag that additionally supports all frozenset operations."""
    def __repr__(self):
        """Only show the flag names, not values."""
        return super().__repr__().split(':', 1)[0] + '>'
    def __sub__(self, other):
        """Asymmetric difference of this set of flags with the other."""
        if not isinstance(other, type(self)):

Kenny2github

defmodule Squaredle do
  def find_word(row, col, word, board, past_path) do
    coords = [
      {row + 1, col + 1},
      {row + 1, col + 0},
      {row + 1, col - 1},
      {row + 0, col + 1},
      {row + 0, col - 1},
      {row - 1, col + 1},
      {row - 1, col + 0},

Kenny2github

defmodule Combinatorics do
  def combinations(_, 0), do: [[]]
  def combinations([], _), do: []
  def combinations([head | rest], n) do
    (for item <- combinations(rest, n - 1), do: [head | item]) ++ combinations(rest, n)
  end

  def permutations([]), do: [[]]
  def permutations(list) do
    for h <- list, t <- permutations(list -- [h]), do: [h | t]

Kenny2github

from __future__ import annotations
from itertools import combinations

class Node:
    components: set[Component]

    num: int = 1
    
    def __init__(self, components: set = None) -> None:
        self.num = type(self).num

Kenny2github

def exp(z, zero=None, one=None, equality=lambda a, b: a == b):
    """Raise e to the power of z.

    z need only support the following:
    - Addition with its own type
    - Multiplication with its own type
    - Multiplication with float
    Provide ``zero`` if z - z != the zero of its type.
        This function will probably not produce correct results
        if this is the case, but it is provided for completeness.

Kenny2github

import math
import random
from random import randint
from types import SimpleNamespace as Record
import pygame
from pygame.locals import *

SIZE = WIDTH, HEIGHT = 640, 360
HALFWIDTH, HALFHEIGHT = WIDTH // 2, HEIGHT // 2
BLOCS = BLOCW, BLOCH = 20, 20

Kenny2github

LETTERS = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

def vigenere(string, key, direction=1):
    """Transform text with the vigenere cipher.

    ``string`` is the text to transform.
    ``key`` is the key to use in the process.
    ``direction`` is the direction of transformation:
        1 for encoding, and -1 for decoding.