Skip to content

Instantly share code, notes, and snippets.

View Timer's full-sized avatar
🎢
Building world-class infrastructure at Vercel

Joe Haddad Timer

🎢
Building world-class infrastructure at Vercel
View GitHub Profile
#include <stdio.h>
int main() {
int devices;
cudaGetDeviceCount(&devices);
for (int d = 0; d < devices; ++d) {
cudaDeviceProp p;
cudaGetDeviceProperties(&p, d);
int mp = p.multiProcessorCount, sp = 0;
#include <stdint.h>
template<typename T>
inline uint32_t pack_big_uint32(T a, T b, T c, T d) {
return static_cast<uint32_t>(
static_cast<uint8_t>(d) | static_cast<uint8_t>(c) << 8 |
static_cast<uint8_t>(b) << 16 | static_cast<uint8_t>(a) << 24
);
}

Keybase proof

I hereby claim:

  • I am timer on github.
  • I am timer (https://keybase.io/timer) on keybase.
  • I have a public key whose fingerprint is F64F 4F48 16E1 1892 071A 56A1 A5B2 D668 7E76 0793

To claim this, I am signing this object:

@Timer
Timer / gist:dc3c5111ece6ac9b079b
Created December 20, 2013 08:57
Advanced Gaussian next-point implementation.
/**
* Generates a normative point based on bounded data and juxtaposition.
* Maintains bias on object and ensures uniform distribution; leaves
* normality to boundaries.
*/
public Point normative(final Rectangle b, final Rectangle o) {
//boundary data
final double[] d = {b.x, b.y, b.width, b.height, o.width, o.height};
//uniform ellipse distribution