| // Load the TCP Library | |
| net = require('net'); | |
| // Keep track of the chat clients | |
| var clients = []; | |
| // Start a TCP Server | |
| net.createServer(function (socket) { | |
| // Identify this client |
| echo 'export PATH=$HOME/local/bin:$PATH' >> ~/.bashrc | |
| . ~/.bashrc | |
| mkdir ~/local | |
| mkdir ~/node-latest-install | |
| cd ~/node-latest-install | |
| curl http://nodejs.org/dist/node-latest.tar.gz | tar xz --strip-components=1 | |
| ./configure --prefix=~/local | |
| make install # ok, fine, this step probably takes more than 30 seconds... | |
| curl https://www.npmjs.org/install.sh | sh |
| let trampoline f c n = | |
| let rec loop = function | |
| | Choice1Of2 x -> x | |
| | Choice2Of2 x -> loop (f x) | |
| loop (Choice2Of2 (c,n)) | |
| // Test | |
| let factorial n = | |
| let rec factorialT (current, n) = | |
| if n = bigint 0 then Choice1Of2 current |
| // This F# dojo is directly inspired by the | |
| // Digit Recognizer competition from Kaggle.com: | |
| // http://www.kaggle.com/c/digit-recognizer | |
| // The datasets below are simply shorter versions of | |
| // the training dataset from Kaggle. | |
| // The goal of the dojo will be to | |
| // create a classifier that uses training data | |
| // to recognize hand-written digits, and | |
| // evaluate the quality of our classifier |
| // NOTE: import this Nuget package: TaskBuilder.fs (written using 2.1.0) | |
| // | |
| // Tested in LINQPad (hence Dump method usage). | |
| open System | |
| open System.Collections | |
| open System.Collections.Generic | |
| open System.Diagnostics | |
| open System.Linq | |
| open System.Threading |
| open System.Net.Sockets | |
| type A = System.Net.Sockets.SocketAsyncEventArgs | |
| type B = System.ArraySegment<byte> | |
| exception SocketIssue of SocketError with | |
| override this.ToString() = | |
| string this.Data0 | |
| /// Wraps the Socket.xxxAsync logic into F# async logic. |
| Originally: | |
| https://gist.github.com/7565976a89d5da1511ce | |
| Hi Donald (and Martin), | |
| Thanks for pinging me; it's nice to know Typesafe is keeping tabs on this, and I | |
| appreciate the tone. This is a Yegge-long response, but given that you and | |
| Martin are the two people best-situated to do anything about this, I'd rather | |
| err on the side of giving you too much to think about. I realize I'm being very | |
| critical of something in which you've invested a great deal (both financially |
| namespace Tsunami.Server | |
| open System | |
| open System.IO | |
| open System.Linq | |
| open System.Net | |
| open System.Net.Sockets | |
| open System.Text | |
| open System.Threading | |
| open System.Runtime.Serialization |
The Voronoi tesselation shows the closest point on the plane for a given set of points. This example updates the Voronoi diagram in response to mouse interaction! Colors by Cynthia Brewer; algorithm by Steven Fortune; implementation based on work by Nicolas Garcia Belmonte; interaction inspired by Raymond Hill.
This example shows what voronoi tesselations look like drawn with various d3 line interpolators.
| open System.Collections.Generic | |
| open Microsoft.FSharp.Collections | |
| [<RequireQualifiedAccess>] | |
| module Folds = | |
| // These are the fast implementations we actually want to use |
