A non-exhaustive list of WebGL and WebGPU frameworks and libraries. It is mostly for learning purposes as some of the libraries listed are wip/outdated/not maintained anymore.
Name | Stars | Last Commit | Description |
---|---|---|---|
three.js | ![GitHub Rep |
A non-exhaustive list of WebGL and WebGPU frameworks and libraries. It is mostly for learning purposes as some of the libraries listed are wip/outdated/not maintained anymore.
Name | Stars | Last Commit | Description |
---|---|---|---|
three.js | ![GitHub Rep |
EXE = shell | |
SRC = . | |
LDFLAGS = -ldflags="-s -w" | |
windows: | |
GOOS=windows go build -o $(EXE)_win.exe $(LDFLAGS) $(SRC) | |
macos: | |
GOOS=darwin go build -o $(EXE)_macos $(LDFLAGS) $(SRC) |
/* | |
* Compile: | |
* | |
* gcc sctptest.c -o server -lsctp -Wall | |
* ln -s server client | |
* | |
* Invoke: | |
* | |
* ./client | |
* ./server |
#!/usr/bin/env python | |
# -*- coding: utf-8 -*- | |
""" | |
Written on 2013-03-18 by Philipp Klaus <philipp.l.klaus →AT→ web.de>. | |
Check <https://gist.github.com/5188638> for newer versions. | |
An OpenCV script that you can use to transform multiple images into one | |
single image containing the minimum pixel value for each pixel of the | |
input images. The input images have to be of the same dimensions! |
#!/usr/bin/env bash | |
# Wayback machine downloader | |
#TODO: Remove redundancy (download only newest files in given time period - not all of them and then write over them) | |
############################ | |
clear | |
#Enter domain without http:// and www. | |
domain="google.com" | |
#Set matchType to "prefix" if you have multiple subdomains, or "exact" if you want only one page | |
matchType="domain" |
Place phone call. | |
Home? | |
Leave message | |
Wait for callback | |
"Would you like to share a meal" | |
"Would you like to share a meal" | |
What is the response (A) ? | |
"Do you enjoy a hot beverage" | |
What is the response (B) ? | |
n = 0 |
This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.
Prerequisites:
Software components used:
Look at LSB init scripts for more information.
Copy to /etc/init.d
:
# replace "$YOUR_SERVICE_NAME" with your service's name (whenever it's not enough obvious)
If you were learning graph algorithms, which approach would you prefer:
Imagine you have to take public transit from your home to your office. How do you figure out the fastest route? Use graph algorithms! OR
We can choose between two standard ways to represent a graph G = (V, E): as a collection of adjacency lists or as an adjacency matrix. Either way applies to both directed and undirected graphs.
I prefer the first way: lead with lots of examples, and clear writing. The second way is an excerpt from "Introduction to Algorithms"...that's how they start their section on graph algorithms.