| #pragma once | |
| // | |
| // Magic Ring Buffer | |
| // https://gist.github.com/mmozeiko/3b09a340f3c53e5eaed699a1aea95250 | |
| // | |
| // Sets up memory mapping so the same memory block follows itself in virtual address space: | |
| // | |
| // [abcd...xyz][abc...xyz] | |
| // |
| #include <assert.h> | |
| #include <math.h> | |
| #include <stdio.h> | |
| /* Alternative design: Iterate over path and at each point i check distance to line with points | |
| i + 1 and i + 2 and skip i + 1 when distance is small than epsilon. */ | |
| static float | |
| line_dist(const float *p, const float *p1, const float *p2) { | |
| float dx = p2[0] - p1[0]; | |
| float dy = p2[1] - p1[1]; |
Example of how to capture CPU counters with ETW on Windows, perf on Linux or kperf on Apple.
Using ETW needs somewhat recently updated Windows 10 or 11. Not sure about exact version.
Currently tested on:
| #ifndef SSE2NEON_H | |
| #define SSE2NEON_H | |
| // This header file provides a simple API translation layer | |
| // between SSE intrinsics to their corresponding Arm/Aarch64 NEON versions | |
| // | |
| // This header file does not yet translate all of the SSE intrinsics. | |
| // | |
| // Contributors to this work are: | |
| // John W. Ratcliff <jratcliffscarab@gmail.com> |
| static void | |
| qdiag(float *restrict qres, const float *restrict A) { | |
| /* Diagonalizer: http://melax.github.io/diag.html | |
| 'A' must be a symmetric matrix. | |
| Returns quaternion q such that corresponding matrix Q | |
| can be used to Diagonalize 'A' | |
| Diagonal matrix D = Q * A * Transpose(Q); and A = QT*D*Q | |
| The rows of q are the eigenvectors D's diagonal is the eigenvalues | |
| As per 'row' convention if float3x3 Q = q.getmatrix(); then v*Q = q*v*conj(q) | |
| */ |
| // from https://www.klittlepage.com/2013/12/21/twelve-days-2013-de-bruijn-sequences/ | |
| import java.util.Random; | |
| /** | |
| * @author Kelly Littlepage | |
| */ | |
| public class DeBruijn { | |
| /*** | |
| * Generate a De Bruijn Sequence using the recursive FKM algorithm as given |
The core of most real-time fluid simulators, like the one in EmberGen, are based on the "Stable Fluids" algorithm by Jos Stam, which to my knowledge was first presented at SIGGRAPH '99. This is a post about one part of this algorithm that's often underestimated: Projection
The Stable Fluids algorithm solves a subset of the famous "Navier Stokes equations", which describe how fluids interact and move. In particular, it typically solves what's called the "incompressible Euler equations", where viscous forces are often ignored.
| Prefix | Description | Notes | |
|---|---|---|---|
| ac_ | Platform Client ID | Identifier for an auth code/client id. | |
| acct_ | Account ID | Identifier for an Account object. | |
| aliacc_ | Alipay Account ID | Identifier for an Alipay account. | |
| ba_ | Bank Account ID | Identifier for a Bank Account object. | |
| btok_ | Bank Token ID | Identifier for a Bank Token object. | |
| card_ | Card ID | Identifier for a Card object. | |
| cbtxn_ | Customer Balance Transaction ID | Identifier for a Customer Balance Transaction object. | |
| ch_ | Charge ID | Identifier for a Charge object. | |
| cn_ | Credit Note ID | Identifier for a Credit Note object. |
| #!python2 | |
| # -*- coding: utf-8 -*- | |
| # 一个简单的 Socks5 代理服务器 , 只有 server 端 , 而且代码比较乱 | |
| # 不是很稳定 , 而且使用多线程并不是 select 模型 | |
| # Author : WangYihang <wangyihanger@gmail.com> | |
| import socket | |
| import threading | |
| import sys |
