A Go library that implements a Sparse Merkle Trie for a key-value map.
-
Updated
Nov 11, 2026 - Go
A Go library that implements a Sparse Merkle Trie for a key-value map.
Implementation code when learning deep reinforcement learning
Provide a fast (cpp-version) of Prioritized Experience Replay in Reinforcement Learning
Implementation of project 1 for Udacity's Deep Reinforcement Learning Nanodegree
Efficient discrete random distribution for C++. The implementation uses array-based sum tree to allow fast sampling and updates of weighted events.
Deep Q-Network Prioritized Experience Replay (PER) binary sum-tree engine enabling O(log N) proportional transition sampling and TD-error ranking.
Sum tree data structure for stochastic priority sampling
A PHP implementation of a fixed-size binary sum tree
Zero-dependency, zero-GC summary tree for mutable ordered sequences: SumSequence inserts, removes and resizes anywhere in O(log n) and seeks by any running total (count, pixels, bytes, milliseconds) over 1 to 4 integer measures per element.
To associate your repository with the sum-tree topic, visit your repo's landing page and select "manage topics."