Probably what you're looking for
[a]Alternate (alternate version of the game, usually trying a different output method)[p]Pirate
Daniel Klingel 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)
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.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| """ | |
| 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
/ 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
CorellanStoma
/ classfinder2.py
Created
April 2, 2022 19:40
— forked from D-Brox/classfinder2.py
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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: |
CorellanStoma
/ classfinder.py
Created
January 9, 2022 16:20
— forked from Davr1/classfinder.py
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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) |