NickCraver

<Query Kind="Program">
  <NuGetReference Prerelease="true">Microsoft.Diagnostics.Runtime</NuGetReference>
  <Namespace>Microsoft.Diagnostics.Runtime</Namespace>
  <Namespace>System</Namespace>
  <Namespace>System.IO</Namespace>
  <Namespace>System.Linq</Namespace>
  <Namespace>System.Text</Namespace>
  <Namespace>Microsoft.Diagnostics.Runtime.Utilities</Namespace>
</Query>

leonardo-m

// Port of the C# 101 LINQ Samples rewritten into Apple's Swift 3.

#![feature(ordering_chaining, step_by)]

fn main() {
    // linq5: Where - Indexed
    /*
    //c#
    public void Linq5()
    {

davipatti

ThinkPad setup

Notes from installing Ubuntu 18.04 on a Lenovo ThinkPad X1 Extreme, with nvidia graphics.

• Turn off secure boot in the BIOS.

---

Installer freezing / non-responsive

kurtlawrence

// # Fitting kserd macro.
//
// The macro logic is hidden from users to avoid having the long list of pattern matching exposed.
// It also helps control the pattern state.
//
// Fitting is split into four aspects:
// 1. Parsing
// 2. Flattening
// 3. Documentation
// 4. Code generation

debasishg

Basics

1. The Log-Structured Merge-Tree (LSM-Tree)
2. B-Tree vs Log-Structured Merge-Tree
3. Modern B-tree techniques
4. LSM-based Storage Techniques: A Survey

B-trees and CPU Caches

1. B-tree Indexes and CPU Caches by Goetz Graefe and Per-Åke Larson

debasishg

Cache Oblivious and Cache Aware Data Structure and Algorithms

1. Cache-Oblivious Algorithms and Data Structures - Erik Demaine (One of the earliest papers in cache oblivious data structures and algorithms that introduces the cache oblivious model in detail and examines static and dynamic cache oblivious data structures built between 2000-2003)

2. Cache Oblivious B-Trees - Bender, Demaine, Farch-Colton (This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. One of the fundamental papers in the field where both search trees discussed match the optimal search bound of Θ(1+log (B+1)N) memory transfers)

3. Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (The data structure discussed in this paper works on the version of [2] but avoids the use o