Fast and memory-efficient immutable collections and helper data structures
-
Updated
Oct 23, 2026 - C#
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
reference-semanticsHere are 5 public repositories matching this topic...Fast and memory-efficient immutable collections and helper data structures
map performance immutable avl-tree functional-programming dictionary effects value-semantics persistent data-structures hashmap lock-free hashtable memory-efficient sum-types open-addressing compare-and-swap 2-3-tree reference-semantics robinhood-hashmap
A Class for Working with Time Series Data Based on 'data.table' and 'R6' with Largely Optional Reference Semantics (Development Version)
Lets you pass anything using reference semantics without the danger of unsafe pointers
swift danger pointer type-safety pointers reference-semantics pointers-and-references safe-pointers swift-pointers
My generic doubly linked list in an Xcode 9 playground and written in Swift 4.
swift node linked-list datastructures xcode protocol traversal class traversing-graphs traverse object-oriented-programming doubly-linked-list traversable-nodes protocol-oriented-programming swift4 xcode9 reference-semantics reference-types
Development-only independent reference semantics for MLTL over finite words and lassos, used to cross-check tl-mltl and tl-rewrite.
Add this topic to your repoTo associate your repository with the reference-semantics topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |