5 مستودعات
Growable byte buffers that treat data as queues to avoid memory copying.
Distinct from In-Memory Byte Stream Processing: Specifically focuses on the mutable, queue-like nature of buffers rather than general in-memory processing.
Explore 5 awesome GitHub repositories matching operating systems & systems programming · Mutable Byte Buffers. Refine with filters or upvote what's useful.
Okio is a Java I/O library providing a set of tools for efficient byte-stream processing and file system operations. It functions as a buffered byte stream handler and streaming data transformer, utilizing a cross-platform file system API to manage data movement. The project is distinguished by its use of pooled mutable byte buffers that treat sequences as queues to reduce memory copying and garbage collection churn. It further decouples file operations from the host operating system through an abstraction-based file system, allowing for consistent path manipulation and atomic operations acro
Manages bytes as growable queues to significantly reduce memory copying and GC churn during I/O.
rustls is a modern implementation of the Transport Layer Security protocol written in the Rust programming language. It serves as a cryptographic transport layer for establishing encrypted connections between clients and servers to ensure data privacy and integrity. The library features a pluggable crypto provider framework, allowing the substitution of cryptographic primitive implementations to meet specific platform architecture or regulatory compliance requirements. It provides capabilities for secure server configuration to handle encrypted incoming connections and secure client connecti
Implements mutable byte buffers to handle network streams and minimize memory copying.
The Rust RFCs repository is the formal home for the Rust language evolution process, housing the structured design documents and community review mechanisms that govern changes to the Rust programming language, its compiler, and its standard library. It defines the complete lifecycle for proposing, discussing, and implementing substantial changes through RFC documents, from initial submission and community feedback through final comment periods and sub-team sign-offs. The repository codifies the governance and collaboration processes that shape Rust's development, including mechanisms for com
Defines the read_exact method on the Read trait for guaranteed buffer filling.
Janet هي لغة برمجة ديناميكية قائمة على Lisp تتميز بآلة افتراضية bytecode قائمة على السجلات ومحرك برمجة نصية قابل للتضمين. تعمل كوقت تشغيل تزامن قائم على الألياف (fiber) وتتضمن محرك تحليل قائماً على قواعد التعبير التحليلي (Parsing Expression Grammars). يتميز المشروع بقدرته على الاندماج في تطبيقات C أو C++ عبر واجهة رأس (header) بسيطة. يستخدم نظام ماكرو على طراز Lisp لتحويل الكود في وقت التجميع ويستخدم وراثة الجدول القائمة على النموذج (prototype-based) للسلوك الموجه للكائنات. يغطي وقت التشغيل مجموعة واسعة من القدرات، بما في ذلك إدارة IO غير المتزامنة من خلال حلقة أحداث غير محظورة، وتوافقية المكتبة الأصلية عبر واجهة دالة خارجية، ومعالجة نصوص شاملة باستخدام قواعد PEG. كما يوفر أدوات لأتمتة النظام، مثل حلقة القراءة-التقييم-الطباعة (REPL)، ونظام وحدة لحل الرموز، وأدوات مساعدة لاتصال مقبس الشبكة وإدارة نظام الملفات. تتضمن البيئة أدوات تشخيص لتصحيح أخطاء تنفيذ الـ bytecode ويمكنها تجميع كود المصدر في ملفات تنفيذية ثنائية مستقلة.
Provides growable byte buffers to store and modify sequences of bytes representing binary data.
Kotlinx-io is a multiplatform library designed for input and output operations, providing a unified interface for streaming data, managing byte buffers, and interacting with local filesystems. It serves as a cross-platform abstraction layer that standardizes how applications handle data movement across different operating systems and hardware architectures. The library distinguishes itself by providing high-performance tools for both mutable and immutable byte sequences. It utilizes segmented memory pools and direct memory access to minimize allocation overhead and prevent unnecessary data co
Modifies dynamic byte sequences using efficient memory segments to reduce allocation overhead.