A Pen by Sikriti Dakua on CodePen.
dEMO https://codemyui.com/pixelated-movement-effect-for-images-with-hover-dissolve-animation-using-gsap/
| Compiler design | |
| Compilers | |
| https://github.com/snazzy-d/SDC | |
| https://github.com/dbohdan/embedded-scripting-languages | |
| https://github.com/ishiura-compiler/CF3 | |
| https://gitlab.com/styx-lang/styx | |
| http://mlton.org/CompilerOverview | |
| https://github.com/TurkeyMan/mlang | |
| https://github.com/FeepingCreature/fcc | |
| https://github.com/jondgoodwin/cone |
| from dataclasses import dataclass | |
| from field import FieldElement, PrimeGaloisField | |
| @dataclass | |
| class EllipticCurve: | |
| a: int | |
| b: int |
| #!/usr/bin/env python3 | |
| import math | |
| # >> Discrete Fourier transform for sampled signals | |
| # x [in]: sampled signals, a list of magnitudes (real numbers) | |
| # yr [out]: real parts of the sinusoids | |
| # yi [out]: imaginary parts of the sinusoids | |
| def dft(x): | |
| N, yr, yi = len(x), [], [] |
| class dominatorTree{ | |
| int n, dfnCnt; | |
| vector<vector<int>> G, rG, semiTree; | |
| vector<int> dfn, id, pa, semi, idom; | |
| vector<int> unionFind, best; | |
| int find(int x){ | |
| if( x==unionFind[x] ) return x; | |
| int tmp = find(unionFind[x]); | |
| if( dfn[semi[best[x]]] > dfn[semi[best[unionFind[x]]]] ) | |
| best[x] = best[unionFind[x]]; |
| """Perlin noise implementation.""" | |
| # Licensed under ISC | |
| from itertools import product | |
| import math | |
| import random | |
| def smoothstep(t): | |
| """Smooth curve with a zero derivative at 0 and 1, making it useful for | |
| interpolating. |
By: @BTroncone
Also check out my lesson @ngrx/store in 10 minutes on egghead.io!
Update: Non-middleware examples have been updated to ngrx/store v2. More coming soon!
Table of Contents
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <pthread.h> | |
| #include <unistd.h> | |
| #include <stdbool.h> | |
| #include <time.h> | |
| #include <stdarg.h> | |
| #include <string.h> | |
| #include "future.h" |
| //pairing heap | |
| //{elem:object, subheaps:[array of heaps]} | |
| //subheaps might should be a linked list | |
| function PairingHeap(obj) { | |
| this.elem = obj; | |
| this.subheaps = []; | |
| } | |
| function min(heap) { | |
| return heap.elem; |
| #include <stdio.h> | |
| #include <stdint.h> | |
| #include <stdlib.h> | |
| #include <ucontext.h> | |
| typedef struct coro_t_ coro_t; | |
| typedef struct thread_t_ thread_t; | |
| typedef int (*coro_function_t)(coro_t *coro); | |
| typedef enum { | |
| CORO_NEW, |