A (vibe-coded) C# implementation of an embedded SQL database (parser using the SQLite dialect). Currently supports:
| #[inline] | |
| fn zigzag_encode(from: i64) -> u64 { | |
| ((from << 1) ^ (from >> 63)) as u64 | |
| } | |
| // see: http://stackoverflow.com/a/2211086/56332 | |
| // casting required because operations like unary negation | |
| // cannot be performed on unsigned integers | |
| #[inline] |
This paper discusses some ideas of how to extend HyParView/Plumtree beyond the most straightforward implementation. It presents the goals that we wanted to have in mind when building actual implementation in Rust.
While Partisan - the original and probably the most widely adopted implementation of HyParView+Plumtree - value proposition relies on building huge clusters (having >10 000 nodes) capable of broadcasting messages via self-healing broadcast trees, its network protocol seems to limit its possibilities to centralized solutions - like services living in data centres or at the edge, where peer discoverability and reachability is in control of their developers/operators. Other issue is that when exchanging neighbors/shuffle peers, plumtree blindly replaces them with current passive view without checking if they are reachable for the current peer in the first place.
We think, that adopting HyParView/Plumtree in Rust with extensible API could expand its capabil
| namespace Demos | |
| open System | |
| type ReplicaId = String | |
| [<RequireQualifiedAccess>] | |
| module Array = | |
| use crate::session::{SessionDeserialize, SessionSerialize}; | |
| use serde::de::{Error, SeqAccess, Visitor}; | |
| use serde::ser::SerializeStruct; | |
| use serde::{Deserialize, Deserializer, Serialize, Serializer}; | |
| use std::fmt::Formatter; | |
| /// A sample record of time-series data. | |
| #[derive(Debug, Eq, PartialEq, Serialize, Deserialize)] | |
| pub struct Record { | |
| /// A number of milliseconds since UNIX_EPOCH. |
| (* | |
| An immutable R-Tree implementation in F#. | |
| Based on: https://github.com/swimos/swim-rust/tree/main/swim_utilities/swim_rtree (licensed on Apache 2.0) | |
| Author: Bartosz Sypytkowski <b.sypytkowski at gmail.com> | |
| *) | |
| namespace Demos.RTree |
| module Demo.HashRings | |
| open System | |
| open System.Collections.Generic | |
| /// Range is a tuple describing (s,e] - where `s` is start | |
| /// (exclusive) index, while `e` is end (inclusive) index. | |
| type Range = ValueTuple<int,int> | |
| [<RequireQualifiedAccess>] |
| module Demo.Dht | |
| open System | |
| open System.Collections.Generic | |
| /// Range is a tuple describing (s,e] - where `s` is start | |
| /// (exclusive) index, while `e` is end (inclusive) index. | |
| type Range = ValueTuple<int,int> | |
| [<RequireQualifiedAccess>] |
| module Demo.Ramp | |
| open System | |
| open Akka.Actor | |
| open Akkling | |
| /// A Lamport clock timestamp used as transaction identifier - sequence number with unique node identifier. | |
| /// Original paper implementation uses combination of hybrid logical clock with node id encoded together into uint64. | |
| type TxnId = DateTime * int |