Compare commits
2 Commits
a507315ad2
...
1ee57eeda3
Author | SHA1 | Date |
---|---|---|
osmarks | 1ee57eeda3 | |
osmarks | 943e8e95b1 |
|
@ -271,6 +271,9 @@ local function scan_entities()
|
|||
for _, entity in pairs(entities) do
|
||||
entity.s = vector.new(entity.x, entity.y, entity.z)
|
||||
entity.v = vector.new(entity.motionX, entity.motionY, entity.motionZ)
|
||||
if entity.deltaPosX then
|
||||
entity.v = vector.new(entity.deltaPosX, entity.deltaPosY, entity.deltaPosZ)
|
||||
end
|
||||
if entity.displayName ~= username then
|
||||
hud_entities[entity.displayName] = (hud_entities[entity.displayName] or 0) + 1
|
||||
end
|
||||
|
|
4
ptt.py
4
ptt.py
|
@ -50,7 +50,7 @@ def mute():
|
|||
if not muted:
|
||||
muted = True
|
||||
print("muted")
|
||||
subprocess.run(["pacmd", "set-source-mute", source, "1"])
|
||||
subprocess.run(["pactl", "set-source-mute", source, "1"])
|
||||
# this could call set_icon on the taskbar icon object directly, but that seems to inconsistently cause mysterious crashes in cairo
|
||||
wx.PostEvent(app.taskbar_icon, MuteSetEvent(muted=muted))
|
||||
def unmute():
|
||||
|
@ -58,7 +58,7 @@ def unmute():
|
|||
if muted:
|
||||
muted = False
|
||||
print("unmuted")
|
||||
subprocess.run(["pacmd", "set-source-mute", source, "0"])
|
||||
subprocess.run(["pactl", "set-source-mute", source, "0"])
|
||||
wx.PostEvent(app.taskbar_icon, MuteSetEvent(muted=muted))
|
||||
|
||||
def toggle():
|
||||
|
|
|
@ -0,0 +1,79 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <limits.h>
|
||||
#define let int
|
||||
#define var unsigned let
|
||||
#define Æ nop(0);
|
||||
#define X ar[i1]
|
||||
#define Y ar[i2]
|
||||
|
||||
int comparatorinator(const void*x, const void* y);
|
||||
int comparatorinator(const void *x, const void* y) {
|
||||
return x < y;
|
||||
}
|
||||
|
||||
|
||||
void nop(int _);
|
||||
void nop(volatile int _) { _++; }
|
||||
|
||||
void sort(int* ar, int ææ);
|
||||
void sort(int* ar, int arrayorsomethinglength) {
|
||||
let* _______ = malloc((var)*ar); Æ Æ Æ Æ // allocate temporary buffer
|
||||
nop(*_______); Æ Æ Æ Æ
|
||||
// optimized bubble bogosort
|
||||
for (let i = 0; i < (arrayorsomethinglength * arrayorsomethinglength * arrayorsomethinglength * 3); i += 2) {
|
||||
int i1 = rand() % arrayorsomethinglength; Æ
|
||||
int i2 = rand() % arrayorsomethinglength; Æ
|
||||
if (i2 == i1) continue; Æ Æ
|
||||
// intellectual swap
|
||||
X = X ^ Y;
|
||||
Y = Y ^ X;
|
||||
X = X ^ Y;
|
||||
// check if sorted
|
||||
let last = INT_MIN;
|
||||
for (let j = 0; j < arrayorsomethinglength; j++) {
|
||||
if (ar[j] >= last) {
|
||||
last = ar[j]; Æ
|
||||
} else {
|
||||
goto unsorted; Æ
|
||||
}
|
||||
}
|
||||
return; Æ
|
||||
unsorted: nop(*_______); // make compiler happy with presence of label
|
||||
}
|
||||
|
||||
// in case bubble bogosort failed, initiate protocol delta
|
||||
if (rand() % 222 == 0) nop(*(volatile int*)NULL);
|
||||
if (rand() % 16 == 0) {
|
||||
for (let _ = 0; _ < arrayorsomethinglength; _++) {
|
||||
ar[_] = 0; /* enforce sorting */
|
||||
}
|
||||
qsort(ar, (var)arrayorsomethinglength, sizeof(int), comparatorinator);
|
||||
return; Æ
|
||||
return; Æ
|
||||
} else {
|
||||
for (let malloc = 0; malloc < arrayorsomethinglength * arrayorsomethinglength; malloc++)
|
||||
for (let i = 1; i < arrayorsomethinglength; i++) {
|
||||
if (ar[i-1] > ar[i]) { // out of order - deal with it
|
||||
ar[i-1] = ar[i-1] ^ ar[i];
|
||||
ar[i] = ar[i-1] ^ ar[i];
|
||||
ar[i-1] = ar[i-1] ^ ar[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return;
|
||||
//
|
||||
//printf("%d", *_______); // no unused variable error
|
||||
}
|
||||
|
||||
int main() {
|
||||
char * aname = "gollark;";
|
||||
// segfaults, TODO fix later
|
||||
//sort((int *)aname, 1); // can't be bothered to count, close enough
|
||||
int bees[11] = {6, 7, 8, 1, 0, 3, 5,4, 3, 2,1 };
|
||||
sort(bees, 11);
|
||||
for (unsigned let i = 0; i < (sizeof(bees) / sizeof(int)); i++) {
|
||||
printf("\n%s %d", aname, bees[i]);
|
||||
}
|
||||
}
|
|
@ -0,0 +1,132 @@
|
|||
<!DOCTYPE html>
|
||||
<canvas id="d"></canvas>
|
||||
<script>
|
||||
function fade(t)
|
||||
{
|
||||
return t * t * t * (t * (t * 6 - 15) + 10);
|
||||
}
|
||||
|
||||
function lerp(t, a, b)
|
||||
{
|
||||
return a + t * (b - a);
|
||||
}
|
||||
|
||||
function grad(hash, x, y, z)
|
||||
{
|
||||
// Convert lo 4 bits of hash code into 12 gradient directions.
|
||||
var h = hash & 15,
|
||||
u = h < 8 ? x : y,
|
||||
v = h < 4 ? y : h == 12 || h == 14 ? x : z;
|
||||
return ((h & 1) == 0 ? u : -u) + ((h & 2) == 0 ? v : -v);
|
||||
}
|
||||
|
||||
function scale(n)
|
||||
{
|
||||
return (1 + n) / 2;
|
||||
}
|
||||
|
||||
var p = new Array(512);
|
||||
|
||||
var permutation = [
|
||||
151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36, 103, 30, 69, 142, 8, 99,
|
||||
37, 240, 21, 10, 23, 190, 6, 148, 247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, 32,
|
||||
57, 177, 33, 88, 237, 149, 56, 87, 174, 20, 125, 136, 171, 168, 68, 175, 74, 165, 71, 134, 139, 48, 27, 166,
|
||||
77, 146, 158, 231, 83, 111, 229, 122, 60, 211, 133, 230, 220, 105, 92, 41, 55, 46, 245, 40, 244, 102, 143,
|
||||
54, 65, 25, 63, 161, 1, 216, 80, 73, 209, 76, 132, 187, 208, 89, 18, 169, 200, 196, 135, 130, 116, 188, 159,
|
||||
86, 164, 100, 109, 198, 173, 186, 3, 64, 52, 217, 226, 250, 124, 123, 5, 202, 38, 147, 118, 126, 255, 82,
|
||||
85, 212, 207, 206, 59, 227, 47, 16, 58, 17, 182, 189, 28, 42, 223, 183, 170, 213, 119, 248, 152, 2, 44,
|
||||
154, 163, 70, 221, 153, 101, 155, 167, 43, 172, 9, 129, 22, 39, 253, 19, 98, 108, 110, 79, 113, 224, 232,
|
||||
178, 185, 112, 104, 218, 246, 97, 228, 251, 34, 242, 193, 238, 210, 144, 12, 191, 179, 162, 241, 81, 51,
|
||||
145, 235, 249, 14, 239, 107, 49, 192, 214, 31, 181, 199, 106, 157, 184, 84, 204, 176, 115, 121, 50, 45,
|
||||
127, 4, 150, 254, 138, 236, 205, 93, 222, 114, 67, 29, 24, 72, 243, 141, 128, 195, 78, 66, 215, 61, 156, 180
|
||||
];
|
||||
|
||||
for (var i = 0; i < 256; i++) {
|
||||
p[256 + i] = p[i] = permutation[i];
|
||||
}
|
||||
|
||||
|
||||
/** Returns a number between 0 and 1. */
|
||||
function noise3d(x, y, z)
|
||||
{
|
||||
// Find unit cube that contains point.
|
||||
var X = Math.floor(x) & 255,
|
||||
Y = Math.floor(y) & 255,
|
||||
Z = Math.floor(z) & 255;
|
||||
// Find relative x,y,z of point in cube.
|
||||
x -= Math.floor(x);
|
||||
y -= Math.floor(y);
|
||||
z -= Math.floor(z);
|
||||
// Compute fade curves for each of x,y,z.
|
||||
var u = fade(x),
|
||||
v = fade(y),
|
||||
w = fade(z);
|
||||
// Hash coordinates of the corners.
|
||||
var A = p[X ] + Y, AA = p[A] + Z, AB = p[A + 1] + Z,
|
||||
B = p[X + 1] + Y, BA = p[B] + Z, BB = p[B + 1] + Z;
|
||||
|
||||
// Add blended results from 8 corners of cube.
|
||||
return scale(
|
||||
lerp(
|
||||
w,
|
||||
lerp(
|
||||
v,
|
||||
lerp(
|
||||
u,
|
||||
grad(p[AA], x, y, z),
|
||||
grad(p[BA], x - 1, y, z)
|
||||
),
|
||||
lerp(
|
||||
u,
|
||||
grad(p[AB], x, y - 1, z),
|
||||
grad(p[BB], x - 1, y - 1, z)
|
||||
)
|
||||
),
|
||||
lerp(
|
||||
v,
|
||||
lerp(
|
||||
u,
|
||||
grad(p[AA + 1], x, y, z - 1),
|
||||
grad(p[BA + 1], x - 1, y, z - 1)
|
||||
),
|
||||
lerp(
|
||||
u,
|
||||
grad(p[AB + 1], x, y - 1, z - 1),
|
||||
grad(p[BB + 1], x - 1, y - 1, z - 1)
|
||||
)
|
||||
)
|
||||
)
|
||||
);
|
||||
}
|
||||
|
||||
let hues = ["180", "300", "60", "120"]
|
||||
let size = 1000
|
||||
let sc1 = 16
|
||||
let sc2 = 3
|
||||
let sc3 = 2.2
|
||||
let grid = 8
|
||||
let canvas = document.querySelector("canvas")
|
||||
canvas.width = canvas.height = size
|
||||
canvas.style.width = canvas.style.height = size + "px"
|
||||
let ctx = canvas.getContext("2d")
|
||||
let rec = () => {
|
||||
let dt = Date.now() / 5000
|
||||
ctx.fillRect(0,0,size,size)
|
||||
for (let x = grid; x < size; x += grid) {
|
||||
for (let y = grid; y < size; y += grid) {
|
||||
let xn = noise3d(x/size/sc3,y/size/sc3,dt) * 2 - 1
|
||||
let yn = noise3d(x/size/sc3,y/size/sc3,dt+3882) * 2 - 1
|
||||
let sn = noise3d(x/size/sc3,y/size/sc3,dt+51235)
|
||||
let cn = noise3d(x/size/sc3,y/size/sc3,dt+1114)
|
||||
ctx.strokeStyle = `oklch(${sn * 50 + 50}% 80% ${cn * 360}deg)`
|
||||
ctx.lineWidth = 2
|
||||
ctx.beginPath()
|
||||
ctx.moveTo(x + xn * grid * sc2, y + yn * grid * sc2)
|
||||
ctx.lineTo(x + (xn ** 2) * grid * sc1, y + (yn ** 2) * grid * sc1)
|
||||
ctx.stroke()
|
||||
}
|
||||
}
|
||||
requestAnimationFrame(rec)
|
||||
}
|
||||
rec()
|
||||
</script>
|
Loading…
Reference in New Issue