tomasz
/
samples
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: tomasz:6e9af65dd3794729a9f69834083e815a7aa319aa
Branches Tags
tomasz:master
..
compare: tomasz:106bc4367ca789b83b03a03a1be8565bdffdb099
Branches Tags
tomasz:master

No commits in common. "6e9af65dd3794729a9f69834083e815a7aa319aa" and "106bc4367ca789b83b03a03a1be8565bdffdb099" have entirely different histories.
6e9af65dd3 ... 106bc4367c

33 changed files with 0 additions and 3295 deletions
Show Stats Expand all files Collapse all files

85
2022/03/algorithms/append_delete_bfs.js
View File

@ -1,85 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'appendAndDelete' function below.
*
* The function is expected to return a STRING.
* The function accepts following parameters:
* 1. STRING s
* 2. STRING t
* 3. INTEGER k
*/
function appendAndDelete(s, t, k) {
let max = 0, res;
s = s.trim();
t = t.trim();
// console.log(`s: ${s}, t: ${t}`);
let queue = [[s, 0]];
while (queue.length) {
let [word, steps] = queue.pop();
// console.log(`Word: ${word}, steps: ${steps}`);
if (word === t && steps === k) {
// console.log('Yes');
return "Yes";
}
if (steps >= k) {
continue;
}
queue.unshift([word.length ? word.slice(0, word.length - 1): '', steps+1]);
let increment = word.length >= t.length ? 'x' : t[word.length];
queue.unshift([word + increment, steps+1]);
}
// console.log('No');
return "No";
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const t = readLine();
const k = parseInt(readLine().trim(), 10);
const result = appendAndDelete(s, t, k);
ws.write(result + '\n');
ws.end();
}

79
2022/03/algorithms/append_delete_final.js
View File

@ -1,79 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'appendAndDelete' function below.
*
* The function is expected to return a STRING.
* The function accepts following parameters:
* 1. STRING s
* 2. STRING t
* 3. INTEGER k
*/
function appendAndDelete(s, t, k) {
let max = 0, res;
s = s.trim();
t = t.trim();
for (let i = 0; i < Math.min(s.length, t.length); i++) {
if (s[i] !== t[i]) {
break;
} else {
max = i+1;
}
}
// console.log(`Max: ${max}`);
let operations = (s.length - max) + (t.length - max);
let operations2 = s.length + t.length;
console.log('Operations', operations);
return k >= operations2 || (k >= operations && (operations - k) % 2 == 0) ? 'Yes' : 'No';
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const t = readLine();
const k = parseInt(readLine().trim(), 10);
const result = appendAndDelete(s, t, k);
ws.write(result + '\n');
ws.end();
}

78
2022/03/algorithms/append_delete_opt.js
View File

@ -1,78 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'appendAndDelete' function below.
*
* The function is expected to return a STRING.
* The function accepts following parameters:
* 1. STRING s
* 2. STRING t
* 3. INTEGER k
*/
function appendAndDelete(s, t, k) {
let max = 0, res;
s = s.trim();
t = t.trim();
for (let i = 0; i < Math.min(s.length, t.length); i++) {
if (s[i] !== t[i]) {
break;
} else {
max = i+1;
}
}
// console.log(`Max: ${max}`);
let operations = (s.length - max) + (t.length - max);
console.log('Operations', operations);
return operations === k ? 'Yes' : 'No';
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const t = readLine();
const k = parseInt(readLine().trim(), 10);
const result = appendAndDelete(s, t, k);
ws.write(result + '\n');
ws.end();
}

203
2022/03/algorithms/btree.js
View File

@ -1,203 +0,0 @@
"use strict";
// const fs = require('fs');
// const {EOL} = require('os');
let enable_logging = false;
function log(...s) {
if (!enable_logging) {
return;
}
console.log.apply(null, s);
}
function make_node(k) {
return {
level: k,
// temporarily allowing having one more element before split
keys: [], // k node can have k-1 keys, they are sorted
children: [] // k node can have k children
};
};
function binary_search(arr, el) {
if (!arr.length) {
log('Arr is empty');
return 0;
}
if (el < arr[0]) {
log(`El ${el} is smaller than ${arr[0]}`);
return 0;
}
if (el > arr[arr.length - 1]) {
log(`El ${el} is bigger than ${arr[arr.length - 1]}`);
return arr.length;
}
let i = 0;
let j = arr.length - 1;
let p;
while (i < j - 1) {
p = (i + j) >> 1; // dividing by 2 but javascript can't do it without Math.floor
if (arr[p] <= el) {
i = p;
} else {
j = p;
}
}
return i+1;
}
function btree_insert(node, el) {
log(`Adding ${el} into`, node);
if (!node) {
return [null, el, null];
}
const idx = binary_search(node.keys, el);
log(`Got index ${idx}`);
const child = node.children[idx];
let result = btree_insert(child, el);
if (!result) {
log('No merging root from sub');
return null; // we are all good
}
let [left, root, right] = result;
log(`Got new root ${root} and sub trees`, left, right);
node.keys.splice(idx, 0, root);
node.children[idx] = left;
node.children.splice(idx+1, 0, right);
log(`Node size: ${node.keys.length}, node level: ${node.level}`);
if (node.keys.length > node.level) {
let h = node.level >> 1;
log(`Splitting`);
log(node.keys, `h index ${h}`);
let left = make_node(node.level);
let right = make_node(node.level);
let root = node.keys[h];
console.log(`Children`, node.children);
left.keys = node.keys.slice(0, h);
left.children = node.children.slice(0, h+1);
right.keys = node.keys.slice(h+1);
right.children = node.children.slice(h+1);
log('Result', left, root, right);
return [left, root, right];
} else {
return null;
}
}
function make_tree(t, result) {
if (!result) {
return t;
}
let [left, el, right] = result;
let root = make_node(t.level);
root.keys[0] = el;
root.children[0] = left;
root.children[1] = right;
return root;
}
function display_tree(t, path = '') {
if (!t) {
return;
}
for (let i = 0; i < t.keys.length; i++) {
display_tree(t.children[i], path + "/" + i);
console.log(path + " " + t.keys[i]);
}
display_tree(t.children[t.keys.length], path + "/" + t.keys.length);
}
function btree_delete(t, el) {
console.log(`Got t`, t, `, el: ${el}`);
if (!t) {
return t;
}
let idx = binary_search(t.keys, el);
let val = t.keys[idx];
console.log(`Got index ${idx} with value ${t.keys[idx]}`);
if (t.keys[idx] === el || t.keys[idx-1] === el) {
// we need to delete this element
console.log(`Found key ${el}`);
let idxEl = t.keys[idx] === el ? idx : idx - 1;
console.log(`Found idx ${idxEl}`);
if (!t.children[idx]) {
t.keys.splice(idxEl, 1);
t.children.splice(idxEl, 1);
} else {
if (t[idx-1].keys >= t.level/2) {
// we can borrow one element from precedessing
} else if (t[idx+1].keys >= t.level/2) {
// we can borrow one element from successor
} else {
}
}
// TODO check if there are enough elements to be balanced
} else {
return btree_delete(t.children[idx], el);
}
}
// let arr = [1, 3, 5, 7];
// const el = -2;
// const pos = binary_search(arr, el);
// arr.splice(pos, 0, el);
// log(`Binary search`, arr);
// let t = make_node(2);
// t = make_tree(t, btree_insert(t, 1));
// t = make_tree(t, btree_insert(t, 2));
// t = make_tree(t, btree_insert(t, 3));
// t = make_tree(t, btree_insert(t, 4));
// t = make_tree(t, btree_insert(t, 5));
// t = make_tree(t, btree_insert(t, 6));
// t = make_tree(t, btree_insert(t, 7));
// display_tree(t);
// enable_logging = true;
// t = make_tree(t, btree_insert(t, 1));
// t = make_tree(t, btree_insert(t, 2));
// t = make_tree(t, btree_insert(t, 3));
// t = make_tree(t, btree_insert(t, 4));
// t = make_tree(t, btree_insert(t, 5));
// t = make_tree(t, btree_insert(t, 6));
// t = make_tree(t, btree_insert(t, 7));
// t = make_tree(t, btree_insert(t, 8));
// t = make_tree(t, btree_insert(t, 5));
// t = make_tree(t, btree_insert(t, 5));
// console.log(t);
//enable_logging = false;
// display_tree(t);
let t = make_node(4);
enable_logging = false;
t = make_tree(t, btree_insert(t, 1));
t = make_tree(t, btree_insert(t, 2));
t = make_tree(t, btree_insert(t, 3));
t = make_tree(t, btree_insert(t, 4));
t = make_tree(t, btree_insert(t, 5));
t = make_tree(t, btree_insert(t, 6));
t = make_tree(t, btree_insert(t, 7));
enable_logging = true;
t = make_tree(t, btree_delete(t, 5));
enable_logging = false;
display_tree(t);

