I hereby claim:
- I am ryanmarcus on github.
- I am rmarcus (https://keybase.io/rmarcus) on keybase.
- I have a public key whose fingerprint is 0E49 94F4 4CCB BCF7 5F00 6C81 56E4 21C4 B2CF 69B1
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
Monitor http://www.newegg.com/Product/Product.aspx?Item=N82E16824009422 150.00
CPU http://www.newegg.com/Product/Product.aspx?Item=N82E16819113284 180.00
Motherboard http://www.newegg.com/Product/Product.aspx?Item=N82E16813128514 124.00
RAM http://www.newegg.com/Product/Product.aspx?Item=N82E16820148720 85.00
PSU http://www.newegg.com/Product/Product.aspx?Item=N82E16817139010 130.00
# Maintainer: Amr Hassan <[email protected]> | |
# Small change by Ryan Marcus <[email protected]> | |
pkgname=cargo-bin | |
pkgrel=1 | |
pkgver=20150220 | |
pkgdesc="The Rust package manager" | |
url="http://crates.io/" | |
arch=('x86_64' 'i686') | |
license=('MIT') | |
depends=('rust') |
Cookbook formulae for audio EQ biquad filter coefficients | |
---------------------------------------------------------------------------- | |
by Robert Bristow-Johnson <[email protected]> | |
All filter transfer functions were derived from analog prototypes (that | |
are shown below for each EQ filter type) and had been digitized using the | |
Bilinear Transform. BLT frequency warping has been taken into account for | |
both significant frequency relocation (this is the normal "prewarping" that |
%define loopcount 800000 | |
global main | |
extern printf | |
extern srand | |
extern rand | |
segment .data |
%define loopcount 800000 | |
global main | |
extern printf | |
extern srand | |
extern rand | |
segment .data |
import java.lang.annotation.Retention; | |
import java.lang.annotation.RetentionPolicy; | |
import java.lang.ref.WeakReference; | |
import java.lang.reflect.InvocationTargetException; | |
import java.lang.reflect.Method; | |
import java.util.Random; | |
import java.util.function.IntFunction; | |
import java.util.function.Supplier; | |
import java.util.stream.IntStream; |
# find a palindrome in just two (reasonable) or one unreasonable line of Python code | |
# Copyright Ryan Marcus and Can Nahum 2016 | |
import collections | |
import functools | |
def getPalin(x): |
# Ryan Marcus 2016 | |
# Think about what you would expect this code to print | |
# And then run it using Python 2.7.11 (or newer) and with Python 3 | |
for i in range(20): | |
x = [i for i in range(2000, 4000)] | |
print(i) | |