Skip to content

Instantly share code, notes, and snippets.

@codemonkey-uk
codemonkey-uk / parallel_for.h
Last active Jan 18, 2021
quickly thrown together parallel_for.h
View parallel_for.h
#pragma once
#include <thread>
#include <mutex>
#include <algorithm>
//
// my sketchy parallel_for
// use:
//
@codemonkey-uk
codemonkey-uk / word-square.cpp
Created Jan 3, 2020
make word squares that have rotational symmetry
View word-square.cpp
/*
Copyright (c) 2019 Thaddaeus Frogley
Word Square Finder
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH
@codemonkey-uk
codemonkey-uk / to-rtf.scrpt
Last active Dec 7, 2016
Apple Script to convert old Documents to RTF using iWork '08 Pages.app
View to-rtf.scrpt
property PagesApp : ((path to applications folder) as text) & "iWork '08:" & "Pages.app:"
on open theDroppedItems
repeat with a from 1 to count of theDroppedItems
set theCurrentItem to item a of theDroppedItems
tell application "Finder"
set isFolder to folder (theCurrentItem as string) exists
end tell
-- Process a dropped folder
if isFolder = true then
@codemonkey-uk
codemonkey-uk / LODcheck.sh
Last active Apr 21, 2021
Find source of "Inconsistent LOD naming (_LOD1 found but no _LOD0)." messages in a large Unity project.
View LODcheck.sh
#!/bin/bash
for i in $(seq 0 9)
do
let j=i+1
echo "Looking for LOD$j where no LOD$i exists."
diff <(find . | grep _LOD$i | grep -v meta$ | sed -e "s/LOD$i/LOD-/g" | sort) <(find . | grep _LOD$j | grep -v meta$ | sed -e "s/LOD$j/LOD-/g" | sort) | grep ">"
done
View analyse.sh
#!/bin/bash
for i in $( ls *.jpg ); do
echo -n , $i
done
echo
for i in $( ls *.jpg ); do
echo -n $i
for j in $( ls *.jpg ); do
echo -n , $(compare -metric PSNR $i $j difference.png 3>&1 1>&2- 2>&3-)
done
@codemonkey-uk
codemonkey-uk / pfc5.cpp
Created Nov 6, 2014
Programming Fun Challenge 5: Polygon Packing (Winning Solution)
View pfc5.cpp
// pfc5.cpp v2 (c) T.Frogley 2002
// Programming Fun Challenge 5: Polygon Packing
// http://www.kuro5hin.org/story/2002/5/24/171054/160
//
// My solution does not provide an optimal packing,
// instead it produces a reasonable packing,
// and very good throughput, scaling very well,
// packing thousands of polys in sub-minute times,
// rather than hundreds in hours.
//
View gist:bc2a824c55fe16804818
-- A five digit number minus a four digit number equals 33333,
-- where the nine contributing digits are 1-9, each used only once.
import Data.List
slice start end = take (end - start + 1) . drop start
sliced :: String -> [Int]
sliced s = [read $ slice 0 4 s, read $ slice 5 9 s]
View gist:8edab3ae727314b0f886

Why you should never have to call super.Foo() in an Foo overload.

This is a classic example of poorly structured points of customisation.

For example, when you have:

class Base
{
  virtual void Foo();
@codemonkey-uk
codemonkey-uk / bfs.h
Last active Jan 2, 2016
Provide self contained function template implementing the Breadth First Search algorithm.Does not depend on STL, or any other library code. Circa 2003.
View bfs.h
// -------------------------------------------------------------------------
// bfs.h
// Version: 1.1
// Date: 2003/04/14
// Purpose: Provide template for Breadth First Search algorithm
// Note: Self contained, does not depend on STL, or any other library code
// (c) T.Frogley 2003-2015
// -------------------------------------------------------------------------
#ifndef TFROGLEY_BFS_H_2003
@codemonkey-uk
codemonkey-uk / astar.h
Last active Oct 5, 2021
The C++ header file "astar.h" implements the A* graph search (route finding) algorithm using a C++ function template. The interface is written in an STL like style.
View astar.h
// -------------------------------------------------------------------------
// Filename: astar.h
// Version: 1.24
// Date: 2002/03/08
// Purpose: Provide template for a* algorythm
// (c) T.Frogley 1999-2002
// -------------------------------------------------------------------------
#ifndef ASTAR_H
#define ASTAR_H