I hereby claim:
- I am indutny on github.
- I am indutny (https://keybase.io/indutny) on keybase.
- I have a public key whose fingerprint is 0C07 263A A07C D36C D122 C09C FB0E 1095 B179 7999
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
diff --git a/lib/child_process.js b/lib/child_process.js | |
index c8e9e37..390f435 100644 | |
--- a/lib/child_process.js | |
+++ b/lib/child_process.js | |
@@ -140,6 +140,11 @@ var handleConversion = { | |
handle.onread = function() {}; | |
socket._handle = null; | |
+ // Kill happy eyeball | |
+ if (socket._eyeball) |
Benchmarking: create-10 | |
bn.js#create-10 x 98,920 ops/sec ±0.69% (99 runs sampled) | |
bignum#create-10 x 282,502 ops/sec ±3.52% (86 runs sampled) | |
browserify-bignum#create-10 x 153,830 ops/sec ±1.03% (94 runs sampled) | |
------------------------ | |
Fastest is bignum#create-10 | |
======================== | |
Benchmarking: create-hex | |
bn.js#create-hex x 604,436 ops/sec ±0.73% (97 runs sampled) | |
bignum#create-hex x 270,627 ops/sec ±3.67% (84 runs sampled) |
[ <Vec: <Frac: 1/1>, <Frac: 1/1>, <Frac: 1/1>>, | |
<Vec: <Frac: 6c706108703d1fec15648b260fede8fa/1>, <Frac: -a859efef38a5d40a425c85678d56e6de/1>, <Frac: 3be98ee6c868b41e2cf7fa417d68fde5/1>>, | |
<Vec: <Frac: -1716c16e24434960ffb9b72ad34c25720/1>, <Frac: 87a1b8eb65bce60ecb7a1d8973425d7b/1>, <Frac: -2c1af3c8f37d364bbb6dd13b04f89c33/1>> ] |
uv_stream_t* s; | |
uv_pipeline_t p1 = { | |
.alloc_cb = int(uv_stream_t* s, uv_pipeline_t*, size_t size, uv_buf_t* buf) { | |
}, | |
.read_cb = int(uv_stream_t* s, uv_pipeline_t* p, uv_buf_t* buf) { | |
// The point here is that you could call it in a later tick, thus | |
// the next pipeline couldn't be provided as an argument to this function | |
uv_pipeline_t* next = uv_stream_next_pipeline(s, &p); |
commit c732e933f995b42317e63875bfaa6907085a5811 | |
Author: James M Snell <jasnell@gmail.com> | |
Date: Wed Aug 21 14:39:54 2013 -0700 | |
Support for unknown extension methods in the http parser.. implemented | |
in a way that does not slow the parser down. | |
Conflicts: | |
.gitignore | |
http_parser.h |
ECDHE-ECDSA-AES256-GCM-SHA384 | |
ECDHE-RSA-AES256-GCM-SHA384 | |
ECDHE-ECDSA-AES256-GCM-SHA256 | |
ECDHE-RSA-AES256-GCM-SHA256 | |
ECDHE-ECDSA-AES256-SHA256 | |
ECDHE-RSA-AES256-SHA256 | |
DHE-RSA-AES256-GCM-SHA384 | |
DHE-RSA-AES256-GCM-SHA256 | |
DHE-RSA-AES256-SHA256 | |
AES256-GCM-SHA384 |
{ | |
init: function(elevators, floors) { | |
var floorButtons = new Array(floors.length); | |
var floorTime = new Array(floors.length); | |
var UP = 1; | |
var DOWN = 2; | |
var DISABLED = 4; | |
for (var i = 0; i < floorButtons.length; i++) { | |
floorButtons[i] = 0; | |
floorTime[i] = 0; |
I hereby claim:
To claim this, I am signing this object:
Benchmarking: create-10 | |
bn.js#create-10 x 1,967,120 ops/sec ±1.65% (9 runs sampled) | |
bignum#create-10 x 642,220 ops/sec ±0.80% (8 runs sampled) | |
------------------------ | |
Fastest is bn.js#create-10 | |
======================== | |
Benchmarking: create-hex | |
bn.js#create-hex x 2,610,191 ops/sec ±0.85% (9 runs sampled) | |
bignum#create-hex x 614,238 ops/sec ±2.36% (9 runs sampled) | |
------------------------ |