codemonkey-uk

#pragma once

#include <thread>
#include <mutex>
#include <algorithm>

//
// my sketchy parallel_for
// use:
// 

codemonkey-uk

/*
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

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

#!/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

codemonkey-uk

#!/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

// 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.
//

codemonkey-uk

-- 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]

codemonkey-uk

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

// -------------------------------------------------------------------------
// 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

// -------------------------------------------------------------------------
// Filename:    astar.h
// Version:     3
// Purpose:     Provide template for a* algorithm
// (c) T.Frogley 1999-2021
// Stable and used in many projects 2003-2021+
// Updated: 2021 to better support behaviour controls, & unordered_set
// -------------------------------------------------------------------------

#ifndef ASTAR_H