98
2022/03/algorithms/distance.js
View File

@ -1,98 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'appendAndDelete' function below.
*
* The function is expected to return a STRING.
* The function accepts following parameters:
* 1. STRING s
* 2. STRING t
* 3. INTEGER k
*/
function appendAndDelete(s, t, k) {
s = s.trim();
t = t.trim();
let n = s.length;
let m = t.length;
// console.log(`n: ${n}, m: ${m}`);
let a = new Array(n+1);
for (let i = 0; i <= n; i++) {
a[i] = new Array(m+1);
}
for (let i = 0; i <= m; i++) {
a[0][i] = i;
}
for (let i = 0; i <= n; i++) {
a[i][0] = i;
}
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= m; j++) {
// console.log(`I: ${i}, J: ${j}, Sc: ${s[i-1]}, Tc: ${t[j-1]}`);
if (s[i-1] === t[j-1]) {
a[i][j] = a[i-1][j-1];
} else {
a[i][j] = Math.min(a[i-1][j]+1, a[i][j-1]+1);
}
}
}
// console.log('Array', a);
console.log(`Min operations: ${a[n][m]}`);
let res = a[n][m] <= k ? 'Yes': 'No';
// console.log(`Res: ${res}`);
return res;
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const t = readLine();
const k = parseInt(readLine().trim(), 10);
const result = appendAndDelete(s, t, k);
ws.write(result + '\n');
ws.end();
}

106
2022/03/algorithms/factorial.js
View File

@ -1,106 +0,0 @@
"use strict";
function mul2(v) {
let res = [];
let shift = 0;
let t;
for (let i = v.length - 1; i >= 0; i--) {
t = v[i]*2 + shift;
shift = t >= 10 ? 1 : 0;
res.unshift(t % 10);
}
if (shift > 0) {
res.unshift(1);
}
return res;
}
function div2(v) {
let res = [];
let s = 0, div;
let leading = false;
for (let i = 0; i < v.length; i++) {
s = s*10 + v[i];
div = s >> 1;
s = s - 2*div;
if (!leading && div > 0) {
leading = true;
}
if (leading || Math.abs(div) > 1e-6) {
res.push(div);
}
}
if (!res.length) {
res.push(0);
}
return res;
}
function odd(a) {
return a.length > 0 ? a[a.length-1] % 2 === 1: false;
}
function zero(a) {
return !a.length || (a.length == 1 && a[0] === 0);
}
function sum(a, b) {
let x = [...a];
let y = [...b];
let shift = 0;
let res = []
let e1, e2, e3;
while (x.length || y.length) {
e1 = x.length ? x.pop() : 0;
e2 = y.length ? y.pop() : 0;
e3 = e1+e2+shift;
res.unshift(e3 % 10);
shift = e3 >= 10 ? 1 : 0;
}
if (shift) {
res.unshift(1);
}
return res;
}
function mul(a, b) {
let x = [...a];
let y = [...b];
let x2;
let y2;
let s = [0];
while (!zero(x)) {
x2 = div2(x);
y2 = mul2(y);
if (odd(x)) {
s = sum(s, y);
}
x = x2;
y = y2;
}
return s;
}
function factorial(x) {
let c = [ 0 ];
let m = [1];
let mp = [1];
for (let i = 0; i < x; i++) {
c = sum(c, [1]);
m = mul(mp, c);
mp = m;
}
return m;
}
console.log(factorial(7).map((el) => '' + el).join(''));

119
2022/03/algorithms/factorial2.js
View File

@ -1,119 +0,0 @@
'use strict';
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'extraLongFactorials' function below.
*
* The function accepts INTEGER n as parameter.
*/
// the idea to store digits in array
// but the system is 1000 base instead of 10
// just for printing issues
function convert_to(n) {
let res = [];
let digit;
do {
digit = n % 1000;
res.unshift(digit);
n = Math.floor(n / 1000);
} while (n > 0);
return res;
}
function sum(a, b) {
let da, db, shift = 0, res;
let digits = [];
while (a.length || b.length) {
da = a.length ? a.pop() : 0;
db = b.length ? b.pop() : 0;
res = da + db + shift;
digits.unshift(res % 1000);
shift = Math.floor(res / 1000);
}
if (shift > 0) {
digits.unshift(shift);
}
return digits;
}
function multiply(a, b) {
// console.log('multiply', a, b);
let n = a.length;
let m = b.length;
let da, db, shift = 0, res;
let offsetArray = [];
let subSum;
let sumAll = [0];
for (let i = m - 1; i >= 0; i--) {
subSum = [...offsetArray];
offsetArray.push(0);
for (let j = n - 1; j >= 0; j--) {
res = b[i] * a[j] + shift;
subSum.unshift(res % 1000);
shift = Math.floor(res / 1000);
}
if (shift > 0) {
subSum.unshift(shift);
}
// console.log('Subsum', subSum);
sumAll = sum(sumAll, subSum);
// console.log('Summed', sumAll);
}
return sumAll;
}
function extraLongFactorials(n) {
let m = [1];
let factor = [0];
for (let i = 0; i < n; i++) {
factor = sum(factor, [1]);
console.log(`Factor`, m, factor);
m = multiply(m, factor);
}
console.log(`Result`, m);
let s = "" + m[0];
for (let i = 1; i < m.length; i++) {
s += ("" + m[i]).padStart(3, "0");
}
console.log(s);
}
function main() {
const n = parseInt(readLine().trim(), 10);
extraLongFactorials(n);
}

153
2022/03/algorithms/fibonacci_heap.js
View File

