MadLittleMods

Just some notes and references for myself.

• In bash, you can access your C:\ drive via /mnt/c/
• ~ = C:\Users\MLM\AppData\Local\lxss\home\mlm and is different from your Windows user directory C:\Users\MLM

How to google things

kuznero

Work with Docker behind proxy

Docker on Linux OS

Following instructions are from official docuementation:

sudo mkdir /etc/systemd/system/docker.service.d

akimboyko

#time "on"
#load "Bootstrap.fsx"

open System
open Akka.Actor
open Akka.Configuration
open Akka.FSharp
open Akka.TestKit

// #Using Actor

ayende

using System;
using System.Collections.Generic;
using System.Linq;

namespace Voron.Util
{
	/// <summary>
	/// A list that can be used by readers as a true immutable read-only list 
	/// and that supports relatively efficient "append to the end" and "remove 
	/// from the front" operations, by sharing the underlying array whenever 

ImmutableAppendOnlyList.cs

    /// <summary>
    /// A list that can be used by readers as a true immutable read-only list 
    /// and that supports relatively efficient "append to the end" and "remove 
    /// from the front" operations, by sharing the underlying array whenever 
    /// possible. Implemented as a class so it can be used to "CAS" when making 
    /// changes in order to allow lockless immutability.
    /// </summary>
    public class ImmutableAppendOnlyList<T> : IReadOnlyList<T>
    {
        private delegate void RangeCopier(IEnumerable<T> source, T[] dest, int destOffset, int count);

banaslee

eXtreme Go Horse (XGH) Process

Source: http://gohorseprocess.wordpress.com


1. I think therefore it's not XGH.
In XGH you don't think, you do the first thing that comes to your mind. There's not a second option as the first one is faster.

2. There are 3 ways of solving a problem: the right way, the wrong way and the XGH way which is exactly like the wrong one but faster.
XGH is faster than any development process you know (see Axiom 14).

Jud

/*****************************************************************************
 *                QuantCup 1:   Price-Time Matching Engine
 *
 * Submitted by: voyager
 * 
 * Design Overview:
 *   In this implementation, the limit order book is represented using 
 *   a flat linear array (pricePoints), indexed by the numeric price value. 
 *   Each entry in this array corresponds to a specific price point and holds 
 *   an instance of struct pricePoint. This data structure maintains a list