This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python3 | |
# Creates a model of a 3D Hilbert curve, suitable for 3D printing. | |
# by Andrew Brampton (bramp.net) 2023 | |
# See https://www.printables.com/model/518431 | |
# | |
# Usage: | |
# python3 make.py 4 4 4 --voxelizer voxelmap --spacing 3 | |
# python3 make.py 4 4 4 --voxelizer trimesh --spacing 2 | |
# |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/python | |
# Prints some simple information about ucode firmwares | |
# such as those used by Intel Wifi cards | |
# | |
# Version 1.0 Jan 2011 | |
# by Andrew Brampton | |
# | |
# Example | |
# ./ucode.py /lib/firmware/*.ucode | |
# |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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)"; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* 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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<?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). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/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 | |
# |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# 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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/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 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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 |
NewerOlder