@ -1,153 +0,0 @@
"use strict";
// const fs = require('fs');
// const {EOL} = require('os');
function log(s) {
// console.log(s);
}
function find_min(l) {
if (!l || !l.length) {
return null;
}
let min = l[0];
let idx = 0;
for (let i = 1; i < l.length; i++) {
if (min.value > l[i].value) {
min = l[i];
idx = i;
}
}
return [min, idx];
}
function merge_some_level_trees(l, r) {
// merge it into level+1 and it becomes t
if (l.value < r.value) {
// l becomes root
l.children.push(r);
l.level++;
return l;
} else {
// r becomes root
r.children.push(l);
r.level++;
return r;
}
}
function heap_insert(nodes, el) {
log('Heap insert nodes: ', nodes, ', element: ', el);
return merge_tree_lists(nodes, [{
value: el,
level: 0,
children: []
}]);
}
function merge_tree_lists(l, r) {
log('Merging tree lists l: ', l, ', r: ', r);
if (!l) {
return r;
}
if (!r) {
return l;
}
let x = [];
// assuming both l and r are correct fibonacci heaps so max 2 trees with the same level
let idx = 0;
while (l.length && r.length) {
log(`${idx}. loop iteration`);
if (l[0].level < r[0].level) {
log('Case 1 l level is smaller than r level. Adding l[0]');
x.push(l.shift());
} else if (l[0].level > r[0].level) {
log('Case 2 l level is bigger than r level. Adding r[0]');
x.push(r.shift());
} else {
// l[0].level === r[0].level
log('Case 3 l is the same as r level. Adding both');
x.push(l.shift());
x.push(r.shift());
}
++idx;
}
log(`End of loop after ${idx} iterations`);
log('l: ', l, ', r: ', r);
if (l.length) {
x = x.concat(l);
} else if (r.length) {
x = x.concat(r);
}
log('x: ', x);
// the situation is we have sorted by level (ascending) with max 2 neighbouring
// trees with the same level
let res = [];
let t1, t2, t;
while (x.length > 1) {
if (x[0].level < x[1].level) {
res.push(x.shift());
} else {
// with the same level
t1 = x.shift();
t2 = x.shift();
x.unshift(merge_some_level_trees(t1, t2));
}
}
// case 0 or 1
while (x.length) {
res.push(x.shift());
}
return res;
}
function delete_heap_min(nodes) {
log(`Delete heap min l ${nodes.length}`);
let [node, idx] = find_min(nodes);
nodes.splice(idx, 1);
return merge_tree_lists(nodes, node.children);
}
let heap = [];
// heap = heap_insert(heap, -2);
heap = heap_insert(heap, 2);
// heap = heap_insert(heap, -3);
heap = heap_insert(heap, 3);
// heap = heap_insert(heap, -1);
heap = heap_insert(heap, -10);
// heap = heap_insert(heap, 20);
heap = heap_insert(heap, 100);
heap = heap_insert(heap, 3);
heap = heap_insert(heap, 2);
heap = heap_insert(heap, 1);
heap = heap_insert(heap, -100);
heap = heap_insert(heap, -1);
heap = heap_insert(heap, -4);
heap = heap_insert(heap, 4);
heap = heap_insert(heap, 5);
heap = heap_insert(heap, 6);
console.log(`Forrest of binomial trees ${heap.length}`);
for (let el of heap) {
console.log(`${el.value} ${el.level}`);
}
while (heap.length) {
let [node, idx] = find_min(heap);
console.log(`Node ${node.value}, idx: ${idx}`);
heap = delete_heap_min(heap);
}

133
2022/03/algorithms/heap_binary_arr.js
View File

@ -1,133 +0,0 @@
"use strict";
// const fs = require('fs');
// const {EOL} = require('os');
// 0
// 1 2
// 3 4 5 6
// |--- i ---|
// 2*i+1 2*i+2
function check_heap(arr) {
// parent has to be smaller or equal
let n = arr.length;
for (let i = n - 1; i > 0; i--) {
let idx = (i-1) >> 1;
if (heap[idx] > heap[i]) {
return [idx, i];
}
}
return [-1, -1];
}
function push_up(heap, i) {
let idx, t;
while (i > 0) {
idx = (i - 1) >> 1;
console.log(`Checking ${i} with parent ${idx}. v ${heap[i]} vs p ${heap[idx]}`);
if (heap[idx] > heap[i]) {
console.log(`Replacing ${i}(${heap[i]}) with ${idx}(${heap[idx]})`);
t = heap[idx];
heap[idx] = heap[i];
heap[i] = t;
i = idx;
} else {
break;
}
}
}
function push_down(heap, i) {
let t;
while (true) {
if (i + 1 >= heap.length) {
// we are the last. No children
return;
}
if ((2*i + 1 >= heap.length || heap[i] < heap[2*i+1])
&& (2*i + 2 >= heap.length || heap[i] < heap[2*i+2])) {
// heap conditions are right
return;
}
// let's replace it with the smallest
// -1 5
// 0 1 -> 0 1
if (2*i + 2 < heap.length) {
if (heap[2*i+1] > heap[2*i+2]) {
// heap[2*i+2] is smallest
t = heap[2*i+2];
heap[2*i+2] = heap[i];
heap[i] = t;
i = 2*i + 2;
} else {
// heap[2*i+1] is smallest
t = heap[2*i+1];
heap[2*i+1] = heap[i];
heap[i] = t;
i = 2*i + 1;
}
} else {
// we have only one case possible
// heap[2*i+1] is smallest
t = heap[2*i+1];
heap[2*i+1] = heap[i];
heap[i] = t;
i = 2*i + 1;
}
}
}
function insert_heap(heap, el) {
let n = heap.length;
heap[n] = el;
push_up(heap, n);
}
function pop_heap(heap) {
let n = heap.length;
let el = heap[0];
heap[0] = heap[n-1];
heap.pop();
push_down(heap, 0);
return el;
}
function build_heap(arr) {
const n = arr.length;
const heap = new Array(n);
for (let i = 0; i < n; i++) {
heap[i] = arr[i];
}
let t;
for (let i = n - 1; i > 0; i--) {
push_up(heap, i);
}
return heap;
}
const arr = [6, 5, 4, 3, 2, 1, 0];
console.log('Heap 1', arr);
const heap = build_heap(arr);
insert_heap(heap, 7);
insert_heap(heap, 8);
insert_heap(heap, 9);
insert_heap(heap, 10);
console.log('Heap 2', heap);
console.log('Check heap', check_heap(heap));
while (heap.length) {
console.log(pop_heap(heap));
}

95
2022/03/algorithms/leftist_heap.js
View File

@ -1,95 +0,0 @@
"use strict";
// const fs = require('fs');
// const {EOL} = require('os');
function log(v) {
// console.log(v);
}
function merge_heap(a, b) {
log('a', a);
log('b', b);
if (!a) {
log('a is empty. Returning b');
return b;
}
if (!b) {
log('b is empty. Returning a');
return a;
}
// a & b are non null
if (a.value > b.value) {
log(`a.value is bigger than b.value`);
return merge_heap(b, a); // heap the top, the smallest
}
log('Merging a.right with b');
a.right = merge_heap(a.right, b); // merging right as right is usually smaller
// and should be more performent thus
// a.right is not null as b is not null
if (!a.left) {
a.left = a.right;
a.right = null;
a.height = 1;
return a; // a is already merged with b and having null right
}
let t;
// we keep leftist tree intact as it's balanced to the left
if (a.left.height < a.right.height) {
t = a.left;
a.left = a.right;
a.right = t;
}
a.height = a.right.height + 1;
return a;
}
function pop_heap(heap) {
return merge_heap(heap.left, heap.right);
}
function insert_heap(heap, val) {
return merge_heap(heap, {value: val, height: 1});
}
let values = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0];
let heap = {root: null};
// heap.root = merge_heap(heap.root, {value: 1, height: 1});
// heap.root = merge_heap(heap.root, {value: 2, height: 1});
// heap.root = merge_heap(heap.root, {value: 3, height: 1});
// heap.root = merge_heap(heap.root, {value: -1, height: 1});
if (false) {
// naive way of creating leftist heap
for (let el of values) {
heap.root = merge_heap(heap.root, {value: el, height: 1});
}
} else {
// better way of creating heap using queue
let queue = [];
for (let el of values) {
queue.push({value: el, height: 1});
}
while (queue.length > 1) {
let h1 = queue.shift();
let h2 = queue.shift();
let h = merge_heap(h1, h2);
queue.push(h);
}
heap.root = queue.shift();
}
while (heap.root) {
let el = heap.root.value;
console.log(`Value: ${el}`);
heap.root = pop_heap(heap.root);
}

