I hereby claim:
- I am zaargh on github.
- I am zaargh (https://keybase.io/zaargh) on keybase.
- I have a public key ASDroU6H91zuuOG4IIsMytDG6jDIcpqGksPTXB8wyvkXLwo
To claim this, I am signing this object:
#!/usr/bin/env bash | |
# | |
# This is sp, the command-line Spotify controller. It talks to a running | |
# instance of the Spotify Linux client over dbus, providing an interface not | |
# unlike mpc. | |
# | |
# Put differently, it allows you to control Spotify without leaving the comfort | |
# of your command line, and without a custom client or Premium subscription. | |
# |
I hereby claim:
To claim this, I am signing this object:
#!/usr/bin/env python3 | |
import unittest | |
from collections import Counter | |
def find_anagrams(list_of_strings, word): | |
return [c for c in list_of_strings | |
if Counter(c.lower()) == Counter(word.lower()) | |
if c.lower() != word.lower()] |
#!/usr/bin/env python3 | |
import unittest | |
from functools import reduce | |
from string import digits | |
def adjacent_digits_product(numb_str, digits_count): | |
numb_str = [i for i in numb_str if i in digits] | |
groups = [numb_str[i:i+digits_count] |
# primes.py | |
from math import sqrt | |
def find_next_prime(n): | |
n = int(n) # Allows for floating point inputs | |
if n < 2: | |
return 2 # Primes are natural numbers, 2 is the smallest possible | |
while True: |
#Line 7: | |
counts = [[str(len(list(iterator))), char] | |
for char, iterator in itertools.groupby(s)] | |
#Line 21: | |
result = ''.join([x[0] if len(x) == 1 | |
else int(number_r.findall(x)[0]) * x[-1] | |
for x in vals] | |
) |