SaaSHub helps you find the best software and product alternatives Learn more →
Folly Alternatives
Similar projects and alternatives to Folly
-
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
-
-
parallel-hashmap
A family of header-only, very fast and memory-friendly hashmap and btree containers.
-
-
xz
Discontinued XZ Utils [GET https://api.github.com/repos/tukaani-project/xz: 403 - Repository access blocked]
-
-
t-digest
A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
-
-
-
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a better Folly alternative or higher similarity.
Folly discussion
Folly reviews and mentions
Posts with mentions or reviews of Folly.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2024-06-09.
-
Compilers Are (Too) Smart
Easily solved manually reserving exponentially. All my projects use some variation of this: https://github.com/facebook/folly/blob/9f125c94e10fd01f5567c...
But I've burned myself on this a few times before.
-
Intel's Lion Cove Architecture Preview
Modern hash table implementations use vector instructions for lookups:
- Folly: https://github.com/facebook/folly/blob/main/folly/container/...
- Abseil: https://abseil.io/about/design/swisstables
-
Ask HN: How bad is the xz hack?
https://github.com/facebook/folly/commit/b1391e1c57be71c1e2a...
-
Backdoor in upstream xz/liblzma leading to SSH server compromise
https://github.com/facebook/folly/pull/2153
-
A lock-free ring-buffer with contiguous reservations (2019)
To set a HP on Linux, Folly just does a relaxed load of the src pointer, release store of the HP, compiler-only barrier, and acquire load. (This prevents the compiler from reordering the 2nd load before the store, right? But to my understanding does not prevent a hypothetical CPU reordering of the 2nd load before the store, which seems potentially problematic!)
Then on the GC/reclaim side of things, after protected object pointers are stored, it does a more expensive barrier[0] before acquire-loading the HPs.
I'll admit, I am not confident I understand why this works. I mean, even on x86, loads can be reordered before earlier program-order stores. So it seems like the 2nd check on the protection side could be ineffective. (The non-Linux portable version just uses an atomic_thread_fence SeqCst on both sides, which seems more obviously correct.) And if they don't need the 2nd load on Linux, I'm unclear on why they do it.
[0]: https://github.com/facebook/folly/blob/main/folly/synchroniz...
(This uses either mprotect to force a TLB flush in process-relevant CPUs, or the newer Linux membarrier syscall if available.)
-
Appending to an std:string character-by-character: how does the capacity grow?
folly provides functions to resize std::string & std::vector without initialization [0].
[0] https://github.com/facebook/folly/blob/3c8829785e3ce86cb821c...
-
Can anyone explain feedback of a HFT firm regarding implementation of SPSC lock-free ring-buffer queue?
My implementation was quite similar to Boost's spsc_queue and Facebook's folly/ProducerConsumerQueue.h.
-
A Compressed Indexable Bitset
> How is that relevant?
Roaring bitmaps and similar data structures get their speed from decoding together consecutive groups of elements, so if you do sequential decoding or decode a large fraction of the list you get excellent performance.
EF instead excels at random skipping, so if you visit a small fraction of the list you generally get better performance. This is why it works so well for inverted indexes, as generally the queries are very selective (otherwise why do you need an index?) and if you have good intersection algorithms you can skip a large fraction of documents.
I didn't follow the rest of your comment, select is what EF is good at, every other data structure needs a lot more scanning once you land on the right chunk. With BMI2 you can also use the PDEP instruction to accelerate the final select on a 64-bit block: https://github.com/facebook/folly/blob/main/folly/experiment...
-
Defer for Shell
C++ with folly's SCOPE_EXIT {} construct:
https://github.com/facebook/folly/blob/main/folly/ScopeGuard...
-
Is there any facebook/folly community for discussion and Q&A?
Seems like github issues taking a long time to get any response: https://github.com/facebook/folly
-
A note from our sponsor - SaaSHub
www.saashub.com | 15 Jun 2024
Stats
Basic Folly repo stats
92
27,319
9.8
3 days ago
facebook/folly is an open source project licensed under Apache License 2.0 which is an OSI approved license.
The primary programming language of Folly is C++.
Sponsored
Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com