mmozeiko

// compile this to hook.dll
// for example, with MSVC: cl.exe /LD /MT /O2 hook.c /Fehook.dll

#include <windows.h>

// get this from https://github.com/kubo/plthook
#include "plthook_win32.c"

static plthook_t* hook;

jart

# Copyright 2017 The TensorFlow Authors. All Rights Reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,

chinmaygarde

#include <assert.h>
#include <chrono>
#include <embedder.h>
#include <glfw3.h>
#include <iostream>

static_assert(FLUTTER_ENGINE_VERSION == 1, "");

static const size_t kInitialWindowWidth = 800;

martinwicke

reinsteam

Perceptual Image Differencing

• [1983. Peter Burt and Edward Adelson. The Laplacian Pyramid as a Compact Image Code][1]
• [1993. Scott Daly. The visible differences predictor: an algorithm for the assessment of image fidelity][2]
• [1995. Andrew S. Glassner. In Principles of digital image synthesis, pages 59-66][3]
• [1997. Gregory Ward-Larson, Holly Rushmeier, and Christine Piatko. A visibility matching tone reproduction operator for high dynamic range scenes][4]
• [1999. Mahesh Ramasubramanian, Sumant N. Pattnaik, Donald P. Greenberg. A perceptually based physical error metric for realistic image synthesis][5]
• [2004. Yangli Hector Yee, Anna Newman. A perceptual metric for production Testing][6]
• [2004. HECTOR YEE, SUMANTA PATTANAIK and DONALD P. GREENBERG. Spatiotemporal Sensitivity and Visual Attention for Efficient Rendering of Dynamic Environments][7]
• [2004. Hector Yee. *A Perceptual Metric for Production Testing (Submitted and Accepted in Journal of

pervognsen

#include <deque>
#include <Windows.h>

HANDLE scheduler_thread;
PUMS_COMPLETION_LIST scheduler_completion_list;
HANDLE scheduler_completion_event;
HANDLE scheduler_initialized_event;
HANDLE scheduler_shutdown_event;

enum BlockReason {

vasanthk

System Design Cheatsheet

Picking the right architecture = Picking the right battles + Managing trade-offs

Basic Steps

1. Clarify and agree on the scope of the system

• User cases (description of sequences of events that, taken together, lead to a system doing something useful)
  • Who is going to use it?
  • How are they going to use it?

paulirish

/* bling.js */
window.$ = document.querySelector.bind(document);
window.$$ = document.querySelectorAll.bind(document);
Node.prototype.on = window.on = function(name, fn) { this.addEventListener(name, fn); };
NodeList.prototype.__proto__ = Array.prototype;
NodeList.prototype.on = function(name, fn) { this.forEach((elem) => elem.on(name, fn)); };

mattbierner

/**
 * Conway's game of life implemented in C++ templates at compile time using Comonads.
 * 
 * Logic based on: http://blog.emillon.org/posts/2012-10-18-comonadic-life.html
 */
#include <iostream>

/// Identity functor
template <typename X>
struct id {

rygorous

// ---- Straightforward:
__m128i lo_int = _mm_and_si128(_mm_set1_epi32(0xffff), in); // low 16 bits of all vals
__m128i hi_int = _mm_srli_epi32(in, 16);   // high 16 bits of all vals
__m128  lo_flt = _mm_cvtepi32_ps(lo_int);  // exact (all 16 bit ints = machine numbers)
__m128  hi_flt = _mm_cvtepi32_ps(hi_int);  // exact
__m128  hi_scl = _mm_mul_ps(hi_flt, _mm_set1_ps(65536.0f)); // exact (just exponent change)
__m128  result = _mm_add_ps(hi_scl, lo_flt); // this is the only step that rounds.

// same approach also works with FMA where available.