22
2022/03/algorithms/liss.js
View File

@ -1,22 +0,0 @@
function liss(arr) {
console.log('Array', arr);
let n = arr.length;
let liss = new Array(n);
liss[n-1] = 1;
let cliss;
for (let i = n-2; i >= 0; i--) {
cliss = 1;
for (let j = i+1; j < n; j++) {
if (arr[i] < arr[j]) {
cliss = Math.max(cliss, 1+liss[j]);
}
}
liss[i] = cliss;
console.log(`LISS(${i}) == ${liss[i]}`);
}
return cliss[0];
}
console.log(`LISS ${liss([1,2,4,3])}`);

0
2022/03/algorithms/maxflow_edmunds_karps.js → 2022/03/algorithms/maxflow1.js
View File

268
2022/03/algorithms/maxflow_push_relabel.js
View File

@ -1,268 +0,0 @@
"use strict";
const fs = require('fs');
const {EOL} = require('os');
const eps = 1e-6;
function chooseActiveNodeForRelabel(c, e, h) {
let n = h.length;
for (let i = 0; i < n; i++) {
if (e[i] <= 0) {
continue;
}
for (let j = 0; j < n; j++) {
if (c[i][j] <= 0) {
// in edge E_f
continue;
}
if (h[i] > h[j]) {
break;
}
}
return i;
}
return -1;
}
function chooseActiveNodeForPush(c, e, h) {
let n = h.length;
for (let i = 0; i < n; i++) { // what about replacing it with priority queues
if (e[i] <= 0) {
continue;
}
// we are looking for nodes if excess
for (let j = 0; j < n; j++) { // what about replacing it with priority queues
if (c[i][j] <= 0 || h[i] != h[j] + 1) {
continue;
}
// c[i][j] > 0 && h[i] == h[j] + 1
return [i, j];
}
}
return [-1, -1];
}
function findMaximumFlow(graph) {
let nodes = [];
let m = {};
for (let el of graph.nodes) {
nodes.push(el);
}
for (let i = 0; i < nodes.length; i++) {
m[nodes[i]] = i;
}
const n = nodes.length;
let c = new Array(n);
let oc = new Array(n);
let f = new Array(n);
let h = new Array(n);
let e = new Array(n); // excess flow
for (let i = 0; i < n; i++) {
c[i] = new Array(n); // residual capacity
oc[i] = new Array(n); // residual capacity
f[i] = new Array(n); // flow
h[i] = 0; // node height
e[i] = 0; // node flow excess
}
h[m[graph.source]] = n;
for (let i = 0; i < n; i++) {
for (let j = 0; j < n; j++) {
f[i][j] = 0;
c[i][j] = 0;
oc[i][j] = 0;
}
}
// init capacity
for (let v in graph.edges) {
for (let {node, weight} of graph.edges[v]) {
c[m[v]][m[node]] = weight;
oc[m[v]][m[node]] = weight;
}
}
for (let {node, weight} of graph.edges[graph.source]) {
f[m[graph.source]][m[node]] = weight;
e[m[node]] = weight;
e[m[graph.source]] -= weight;
}
console.log('Capacity', c);
console.log('Flow', f);
console.log('Height', h);
console.log('Excess', e);
// try push
// if not relabel
// and repeat till it's possible
// quite naive way to choose active node for push
do {
// push
let [ci, cj] = chooseActiveNodeForPush(c, e, h);
if (ci >= 0 && cj >= 0) {
console.log(`Pushing (${ci},${cj})`);
let flow = Math.min(e[ci], c[ci][cj]);
if (oc[ci][cj] > 0) { // if ci, cj exists in e edges
f[ci][cj] += flow;
} else {
f[cj][ci] -= flow;
}
e[ci] -= flow;
e[cj] += flow;
} else {
// relabel
let ri = chooseActiveNodeForRelabel(c, e, h);
if (ri >= 0) {
console.log(`Relabeling (${ri})`);
let hMax = -Infinity;
for (let i = 0; i < n; i++) {
if (c[ri][i] <= 0) {
continue;
}
hMax = Math.max(hMax, h[i]);
}
if (hMax <= 0) {
continue;
}
h[ri] = hMax + 1;
console.log(`Setting height ${h[ri]} for ${ri}`);
} else {
console.log('Maximal flow...');
break; // we have maximal flow
}
}
} while (true);
let flow = 0;
for (let j = 0; j < n; j++) {
flow += f[m[graph.source]][j];
}
return flow;
}
function sourceCmdLine(ctx, cmdLine) {
ctx.source = cmdLine.slice(
'source'.length,
cmdLine.indexOf(';')
).trim();
}
function targetCmdLine(ctx, cmdLine) {
ctx.target = cmdLine.slice(
'target'.length,
cmdLine.indexOf(';')
).trim();
}
function edgeCmdLine(ctx, cmdLine) {
let edgeLine = cmdLine.slice(
'edge'.length,
cmdLine.indexOf(';')
).trim();
console.log(`Edge line ${edgeLine}`);
const matches = edgeLine.match(/^([a-zA-Z]*) -> ([a-zA-Z]*): ([0-9.]*)$/);
// console.log('Matches', matches);
const v = matches[1];
const z = matches[2];
const weight = Number.parseFloat(matches[3]);
console.log(`Parsed ${v} -> ${z} : ${weight}`);
ctx.nodes.add(v);
ctx.nodes.add(z);
let targetEdges = ctx.edges[v] || [];
targetEdges.push({node: z, weight});
ctx.edges[v] = targetEdges;
}
function processCmdLine(ctx, cmdLine) {
console.log(`Processing command line ${cmdLine}`);
if (cmdLine.startsWith('source')) {
sourceCmdLine(ctx, cmdLine);
} else if (cmdLine.startsWith('target')) {
targetCmdLine(ctx, cmdLine);
} else if (cmdLine.startsWith('edge')) {
edgeCmdLine(ctx, cmdLine);
}
}
console.log(`Process argv: ${process.argv}`);
const inputPath = process.argv.length > 2 ? process.argv[2] : '-';
const outputPath = process.argv.length > 3 ? process.argv[3] : '-';
console.log(`Input path ${inputPath}, output path: ${outputPath}`);
const inputStream = inputPath === '-'
? process.stdin
: fs.createReadStream(inputPath);
// const outputStream = outputPath === '-'
// ? process.stdout
// : fs.createWriteStream(outputStream);
let inputBuffer = "";
let ctx = {
source: '',
target: '',
edges: {},
nodes: new Set()
};
function processChunk(chunk) {
inputBuffer += chunk;
console.log(`Chunk: ${chunk}`);
let eolIdx;
do {
eolIdx = inputBuffer.indexOf(EOL);
if (eolIdx < 0 && !chunk) {
eolIdx = inputBuffer.length;
}
let cmdLine = null;
if (eolIdx >= 0) {
console.log(`We got new line ${eolIdx}`);
cmdLine = inputBuffer.slice(0, eolIdx);
processCmdLine(ctx, cmdLine);
inputBuffer = inputBuffer.slice(eolIdx+EOL.length);
}
} while (eolIdx >= 0 && inputBuffer.length);
}
inputStream.on('data', (chunk) => {
processChunk(chunk);
});
inputStream.on('end', (chunk) => {
console.log(`end chunk ${chunk}`);
processChunk(chunk);
console.log('Got following graph', ctx);
for (let v in ctx.edges) {
for (let {node, weight} of ctx.edges[v]) {
console.log(`${v} ${node} : ${weight}`);
}
}
let mflow = findMaximumFlow(ctx);
console.log(`Maximum flow is ${mflow}`);
});

