Skip to content

Instantly share code, notes, and snippets.

View gamalielhere's full-sized avatar
👨‍💻
Getting that 🍞

Gamaliel 'Yel' Padillo gamalielhere

👨‍💻
Getting that 🍞
View GitHub Profile
@gamalielhere
gamalielhere / .env
Last active March 18, 2020 20:02
Fetch tokens, filter out existing ones in the contract, create transactions to add missing ones
GET_TOKEN_DEFAULT_PARAM=0x80f4ae5c000000000000000000000000decaf9cd2367cdbb726e904cd6397edfcae6068d0000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000
CONTRACT_ADDRESS=0xBE1ecF8e340F13071761e0EeF054d9A511e1Cb56
TOKEN_LIST_SRC=https://raw.githubusercontent.com/MyEtherWallet/ethereum-lists/master/dist/tokens/eth/tokens-eth.min.json
PRIV=
RPC=https://api.myetherwallet.com/eth
GAS_PRICE = 5000000000
GAS = 300000
ACCOUNT_CONTRACT_ADDR = 0xDECAF9CD2367cdbb726E904cD6397eDFcAe6068D
@gamalielhere
gamalielhere / .env
Last active April 26, 2018 20:46
Figures out what tokens are missing from the MEW token contract
GET_TOKEN_DEFAULT_PARAM='' // Data object for getAllBAlance for the contract
CONTRACT_ADDRESS='' // Contract address
TOKEN_LIST_SRC='' // Token list source
PRIV='' // account private key
RPC='' // Node you're connecting to
GAS_PRICE = 0
GAS = 0
@gamalielhere
gamalielhere / README.md
Last active April 19, 2018 23:13
Token Tester for MEW

To run: npm install && node index.js

Note: You must have Geth running. Geth (hehe) it here. After installing, run geth --rpc

void selectionSort (int array[], int size) {
int startScan, minIndex, minValue;
for(startScan = 0; startScan < (size - 1); startScan++) {
minIndex = startScan;
minValue = array[startScan];
for(int index = startScan + 1; index < size; index++) {
if(array[index] < minValue) {
minValue = array[index];
@gamalielhere
gamalielhere / Bubble sort
Last active June 21, 2018 03:16
Bubble Sort for C++
void bubbleSortArray(int array[], int size) {
bool swap;
int temp;
do {
swap = false;
for (int count = 0; count < (size - 1); count ++) {
if (array[count] > array[count + 1]) {
temp = array[count];
array[count] = array[count + 1];