-
Perfect C compatibility
- Every C type is a Chara type and vice versa
- Use a similar compilation model
-
Stay simple: don't add super advanced features like C++ or Rust
-
Clean up C cruft
- Undefined integer overflow
var observer = new MutationObserver(records => { | |
for (var record of records) { | |
for (var node of record.addedNodes) { | |
// TODO: do something with the node | |
} | |
} | |
}) | |
// TODO: is there a cleaner way to do this? | |
var hookMeUp = () => { | |
var feed = document.querySelector('#stream_pagelet > :last-child > div') |
Expected to timeout, but passed: (15) | |
fast/dom/StyleSheet/stylesheet-move-between-documents-crash.html | |
fast/dom/htmlcollection-reachable.html | |
fast/dom/minor-dom-gc.html | |
fast/frames/cached-frame-counter.html | |
http/tests/security/w3c/cross-origin-objects.html | |
imported/web-platform-tests/html/rendering/replaced-elements/svg-embedded-sizing/svg-in-iframe-auto.html | |
imported/web-platform-tests/html/rendering/replaced-elements/svg-embedded-sizing/svg-in-iframe-fixed.html | |
imported/web-platform-tests/html/rendering/replaced-elements/svg-embedded-sizing/svg-in-iframe-percentage.html | |
imported/web-platform-tests/html/rendering/replaced-elements/svg-embedded-sizing/svg-in-object-auto.html |
module Elo where | |
updateRating :: Double -> Double -> Double -> Double -> Double | |
updateRating volatility me you result = me + change | |
where | |
change = volatility * (result - expected) | |
expected = 1 / (1 + (10 ** ((you - me) / 400))) |
f x y z => f[x, y, z] | |
f : g : x => f[g[x]] | |
{x, y, z} => Do[x, y, z] | |
---------------- | |
If (x == 0) { | |
Say['Hello!'] |
HTTP/1.1 429 Too Many Requests | |
Date: Fri, 19 Jun 2015 05:23:47 GMT | |
Server: Apache | |
Retry-After: 900 | |
Vary: Accept-Encoding | |
Transfer-Encoding: chunked | |
Content-Type: text/html; charset=utf-8 | |
<!DOCTYPE html> | |
<h1 style="color:red">Too Many Requests From Your IP Address</h1> |
#!/usr/bin/env python3 | |
from collections import defaultdict | |
from functools import lru_cache | |
import string | |
cipher = ["BUGVIOVBGB", "QVAZHBGOLO", "UMCKVQHLBQ", "XBQMVGDXGU", "TDDDOUJWCZ", | |
"TIWQKKGXTX", "QQCCQKULXU", "CVVOQQZGZD", "UVGCGITVTQ", "VRHGOBBVKK"] |
#!/usr/bin/env python3 | |
names = set(map(str.strip, open('names.txt'))) | |
affixes = ['rust', 'rs'] | |
separators = ['_', '-'] | |
n_affixed = 0 | |
n_strippable = 0 | |
for name in names: |