Awesome GitHub RepositoriesRecursive Structure Traversers

Python Fire is a library that automatically generates command line interfaces from any Python object, function, or class. It removes the need for manual argument parsing by mapping Python dictionaries, lists, and classes directly to terminal commands. The tool converts Python docstrings into formatted terminal help screens and produces shell scripts to enable tab-completion for available commands. It can wrap existing libraries or external modules to expose their functionality via the terminal without requiring modifications to the original source code. The library supports hierarchical comm

SwiftyJSON is a Swift JSON parsing library and data wrapper designed to simplify the reading and manipulation of JSON structures. It provides a toolkit for converting raw JSON strings into structured formats without requiring manual type casting or optional chaining for every value. The library focuses on simplifying nested data extraction through subscript-based value access and recursive data resolution. It ensures optional-safe value retrieval by returning default empty values instead of crashing when encountering missing keys or out-of-bounds array indices. The project includes capabilit

This project is a static code analysis tool and local-first code indexer that builds a persistent dependency graph of functions, classes, and imports. It functions as an AI context optimizer and codebase dependency graph, designed to reduce token usage by providing AI assistants with only the most relevant code fragments and impact analysis for a given change. The system implements a Model Context Protocol server that exposes code intelligence and architectural graph queries to external AI coding tools. It distinguishes itself by computing the change blast radius and risk scores of modificati

Photon is a command-line web crawler designed for security reconnaissance and information gathering. It systematically traverses websites to discover URLs, map domain infrastructure, and identify associated subdomains by retrieving DNS records. The tool distinguishes itself through its ability to perform deep content analysis, including the extraction of sensitive data such as API keys and authentication tokens using user-defined regular expressions. It supports offline inspection by cloning crawled web content to the local filesystem, allowing for structural analysis without additional netwo

This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

This project is an open-source 3D game engine designed for building high-fidelity games, simulations, and cinematic environments. It functions as a robotics simulation platform with native integration for ROS 2 to model robot controllers and sensors. The engine features a multi-threaded Forward+ physically based renderer that supports hardware-accelerated ray tracing and global illumination. The system is built on a modular extension architecture using Gems to add or replace features without modifying core binaries. It includes a native SDK for AWS cloud integration, enabling IAM authenticati

itsy-bitsy-data-structures is a collection of fundamental computer science data structures implemented in JavaScript. It serves as an educational resource and algorithm study guide, providing simplified code implementations of classic data organization patterns to demonstrate internal logic and usage. The project provides clear and concise JavaScript implementations of stacks, queues, and linked lists. These examples are designed for learning, technical interview preparation, and studying the mechanical behavior of core data structures through code. The implementations utilize various comput

MJExtension is a JSON serialization library and model mapping framework used to convert data between JSON strings and structured model objects. It functions as an object data mapper that handles the encoding and decoding of complex object hierarchies for network transmission and storage. The framework is a non-intrusive data mapper that uses reflection and runtime inspection to map raw data strings to application objects. This approach allows for data transformation without requiring base class inheritance, decorators, or extensions to the underlying model classes. The system supports recurs

This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis

Universal Ctags is a multi-language symbol indexer and regex-based parsing engine used to extract and catalog functions, classes, and variables from source code. It functions as a source code indexer that scans files across diverse programming languages to create searchable catalogs of definitions and declarations. The project is distinguished by its extensible parser framework, which allows users to define new language rules using regular expressions and configuration files. It supports complex parsing scenarios through state-based parsing, stack-oriented scope tracking, and guest-parser del

ArduinoJson is a C++ library for parsing and manipulating JSON data and MessagePack binary streams on microcontrollers with limited memory and processing power. It provides the core primitives necessary for embedded data serialization and parsing, enabling devices to exchange structured data over serial or network interfaces. The library is distinguished by its focus on microcontroller memory management, employing strategies such as pool-based allocation, string deduplication, and non-owning string views to minimize RAM usage. It further optimizes for constrained environments by allowing cons

Pry is a programmable Ruby shell, REPL console, and runtime developer environment. It serves as a debugging toolkit for inspecting object state, navigating bindings, and evaluating code within a running Ruby program. The project differentiates itself through advanced introspection and live iteration capabilities. It allows users to inject an interactive console into a running program at specific points to inspect local state and navigate different object scopes. It further enables live code iteration by integrating with external system editors to modify and reload method definitions without r

Object-enumerator is a data structure crawler and enumeration library designed to discover and list all objects stored within deep or circular data references. It functions as a traversal tool that recursively walks through nested arrays and object graphs to identify every individual referenced object. The library flattens complex hierarchical data structures into a linear collection of unique objects. This process enables data structure analysis and memory reference mapping by tracing all objects connected to a root element to understand the overall composition of a data set.

go-spew is a deep inspection library and debugging utility for Go. It functions as a data structure pretty printer that renders complex, nested types into human-readable strings with indentation and type information. The library provides specialized capabilities for visualizing internal program states, including the ability to dump data structures with pointer addresses and map keys. It includes a configuration system to adjust printing behavior, such as limiting recursion depth and setting indentation. The tool uses reflection-based type inspection and recursive tree traversal to handle nes

