cl-ppcre
ClickHouse
cl-ppcre | ClickHouse | |
---|---|---|
13 | 208 | |
292 | 34,269 | |
0.3% | 1.6% | |
3.7 | 10.0 | |
9 days ago | 3 days ago | |
Common Lisp | C++ | |
BSD 2-clause "Simplified" License | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
cl-ppcre
-
Compile time regular expression in C++
I've never used cl-ppcre myself, but its docs[1] claim that it provides compile-time regexes:
> CL-PPCRE uses compiler macros to pre-compile scanners at load time if possible. This happens if the compiler can determine that the regular expression (no matter if it's a string or an S-expression) is constant at compile time and is intended to save the time for creating scanners at execution time (probably creating the same scanner over and over in a loop).
[1]: https://edicl.github.io/cl-ppcre/
- Ask HN: What are some of the most elegant codebases in your favorite language?
-
sbcl and Let Over Lambda
A few weeks back Xach recommended cl-ppcre which i found educational.
-
-🎄- 2022 Day 1 Solutions -🎄-
For simple string processing, there are some functions in the language, that you can find listed here (for string-specific functions) and here (for more generic sequence-handling functions). For anything involving regular expressions, cl-ppcre is the way, in particular the split and register-groups-bind functions.
-
The unreasonable effectiveness of f-strings and re.VERBOSE
I must have a serious bug in my writing about this, because this was never about regex engines -- it's about literals and domain-specific sublanguages in general. Composing DSL programs by string concatenation is such a famous source of security bugs you see it in top-10 lists. I linked to the very similar example of a PEG parsing DSL.
But any regex engine that can work with a parse tree shows the same principle, e.g. https://edicl.github.io/cl-ppcre/#create-scanner2
-
Adding Space to subst function
Take a look at - https://github.com/edicl/cl-ppcre
-
Common Lisp ASDF maintainer considers resignation
And here's what I believe represents the reality of the situation... Stas was indeed tired of ASDF's changes. Now the nature of what changes to make is a matter of judgement of course, but in this case (I'm thinking of SBCL's bug report request to update ASDF: https://bugs.launchpad.net/sbcl/+bug/1826074), it would be a different matter altogether if the discussion was centered on how best to make the new ASDF work with SBCL, but the thread reads to me like a man who had to put up with too much breakage for the upteenth time. Now, if (for the sake of argument :D) the change was of the necessary kind -- think hardware changes or security issues -- I can still see myself feeling wronged, it's human to do so. Because I don't trust ASDF anymore or I feel as if they (or other people at each step of the process) have not shared enough of the burden. But from the discussions I have read (https://github.com/edicl/cl-ppcre/pull/30) what the ASDF maintainers want to change does not seem unreasonable and they are willing to share the burden. But let us say it's truly a 50/50 deadlock. Well then Linus is right, show us the code, who dares wins. And Stas certainly has enough on his plate. But that's why we must cooperate. You don't have to be a diplomat to know the difference when two people want to work together and when one party wants out. And this setting makes more sense when you read (https://bugs.launchpad.net/sbcl/+bug/1823442) where Stas honestly states he wants nothing more to do with ASDF. I don't think it's unreasonable to surmise there's a bit more going on here than plainly technical issues.
-
Stas has alienated long-time ASDF maintainer Robert Goldman
Could you just direct me to some existing discussions, in order to save time? I already read this one.
-
#"<your literal interpretation here>" (regular expression literals)
I plan to use the regular expressions with a cl-ppcre wrapper, also emulating various clojure regular expression operations. Similar to re21, which doesn't quite support the operations in the way I'd like (or match the clojure operations), and whose regular expression literal syntax is "#//".
ClickHouse
-
We Built a 19 PiB Logging Platform with ClickHouse and Saved Millions
Yes, we are working on it! :) Taking some of the learnings from current experimental JSON Object datatype, we are now working on what will become the production-ready implementation. Details here: https://github.com/ClickHouse/ClickHouse/issues/54864
Variant datatype is already available as experimental in 24.1, Dynamic datatype is WIP (PR almost ready), and JSON datatype is next up. Check out the latest comment on that issue with how the Dynamic datatype will work: https://github.com/ClickHouse/ClickHouse/issues/54864#issuec...
-
Build time is a collective responsibility
In our repository, I've set up a few hard limits: each translation unit cannot spend more than a certain amount of memory for compilation and a certain amount of CPU time, and the compiled binary has to be not larger than a certain size.
When these limits are reached, the CI stops working, and we have to remove the bloat: https://github.com/ClickHouse/ClickHouse/issues/61121
Although these limits are too generous as of today: for example, the maximum CPU time to compile a translation unit is set to 1000 seconds, and the memory limit is 5 GB, which is ridiculously high.
-
Fair Benchmarking Considered Difficult (2018) [pdf]
I have a project dedicated to this topic: https://github.com/ClickHouse/ClickBench
It is important to explain the limitations of a benchmark, provide a methodology, and make it reproducible. It also has to be simple enough, otherwise it will not be realistic to include a large number of participants.
I'm also collecting all database benchmarks I could find: https://github.com/ClickHouse/ClickHouse/issues/22398
-
How to choose the right type of database
ClickHouse: A fast open-source column-oriented database management system. ClickHouse is designed for real-time analytics on large datasets and excels in high-speed data insertion and querying, making it ideal for real-time monitoring and reporting.
-
Writing UDF for Clickhouse using Golang
Today we're going to create an UDF (User-defined Function) in Golang that can be run inside Clickhouse query, this function will parse uuid v1 and return timestamp of it since Clickhouse doesn't have this function for now. Inspired from the python version with TabSeparated delimiter (since it's easiest to parse), UDF in Clickhouse will read line by line (each row is each line, and each text separated with tab is each column/cell value):
-
The 2024 Web Hosting Report
For the third, examples here might be analytics plugins in specialized databases like Clickhouse, data-transformations in places like your ETL pipeline using Airflow or Fivetran, or special integrations in your authentication workflow with Auth0 hooks and rules.
-
Choosing Between a Streaming Database and a Stream Processing Framework in Python
Online analytical processing (OLAP) databases like Apache Druid, Apache Pinot, and ClickHouse shine in addressing user-initiated analytical queries. You might write a query to analyze historical data to find the most-clicked products over the past month efficiently using OLAP databases. When contrasting with streaming databases, they may not be optimized for incremental computation, leading to challenges in maintaining the freshness of results. The query in the streaming database focuses on recent data, making it suitable for continuous monitoring. Using streaming databases, you can run queries like finding the top 10 sold products where the “top 10 product list” might change in real-time.
-
Proton, a fast and lightweight alternative to Apache Flink
Proton is a lightweight streaming processing "add-on" for ClickHouse, and we are making these delta parts as standalone as possible. Meanwhile contributing back to the ClickHouse community can also help a lot.
Please check this PR from the proton team: https://github.com/ClickHouse/ClickHouse/pull/54870
-
1 billion rows challenge in PostgreSQL and ClickHouse
curl https://clickhouse.com/ | sh
-
We Executed a Critical Supply Chain Attack on PyTorch
But I continue to find garbage in some of our CI scripts.
Here is an example: https://github.com/ClickHouse/ClickHouse/pull/58794/files
The right way is to:
- always pin versions of all packages;
What are some alternatives?
sbcl - Mirror of Steel Bank Common Lisp (SBCL)'s official repository
loki - Like Prometheus, but for logs.
one-more-re-nightmare - A fast regular expression compiler in Common Lisp
duckdb - DuckDB is an in-process SQL OLAP Database Management System
aoc2022
Trino - Official repository of Trino, the distributed SQL query engine for big data, formerly known as PrestoSQL (https://trino.io)
advents-of-code - 🎄🎁 Solutions for the yearly advent of code challenges
VictoriaMetrics - VictoriaMetrics: fast, cost-effective monitoring solution and time series database
advent-of-code-2022 - back to rust, except i'll use libs where it makes sense
TimescaleDB - An open-source time-series SQL database optimized for fast ingest and complex queries. Packaged as a PostgreSQL extension.
advent-of-code - All my advent of code projects
datafusion - Apache DataFusion SQL Query Engine