81
2022/03/algorithms/non_divisible_subset.js
View File

@ -1,81 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'nonDivisibleSubset' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER k
* 2. INTEGER_ARRAY s
*/
function nonDivisibleSubset(k, s) {
let counts = new Array(k);
for (let i = 0; i < k; i++) {
counts[i] = 0;
}
for (let el of s) {
counts[el % k]++;
}
let count = Math.min(1, counts[0]);
for (let i = 1; i <= k >> 1; i++) {
let j = k - i;
if (i !== j) {
count += Math.max(counts[i], counts[j]);
} else {
count += Math.min(1, counts[i]);
}
}
return count;
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const firstMultipleInput = readLine().replace(/\s+$/g, '').split(' ');
const n = parseInt(firstMultipleInput[0], 10);
const k = parseInt(firstMultipleInput[1], 10);
const s = readLine().replace(/\s+$/g, '').split(' ').map(sTemp => parseInt(sTemp, 10));
const result = nonDivisibleSubset(k, s);
console.log(`Result ${result}`);
ws.write(result + '\n');
ws.end();
}

93
2022/03/algorithms/non_divisible_subset_naive.js
View File

@ -1,93 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
let sigintCalled = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
++sigintCalled;
console.log(`SIGINT ${sigintCalled}`);
if (sigintCalled >= 2) {
process.exit(1);
return;
}
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'nonDivisibleSubset' function below.
*
* The function is expected to return an INTEGER.
* The function accepts following parameters:
* 1. INTEGER k
* 2. INTEGER_ARRAY s
*/
function nonDivisibleSubset(k, s) {
if (sigintCalled >= 2) {
process.exit(1);
return null;
}
console.log('k', k, 's', s);
if (s.length <= 1) {
return s.length;
}
let el = s[0];
// with
let msize1 = nonDivisibleSubset(
k,
s.slice(1).filter((a) => {
return (a + el) % k !== 0
})
) + 1;
// or without
let msize2 = nonDivisibleSubset(k, s.slice(1));
return Math.max(msize1, msize2);
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const firstMultipleInput = readLine().replace(/\s+$/g, '').split(' ');
const n = parseInt(firstMultipleInput[0], 10);
const k = parseInt(firstMultipleInput[1], 10);
const s = readLine().replace(/\s+$/g, '').split(' ').map(sTemp => parseInt(sTemp, 10));
const result = nonDivisibleSubset(k, s);
console.log(`Result ${result}`);
ws.write(result + '\n');
ws.end();
}

243
2022/03/algorithms/prim.js
View File

@ -1,243 +0,0 @@
"use strict";
const fs = require('fs');
const {EOL} = require('os');
function findPrimMST(graph) {
let heap = [];
// we need to make a heap and remove it
// one by one. Approach bottom up as it's more
// efficient when we create heap from scratch
// not just adding single element
function testHeap() {
console.log('Test', heap);
for (let i = 0; i < heap.length; i++) {
// console.log(`Testing ${i}`);
if (2*i+1 < heap.length && heap[2*i+1].w < heap[i].w) {
console.log(`Bad ${i} because ${2*i+1} has smaller value ${heap[i].w} > ${heap[2*i+1].w}`);
return;
}
if (2*i+2 < heap.length && heap[2*i+2].w < heap[i].w) {
console.log(`Bad ${i} because ${2*i+2} has smaller value ${heap[i].w} > ${heap[2*i+2].w}`);
return;
}
}
}
function heapInsert(el) {
heap.push(el);
let idx = heap.length - 1;
let t;
while (idx >= 1) {
let parent = (idx - 1) >> 1;
if (heap[parent].w > heap[idx].w) {
t = heap[idx];
heap[idx] = heap[parent];
heap[parent] = t;
idx = parent;
} else {
break;
}
}
}
function popSmallest() {
let val = heap[0];
heap[0] = heap[heap.length - 1];
heap.pop();
// console.log('Popping first', val);
// we need to fix from top to bottom
// we need to take smallest from descendents
let idx = 0;
let t;
while (idx < heap.length) {
// console.log(`Checking idx ${idx}`);
let smallest = heap[idx].w;
if (2*idx + 1 < heap.length) {
smallest = Math.min(smallest, heap[2*idx+1].w);
}
if (2*idx + 2 < heap.length) {
smallest = Math.min(smallest, heap[2*idx+2].w);
}
// console.log(`Smallest ${smallest}, current: ${heap[idx].w}`);
if (smallest >= heap[idx].w) {
return val; // we're good
}
// we need to have something smaller we try first
if (smallest === heap[2*idx+1].w) {
t = heap[2*idx+1];
heap[2*idx+1] = heap[idx];
heap[idx] = t;
// console.log(`Smallest ${2*idx+1}`);
idx = 2*idx+1;
} else {
t = heap[2*idx+2];
heap[2*idx+2] = heap[idx];
heap[idx] = t;
// console.log(`Smallest ${2*idx+2}`);
idx = 2*idx+2;
}
}
return null; // it should never go here except empty
}
// * TODO troubleshoot it adding bottom up
// for (let u in graph.edges) {
// for (let {v, w} of graph.edges[u]) {
// heap.push({u, v, w}); // bottom up
// heapInsert({u,v, w}); // top to bottom
// }
//}
// 0
// 1 2 // left desc 2*i + 1, right 2*i + 2
// 3 4 5 6
// parent (i-1) >> 1;
// console.log('Heap', heap);
/**
let t;
for (let i = heap.length - 1; i >= 1; i--) {
let idx = (i - 1) >> 1; // divided by 2
console.log(`i: ${i}, idx: ${idx}`);
console.log(`Parent: ${heap[idx].w}, item: ${heap[i].w}`);
if (heap[idx].w > heap[i].w) {
console.log(`Replaced`);
t = heap[idx];
heap[idx] = heap[i];
heap[i] = t;
}
}
for (let i = heap.length - 1; i >= 1; i--) {
let idx = (i - 1) >> 1; // divided by 2
console.log(`i: ${i}, idx: ${idx}`);
console.log(`Parent: ${heap[idx].w}, item: ${heap[i].w}`);
if (heap[idx].w > heap[i].w) {
console.log(`Bad...`);
}
}
**/
// while (heap.length) {
// console.log(popSmallest());
// }
let remaining = new Set(graph.nodes);
console.log('Nodes', remaining);
let mst = {};
let sets = 1;
function addEdges(u) {
// console.log(`Adding edges for ${u}`);
for (let el of graph.edges[u]) {
// console.log(`Edge`, el);
if (typeof(mst[el.v]) === 'number') {
continue;
}
heapInsert({u: u, v: el.v, w: el.w});
}
}
let sum = 0;
while (remaining.size) {
let u = null;
for (let el of remaining) {
u = el;
break;
}
remaining.delete(u);
mst[u] = sets;
addEdges(u);
while (true) {
let r = popSmallest();
console.log('Edge', r);
if (!r) {
break;
}
let {u,v,w} = r;
if (typeof(mst[v]) === 'number') {
console.log('Already added v...');
continue;
}
mst[v] = sets;
remaining.delete(v);
sum += w;
addEdges(v);
}
}
console.log(`Weight ${sum}`);
console.log('MST', mst);
console.log('Remaining', remaining);
}
function processLine(graph, line) {
// console.log(`Processing line ${line}`);
let matches =
line.match(/([a-zA-Z]+) - ([a-zA-Z]+): ([0-9.]+)/);
let u = matches[1];
let v = matches[2];
let w = Number.parseFloat(matches[3]);
graph.nodes.add(u);
graph.nodes.add(v);
// bidirectional graph
let outEdges = graph.edges[u] || [];
outEdges.push({v, w});
graph.edges[u] = outEdges;
outEdges = graph.edges[v] || [];
outEdges.push({v: u, w});
graph.edges[v] = outEdges;
}
function main() {
let buffer = "";
let graph = {
nodes: new Set(), // mapping name to idx
edges: {}
};
let inputPath = process.argv.length > 2 ? process.argv[2] : null;
console.log(`Input path ${inputPath}...`);
let is = inputPath ? fs.createReadStream(inputPath) : process.stdin;
is.on('data', (chunk) => {
// console.log(`Reading chunk ${chunk}`);
buffer += chunk;
});
is.on('end', () => {
// console.log('Got end of data...');
while (buffer.length > 0) {
let idx = buffer.indexOf(EOL);
if (idx < 0) {
idx = buffer.length;
}
let line = buffer.slice(0, idx);
processLine(graph, line);
buffer = buffer.slice(idx + EOL.length);
}
is.close();
findPrimMST(graph);
});
}
main();

