I hereby claim:
- I am hexafraction on github.
- I am hexafraction (https://keybase.io/hexafraction) on keybase.
- I have a public key whose fingerprint is 0155 DE82 CBE9 4CAD E1DA B517 280C 8692 2441 321B
To claim this, I am signing this object:
| data { | |
| int<lower=0> numLscores; // Number of boulder results | |
| int<lower=0> maxN; // Max climber number observed | |
| int<lower=0> maxML; // Max lead comp number observed | |
| vector[numLscores] lscore; | |
| int<lower=1,upper=maxN> lClimber[numLscores]; | |
| int<lower=1,upper=maxML> lComp[numLscores]; | |
| real hypersigma_LScore; | 
| | Welcome to JShell -- Version 11.0.3 | |
| | For an introduction type: /help intro | |
| jshell> class Hack implements Comparator<int[]> { | |
| ...> | |
| ...> @Override | |
| ...> public int compare(int[] e1, int[] e2) { | |
| ...> int[] copy1 = Arrays.copyOf(e1, e1.length); | |
| ...> int[] copy2 = Arrays.copyOf(e2, e2.length); | |
| ...> Arrays.sort(copy1); | 
| ## FPGA pin constraints | |
| Net "SW0" LOC="J11" | IOSTANDARD = LVCMOS33; | |
| Net "SW1" LOC="J12" | IOSTANDARD = LVCMOS33; | |
| Net "SW2" LOC="H16" | IOSTANDARD = LVCMOS33; | |
| Net "SW3" LOC="H13" | IOSTANDARD = LVCMOS33; | |
| Net "SW4" LOC="G12" | IOSTANDARD = LVCMOS33; | |
| Net "SW5" LOC="E14" | IOSTANDARD = LVCMOS33; | |
| Net "SW6" LOC="D16" | IOSTANDARD = LVCMOS33; | |
| Net "SW7" LOC="B16" | IOSTANDARD = LVCMOS33; | 
| QUOTIENT | |
| |============ | |
| DIVISOR|0000DIVIDEND | |
| SUBTRAHEND00 | |
| In this example the divident is 8 bits and the divisor is 4 bits. X's are placeholder zeros. | |
| xxxxxxxx | |
| |=========== | 
I hereby claim:
To claim this, I am signing this object:
| Verifying that +hexafraction is my openname (Bitcoin username). https://onename.io/hexafraction | 
I hereby claim:
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
| #include "JoystickDriver.c" | |
| #pragma systemFile | |
| #ifndef JOYSTICK_DRIVER_LOADED | |
| #define JOYSTICK_DRIVER_LOADED | |
| #define SET_BIT(NUM, BIT) NUM |= 1 << BIT | |
| #define CLR_BIT(NUM, BIT) NUM &= ~(1 << BIT) | |
| #define TOGGLE_BIT(NUM, BIT) NUM ^= 1 << BIT | |
| #define ISSET_BIT(NUM, BIT) ((NUM & (1 << BIT))!=0) | |
| #define LONGPRESS_TIME 1000 | 
| /* | |
| Minetest | |
| Copyright (C) 2013 celeron55, Perttu Ahola <[email protected]> | |
| This program is free software; you can redistribute it and/or modify | |
| it under the terms of the GNU Lesser General Public License as published by | |
| the Free Software Foundation; either version 2.1 of the License, or | |
| (at your option) any later version. | |
| This program is distributed in the hope that it will be useful, |