uahim

// ==UserScript==
// @name         arte stream url
// @namespace    http://tampermonkey.net/
// @version      0.1.8.2
// @description  get arte m3u8 stream url
// @author       You
// @match        https://www.arte.tv/de/videos/*
// @match        https://www.arte.tv/fr/videos/*
// ==/UserScript==

mikhailov-work

// Copyright 2019 Google LLC.
// SPDX-License-Identifier: Apache-2.0

// Author: Anton Mikhailov

// The look-up tables contains 256 entries. Each entry is a an sRGB triplet.

float turbo_srgb_floats[256][3] = {{0.18995,0.07176,0.23217},{0.19483,0.08339,0.26149},{0.19956,0.09498,0.29024},{0.20415,0.10652,0.31844},{0.20860,0.11802,0.34607},{0.21291,0.12947,0.37314},{0.21708,0.14087,0.39964},{0.22111,0.15223,0.42558},{0.22500,0.16354,0.45096},{0.22875,0.17481,0.47578},{0.23236,0.18603,0.50004},{0.23582,0.19720,0.52373},{0.23915,0.20833,0.54686},{0.24234,0.21941,0.56942},{0.24539,0.23044,0.59142},{0.24830,0.24143,0.61286},{0.25107,0.25237,0.63374},{0.25369,0.26327,0.65406},{0.25618,0.27412,0.67381},{0.25853,0.28492,0.69300},{0.26074,0.29568,0.71162},{0.26280,0.30639,0.72968},{0.26473,0.31706,0.74718},{0.26652,0.32768,0.76412},{0.26816,0.33825,0.78050},{0.26967,0.34878,0.79631},{0.27103,0.35926,0.81156},{0.27226,0.36970,0.82624},{0.27334,0.38008,0.84037},{0.27429,0.39043,0.85393},{0.27509,0.40072,0.86692},{0.2757

franky47

Interesting web services

A semi-curated list of SaaS, platforms and web-based tools for software development.

Analytics

• Chiffre - End-to-end encrypted analytics (shameless plug)
• Matomo - Self-hostable alternative to Google Analytics

Cartography

nothings

Are there other single-file public-domain libraries out there?

Yes. Here are some:

• jo_gif.cpp: tiny GIF writer (public domain)
• gif.h: animated GIF writer (public domain)
• tiny_jpeg.h: JPEG encoder (public domain)
• lodepng: PNG encoder/decoder (zlib license)
• nanoSVG: 1-file SVG parser; 1-file SVG rasterizer (zlib license)
• tinyobjloader: wavefront OBJ file loader (BSD license)

ocornut

Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt

Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/

Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to

Rod-Persky

# _______  __   __  _______  ______   _______  _______  _______  ______  #
#|       ||  | |  ||       ||      | |   _   ||       ||       ||      | #
#|   _   ||  | |  ||_     _||  _    ||  |_|  ||_     _||    ___||  _    |#
#|  | |  ||  |_|  |  |   |  | | |   ||       |  |   |  |   |___ | | |   |#
#|  |_|  ||       |  |   |  | |_|   ||       |  |   |  |    ___|| |_|   |#
#|       ||       |  |   |  |       ||   _   |  |   |  |   |___ |       |#
#|_______||_______|  |___|  |______| |__| |__|  |___|  |_______||______| #
#                                                                        #
#  Modern CMake practices and importing the QT scripts by adding it to   #
#    your module path makes things a lot better than it used to be       #

nickloewen

This is a plain-text version of Bret Victor’s reading list. It was requested by hf on Hacker News.

---

Highly recommended things!

This is my five-star list. These are my favorite things in all the world.

A few of these works have had an extraordinary effect on my life or way of thinking. They get a sixth star. ★

dinob0t

"""
To generate 'num' points on a sphere of radius 'r' centred on the origin
- Random placement involves randomly chosen points for 'z' and 'phi'
- Regular placement involves chosing points such that there one point per d_area

References:
Deserno, 2004, How to generate equidistributed points on the surface of a sphere
http://www.cmu.edu/biolphys/deserno/pdf/sphere_equi.pdf
"""

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD