MiniLSM is a working-in-progress tutorial series for building a storage engine. Based on the experience of building AgateDB and RisingWave, MiniLSM introduces you the basics of an LSM-tree storage engine with a step-by-step tutorial.
The starter code is accessible on GitHub, and the tutorial is available on GitHub Pages.
| #![feature(generic_associated_types)] | |
| trait ArrayBuilder { | |
| type ArrayType: Array<Builder = Self>; | |
| fn new(capacity: usize) -> Self; | |
| fn append<'a>( | |
| &'a mut self, | |
| value: Option<<<Self as ArrayBuilder>::ArrayType as Array>::RefItem<'a>>, | |
| ); |
| import requests | |
| from pathlib import Path | |
| import time | |
| import re | |
| import base64 | |
| from lxml import etree | |
| import os | |
| from io import BytesIO | |
| def gen_random_file(size): |
| const data = require('./data.json') | |
| const debug = require('debug')('generator') | |
| const _ = require('lodash') | |
| const ics = require('ics') | |
| const moment = require('moment') | |
| const fs = require('fs') | |
| const courses = data.kbList.filter(course => !course.ignore).map(course => ({ | |
| name: course.kcmc, | |
| teacher: course.xm, |
| { | |
| "__inputs": [ | |
| { | |
| "name": "DS_PROMETHEUS", | |
| "label": "Prometheus", | |
| "description": "", | |
| "type": "datasource", | |
| "pluginId": "prometheus", | |
| "pluginName": "Prometheus" | |
| } |
| #include <iostream> | |
| #include <fstream> | |
| #include <map> | |
| #include <algorithm> | |
| #include <queue> | |
| #include <string> | |
| using namespace std; | |
| struct Node { |
| #include <iostream> | |
| #include <functional> | |
| using namespace std; | |
| template <typename T> | |
| bool compare_by_value(const T& a, const T& b) { return a < b; } | |
| template <typename Comp> | |
| bool alex_compare_int(const int& a, const int &b, Comp comp = compare_by_value) { |
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title>Physics Test</title> | |
| </head> | |
| <body> | |
| <svg id="main" width="800" height="800"></svg> | |
| <script src="https://d3js.org/d3.v5.min.js"></script> | |
| <script src="main.js"></script> | |
| </body> |
| #ifndef STRATEGY_HPP | |
| #define STRATEGY_HPP | |
| #include <vector> | |
| #include <cstdlib> | |
| #include <ctime> | |
| #include "util.hpp" | |
| #include <vector> | |
| int cnt = 0; |
| #include <iostream> | |
| #include <climits> | |
| #include <cstring> | |
| using namespace std; | |
| template<typename T> | |
| struct BST { | |
| struct Node { | |
| T x; |
