mattiasgustavsson

// color1 and color2 are R4G4B4 12bit RGB color values, alpha is 0-255
uint16_t blend_12bit( uint16_t color1, uint16_t color2, uint8_t alpha ) {
	uint64_t c1 = (uint64_t) color1;
	uint64_t c2 = (uint64_t) color2;
	uint64_t a = (uint64_t)( alpha >> 4 );
	// bit magic to alpha blend R G B with single mul
	c1 = ( c1 | ( c1 << 12 ) ) & 0x0f0f0f;
	c2 = ( c2 | ( c2 << 12 ) ) & 0x0f0f0f;
	uint32_t o = ( ( ( ( c2 - c1 ) * a ) >> 4 ) + c1 ) & 0x0f0f0f;

aglitchman

-- Based on the device.js module: https://github.com/matthewhudson/current-device
-- MIT License
--
-- Usage:
-- local device = require("device")
-- if device.type == "mobile" then
--     -- do something!
-- end
-- 
-- Or:

lennardv2

Building the MAMP stack (php, apache & mysql) on Apple Silicon ARM (native)

Update! This tutorial is outdated. Nowadays brew installes m1 binaries just fine. Also use valet: https://laravel.com/docs/9.x/valet. It's 10x easier.

In this tutorial, we'll build the the nescessary packages for ARM via homebrew. After that we'll configure apache2 for using virtual hosts. The native php is ofcourse way faster, see the results of this benchmark below.

TEST NAME	SECONDS	OP/SEC

Reedbeta

Interesting libraries I might like to use in a project...

Asset loading:
	assetsys.h - virtual filesystem with ZIP backing, overlaying, etc https://github.com/mattiasgustavsson/libs/blob/master/docs/assetsys.md
	cute_filewatch.h - file modification watching, for runtime reloading etc https://github.com/RandyGaul/cute_headers/blob/master/cute_filewatch.h
	flatbuffers - data serialization, zero-copy deserialization, extensible schemas https://github.com/google/flatbuffers
	stb_image - https://github.com/nothings/stb/blob/master/stb_image.h
	tinyexr - https://github.com/syoyo/tinyexr
	tinygltf - https://github.com/syoyo/tinygltf
	tinyobjloader - https://github.com/syoyo/tinyobjloader

vurtun

Gilbert–Johnson–Keerthi (GJK) 3D distance algorithm

The Gilbert–Johnson–Keerthi (GJK) distance algorithm is a method of determining the minimum distance between two convex sets. The algorithm's stability, speed which operates in near-constant time, and small storage footprint make it popular for realtime collision detection.

Unlike many other distance algorithms, it has no requirments on geometry data to be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes.

mathiaswking

#!/usr/bin/env bash

#set -e

PACKAGE=$1

if [ -z "$PACKAGE" ]; then
    echo "You must pass a .apk as input!"
    exit 1
fi

britzl

#include <dmsdk/sdk.h>
#include "luautils.h"

void luaL_checklistener(lua_State* L, int idx, struct lua_Listener& listener) {
	int top = lua_gettop(L);
	luaL_checktype(L, idx, LUA_TFUNCTION);
	lua_pushvalue(L, idx);
	int cb = dmScript::Ref(L, LUA_REGISTRYINDEX);
	
	if (listener.m_Callback != LUA_NOREF) {

TeoTwawki

function WeightedRandomSelect(tableID)
    local outerTable =
    {
        [1] =
        {
            {weightValue, thingValue},
            {weightValue, thingValue}
        },
        [2] =
        {

AGulev

local beginX
local beginY
local endX
local endY

local startTime

local xDistance
local yDistance

thennequin

Ini::IniConfig& m_oIniConfig;
Ini::CategoryValueMap& mCategories = m_oIniConfig.GetCategories();

if (ImGui::Button("Reload"))
{
	m_oIniConfig.Load("Config.ini", true, false);
}
ImGui::SameLine();
if (ImGui::Button("Save"))