awesome-repositories.com
Blog
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetÀ proposNotre méthodologiePresseServeur MCP
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

5 dépôts

Awesome GitHub RepositoriesPattern Occurrence Location Algorithms

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.

Awesome Pattern Occurrence Location Algorithms GitHub Repositories

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • kodecocodes/swift-algorithm-clubAvatar de kodecocodes

    kodecocodes/swift-algorithm-club

    29,099Voir sur GitHub↗

    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.

    Swiftalgorithmsdata-structuresswift
    Voir sur GitHub↗29,099
  • oi-wiki/oi-wikiAvatar de OI-wiki

    OI-wiki/OI-wiki

    26,176Voir sur GitHub↗

    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.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    Voir sur GitHub↗26,176
  • mission-peace/interviewAvatar de mission-peace

    mission-peace/interview

    11,306Voir sur GitHub↗

    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.

    Java
    Voir sur GitHub↗11,306
  • apachecn/apachecn-algo-zhAvatar de apachecn

    apachecn/apachecn-algo-zh

    11,140Voir sur GitHub↗

    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.

    JavaScriptalgorithmcodingdata-structure
    Voir sur GitHub↗11,140
  • universal-ctags/ctagsAvatar de universal-ctags

    universal-ctags/ctags

    7,229Voir sur GitHub↗

    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.

    Ccode-analysiscode-completioncode-navigation
    Voir sur GitHub↗7,229
  1. Home
  2. Software Engineering & Architecture
  3. String Processing Algorithms
  4. Pattern Occurrence Location Algorithms

Explorer les sous-tags

  • Tag Location ResolutionUsing a combination of line numbers and search patterns to locate a symbol's position after file edits. **Distinct from Pattern Occurrence Location Algorithms:** Distinct from Pattern Occurrence Location Algorithms: this specifically handles the drift of symbols in a file after edits.