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
--[[ | |
tablecopy.lua | |
version: 17.07.15 | |
Copyright (C) 2017 Jeroen P. Broks | |
This software is provided 'as-is', without any express or implied | |
warranty. In no event will the authors be held liable for any damages | |
arising from the use of this software. | |
Permission is granted to anyone to use this software for any purpose, | |
including commercial applications, and to alter it and redistribute it |
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
#!/usr/bin/python | |
print "1 = Celcius >> Temperatoera" | |
print "2 = Temperatoera >> Celcius" | |
a = None | |
while (a!="1" and a!="2"): a = raw_input("Enter calculation value: ") | |
t = raw_input("Temperature: ") | |
if a=="1": | |
celcius = float(t) |
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
{ --- START LICENSE BLOCK --- | |
*********************************************************** | |
primes.pas | |
This particular file has been released in the public domain | |
and is therefore free of any restriction. You are allowed | |
to credit me as the original author, but this is not | |
required. | |
This file was setup/modified in: | |
2018 | |
If the law of your country does not support the concept |
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
/* | |
This is nothing more but a small javascript I wrote for task | |
I was set out to do, but I stored it here, for personal reasons. | |
If you hae a use for it, oh well, use it. ;) | |
*/ | |
function deepEqual(a,b){ | |
if (typeof(a)!=typeof(b)) { return false; } | |
if (a==null && b==null) { return true; } |
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
quotes = [ | |
"'Whoever makes no mistakes apparently does nothing at all'\n-- Mark Rutte", | |
"'Cogito Ergo Sum'", | |
"'Who wants to play an angel eventually plays the devil'\n-- Blaise Pascal", | |
"'Momento Mori'", | |
"'You can work all you want, but others decide your success'\n-- Jeroen Broks", | |
"'Is love for quick money as blind as love for somebody of the opposite sex?'\n Aziëlla of the House of Rayal", | |
"'Alea Iacta Est'\n-- Julius Caesar", | |
"'Freedom can never exist without the freedom to choose your own religion'\n-- Willem van Oranje", | |
"'A few false notes are only messy. Music without feeling is unforgivable'\n-- Richard Wagner", |
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
m=5000 | |
ver=[]; | |
for i in range(0,m+1): ver.append(0) | |
for a in range(1,m+1): | |
for b in range(1,m+1): | |
c = a * b; | |
if c<=m: ver[c]+=1 | |
primes=[] | |
for i in range(1,m+1): | |
if ver[i]==2 and (not i in primes): primes.append(i); |
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
let klaar=false; | |
const finishHomework=(pos,...nextsubjects)=>{ | |
console.log("\033[32mHomework done for "+nextsubjects[pos-1]+"\033[0m"); | |
doHomework(pos,...nextsubjects); | |
} | |
const doHomework=(pos,...nextsubjects)=>{ | |
if (pos>=nextsubjects.length) { | |
console.log("All 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
10 A=35 | |
15 B=-1 | |
20 FOR I=1 TO A | |
30 PRINT"X"; | |
40 NEXT | |
50 FOR I=1 TO 75-(A*2) | |
60 PRINT" "; | |
70 NEXT | |
80 FOR I=1 TO A | |
90 PRINT"X"; |
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
#include <stdio.h> | |
typedef | |
union | |
mc { | |
char rc; | |
unsigned char uc; | |
} mychar; | |
mychar ch; |
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
/* | |
This was a study source on how to do indexes of my own in C#. | |
This study can really broaden my views on a few things in C#, and maybe also help me to get rid of a few issues I'm currently suffering in C# | |
*/ | |
using System; | |
class test { | |
public string this[string key] { |
OlderNewer