11
2022/03/algorithms/prim_01.txt
View File

@ -1,11 +0,0 @@
A - B: 7
A - D: 5
B - C: 8
B - E: 7
B - D: 9
C - E: 5
D - E: 15
D - F: 6
E - F: 8
E - G: 9
F - G: 11

74
2022/03/algorithms/repeated_string.js
View File

@ -1,74 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
console.log(`Data: ${inputStdin}`);
inputString += inputStdin;
});
process.stdin.on('end', function() {
console.log(`End`);
inputString = inputString.split('\r\n');
main();
});
process.on('SIGINT', function() {
console.log('SIGINT');
inputString = inputString.split('\r\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'repeatedString' function below.
*
* The function is expected to return a LONG_INTEGER.
* The function accepts following parameters:
* 1. STRING s
* 2. LONG_INTEGER n
*/
function repeatedString(s, n) {
let sl = s.length;
console.log(`S: ${sl}, n: ${n}`);
let counts = new Array(sl+1);
counts[0] = 0;
for (let i = 1; i < counts.length; i++) {
counts[i] = s[i-1] === 'a' ? counts[i-1] + 1 : counts[i-1];
}
console.log('Counts', counts);
let c = Math.floor(n / sl);
let r = n % sl;
return counts[sl] * c + counts[r];
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const n = parseInt(readLine().trim(), 10);
const result = repeatedString(s, n);
console.log(`Result ${result}`);
ws.write(result + '\n');
ws.end();
}

65
2022/03/algorithms/time_conversion.js
View File

@ -1,65 +0,0 @@
'use strict';
const fs = require('fs');
process.stdin.resume();
process.stdin.setEncoding('utf-8');
let inputString = '';
let currentLine = 0;
process.stdin.on('data', function(inputStdin) {
inputString += inputStdin;
});
process.stdin.on('end', function() {
inputString = inputString.split('\n');
main();
});
process.on('SIGINT', function() {
inputString = inputString.split('\n');
main();
process.exit(0);
});
function readLine() {
return inputString[currentLine++];
}
/*
* Complete the 'timeConversion' function below.
*
* The function is expected to return a STRING.
* The function accepts STRING s as parameter.
*/
function timeConversion(s) {
s = s.trim();
let shift = 0;
if (s.endsWith('PM')) {
shift += 12;
}
s = s.substring(0, s.length - 2);
let splits = s.split(":");
let hour = Number.parseInt(splits[0]) % 12 + shift;
let minute = Number.parseInt(splits[1]);
let seconds = Number.parseInt(splits[2]);
return ("" + hour).padStart(2, "0")
+ ":" + ("" + minute).padStart(2, "0")
+ ":" + ("" + seconds).padStart(2, "0");
}
function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);
const s = readLine();
const result = timeConversion(s);
ws.write(result + '\n');
ws.end();
ws.close();
}

40
2023/04/ansi-term-logger/.gitignore vendored
View File

@ -1,40 +0,0 @@
.gradle
build/
!gradle/wrapper/gradle-wrapper.jar
!**/src/main/**/build/
!**/src/test/**/build/
### IntelliJ IDEA ###
.idea
*.iws
*.iml
*.ipr
out/
build
!**/src/main/**/out/
!**/src/test/**/out/
### Eclipse ###
.apt_generated
.classpath
.factorypath
.project
.settings
.springBeans
.sts4-cache
bin/
!**/src/main/**/bin/
!**/src/test/**/bin/
### NetBeans ###
/nbproject/private/
/nbbuild/
/dist/
/nbdist/
/.nb-gradle/
### VS Code ###
.vscode/
### Mac OS ###
.DS_Store

5
2023/04/ansi-term-logger/ansitermlogger.properties
View File

@ -1,5 +0,0 @@
logger.ch.polgrabia.utils.Program.level=DEBUG
logger.ch.polgrabia.utils.Program.error.prefix=\u001b[31;1;4m
logger.ch.polgrabia.utils.Program.error.suffix=\u001b[0m
logger.ch.polgrabia.utils.Program.warn.prefix=\u001b[33;1;4m
logger.ch.polgrabia.utils.Program.warn.suffix=\u001b[0m

20
2023/04/ansi-term-logger/build.gradle.kts
View File

@ -1,20 +0,0 @@
plugins {
id("java")
}
group = "ch.polgrabia.utils"
version = "1.0-SNAPSHOT"
repositories {
mavenCentral()
}
dependencies {
implementation("org.slf4j:slf4j-api:2.0.7")
testImplementation("org.junit.jupiter:junit-jupiter-api:5.8.1")
testRuntimeOnly("org.junit.jupiter:junit-jupiter-engine:5.8.1")
}
tasks.getByName<Test>("test") {
useJUnitPlatform()
}

BIN
2023/04/ansi-term-logger/gradle/wrapper/gradle-wrapper.jar vendored
View File

Binary file not shown.

5
2023/04/ansi-term-logger/gradle/wrapper/gradle-wrapper.properties vendored
View File

@ -1,5 +0,0 @@
distributionBase=GRADLE_USER_HOME
distributionPath=wrapper/dists
distributionUrl=https\://services.gradle.org/distributions/gradle-7.4-bin.zip
zipStoreBase=GRADLE_USER_HOME
zipStorePath=wrapper/dists

234
2023/04/ansi-term-logger/gradlew vendored
View File

@ -1,234 +0,0 @@
#!/bin/sh
#
# Copyright © 2015-2021 the original authors.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# https://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#
##############################################################################
#
# Gradle start up script for POSIX generated by Gradle.
#
# Important for running:
#
# (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is
# noncompliant, but you have some other compliant shell such as ksh or
# bash, then to run this script, type that shell name before the whole
# command line, like:
#
# ksh Gradle
#
# Busybox and similar reduced shells will NOT work, because this script
# requires all of these POSIX shell features:
# * functions;
# * expansions «$var», «${var}», «${var:-default}», «${var+SET}»,
# «${var#prefix}», «${var%suffix}», and «$( cmd )»;
# * compound commands having a testable exit status, especially «case»;
# * various built-in commands including «command», «set», and «ulimit».
#
# Important for patching:
#
# (2) This script targets any POSIX shell, so it avoids extensions provided
# by Bash, Ksh, etc; in particular arrays are avoided.
#
# The "traditional" practice of packing multiple parameters into a
# space-separated string is a well documented source of bugs and security
# problems, so this is (mostly) avoided, by progressively accumulating
# options in "$@", and eventually passing that to Java.
#
# Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS,
# and GRADLE_OPTS) rely on word-splitting, this is performed explicitly;
# see the in-line comments for details.
#
# There are tweaks for specific operating systems such as AIX, CygWin,
# Darwin, MinGW, and NonStop.
#
# (3) This script is generated from the Groovy template
# https://github.com/gradle/gradle/blob/master/subprojects/plugins/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt
# within the Gradle project.
#
# You can find Gradle at https://github.com/gradle/gradle/.
#
##############################################################################
# Attempt to set APP_HOME
# Resolve links: $0 may be a link
app_path=$0
# Need this for daisy-chained symlinks.
while
APP_HOME=${app_path%"${app_path##*/}"} # leaves a trailing /; empty if no leading path
[ -h "$app_path" ]
do
ls=$( ls -ld "$app_path" )
link=${ls#*' -> '}
case $link in #(
/*) app_path=$link ;; #(
*) app_path=$APP_HOME$link ;;
esac
done
APP_HOME=$( cd "${APP_HOME:-./}" && pwd -P ) || exit
APP_NAME="Gradle"
APP_BASE_NAME=${0##*/}
# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"'
# Use the maximum available, or set MAX_FD != -1 to use that value.
MAX_FD=maximum
warn () {
echo "$*"
} >&2
die () {
echo
echo "$*"
echo
exit 1
} >&2
# OS specific support (must be 'true' or 'false').
cygwin=false
msys=false
darwin=false
nonstop=false
case "$( uname )" in #(
CYGWIN* ) cygwin=true ;; #(
Darwin* ) darwin=true ;; #(
MSYS* | MINGW* ) msys=true ;; #(
NONSTOP* ) nonstop=true ;;
esac
CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
# Determine the Java command to use to start the JVM.
if [ -n "$JAVA_HOME" ] ; then
if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
# IBM's JDK on AIX uses strange locations for the executables
JAVACMD=$JAVA_HOME/jre/sh/java
else
JAVACMD=$JAVA_HOME/bin/java
fi
if [ ! -x "$JAVACMD" ] ; then
die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi
else
JAVACMD=java
which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi
# Increase the maximum file descriptors if we can.
if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then
case $MAX_FD in #(
max*)
MAX_FD=$( ulimit -H -n ) ||
warn "Could not query maximum file descriptor limit"
esac
case $MAX_FD in #(
'' | soft) :;; #(
*)
ulimit -n "$MAX_FD" ||
warn "Could not set maximum file descriptor limit to $MAX_FD"
esac
fi
# Collect all arguments for the java command, stacking in reverse order:
# * args from the command line
# * the main class name
# * -classpath
# * -D...appname settings
# * --module-path (only if needed)
# * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables.
# For Cygwin or MSYS, switch paths to Windows format before running java
if "$cygwin" || "$msys" ; then
APP_HOME=$( cygpath --path --mixed "$APP_HOME" )
CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" )
JAVACMD=$( cygpath --unix "$JAVACMD" )
# Now convert the arguments - kludge to limit ourselves to /bin/sh
for arg do
if
case $arg in #(
-*) false ;; # don't mess with options #(
/?*) t=${arg#/} t=/${t%%/*} # looks like a POSIX filepath
[ -e "$t" ] ;; #(
*) false ;;
esac
then
arg=$( cygpath --path --ignore --mixed "$arg" )
fi
# Roll the args list around exactly as many times as the number of
# args, so each arg winds up back in the position where it started, but
# possibly modified.
#
# NB: a `for` loop captures its iteration list before it begins, so
# changing the positional parameters here affects neither the number of
# iterations, nor the values presented in `arg`.
shift # remove old arg
set -- "$@" "$arg" # push replacement arg
done
fi
# Collect all arguments for the java command;
# * $DEFAULT_JVM_OPTS, $JAVA_OPTS, and $GRADLE_OPTS can contain fragments of
# shell script including quotes and variable substitutions, so put them in
# double quotes to make sure that they get re-expanded; and
# * put everything else in single quotes, so that it's not re-expanded.
set -- \
"-Dorg.gradle.appname=$APP_BASE_NAME" \
-classpath "$CLASSPATH" \
org.gradle.wrapper.GradleWrapperMain \
"$@"
# Use "xargs" to parse quoted args.
#
# With -n1 it outputs one arg per line, with the quotes and backslashes removed.
#
# In Bash we could simply go:
#
# readarray ARGS < <( xargs -n1 <<<"$var" ) &&
# set -- "${ARGS[@]}" "$@"
#
# but POSIX shell has neither arrays nor command substitution, so instead we
# post-process each arg (as a line of input to sed) to backslash-escape any
# character that might be a shell metacharacter, then use eval to reverse
# that process (while maintaining the separation between arguments), and wrap
# the whole thing up as a single "set" statement.
#
# This will of course break if any of these variables contains a newline or
# an unmatched quote.
#
eval "set -- $(
printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" |
xargs -n1 |
sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' |
tr '\n' ' '
)" '"$@"'
exec "$JAVACMD" "$@"

