4 个仓库
Mechanisms to restrict the nesting level of recursive operations to prevent stack overflows.
Distinct from Recursion Depth Limits: The candidates are too specific to filesystems, search crawlers, or deserialization; this is a general architectural constraint for any recursive data processing.
Explore 4 awesome GitHub repositories matching software engineering & architecture · Recursion Depth Limits. Refine with filters or upvote what's useful.
Cppcheck 是一个用于 C 和 C++ 源代码的静态分析工具和检查器,旨在在不执行程序的情况下检测编程错误、内存泄漏和安全违规。它作为一个错误检测引擎和质量保证工具,用于识别并发问题、类型转换错误以及对安全编码标准的合规性。 该项目提供了一个用于选择文件和审查错误的图形用户界面,以及一个用于强制执行命名约定和编码标准的检查器。它支持使用正则表达式创建自定义分析规则,以识别特定的编码模式。 该工具包括增量分析、警告抑制和文件排除功能,以管理大型代码库。它还具有 HTML 报告生成功能,并与 VS Code 等编辑器集成,以便在开发过程中提供错误识别。
Adjusts recursion limits for template and function analysis to balance thoroughness and speed.
recursion-context is a set of PHP utilities for traversing and modifying deep data hierarchies. It provides a recursive variable processor designed to apply transformations across nested arrays and objects while maintaining stability. The project distinguishes itself through a recursion depth controller and reference tracking to prevent infinite loops and memory exhaustion when processing circular data structures. It monitors the level of nesting during traversal to avoid stack overflows. These tools cover hierarchical data transformation and nested data processing, allowing for stateful vis
Provides a mechanism to terminate processing once a maximum nesting depth threshold is reached to prevent stack overflows.
Note: https://github.com/kyegomez/tree-of-thoughts CANNOT replicate paper results.
Configures maximum step counts to prevent infinite loops during multi-step reasoning exploration.
OpenDeepSearch is an autonomous research platform and search orchestration engine that connects large language models with live web data. It functions as an agentic information retrieval tool designed to automate the gathering, structuring, and synthesis of web information to resolve complex queries. The system differentiates itself through iterative multi-hop querying, which allows the agent to execute sequences of dependent searches where previous results refine subsequent requests. It features a semantic reranking pipeline that uses embedding models to prioritize the most relevant content
Implements configurable recursion limits to toggle between fast retrieval and high-accuracy iterative research.