diff options
| author | Loïc Hoguin <[email protected]> | 2019-06-11 15:53:47 +0200 |
|---|---|---|
| committer | Loïc Hoguin <[email protected]> | 2019-06-11 15:53:47 +0200 |
| commit | e031713c0e8bd871248dbbbbdec1ea28609f4431 (patch) | |
| tree | b2aa91d26c6de0bb02e5fc1ac04093c7a1af9a2e /articles/page/2/index.html | |
| parent | 6c17bcc5ecd1ab7f26fad8e280d782bd5f3965d6 (diff) | |
| download | ninenines.eu-e031713c0e8bd871248dbbbbdec1ea28609f4431.tar.gz ninenines.eu-e031713c0e8bd871248dbbbbdec1ea28609f4431.tar.bz2 ninenines.eu-e031713c0e8bd871248dbbbbdec1ea28609f4431.zip | |
Joe Armstrong the rubber duck
Diffstat (limited to 'articles/page/2/index.html')
| -rw-r--r-- | articles/page/2/index.html | 42 |
1 files changed, 22 insertions, 20 deletions
diff --git a/articles/page/2/index.html b/articles/page/2/index.html index 46ecfdd7..6e899f20 100644 --- a/articles/page/2/index.html +++ b/articles/page/2/index.html @@ -67,6 +67,25 @@ <article class="blog_item"> <header> + <h2><a href="https://ninenines.eu/articles/cowboy-2.0.0-pre.4/">Cowboy 2.0 pre-release 4</a></h2> + <p class="date"> + <span class="year">2017</span> + <span class="day-month">03 Jan</span> + </p> + </header> + + <p>Cowboy 2.0.0-pre.4 has been released! +This is the new recommended version of Cowboy. While I would not recommend putting it in production just yet, I do recommend you start writing new applications with this Cowboy version. +The most significant changes in the pre-release are: +A new architecture: there now is one process per connection and one process per request. This was done because HTTP/2 allows running requests concurrently. Stream handlers.</p> + + <p style="text-align:right"> + <a class="read_more" href="https://ninenines.eu/articles/cowboy-2.0.0-pre.4/">Read More</a> + </p> + </article> + + <article class="blog_item"> + <header> <h2><a href="https://ninenines.eu/articles/ranch-1.3/">Ranch 1.3</a></h2> <p class="date"> <span class="year">2016</span> @@ -408,32 +427,15 @@ The goal of this article is to showcase how to use Ranch for writing a network p </p> </article> - <article class="blog_item"> - <header> - <h2><a href="https://ninenines.eu/articles/tictactoe/">Erlang Tic Tac Toe</a></h2> - <p class="date"> - <span class="year">2012</span> - <span class="day-month">17 Oct</span> - </p> - </header> - - <p>Everyone knows Tic Tac Toe, right? -Players choose either to be the Xs or the Os, then place their symbol on a 3x3 board one after another, trying to create a line of 3 of them. -Writing an algorithm to check for victory sounds easy, right? It's easily tested, considering there's only 8 possible winning rows (3 horizontal, 3 vertical and 2 diagonal). -In Erlang though, you probably wouldn't want an algorithm.</p> - - <p style="text-align:right"> - <a class="read_more" href="https://ninenines.eu/articles/tictactoe/">Read More</a> - </p> - </article> - <nav class="pagination" role="pagination"> <a href="/articles/"><i class="fa fa-angle-double-left"></i></a> - <span>2 / 2</span> + <span>2 / 3</span> + + <a href="/articles/page/3/"><i class="fa fa-angle-double-right"></i></a> </nav> |