5 مستودعات
Algorithms for identifying all positions of patterns using prefix matching analysis.
Distinct from String Processing Algorithms: Focuses on occurrence location, distinct from general string processing.
Explore 5 awesome GitHub repositories matching software engineering & architecture · Pattern Occurrence Location Algorithms. Refine with filters or upvote what's useful.
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
Implements algorithms for identifying all starting indices of a specific substring within a text.
This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin
Provides algorithms for locating all occurrences of patterns within text.
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
Locates occurrences of patterns within text using efficient algorithms like Rabin-Karp or Knuth-Morris-Pratt.
This project is an algorithm study resource, a centralized LeetCode solution repository, and a technical interview study guide. It provides Chinese translations of textbooks and guides on data structures and algorithms for academic study and professional preparation. The project distinguishes itself by delivering multi-language solution repositories and translated academic materials through a static site generation model. This architecture enables compile-time content translation and offline-first delivery of educational assets as static files. The repository covers a wide range of algorithm
Provides efficient search algorithms to locate the first occurrence of target substrings.
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
Universal Ctags chooses between using line numbers, search patterns, or a combination of both to locate objects.