5 repository-uri
Systems for storing and retrieving growable collections with indexed access.
Distinct from Fixed-Size Collections: Candidates focused on fixed-size collections or UI sizing; this is about growable data structure storage.
Explore 5 awesome GitHub repositories matching data & databases · Dynamic Array Management. Refine with filters or upvote what's useful.
The ECMAScript specification is the formal standard defining the syntax, semantics, and execution model that all JavaScript implementations must follow. It establishes the official language rules through a combination of formal grammar and step-by-step algorithmic prose. The project manages the technical evolution of the language via a consensus-driven governance framework and a staged proposal pipeline. This process tracks features from initial design through expert reviewer sign-off and committee approval. A specification-as-code toolchain compiles these formal definitions and algorithmic d
Manages indexed collections with dynamic lengths and standard methods for sorting and transforming elements.
Sui is a blockchain platform featuring an object-centric state model and resource-oriented smart contracts. It utilizes parallel transaction execution to increase network throughput and supports programmable transaction blocks that bundle multiple operations into single atomic units. The platform distinguishes itself with a capability-based access control system and zero-knowledge login mechanisms, enabling users to authenticate via identity providers without seed phrases. It also implements deterministic object addressing to allow predictable state lookups and supports the creation of soulbo
Provides the ability to store and retrieve growable collections of any type using zero-based indexing.
uthash is a macro-based data structure library for C that provides header-only implementations of hash tables, linked lists, stacks, and dynamic arrays. It allows for key-based lookups and organized data storage without requiring external library linking. The library uses intrusive linking to embed metadata directly into user-defined structures via macros. This approach enables in-place structure extension, allowing hash and link fields to be added to existing structs without separate memory allocations for container nodes. The project also covers specialized memory and data stream managemen
Provides growable collections of data with indexed access using dynamic array management.
Janet is a Lisp-based dynamic programming language featuring a register-based bytecode virtual machine and an embeddable scripting engine. It functions as a fiber-based concurrency runtime and includes a parsing engine based on Parsing Expression Grammars. The project is distinguished by its ability to be integrated into C or C++ applications via a minimal header interface. It utilizes a Lisp-style macro system for compile-time code transformation and employs prototype-based table inheritance for object-oriented behavior. The runtime covers a broad set of capabilities, including asynchronous
Provides growable collections with indexed access for storing data dynamically.
Acest proiect este un ghid tehnic de programare și o resursă educațională axată pe internele Go, mecanismele de runtime și funcționalitățile avansate ale limbajului. Oferă o analiză conceptuală detaliată a modelului de execuție al limbajului, inclusiv scheduler-ul său, analiza de escape a memoriei și mecanismele de garbage collection. Materialul se distinge prin incursiuni profunde în designul sistemelor cu concurență ridicată, explorând implementarea pool-urilor de worker-i și a canalelor de comunicare. Acoperă, de asemenea, programarea de rețea de nivel scăzut cu accent pe multiplexarea I/O și gestionarea stării TCP, alături de un studiu al teoriei sistemelor distribuite aplicând teoremele CAP și BASE pentru servicii scalabile. Domeniul de aplicare se extinde la optimizarea performanței prin profilarea CPU și a memoriei, gestionarea dependențelor modulelor și verificarea integrității, precum și aplicarea principiilor de arhitectură software precum inversarea dependenței. Examinează în continuare comportamentul polimorf al sistemului de tipuri și internele gestionării automate a memoriei.
Describes how Go manages growable collections through slice initialization and capacity expansion.