Search Results for "miarma-seq"

Immutable.js offers a collection of Persistent Immutable data structures for JavaScript. Immutable data is unchangeable once created, which makes application development so much simpler. There’s no defensive copying, and you get advanced memoization and change detection techniques with simple logic. Persistent data gives you a mutative API, one that doesn’t update data in-place but always produces new and updated data. The data structures that Immutable.js provides include List, Stack,...

This is a workshop/repository by the Rust developer David Tolnay (dtolnay) intended to teach how to write Rust procedural macros (derive macros, function-like macros, attribute macros). The repo contains multiple toy/realistic macro projects drawn from real use-cases: e.g., derive(Builder), derive(CustomDebug), seq!, #[sorted], #[bitfield]. The README indicates the focus is on learning: parsing token streams, generating code, handling generics, attribute arguments, etc. It has test harness and workflow guidance. Because procedural macros are quite subtle in Rust, this workshop is a strong resource for anyone wanting to go from beginner to intermediate/advanced macro writing.

Cheshire is a high-performance JSON encoding and decoding library for Clojure, built atop Jackson to combine fast parsing/generation with advanced support for types like Dates, UUIDs, Sets, Symbols, and the binary JSON SMILE format. Custom encoding is supported from 2.0.0 and up if you encounter a bug, please open a GitHub issue. From 5.0.0 onwards, custom encoding has been moved to be part of the core namespace (not requiring a namespace change). Custom and Core encoding have been combined...

This is my school project. It focuses on Reinforcement Learning for personalized news recommendation. The main distinction is that it tries to solve online off-policy learning with dynamically generated item embeddings. I want to create a library with SOTA algorithms for reinforcement learning recommendation, providing the level of abstraction you like.

Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.