| "use strict"; | |
| // `f` is assumed to sporadically fail with `TemporaryNetworkError` instances. | |
| // If one of those happens, we want to retry until it doesn't. | |
| // If `f` fails with something else, then we should re-throw: we don't know how to handle that, and it's a | |
| // sign something went wrong. Since `f` is a good promise-returning function, it only ever fulfills or rejects; | |
| // it has no synchronous behavior (e.g. throwing). | |
| function dontGiveUp(f) { | |
| return f().then( | |
| undefined, // pass through success |
| (ns thread-utils) | |
| (def ^:private frame-prev-field (doto (.getDeclaredField clojure.lang.Var$Frame "prev") (.setAccessible true))) | |
| (def ^:private bindings-field (doto (.getDeclaredField clojure.lang.Var$Frame "bindings") (.setAccessible true))) | |
| (def ^:private tbox-val-field (doto (.getDeclaredField clojure.lang.Var$TBox "val") (.setAccessible true))) | |
| (def ^:private thread-locals-field (doto (.getDeclaredField Thread "threadLocals") (.setAccessible true))) | |
| (def ^:private thread-local-map-field (doto (.getDeclaredField java.lang.ThreadLocal$ThreadLocalMap "table") (.setAccessible true))) | |
| (def ^:private entry-value-field (doto (.getDeclaredField java.lang.ThreadLocal$ThreadLocalMap$Entry "value") (.setAccessible true))) | |
| (defn all-threads [] |
| // The contents of this file are subject to the Mozilla Public License | |
| // Version 1.1 (the "License"); you may not use this file except in | |
| // compliance with the License. You may obtain a copy of the License | |
| // at http://www.mozilla.org/MPL/ | |
| // | |
| // Software distributed under the License is distributed on an "AS IS" | |
| // basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See | |
| // the License for the specific language governing rights and | |
| // limitations under the License. | |
| // |
This script installs a patched version of ruby 1.9.3-p194 with patches for boot-time performance improvements (#66 and #68), and runtime performance improvements (#83 and #84). It also includes the new backported GC from ruby-trunk.
Huge thanks to funny-falcon for the performance patches.
| #### | |
| ## Ruby port of "A Tale of 3 Nightclubs" | |
| ## | |
| ## Based on Scala version here: https://gist.github.com/970717 | |
| ## | |
| ## Demonstrates applicative validation in Ruby, inspired by the blog post: | |
| ## "An example of applicative validation in FSharpx" | |
| ## (http://bugsquash.blogspot.com/2012/03/example-of-applicative-validation-in.html) | |
| #### |
| // hotspot/src/share/vm/runtime/globals.hpp | |
| /* | |
| * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. | |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
| * | |
| * This code is free software; you can redistribute it and/or modify it | |
| * under the terms of the GNU General Public License version 2 only, as | |
| * published by the Free Software Foundation. | |
| * | |
| * This code is distributed in the hope that it will be useful, but WITHOUT |
Adrian -
I appreciate that you spent time in writing this post. I know I've been up until 2am writing similarly long ones as well. I will take responsibility for having what is likely an irrational response (I blame Twitter for that) to the term "NoOps", but I invite you to investigate why that might be. I'm certainly not the only one who feels this way, apparently, and thus far have decided this issue is easily the largest distraction in my field I've encountered in recent years. I have had the option to simply ignore my opposition to the term, and just let the chips fall where they may with how popular the term "NoOps" may or may not get. I have obviously not taken that option in the past, but I plan to in the future.
You're not an analyst saying "NoOps". Analysts are easy (for me) to ignore, because they're not practitioners. We have expectations of engineering maturity from practitioners in this field of web engineering, especially those we consider leaders. I don't have any expectations from analysts,
| (defn clj->js | |
| "Recursively transforms ClojureScript maps into Javascript objects, | |
| other ClojureScript colls into JavaScript arrays, and ClojureScript | |
| keywords into JavaScript strings." | |
| [x] | |
| (cond | |
| (string? x) x | |
| (keyword? x) (name x) | |
| (map? x) (.strobj (reduce (fn [m [k v]] | |
| (assoc m (clj->js k) (clj->js v))) {} x)) |
| Greg's Stop Loss Kata | |
| Testing is very hard when time is involved ... | |
| A trailing stop loss is a term used in financial trading. For a very in depth explanation you can read here http://www.investopedia.com/articles/trading/03/080603.asp and http://en.wikipedia.org/wiki/Order_(exchange)#Stop_orders | |
| However we do not need a huge amount of background in order to do the kata as we are going to limit the problem a bit. | |
| The general idea is that when you buy into a stock at a price say $10. You want it to automatically get sold if the stock goes below $9 (-$1). If we use the term "trailing" that means that id the price goes up to $11 then the sell point becomes $10. |
| module Main where | |
| import Test.QuickCheck (quickCheck) | |
| import Your.Module (encrypt, decrypt) | |
| prop_reverseReverse :: [Char] -> Bool | |
| prop_reverseReverse s = (reverse . reverse) s == s | |
| prop_encryptDecrypt :: [Char] -> Bool | |
| prop_encryptDecrypt s = (encrypt . decrypt) s == s |