89
2023/04/ansi-term-logger/gradlew.bat vendored
View File

@ -1,89 +0,0 @@
@rem
@rem Copyright 2015 the original author or authors.
@rem
@rem Licensed under the Apache License, Version 2.0 (the "License");
@rem you may not use this file except in compliance with the License.
@rem You may obtain a copy of the License at
@rem
@rem https://www.apache.org/licenses/LICENSE-2.0
@rem
@rem Unless required by applicable law or agreed to in writing, software
@rem distributed under the License is distributed on an "AS IS" BASIS,
@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
@rem See the License for the specific language governing permissions and
@rem limitations under the License.
@rem
@if "%DEBUG%" == "" @echo off
@rem ##########################################################################
@rem
@rem Gradle startup script for Windows
@rem
@rem ##########################################################################
@rem Set local scope for the variables with windows NT shell
if "%OS%"=="Windows_NT" setlocal
set DIRNAME=%~dp0
if "%DIRNAME%" == "" set DIRNAME=.
set APP_BASE_NAME=%~n0
set APP_HOME=%DIRNAME%
@rem Resolve any "." and ".." in APP_HOME to make it shorter.
for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi
@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m"
@rem Find java.exe
if defined JAVA_HOME goto findJavaFromJavaHome
set JAVA_EXE=java.exe
%JAVA_EXE% -version >NUL 2>&1
if "%ERRORLEVEL%" == "0" goto execute
echo.
echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
echo.
echo Please set the JAVA_HOME variable in your environment to match the
echo location of your Java installation.
goto fail
:findJavaFromJavaHome
set JAVA_HOME=%JAVA_HOME:"=%
set JAVA_EXE=%JAVA_HOME%/bin/java.exe
if exist "%JAVA_EXE%" goto execute
echo.
echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
echo.
echo Please set the JAVA_HOME variable in your environment to match the
echo location of your Java installation.
goto fail
:execute
@rem Setup the command line
set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
@rem Execute Gradle
"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %*
:end
@rem End local scope for the variables with windows NT shell
if "%ERRORLEVEL%"=="0" goto mainEnd
:fail
rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
rem the _cmd.exe /c_ return code!
if not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
exit /b 1
:mainEnd
if "%OS%"=="Windows_NT" endlocal
:omega

