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

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

Quelle: http://gohorseprocess.wordpress.com

Übersetzung ursprünglich von https://gist.github.com/Neffez/f8d907ba8289f14e23f3855011fa4e2f

1. Ich denke, also ist es nicht XGH.
In XGH wird nicht gedacht, es wird das erste gemacht, was in den Sinn kommt. Es gibt auch keine zweite Option, die erste ist schneller.

2. Es gibt 3 Wege ein Problem zu lösen: den richtigen Weg, den falschen Weg und den XGH Weg, welcher exakt wie der falsche ist, aber schneller.

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