I hereby claim:
- I am bramp on github.
- I am bramp (https://keybase.io/bramp) on keybase.
- I have a public key whose fingerprint is 77EF 1852 F8E2 E39C 4973 FCDB 67F1 D791 30CA 7809
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
#!/bin/sh | |
# Finds fake files (e.g. those files which are 700mb big, but contain just zeros) | |
# by bramp.net 2015 | |
# | |
if [ -z "$1" ]; then | |
echo "Usage: $0 <directory/files>" | |
echo "List files that are fakes" | |
return | |
fi | |
for path in "$@" |
Benchmark Mode Cnt Score Error Units | |
UnrolledCopierBenchmark.ByteLoopState.test thrpt 25 32035617.621 ± 203057.890 ops/s | |
UnrolledCopierBenchmark.ForLoopState.test thrpt 25 137210309.246 ± 3297133.141 ops/s * For loop | |
UnrolledCopierBenchmark.LoopState.test thrpt 25 148544358.728 ± 10786777.032 ops/s * While loop | |
UnrolledCopierBenchmark.HandUnrolledState.test thrpt 25 447763590.583 ± 7256308.885 ops/s | |
UnrolledCopierBenchmark.UnrolledState.test thrpt 25 455870292.662 ± 4004173.595 ops/s | |
(Larger scores the better) | |
https://github.com/bramp/unsafe/blob/master/unsafe-unroller/src/main/java/net/bramp/unsafe/LoopingForUnsafeCopier.java#L36 | |
https://github.com/bramp/unsafe/blob/master/unsafe-unroller/src/main/java/net/bramp/unsafe/LoopingUnsafeCopier.java#L38 |
#!/usr/bin/env python | |
# Turns a series of numbers into counts per second | |
# by Andrew Brampton 2009 | |
# TODO Make this smarter, so that it can parse numbers in blocks of text, and highlight the numbers it is changing. | |
# TODO Make sure the value is divided by the real interval | |
# TODO If the number printed is smaller than the previous number, then make sure to add extra padding to remove the old number | |
# | |
import subprocess | |
import sys | |
import time |
# Simple script that reads a mongodb datafile | |
# Finds all documents starting with _id | |
# reads the record, and prints out compressed and uncompressed | |
# results. | |
# | |
import mmap | |
import os | |
import struct | |
import zlib |
#!/usr/bin/env python | |
# Prints a list of all owned repositories with pages. | |
# by Andrew Brampton 2016 https://bramp.net | |
# | |
# Copyright 2016 Google Inc. | |
# | |
# Licensed under the Apache License, Version 2.0 (the "License"); | |
# you may not use this file except in compliance with the License. | |
# You may obtain a copy of the License at | |
# |
<?php | |
/** | |
* Polygon Clipping | |
* @author Andrew Brampton me <at> bramp <dot> net | |
* @url http://bramp.net/blog/2011/11/php-polygon-clipper-using-the-sutherland-hodgman-algorithm/ | |
* | |
* Based on the Sutherland-Hodgman algorithm (1974). | |
* http://en.wikipedia.org/wiki/Sutherland%E2%80%93Hodgman_algorithm | |
* | |
* This approache assumes four clip edges (the bounding box). |
/* | |
Copyright 2017 Google Inc. | |
Licensed under the Apache License, Version 2.0 (the "License"); | |
you may not use this file except in compliance with the License. | |
You may obtain a copy of the License at | |
https://www.apache.org/licenses/LICENSE-2.0 | |
Unless required by applicable law or agreed to in writing, software |
/** | |
* Copyright 2017 Google Inc. | |
* | |
* Licensed under the Apache License, Version 2.0 (the "License"); | |
* you may not use this file except in compliance with the License. | |
* You may obtain a copy of the License at | |
* | |
* https://www.apache.org/licenses/LICENSE-2.0 | |
* | |
* Unless required by applicable law or agreed to in writing, software |
digraph "401k" { | |
label = "Assumptions - 2018 - Age < 50 - Single - Income > $135k - 50% company match of 401(k)\n"; | |
"Pay Cheque (Pre-tax)" -> "Pre-tax 401(k)" [ label = "Max $18.5k*" ]; | |
"Pay Cheque (After-tax)" -> "Roth 401(k)" [ label = "Max $18.5k*" ]; | |
"Pay Cheque (After-tax)" -> "After-tax 401(k)" [ label = "Max $27.25k" ]; | |
"Pay Cheque (After-tax)" -> "Bank Account (After-tax)"; |