2
2023/04/ansi-term-logger/settings.gradle.kts
View File

@ -1,2 +0,0 @@
rootProject.name = "ansi-term-logger"

109
2023/04/ansi-term-logger/src/main/java/ch/polgrabia/utils/AnsiTermLogger.java
View File

@ -1,109 +0,0 @@
package ch.polgrabia.utils;
import org.slf4j.Marker;
import org.slf4j.event.Level;
import org.slf4j.helpers.AbstractLogger;
import java.util.Properties;
public class AnsiTermLogger extends AbstractLogger {
private final Properties properties;
private final String loggerPropertiesPrefix;
private Level level;
public AnsiTermLogger(String name, Properties properties, String loggerPropertiesPrefix) {
this.name = name;
this.properties = properties;
this.loggerPropertiesPrefix = loggerPropertiesPrefix;
}
private Level getLevel() {
return this.level != null ? this.level : getLevelFromProperties();
}
private Level getLevelFromProperties() {
String property = String.format("%s.%s.level", loggerPropertiesPrefix, name);
String levelValue = properties.getProperty(
property
, "INFO");
return Level.valueOf(levelValue);
}
public void setLevel(Level level) {
this.level = level;
}
@Override
protected String getFullyQualifiedCallerName() {
return name;
}
@Override
protected void handleNormalizedLoggingCall(Level level, Marker marker, String messagePattern, Object[] arguments, Throwable throwable) {
if (!isLevelEnabled(level)) {
return;
}
String prefix = properties.getProperty(
String.format("%s.%s.%s.prefix", loggerPropertiesPrefix, name, level.name().toLowerCase()), "");
String suffix = properties.getProperty(
String.format("%s.%s.%s.suffix", loggerPropertiesPrefix, name, level.name().toLowerCase()), "");
// TODO I believe it's not the security-wise safest approach but well...
System.out.printf(prefix + " " + level.name() + (messagePattern) + suffix + "%n", arguments);
}
private boolean isLevelEnabled(Level level) {
return level.toInt() >= getLevel().toInt();
}
@Override
public boolean isTraceEnabled() {
return isLevelEnabled(Level.TRACE);
}
@Override
public boolean isTraceEnabled(Marker marker) {
return isTraceEnabled();
}
@Override
public boolean isDebugEnabled() {
return isLevelEnabled(Level.DEBUG);
}
@Override
public boolean isDebugEnabled(Marker marker) {
return isDebugEnabled();
}
@Override
public boolean isInfoEnabled() {
return isLevelEnabled(Level.INFO);
}
@Override
public boolean isInfoEnabled(Marker marker) {
return isInfoEnabled();
}
@Override
public boolean isWarnEnabled() {
return isLevelEnabled(Level.WARN);
}
@Override
public boolean isWarnEnabled(Marker marker) {
return isWarnEnabled();
}
@Override
public boolean isErrorEnabled() {
return isLevelEnabled(Level.ERROR);
}
@Override
public boolean isErrorEnabled(Marker marker) {
return isErrorEnabled();
}
}

19
2023/04/ansi-term-logger/src/main/java/ch/polgrabia/utils/AnsiTermLoggerFactory.java
View File

@ -1,19 +0,0 @@
package ch.polgrabia.utils;
import org.slf4j.ILoggerFactory;
import org.slf4j.Logger;
import java.util.Properties;
public class AnsiTermLoggerFactory implements ILoggerFactory {
private final Properties properties;
public AnsiTermLoggerFactory(Properties properties) {
this.properties = properties;
}
@Override
public Logger getLogger(String name) {
return new AnsiTermLogger(name, properties, "logger");
}
}

50
2023/04/ansi-term-logger/src/main/java/ch/polgrabia/utils/AnsiTermLoggerServiceProvider.java
View File

@ -1,50 +0,0 @@
package ch.polgrabia.utils;
import org.slf4j.ILoggerFactory;
import org.slf4j.IMarkerFactory;
import org.slf4j.spi.MDCAdapter;
import org.slf4j.spi.SLF4JServiceProvider;
import java.util.Properties;
public class AnsiTermLoggerServiceProvider implements SLF4JServiceProvider {
private static AnsiTermLoggerServiceProvider instance;
private Properties properties = System.getProperties();
public static void setInstance(AnsiTermLoggerServiceProvider instance) {
AnsiTermLoggerServiceProvider.instance = instance;
}
public static AnsiTermLoggerServiceProvider getInstance() {
return instance;
}
public void loadProperties(Properties properties) {
this.properties.putAll(properties);
}
@Override
public ILoggerFactory getLoggerFactory() {
return new AnsiTermLoggerFactory(properties);
}
@Override
public IMarkerFactory getMarkerFactory() {
return null;
}
@Override
public MDCAdapter getMDCAdapter() {
return null;
}
@Override
public String getRequestedApiVersion() {
return "2.0.7";
}
@Override
public void initialize() {
AnsiTermLoggerServiceProvider.setInstance(this);
}
}

41
2023/04/ansi-term-logger/src/main/java/ch/polgrabia/utils/Program.java
View File

@ -1,41 +0,0 @@
package ch.polgrabia.utils;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.io.*;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.Properties;
public class Program {
private static final Logger logger = LoggerFactory.getLogger(Program.class);
public static final String ANSITERMLOGGER_PROPERTIES = "ansitermlogger.properties";
public static void main(String[] args) {
loadPropertiesFromPath(
Paths.get(System.getenv("LOCALAPPDATA"), "ansitermlogger", ANSITERMLOGGER_PROPERTIES));
loadPropertiesFromPath(
Paths.get(".", ANSITERMLOGGER_PROPERTIES).toAbsolutePath());
logger.trace("Hello World");
logger.debug("Hello World");
logger.info("Hello World");
logger.warn("Hello World");
logger.error("Hello World");
}
private static void loadPropertiesFromPath(Path propertiesPath) {
Path absolutePath = propertiesPath.toAbsolutePath();
File appPropertiesFile = new File(absolutePath.toString());
if (appPropertiesFile.exists()) {
try (InputStream is = new FileInputStream(appPropertiesFile)) {
Properties properties = new Properties();
properties.load(is);
AnsiTermLoggerServiceProvider.getInstance().loadProperties(properties);
} catch (IOException e) {
throw new IllegalStateException("I couldn't have read properties from file: " + absolutePath);
}
}
}
}

1
2023/04/ansi-term-logger/src/main/resources/META-INF/services/org.slf4j.spi.SLF4JServiceProvider
View File

@ -1 +0,0 @@
ch.polgrabia.utils.AnsiTermLoggerServiceProvider

674
LICENSE
View File

@ -1,674 +0,0 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 2024 Tomasz Półgrabia
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) 2024 Tomasz Półgrabia
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
<https://www.gnu.org/licenses/why-not-lgpl.html>.