Skip to content

Instantly share code, notes, and snippets.

View CorellanStoma's full-sized avatar

Daniel Klingel CorellanStoma

View GitHub Profile
@CorellanStoma
CorellanStoma / rom_suffix_codes.md
Created January 9, 2024 14:11 — forked from ramiabraham/rom_suffix_codes.md
Video game rom suffix codes (decoded)

Video game rom codes

You wouldn't download a car...


Primary rom codes

Probably what you're looking for

  • [a] Alternate (alternate version of the game, usually trying a different output method)
  • [p] Pirate
@CorellanStoma
CorellanStoma / vox_to_obj_AUTO.py
Created September 30, 2022 00:45 — forked from awesomez/vox_to_obj_AUTO.py
Exports from MagicaVoxel VOX to OBJ. Can preserve all edges for easy editing in a program like Blender.
"""
AUTOMATIC drag and drop support for windows (NO PROMPT!)
1. Copy script to directory you want your files copied to.
2. Select the files you want to convert.
3. Drag & drop onto this script to convert .vox to .obj!
Files will be exported to directory of this script.
@CorellanStoma
CorellanStoma / Docker Templates
Created September 9, 2022 16:03
Docker Image Templates
{
"version": "2",
"templates": [
{
"type": 1,
"title": "Registry",
"description": "Docker image registry",
"categories": ["docker"],
"platform": "linux",
"logo": "https://portainer-io-assets.sfo2.digitaloceanspaces.com/logos/registry.png",
@CorellanStoma
CorellanStoma / Public_Time_Servers.md
Created August 4, 2022 19:04 — forked from mutin-sa/Top_Public_Time_Servers.md
List of Top Public Time Servers

Google Public NTP [AS15169]:

time.google.com

time1.google.com

time2.google.com

time3.google.com

import json
import re
from operator import itemgetter
import requests
from itertools import combinations
def best_similarity(master, candidates):
counts = [0] * len(candidates)
for candidate_index, candidate in enumerate(candidates):
for item in candidate:
import json
import re
from operator import itemgetter
# finds the most similar list
# master = [] with n items
# candidates = [[],[],[],...] each nested list with n items
# original_candidates = [{}, {}, {},...]
def best_similarity(master, candidates, originalcandidates):
counts = [0] * len(candidates)