This file contains 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
#!/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 |
This file contains 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
// ------------------------------------------------------------------------- | |
// 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 |
This file contains 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
#pragma once | |
#include <thread> | |
#include <mutex> | |
#include <algorithm> | |
// | |
// my sketchy parallel_for | |
// use: | |
// |
This file contains 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
/* | |
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 |
This file contains 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
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 |
This file contains 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
// ------------------------------------------------------------------------- | |
// 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 |
This file contains 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
/* TCD directory tree program T.Frogley '94 */ | |
#include <stdlib.h> | |
#include <string.h> | |
#include <stdio.h> | |
#include <conio.h> | |
#include <dir.h> | |
#include <dos.h> | |
#include <memory.h> |
This file contains 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
/*(c) 2001 Thad */ | |
#include<string.h> | |
#include <stdio.h> | |
#define abc stdout | |
int main(int a,ch\ | |
ar*b){char*c="??=" | |
"??(??/??/??)??'{" | |
"??!??>??-";while( | |
!((a=fgetc(stdin)) | |
==EOF))fputc((b=s\ |
This file contains 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
Program MakeTrue3DFract; | |
uses dos,crt; | |
const | |
ver : string = '1'; | |
update : string = '1'; | |
Ysize : WORD = 512; | |
Xsize : WORD = 512; | |
ColourSet : Char = 'G'; |
This file contains 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
#!/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 |
NewerOlder