Heil PR40 Package - http://www.bswusa.com/Dynamic-Microphones-Heil-Sound-PR40-Package-P7628.aspx
This is a great deal, and is a perfect mic for this stuff.
OC White Boom - http://www.ocwhite.com/broadcast-arms/proboomtm-elite-extended-reach-mic-arm-with-riser-45-reach-12-vertical-riser.html
The kit comes with a boom. It is decent, I guess, but this OC White boom is badass prostyle with a 4' reach and a 15" riser that lets it live behind my monitor.
| <script src="http://cdnjs.cloudflare.com/ajax/libs/processing.js/1.4.1/processing-api.min.js"></script><html> | |
| <!-- | |
| Created using jsbin.com | |
| Source can be edited via http://jsbin.com/pdfjs-helloworld-v2/8598/edit | |
| --> | |
| <body> | |
| <canvas id="the-canvas" style="border:1px solid black"></canvas> | |
| <input id='pdf' type='file'/> | |
| <!-- Use latest PDF.js build from Github --> |
| Gandi.net ssl certificate working with haproxy | |
| In one file concatenate the certifcate with the private key (domain.pem in the example) | |
| In other file just the intermediate ceritificate (gandi.ca.pem in the example) then in your haproxy.cfg | |
| bind *:443 ssl crt /home/.ssh/domain.pem ca-file /home/.ssh/gandi.ca.pem | |
| frontend https-in | |
| bind *:443 ssl crt /home/.ssh/domain.pem ca-file /home/.ssh/gandi.ca.pem | |
| timeout client 1h |
| var request = require('request'); | |
| function setDownloadName(req, res, fileName) { | |
| var userAgent = (req.headers['user-agent'] || '').toLowerCase(); | |
| if (userAgent.indexOf('chrome') > -1) { | |
| res.setHeader('Content-Disposition', 'attachment; filename=' + encodeURIComponent(fileName)); | |
| } else if (userAgent.indexOf('firefox') >-1) { | |
| res.setHeader('Content-Disposition', 'attachment; filename*="utf8\'\'' + encodeURIComponent(fileName) + '"'); | |
| } else { | |
| res.setHeader('Content-Disposition', 'attachment; filename=' + new Buffer(fileName).toString('binary')); |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
| #!/bin/sh | |
| # Based on instructions found here: http://wiki.razuna.com/display/ecp/FFMpeg+Installation+on+CentOS+and+RedHat#FFMpegInstallationonCentOSandRedHat-InstallX264 | |
| if [ "`/usr/bin/whoami`" != "root" ]; then | |
| echo "You need to execute this script as root." | |
| exit 1 | |
| fi | |
| cat > /etc/yum.repos.d/centos.repo<<EOF |
This is my response to an email asking about Domain-Driven Design in golang project.
Thank you for getting in touch. Below you will find my thoughts on how golang works with DDD, changing it. This is merely a perception of how things worked out for us in a single project.
That project has a relatively well-known domain. My colleagues on this project are very knowledgeable, thoughtful and invested in quality design. The story spelled out below is a result of countless hours spent discussing and refining the approach.
Conclusions could be very different, if there was a different project, team or a story-teller.
| # more detailed instructions are at http://dev.iron.io/mq-onpremise/getting_started | |
| # Get a coreos VM up | |
| git clone https://github.com/coreos/coreos-vagrant.git | |
| cd coreos-vagrant/ | |
| vagrant up | |
| # get into the coreos box | |
| vagrant ssh |
While this gist has been shared and followed for years, I regret not giving more background. It was originally a gist for the engineering org I was in, not a "general suggestion" for any React app.
Typically I avoid folders altogether. Heck, I even avoid new files. If I can build an app with one 2000 line file I will. New files and folders are a pain.
| /** | |
| * Fancy ID generator that creates 20-character string identifiers with the following properties: | |
| * | |
| * 1. They're based on timestamp so that they sort *after* any existing ids. | |
| * 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs. | |
| * 3. They sort *lexicographically* (so the timestamp is converted to characters that will sort properly). | |
| * 4. They're monotonically increasing. Even if you generate more than one in the same timestamp, the | |
| * latter ones will sort after the former ones. We do this by using the previous random bits | |
| * but "incrementing" them by 1 (only in the case of a timestamp collision). | |
| */ |
