Integer division and remainder are among the slowest fundamental arithmetic operations CPUs support, so compilers have a lot of incentive to turn them into cheaper operations.
In games we often want to find shortest paths from one location to another. Breadth First Search is the simplest of the graph search algorithms, so let’s start there, and we’ll work our way up to A*.
Multiple computers around the world are configured with the same IP address. I send a packet to that IP address. The closest of the configured computers in the network (and only that one computer) receives my packet.
Some other interesting links in crypto space. mangacrypto and coursera one
It can be difficult to disassociate the idea that dynamically typed programming languages are tied to byte-code interpreters. In this post I will briefly describe how I built a compiler for my Scheme implementation using artifacts from the interpreter
React to any event with serverless functions across clouds
Build packet capture syntax online
run and operate functions as a service projects using event sourcing and webassembly under the hood
network and system reconnaissance using the massive Nmap engine
versatile HTTP load testing tool
quickly identify suspicious hosts
Go module datastore and proxy
Compiles Go to WASM and deploys to the jsgo.io CDN
Smart code search for Ruby, Go, and JavaScript
a scalable no-SPOF IMAP/POP3 mail server
Compose shell commands to build interactive terminal applications
The Interactive UI Development Environment
BetterDev Link
Every Monday