Conex – single-header C++20 library for condition-based binary pattern matching
Conex is a C++20 library designed for condition-based binary pattern matching, allowing users to define match conditions using lambdas instead of hard-coded byte signatures. It provides a flexible syntax for specifying patterns and includes functions for scanning binary data to find matches. The library requires C++20 and has no dependencies beyond the standard library, making it easy to integrate into projects.
- ▪Conex allows for semantic matching of binary patterns using lambda functions.
- ▪The library supports various pattern syntaxes and quantifiers for flexible matching.
- ▪It includes functions to search for the first match or all non-overlapping matches in a binary blob.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/DanielCohen197/Conex |
| Publication time | Wed, 20 May 2026 14:54:52 +0000 |
| Retrieval time | 2026-05-20T15:05:02.641Z |
| Last seen | 2026-05-20T15:05:02.641Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 8FQ0Xbwnb9Tu |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Conex Binary pattern matching usually means hard-coded byte signatures. Conex lets you express match conditions as lambdas instead — find structures by semantics, not magic bytes. auto result = conex::search_first(blob, "(c0:4)(c1:8)*", [](std::span<const uint8_t> s) { /* signature check */ }, [](std::span<const uint8_t> s) { /* page-aligned address */ } ); Requirements C++20 or later No dependencies beyond the standard library Installation Copy Include/conex.hpp into your project and include it.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.