Skip to content

Instantly share code, notes, and snippets.

View MihailJP's full-sized avatar

MihailJP MihailJP

View GitHub Profile
@MihailJP
MihailJP / hsp.xml
Created January 1, 2013 01:44
Kate syntax highlighting definition file for Hot Soup Processor
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE language SYSTEM "language.dtd">
<language name="Hot Soup Processor" section="Sources" version="1.00" extensions="*.hsp;*.as">
<highlighting>
<list name="keywords">
<item> await </item>
<item> break </item>
<item> continue </item>
<item> else </item>
<item> end </item>
@MihailJP
MihailJP / hsp.xml
Created January 1, 2013 01:48
Notepad++ syntax highlighting definition file for Hot Soup Processor
<NotepadPlus>
<UserLang name="HSP" ext="hsp as" udlVersion="2.0">
<Settings>
<Global caseIgnored="yes" allowFoldOfComments="no" forceLineCommentsAtBOL="no" foldCompact="no" />
<Prefix Keywords1="no" Keywords2="no" Keywords3="no" Keywords4="no" Keywords5="no" Keywords6="no" Keywords7="no" Keywords8="no" />
</Settings>
<KeywordLists>
<Keywords name="Comments" id="0">00// 00; 01 02 03/* 04*/</Keywords>
<Keywords name="Numbers, additional" id="1"></Keywords>
<Keywords name="Numbers, prefixes" id="2">0x 0b $ %</Keywords>
@MihailJP
MihailJP / paco-glib-issue.patch
Created January 8, 2013 04:21
Patch to compile GPACO with newer GLIB/GTKMM
diff -ru paco-2.0.9/gpaco/gconfig.h paco-2.0.9-newglib/gpaco/gconfig.h
--- paco-2.0.9/gpaco/gconfig.h 2010-06-26 04:51:00.000000000 +0900
+++ paco-2.0.9-newglib/gpaco/gconfig.h 2013-01-08 13:03:12.497896388 +0900
@@ -11,7 +11,7 @@
#include "paco/baseconfig.h"
#include <glibmm/ustring.h>
-#include <glib/gkeyfile.h>
+#include <glib.h>
#include <vector>
@MihailJP
MihailJP / timezone.c
Created April 20, 2013 16:55
Find the time zone
#include <time.h>
signed long getTZ ()
{
struct tm* timeStruct;
time_t timeValBase = 86400; /* I know an implementation in which time_t is unsigned */
time_t timeVal;
timeStruct = gmtime(&timeValBase); /* parse as the universal time */
timeVal = mktime(tp); /* intentionally treat as the local time in order to find the time zone */
@MihailJP
MihailJP / stat.hs
Created July 15, 2013 06:55
Functions for statistics
-- Functions for statistics
import Data.List
-- Averages
average p = (sum p) / (fromIntegral $ length p) -- arithmetic mean
geomean p = (product p) ** (1.0 / (fromIntegral $ length p)) -- geometric mean
harmean p = (fromIntegral $ length p) / (sum $ map (\x -> 1.0 / x) p) -- harmonic mean
rms p = sqrt $ average $ map (\x -> x * x) p -- quadratic mean (RMS)
@MihailJP
MihailJP / gcd.lua
Created January 26, 2014 11:25
Implementation of Euclidian algorithm
function gcd(a, b)
local x = a; local y = b
repeat
if x > y then
x = math.fmod(x, y)
else
y = math.fmod(y, x)
end
until x == 0 or y == 0
return x + y
@MihailJP
MihailJP / test2038.c
Created October 8, 2012 15:04
Check if your time_t implementation will work after 2038
#include <time.h>
#include <stdio.h>
#include <stdlib.h>
int main () {
time_t time_num[5] = {(time_t)0x00000000, (time_t)0x7fffffff, (time_t)0x80000000, (time_t)0xffffffff,};
struct tm* parsed_time; unsigned int i;
printf("sizeof(time_t) is %d.\n", sizeof(time_t));
for (i = 0; i < 4; i++) {
parsed_time = gmtime(&(time_num[i]));
@MihailJP
MihailJP / gcd.fth
Created May 17, 2014 11:25
GCD and LCM of two numbers, implemented with Forth
\ This implements Euclidean algorithm in Forth
: gcd ( X Y )
2dup <= if swap ( Y X ) then
( X Y )
begin
tuck ( Y X Y )
mod ( Y Z )
dup ( Y Z Z )
0= until ( Y Z )
( Y 0 )
@MihailJP
MihailJP / rational.hpp
Created January 17, 2013 16:40
Fraction class template
#pragma once
#include <stdexcept>
// Calculate GCD (for reduction)
template<typename T> T gcd(T x, T y) {
// Euclidean algorithm
T val1 = (x < y) ? y : x, val2 = (x < y) ? x : y;
T* m = &val1; T* n = &val2; T* tmpptr = nullptr;
while (true) {
@MihailJP
MihailJP / d_copy.lua
Created October 22, 2012 14:47
Shallow- and deep-copy of table in Lua
function clone (t) -- deep-copy a table
if type(t) ~= "table" then return t end
local meta = getmetatable(t)
local target = {}
for k, v in pairs(t) do
if type(v) == "table" then
target[k] = clone(v)
else
target[k] = v
end