Haskell library for parallel tree search
Star History
Add Live Star History & Verified Badges to README.md
Keep your repository README looking professional and dynamic. As our continuous crawler records new stars, these official SVG badges update in real time with zero maintenance.
Renders your high-resolution star trajectory chart right inside your GitHub README or project docs.
[](https://githubrepo.cloud/repo/sebfisch/parallel-tree-search?utm_source=readme_chart)Compact Shields-style badges for your README header. Shows real-time stars and global ranking.
[](https://githubrepo.cloud/repo/sebfisch/parallel-tree-search?utm_source=readme_badge) [](https://githubrepo.cloud/repo/sebfisch/parallel-tree-search?utm_source=readme_badge) [](https://githubrepo.cloud/repo/sebfisch/parallel-tree-search?utm_source=readme_badge)Momentum
+10
STARS · LAST 30 DAYS
1
PER DAY
#104
MOST-STARRED Haskell
| Window | 7 days | 30 days | 90 days |
|---|---|---|---|
| Stars gained | +0 | +10 | +90 |
| Per day | 1 | 1 | 1 |
| Forks gained | +0 | +3 | +10 |
parallel-tree-search gained 10 stars in the last 30 days, about 1 a day, and now has 2. It is about 18 years old and has averaged roughly 0 stars a year. It ranks #104 among Haskell repositories and #20,966 across all languages on GitHubRepo.
Trending Record
20
DAYS ON TRENDING
#100
BEST RANK
Mar 19, 2009
FIRST APPEARANCE
Active
STATUS TODAY
parallel-tree-search has maintained a continuous presence across global trending indexes, peaking at #100. Below is the 30-day activity profile:
💡 Overview
parallel-tree-search is an open-source project written in Haskell: Haskell library for parallel tree search.
Engineered for speed, consistency, and developer ease, it solves common hurdles in Haskell. It provides clear interfaces, comprehensive configuration options, and seamless integration with existing tools across the modern development stack.
⚡ Key Features
Optimized execution pipeline written in Haskell for predictable speed.
Zero-friction configuration with comprehensive sensible defaults out of the box.
Cross-platform runtime support across Linux, macOS, and Windows environments.
Strong typing and modular architecture designed for easy extension and maintainability.
Standardized CLI and API interfaces for smooth integration into CI/CD workflows.
Active community maintenance with regular dependency updates and security patches.
📥 Installation
$ git clone https://github.com/sebfisch/parallel-tree-search.git
cd parallel-tree-search⚙ System Requirements
Platforms
- • macOS
- • Linux
- • Windows
Runtime & Dependencies
Haskell environment and standard tooling
Architecture
x86_64, ARM64 (Apple Silicon & Graviton)
🧠 How It Works
parallel-tree-search coordinates its core functionality through a modular Haskell pipeline. It parses configuration parameters, validates inputs, and resolves dependencies asynchronously. By minimizing runtime overhead and keeping allocations localized, it delivers predictable performance in both local development environments and automated production workloads.
🎯 Production Use Cases
Production System Integration
Embed parallel-tree-search into Haskell backend services to handle core application logic.
CI/CD Automated Pipelines
Run automated validation, builds, and integration suites during deployments.
Developer Tooling & Workflows
Accelerate developer onboarding with pre-configured project utilities.
Open Source Extension
Fork and customize internal modules under the repository's open NOASSERTION license.
🚀 Getting Started
Install parallel-tree-search using your package manager: `git clone https://github.com/sebfisch/parallel-tree-search.git`
Initialize your project workspace or configuration file for parallel-tree-search.
Import parallel-tree-search into your codebase or invoke it directly from your terminal.
Execute your test suite or run `parallel-tree-search --help` to verify successful setup.
👍 Strengths
⚠️ Considerations
⇄ Alternatives & Direct Competitors
👥 Who Should Use This
Developers and engineering teams building with Haskell, seeking reliable, tested, and actively maintained tooling for production workloads.
🏆 Nearby in the Rankings
sebfisch/parallel-tree-search is currently ranked #20,966 by stars across every repository tracked on GitHubRepo. These are adjacent projects:
| Rank | Repository | Language | Stars | Action |
|---|---|---|---|---|
| #19,477 | matschaffer/mechaflickr | Ruby | ★ 3 | Compare ↗ |
| #19,477 | gnu-lorien/crapvine | Python | ★ 3 | Compare ↗ |
| #19,477 | francois/fogbugz-svnhook | — | ★ 3 | Compare ↗ |
| #19,477 | anildigital/getfake | Ruby | ★ 3 | Compare ↗ |
| #19,477 | mudge/blankable | Ruby | ★ 3 | Compare ↗ |
| #20,966 | sebfisch/parallel-tree-search This Project | Haskell | ★ 2 | |
| #20,966 | pdsphil/ruby-merlin | Ruby | ★ 2 | Compare ↗ |
| #20,966 | daaku/tempdir | Ruby | ★ 2 | Compare ↗ |
| #20,966 | morgs/poll-builder | Python | ★ 2 | Compare ↗ |
| #20,966 | locusf/monotooth | HTML | ★ 2 | Compare ↗ |
| #20,966 | xman/utility | Shell | ★ 2 | Compare ↗ |
Frequently Asked Questions
What does parallel-tree-search do? +
Haskell library for parallel tree search
What language is parallel-tree-search written in? +
The primary language is Haskell. Topics include: software.
Is parallel-tree-search actively maintained? +
Yes, the last recorded push was on Oct 23, 2020 with 0 open issues being tracked.
How many stars does parallel-tree-search have? +
parallel-tree-search has 2 stars and 1 forks on GitHub.
How does parallel-tree-search rank among GitHub repositories? +
With 2 stars, sebfisch/parallel-tree-search is ranked #20,966 globally across all repositories tracked on GitHubRepo and #104 among Haskell projects.
What license is parallel-tree-search distributed under? +
The repository reports a NOASSERTION license. Always verify the repository LICENSE file for legal terms.
