| /* | |
| A data race happens when processes have to access the same variable concur | |
| rently i.e. one process reads from a memory location while another simultaneously | |
| writes to the exact same memory location. | |
| */ | |
| func main() { | |
| number := 0; | |
| go func(){ |
| #!/bin/bash | |
| # Check if xidell is present (required for extracting from webpage using xpath) | |
| if ! command -v xidel &> /dev/null | |
| then | |
| printf "\n\nCould not find xidel \n\n" | |
| echo "You can install it with (on a mac):" | |
| echo "brew install xidel" | |
| exit | |
| fi |
| // Go to here https://www.linkedin.com/feed/following/?filterType=connection | |
| // open the chrome dev tools console | |
| // paste the following | |
| // go grab a cup of tea | |
| // get rid of all life coach from linkedin | |
| var buttons = $('button'), interval = setInterval(function() { | |
| var btn = $('.is-following'); | |
| console.log('Clicking:', btn); | |
| btn.click(); |
I've discovered something how to do something that GHC never intended you to be able to do, and I'm wondering if there's a way to abuse this to do interesting things.
It's known that you can express visible, dependent quantification at the kind level:
data A a :: a -> Typeλ> :kind A
| // Tensorflow Serving Go client for the inception model | |
| // go get github.com/golang/protobuf/ptypes/wrappers google.golang.org/grpc | |
| // | |
| // Compile the proto files: | |
| // | |
| // git clone https://github.com/tensorflow/serving.git | |
| // git clone https://github.com/tensorflow/tensorflow.git | |
| // | |
| // mkdir -p vendor |
This is a proposal for a lightning talk at the Reactive 2016 conference. If you like this, star the Gist.
In regular websites, it is common to send multiple events to track user clicks. Single Page Applications change the way you look at metrics. This is a talk about a simple pattern we created at Globo.com to manage a metrics layer for http://globoplay.globo.com. The talk will cover how to track user flow using Google Analytics and other services. We solved the challenge of tying metrics and components, keeping information across pages and having global data. Also some React, React Router and React Side Effects concepts like context, higher order components, history state will be covered.
The Y Combinator is a classic lambda calculus construct that many people find baffling. Here's my attempt to explain it as clearly as possible (no promises!). Familiarity with Haskell syntax is assumed.
The problem we're trying to solve is how to write an anonymous function (a "lambda") that is recursive. Normally, if you want to write a recursive function, it looks like this:
fac n = if n == 0 then 1
else n * fac (n-1)
| # Updated for Ruby 2.3 | |
| string_t = None | |
| def get_rstring(addr): | |
| s = addr.cast(string_t.pointer()) | |
| if s['basic']['flags'] & (1 << 13): | |
| return s['as']['heap']['ptr'].string() | |
| else: | |
| return s['as']['ary'].string() |
As Kyle brought up, Consul at the moment has a single known case of a potential inconsistency (Could be unknown cases lurking). Currently Consul works by electing a leader, who "leases" the position for LeaderLeaseTimeout interval. At each interval, it checks that a quorum of nodes still believes it to be the leader. At the same time, if a follower does not hear from the leader within randomInterva(HeartbeatTimeout, 2 * HeartbeatTimeout), it will start a new election.
