From c35fc51d495f5b611182b1ca9a3f914a2b9df37b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Matou=C5=A1=20Dzivjak?= Date: Tue, 10 Dec 2024 20:19:01 +0100 Subject: [PATCH] feat: various --- computer_science/data_structures.md | 4 ++++ computer_science/graphics/shaders.md | 1 + computer_science/observability.md | 1 + computer_science/operating_systems/index.md | 1 + math/index.md | 3 +++ work/index.md | 1 + 6 files changed, 11 insertions(+) diff --git a/computer_science/data_structures.md b/computer_science/data_structures.md index f59f7ee..136958e 100644 --- a/computer_science/data_structures.md +++ b/computer_science/data_structures.md @@ -14,6 +14,10 @@ - [how the append-only btree works](https://www.bzero.se/ldapd/btree.html) +## [**k-d tree**](https://en.wikipedia.org/wiki/K-d_tree) + +> k-dimensional tree (k-d tree) is a space-partitioning data structure for organizing points in a k-dimensional space. K-dimensional is that which concerns exactly `k` orthogonal axes or a space of any number of dimensions. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches) or creating point clouds. k-d trees are a special case of [binary space partitioning](https://en.wikipedia.org/wiki/Binary_space_partitioning) trees. + ## Ropes - [Rope science](https://xi-editor.io/docs/rope_science_00.html) diff --git a/computer_science/graphics/shaders.md b/computer_science/graphics/shaders.md index 1360b6e..287dbb7 100644 --- a/computer_science/graphics/shaders.md +++ b/computer_science/graphics/shaders.md @@ -8,3 +8,4 @@ - [On Crafting Painterly Shaders](https://blog.maximeheckel.com/posts/on-crafting-painterly-shaders/) - shader that looks like paintings #shaders - [glslViewer](https://github.com/patriciogonzalezvivo/glslViewer) - Console-based GLSL Sandbox for 2D/3D shaders - [shadertoy](https://www.shadertoy.com/) - Build and Share your best shaders with the world and get Inspired +- [Shadplay](https://github.com/alphastrata/shadplay) - exploring shader in bevy diff --git a/computer_science/observability.md b/computer_science/observability.md index 1aa970e..72a74c3 100644 --- a/computer_science/observability.md +++ b/computer_science/observability.md @@ -7,6 +7,7 @@ - [Monitoring is a Pain](https://matduggan.com/were-all-doing-metrics-wrong/) - [Canonical Log Lines](https://stripe.com/blog/canonical-log-lines) - [What Does a Good Trace Look Like?](https://www.honeycomb.io/getting-started/what-does-a-good-trace-look-like) +- [All you need is Wide Events, not "Metrics, Logs and Traces"](https://isburmistrov.substack.com/p/all-you-need-is-wide-events-not-metrics) ## Tools diff --git a/computer_science/operating_systems/index.md b/computer_science/operating_systems/index.md index ebf90c8..4859a81 100644 --- a/computer_science/operating_systems/index.md +++ b/computer_science/operating_systems/index.md @@ -13,3 +13,4 @@ - [Operating Systems: From 0 to 1](https://tuhdo.github.io/os01/) - [MyViewOfLinuxSystems](https://github.com/lsc4719/MyViewOfLinuxSystems) ![Linux process view](/static/linux-process-view.png) +- [Hermit OS](https://github.com/hermit-os/kernel) - A Rust-based, lightweight unikernel. #rust #os #kernel diff --git a/math/index.md b/math/index.md index 2783395..fd5eea9 100644 --- a/math/index.md +++ b/math/index.md @@ -3,6 +3,9 @@ ## Resources - [**Interactive Linear Algebra**](https://textbooks.math.gatech.edu/ila/index.html) +- [**Quaternions**](https://eater.net/quaternions) + - [Quaternion (Wiki)](https://en.wikipedia.org/wiki/Quaternion) + - [Quaternions and 3d rotation, explained interactively (video)](https://youtu.be/zjMuIxRvygQ?si=4LvYANrmsuy5lwIt) - [Mathematics Cheat Sheet](https://ourway.keybase.pub/mathematics_cheat_sheet.pdf) - [A Programmer’s Introduction to Mathematics](https://www.bit-101.com/blog/2021/08/a-programmers-introduction-to-mathematics/) - [Math Foundations from Scratch](https://learnaifromscratch.github.io/math.html) diff --git a/work/index.md b/work/index.md index 0d87691..5d7777e 100644 --- a/work/index.md +++ b/work/index.md @@ -145,5 +145,6 @@ The [CAP theorem](https://en.wikipedia.org/wiki/CAP_theorem), states that any di - **Availability** - Every request receives a (non-error) response, without the guarantee that it contains the most recent write. - **Partition tolerance** - The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes. +- [A Critique of the CAP Theorem](https://arxiv.org/abs/1509.05393) [^get_it_done]: [Get It Done](https://boz.com/articles/get-it-done) by [Andrew Bosworth](https://boz.com)