milahu

This document contains some ideas for additions to the Nix language.

Motivation

The Nix package manager, Nixpkgs and NixOS currently have several problems:

Poor discoverability of package options. Package functions have function arguments like enableFoo, but there is no way for the Nix UI to discover them, let alone to provide programmatic ways to

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.

Engines and libraries ⚙️

Name	Stars	Last Commit	Description
three.js	![GitHub

WebAssembly kickstart guide

Rolling your own compiler

One of the premises of WebAssembly is to support compiling multiple languages to WebAssembly.

	#!/bin/env python3

	import libtorrent as lt
	with open("/path/to/file.torrent", "rb") as f:
	e = lt.bdecode(f.read())
	info = lt.torrent_info(e)
	print(info.num_pieces(), 'pieces')
	files = info.files()

	def humanize(size_bytes):

	from __future__ import print_function

	import struct
	import gdb


	def log():

	# Get the inferior.
	try:

	# An example to get the remaining rate limit using the Github GraphQL API.

	import requests

	headers = {"Authorization": "Bearer YOUR API KEY"}


	def run_query(query): # A simple function to use requests.post to make the API call. Note the json= section.
	request = requests.post('https://api.github.com/graphql', json={'query': query}, headers=headers)
	if request.status_code == 200:

	const crypto = require('crypto')

	const sha1 = path => new Promise((resolve, reject) => {
	const hash = crypto.createHash('sha1')
	const rs = fs.createReadStream(path)
	rs.on('error', reject)
	rs.on('data', chunk => hash.update(chunk))
	rs.on('end', () => resolve(hash.digest('hex')))
	})

	typedef vector<int> vi;
	typedef vector<vi> vvi;
	#define pb push_back
	#define MAX 100005
	// C++ implementation of tarjan's algorithm for SCC
	// foundat: analogous to time at which the vertex was discovered
	// disc: will contain the foundat value of ith vertex(as in input graph)
	// low: will contain the lowest vertex(foundat value) reachable from ith vertex(as in input graph)
	// onstack: whether the vertex is on the stack st or not
	// scc: will contain vectors of strongly connected vertices

milahu

Motivation

Engines and libraries ⚙️

WebAssembly kickstart guide

Rolling your own compiler

C/C++

Building

	let uneval = (o, noNativeFns = true) => {
	var retVal = '';
	if (typeof o === 'object') {
	if (Array.isArray(o)) {
	retVal = '[' + o.map((el) => uneval(el)).join(',') + ']';
	} else if (o instanceof RegExp) {
	retVal = o.toString();
	} else if (o instanceof Date) {
	retVal = `new Date(${o})`;
	} else if (o === null) {