mirror of
https://github.com/ddidderr/wuffs.git
synced 2026-11-17 16:32:11 +01:00
wuffs_png_decode_19k_8bpp/clang9 95.5MB/s ± 0% 91.8MB/s ± 1% -3.90% (p=0.008 n=5+5) wuffs_png_decode_40k_24bpp/clang9 115MB/s ± 0% 115MB/s ± 1% ~ (p=0.151 n=5+5) wuffs_png_decode_77k_8bpp/clang9 358MB/s ± 0% 345MB/s ± 0% -3.68% (p=0.008 n=5+5) wuffs_png_decode_552k_32bpp/clang9 124MB/s ± 0% 152MB/s ± 1% +22.35% (p=0.008 n=5+5) wuffs_png_decode_4002k_24bpp/clang9 116MB/s ± 0% 116MB/s ± 0% ~ (p=0.151 n=5+5) wuffs_png_decode_filter_1_sub/clang9 924MB/s ± 0% 982MB/s ± 0% +6.28% (p=0.008 n=5+5) wuffs_png_decode_filter_2_up/clang9 13.1GB/s ± 0% 12.7GB/s ± 0% -2.73% (p=0.008 n=5+5) wuffs_png_decode_filter_3_average/clang9 640MB/s ± 0% 757MB/s ± 0% +18.31% (p=0.008 n=5+5) wuffs_png_decode_filter_4_paeth/clang9 64.8MB/s ± 0% 82.1MB/s ± 0% +26.72% (p=0.008 n=5+5) wuffs_png_decode_19k_8bpp/gcc10 99.0MB/s ± 0% 98.9MB/s ± 0% ~ (p=0.222 n=5+5) wuffs_png_decode_40k_24bpp/gcc10 114MB/s ± 1% 118MB/s ± 1% +3.38% (p=0.008 n=5+5) wuffs_png_decode_77k_8bpp/gcc10 320MB/s ± 0% 321MB/s ± 0% +0.38% (p=0.016 n=5+4) wuffs_png_decode_552k_32bpp/gcc10 141MB/s ± 0% 144MB/s ± 0% +1.80% (p=0.008 n=5+5) wuffs_png_decode_4002k_24bpp/gcc10 118MB/s ± 0% 118MB/s ± 1% ~ (p=0.151 n=5+5) wuffs_png_decode_filter_1_sub/gcc10 1.11GB/s ± 0% 0.90GB/s ± 0% -18.57% (p=0.008 n=5+5) wuffs_png_decode_filter_2_up/gcc10 11.1GB/s ± 0% 11.0GB/s ± 0% -0.33% (p=0.008 n=5+5) wuffs_png_decode_filter_3_average/gcc10 751MB/s ± 0% 749MB/s ± 0% -0.29% (p=0.008 n=5+5) wuffs_png_decode_filter_4_paeth/gcc10 76.9MB/s ± 0% 81.8MB/s ± 0% +6.33% (p=0.008 n=5+5)
1.1 KiB
1.1 KiB
Axiom Listing
This file lists Wuffs' axioms: a fixed list
of built-in, self-evident rules to create new facts by combining existing
facts. For example, given numerical-typed expressions a, b and c, the two
facts that a < c and c <= b together imply that a < b: less-than-ness is
transitive. That rule is named by the string "a < b: a < c; c <= b"`.
This file is not just documentation. It is parsed to give
the list of axioms built into the Wuffs compiler. Run go generate after
editing this list.
"a < b: b > a""a < b: a < c; c < b""a < b: a < c; c == b""a < b: a == c; c < b""a < b: a < c; c <= b""a < b: a <= c; c < b"
"a > b: b < a"
"a <= b: a == b""a <= b: b >= a""a <= b: a <= c; c <= b""a <= b: a <= c; c == b""a <= b: a == c; c <= b"
"a >= b: a == b""a >= b: b <= a""a >= b: a >= (b + c); 0 <= c"
"a < (b + c): a < c; 0 <= b""a < (b + c): a < (b0 + c0); b0 <= b; c0 <= c"
"a <= (a + b): 0 <= b"
"(a + b) <= c: a <= (c - b)"
"(a - b) < c: a < c; 0 <= b"