| import re | |
| import sys | |
| def minify_cpp_code(code): | |
| # Remove comments: | |
| # Turn single-line comments into multi-line comments | |
| code = re.sub(re.compile(r'//(.*?)\n'), '/*\\1*/', code) | |
| # Remove multi-line comments | |
| code = re.sub(re.compile(r'/\*.*?\*/', re.DOTALL), '', code) | |
| # Preprocessing directives must remain on separate lines. |
This code snippet demonstrates how to jump to a label by its index with brx.idx instruction.
Unlike the regular if (a == 2) { ... } else { ... } code (as well as switch (...) { ... }), the brx.idx solution avoids multiple setp.ne.s32 comparisons.
> make
| """ | |
| A simple python program showing how to use regular | |
| expressions to write a paren-matching recursive parser. | |
| This parser recognises items enclosed by parens, brackets, | |
| braces and <> symbols, but is adaptable to any set of | |
| open/close patterns. This is where the re package greatly | |
| assists in parsing. | |
| Published by Gene Olson at |
| #!/bin/bash | |
| # | |
| # Make a FreeBSD bootable sdcard for NanoPi Neo3. | |
| # The idea is to mix an official ROCK64 snapshot with U-Boot for Neo3 board from Armbian project. | |
| # This script is based on the original forum post at | |
| # https://forums.FreeBSD.org/threads/nanopi-neo-3-rockchip-rk3328.76449/post-493043 | |
| # | |
| set -e | |
| if [[ $UID != 0 ]]; then |
| # Clone all branches individually | |
| my(@branches) = ( | |
| "eskew", | |
| "combinations", | |
| "distributed", | |
| "earnest", | |
| "emax", | |
| "engine-hpc", | |
| "engine-trivial", |
| #!/bin/bash | |
| # Automatic Image file resizer | |
| # Written by SirLagz | |
| # Fixed 2016.04.17 by @ChrisPrimeish | |
| strImgFile=$1 | |
| if [[ ! $(whoami) =~ "root" ]]; then | |
| echo "" | |
| echo "**********************************" | |
| echo "*** This should be run as root ***" |
| #!/bin/bash | |
| # Automatic Image file resizer | |
| # Written by SirLagz | |
| # Fixed 2016.04.17 by @ChrisPrimeish | |
| strImgFile=$1 | |
| if [[ ! $(whoami) =~ "root" ]]; then | |
| echo "" | |
| echo "**********************************" | |
| echo "*** This should be run as root ***" |
| #!/bin/bash | |
| #===================================================================== | |
| # Selects an android device | |
| # Copyright (C) 2012-2020 Diego Torres Milano. All rights reserved. | |
| # | |
| # See: | |
| # - http://dtmilano.blogspot.ca/2013/01/android-select-device.html | |
| # - http://dtmilano.blogspot.ca/2012/03/selecting-adb-device.html | |
| # for details on usage. | |
| #===================================================================== |
| // Given all possible combinations of K values, each no greater than M, and whose sum is exactly N | |
| // (zeros and different orderings are accounted, that is 1 + 4 and 4 + 1 are different combinations), | |
| // for the known combination, reconstruct back its index (the order of enumeration does not matter). | |
| // | |
| // C++ implementation of an algorithm proposed by Mike Earnest. | |
| // | |
| // Compile: g++-11 earnestrank.cpp -o earnestrank | |
| // Run: ./earnestrank | |
| // | |
| // |