5 مستودعات
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 هي لغة برمجة ديناميكية قائمة على Lisp تتميز بآلة افتراضية bytecode قائمة على السجلات ومحرك برمجة نصية قابل للتضمين. تعمل كوقت تشغيل تزامن قائم على الألياف (fiber) وتتضمن محرك تحليل قائماً على قواعد التعبير التحليلي (Parsing Expression Grammars). يتميز المشروع بقدرته على الاندماج في تطبيقات C أو C++ عبر واجهة رأس (header) بسيطة. يستخدم نظام ماكرو على طراز Lisp لتحويل الكود في وقت التجميع ويستخدم وراثة الجدول القائمة على النموذج (prototype-based) للسلوك الموجه للكائنات. يغطي وقت التشغيل مجموعة واسعة من القدرات، بما في ذلك إدارة IO غير المتزامنة من خلال حلقة أحداث غير محظورة، وتوافقية المكتبة الأصلية عبر واجهة دالة خارجية، ومعالجة نصوص شاملة باستخدام قواعد PEG. كما يوفر أدوات لأتمتة النظام، مثل حلقة القراءة-التقييم-الطباعة (REPL)، ونظام وحدة لحل الرموز، وأدوات مساعدة لاتصال مقبس الشبكة وإدارة نظام الملفات. تتضمن البيئة أدوات تشخيص لتصحيح أخطاء تنفيذ الـ bytecode ويمكنها تجميع كود المصدر في ملفات تنفيذية ثنائية مستقلة.
Provides growable collections with indexed access for storing data dynamically.
This project is a technical programming guide and educational resource focused on Go internals, runtime mechanisms, and advanced language features. It provides detailed conceptual analysis of the language's execution model, including its scheduler, memory escape analysis, and garbage collection mechanisms. The material distinguishes itself through deep dives into high-concurrency system design, exploring the implementation of worker pools and communication channels. It also covers low-level network programming with a focus on I/O multiplexing and TCP state management, alongside a study of dis
Describes how Go manages growable collections through slice initialization and capacity expansion.