هذا المشروع عبارة عن مكتبة خوارزميات C# ومجموعة من هياكل البيانات. يعمل كمرجع لعلوم الحاسب يوفر تطبيقات عملية لأنماط الفرز، والبحث، واجتياز الرسوم البيانية الكلاسيكية. تتضمن المكتبة مجموعة أدوات معالجة نصوص مخصصة لتحليل تشابه النصوص، وحساب مسافات التحرير، وإدارة عمليات البحث القائمة على البادئة. كما تتميز بتطبيق لنظرية الرسوم البيانية لنمذجة علاقات الشبكة وحساب أقصر المسارات. يغطي الكود المصدري مجموعة واسعة من القدرات، بما في ذلك إدارة المجموعات الخطية والهرمية، ومعالجة وتصور بيانات الأشجار، وحساب المتتاليات الرقمية الرياضية.

Datascript هو مخزن حالة غير قابل للتغيير في الذاكرة ومخزن ثلاثي قائم على المخطط. يدير حالة التطبيق كقاعدة بيانات ذات إصدارات، ويخزن البيانات كحقائق غير قابلة للتغيير تتكون من كيان، وسمة، وقيمة، ومعاملة. يوفر المشروع محرك منطق لتنفيذ استعلامات Datalog مع دعم للربط الضمني، والقواعد العودية، والنفي. كما يتميز بواجهة برمجة تطبيقات سحب تصريحية لاسترجاع رسوم بيانية للكيانات متداخلة بعمق وهياكل بيانات ذات صلة. تفرض قاعدة البيانات سلامة البيانات من خلال قيود مدفوعة بالمخطط وأنواع السمات. تدعم المعاملات الذرية، وبروتوكولات التخزين القابلة للتوصيل للاستمرار، وفهرسة سمات B-tree لتحسين عمليات البحث. تم تصميم النظام للاستخدام داخل بيئات Clojure وClojureScript وJavaScript.

seL4 is a formally verified microkernel whose C implementation is backed by machine-checked mathematical proofs of correctness, confidentiality, integrity, and availability. It enforces strict isolation between processes through hardware-enforced address space separation and a capability-based access control system, where each process holds explicit rights only to the resources it has been granted. The kernel exposes hardware resources through a minimal API of system calls that manage threads, address spaces, and inter-process communication, with synchronous IPC supporting sender-identifying b

jsondiffpatch هي مكتبة JSON diff وpatch مصممة لحساب الاختلافات بين كائني JSON وتطبيق تلك التغييرات لمزامنة الحالات. تعمل كأداة مزامنة لحساب الفروق (deltas) وتطبيق التصحيحات لتحديث أو استعادة كائنات JavaScript المتداخلة والمعقدة. يوفر المشروع تنفيذاً متوافقاً مع معيار RFC 6902 JSON Patch للتحديثات الذرية ومحرك عرض للاختلافات المرئية يحول فروق البيانات إلى طرق عرض HTML قابلة للقراءة البشرية. يتضمن المشروع أداة نصية للفروق لإجراء تحليل دقيق على مستوى الأحرف للسلاسل الطويلة داخل قيم بيانات JSON. تغطي المكتبة مجموعة واسعة من القدرات بما في ذلك توليد الفروق المتكررة وحساب اختلاف المصفوفات باستخدام خوارزميات Longest Common Subsequence. تدعم المكتبة اختلاف المصفوفات المنطقي لاكتشاف تحركات العناصر عبر التجزئة المخصصة وتوفر خيارات مخرجات بتنسيقات متعددة مثل تنسيق وحدة التحكم الملون ومكون React مخصص للمقارنات المرئية.

Biopython هي مكتبة معلوماتية حيوية لـ Python توفر أدوات لتحليل ومعالجة وتحليل التسلسلات البيولوجية، والهياكل الجزيئية، والأشجار التطورية. تعمل كمحلل للتسلسلات البيولوجية للبيانات الجينومية والبروتينية عبر تنسيقات ملفات متعددة معيارية في الصناعة، وتعمل كواجهة للاستعلام عن البيانات البيولوجية والاقتباسات من مستودعات NCBI Entrez. يتميز المشروع بمجموعات أدوات متخصصة لتحليل بنية البروتين وبناء الأشجار التطورية. يتضمن محلل بنية البروتين لمعالجة ملفات PDB و mmCIF لحساب الهندسة الجزيئية، بالإضافة إلى مجموعة أدوات للأشجار التطورية لتحليل العلاقات التطورية بين الأنواع. تغطي المكتبة مجموعة واسعة من قدرات المعلوماتية الحيوية، بما في ذلك تحليل التسلسل الجينومي للنسخ والترجمة، وإدارة محاذاة التسلسلات، وحسابات الوراثة السكانية. كما توفر أدوات تحليل هيكلية لمعالجة الإحداثيات الذرية ثلاثية الأبعاد، بالإضافة إلى أدوات لتصور الميزات الجينومية ونمذجة البيانات الجغرافية الحيوية. يتكامل النظام مع ملفات المعلوماتية الحيوية الثنائية الخارجية عبر تغليف الأدوات ويدعم تخزين السجلات البيولوجية المستمرة من خلال تخزين التسلسلات المدعوم بـ SQL.

ZLinq is a zero-allocation LINQ library and memory-efficient collection toolkit for C#. It provides a high-performance replacement for standard query operations by using value-type enumerators and pooled memory to eliminate heap allocations and reduce garbage collection overhead. The library features a C# source generator that automatically routes standard query method calls to these zero-allocation implementations. It further accelerates data processing through a SIMD accelerated data library, using hardware vectorization for numeric aggregations and bulk operations on primitive arrays and s