I hereby claim:
- I am netroy on github.
- I am netroy (https://keybase.io/netroy) on keybase.
- I have a public key whose fingerprint is AD34 72D7 4827 4AE4 8A56 CA53 ED26 745F 4605 EF41
To claim this, I am signing this object:
var proto = WebSocket.prototype; | |
var send = proto.send; | |
Object.defineProperty(proto, 'send', { | |
'writable': false, | |
'value': function (data) { | |
console.log(data); | |
return send.apply(this, arguments); | |
} | |
}); |
<link rel="import" href="../core-scaffold/core-scaffold.html"> | |
<link rel="import" href="../core-header-panel/core-header-panel.html"> | |
<link rel="import" href="../core-menu/core-menu.html"> | |
<link rel="import" href="../core-item/core-item.html"> | |
<link rel="import" href="../core-icon-button/core-icon-button.html"> | |
<link rel="import" href="../core-toolbar/core-toolbar.html"> | |
<link rel="import" href="../core-icons/core-icons.html"> | |
<link rel="import" href="../core-icon/core-icon.html"> | |
<link rel="import" href="../core-menu/core-submenu.html"> |
package main | |
import ( | |
"github.com/chuckpreslar/emission" | |
"github.com/garyburd/redigo/redis" | |
"github.com/gorilla/websocket" | |
"log" | |
"net/http" | |
) |
[].forEach.call(document.all,function(e){-1!==e.constructor.name.indexOf("-")&&(e.style.border="3px solid red")}); |
package main | |
import ( | |
"log" | |
"net/http" | |
"github.com/SlyMarbo/spdy" | |
"io" | |
"compress/gzip" | |
"strings" | |
) |
I hereby claim:
To claim this, I am signing this object:
(function (window) { | |
'use strict'; | |
var realConsole = window.console || {}; | |
var warnings = { | |
'Sorry, Your console is disabled for security reasons.': 'color: red; font-size: 36px; line-height: 40px;' | |
}; |
#!/bin/sh | |
files=$(git diff --cached --name-only --diff-filter=ACM | grep ".js$") | |
if [ "$files" = "" ]; then | |
exit 0 | |
fi | |
pass=true | |
for file in ${files}; do |
var primes = [2]; | |
var n = 3; // The number we are testing. Will be incremented. | |
function checkNextNumber() { | |
// It's sufficient to check if there are any prime factors up to sqrt(n) | |
n++; | |
var limitForChecking = Math.floor(Math.sqrt(n)); |