colindean

#!/bin/bash
# 
# This is free and unencumbered software released into the public domain.
#
# Requires bc, dc, openssl, xxd
#
# by grondilu from https://bitcointalk.org/index.php?topic=10970.msg156708#msg156708

base58=({1..9} {A..H} {J..N} {P..Z} {a..k} {m..z})
bitcoinregex="^[$(printf "%s" "${base58[@]}")]{34}$"

mrtns

# Install
# via http://askubuntu.com/questions/510056/how-to-install-google-chrome

wget -q -O - https://dl-ssl.google.com/linux/linux_signing_key.pub | sudo apt-key add - 
sudo sh -c 'echo "deb http://dl.google.com/linux/chrome/deb/ stable main" >> /etc/apt/sources.list.d/google-chrome.list'
sudo apt-get update 
sudo apt-get install google-chrome-stable


# Update

CMCDragonkai

#!/usr/bin/env bash

typeofvar () {

    local type_signature=$(declare -p "$1" 2>/dev/null)

    if [[ "$type_signature" =~ "declare --" ]]; then
        printf "string"
    elif [[ "$type_signature" =~ "declare -a" ]]; then
        printf "array"

tkuchiki

##### setup start
BATS_TEST_NAME:        test_example_status_and_output-2c_lines
BATS_TEST_FILENAME:    /home/bats/test.bats
BATS_TEST_DIRNAME:     /home/bats
BATS_TEST_NAMES:       test_example_status_and_output-2c_lines
BATS_TEST_DESCRIPTION: example status and output, lines
BATS_TEST_NUMBER:      1
BATS_TMPDIR:           /tmp
##### setup end
    example 1

allenday

SELECT 
  ROUND((input_value - output_value)/ size, 0) AS fees_per_byte,
  COUNT(*) AS txn_cnt
FROM
  `bigquery-public-data.crypto_bitcoin.transactions`
WHERE TRUE
  AND block_timestamp >= '2018-01-01' 
  AND is_coinbase IS FALSE
GROUP BY 1

giner

## bash: keep longer history
sed -i 's/^HISTSIZE=1000$/HISTSIZE=10000/' ~/.bashrc
sed -i 's/^HISTFILESIZE=2000$/HISTFILESIZE=20000/' ~/.bashrc

## Enable search through history with PgUp/PgDn
cat > ~/.inputrc << 'EOF'
$include  /etc/inputrc

# alternate mappings for "page up" and "page down" to search the history
"\e[5~": history-search-backward

hrubantjakub1

// find element without pair in array
def solution(A):
    A.sort()
    for index in range(0,len(A),2):
        if A[index] != A[index+1]:
            return A[index]
B = [5,6,2,9,2,3,6,7,3,1,7,9,1]
print(solution(B))