awesome-repositories.com
Blog
MCP
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·
bits-and-blooms avatar

bits-and-blooms/bitset

0
View on GitHub↗
1,505 Stars·189 Forks·Go·BSD-3-Clause·3 Aufrufebits-and-blooms.github.io/bitset↗

Bitset

Go package implementing bitsets

Features

  • Data Structures - Standard bitset implementation.
  • Data Structures - Bitset implementation.

Star-Verlauf

Star-Verlauf für bits-and-blooms/bitsetStar-Verlauf für bits-and-blooms/bitset

KI-Suche

Entdecke weitere awesome Repositories

Beschreibe in einfachen Worten, was du brauchst — die KI bewertet tausende kuratierte Open-Source-Projekte nach Relevanz.

Start searching with AI

Open-Source-Alternativen zu Bitset

Ähnliche Open-Source-Projekte, sortiert nach der Anzahl der gemeinsamen Funktionen mit Bitset.
  • arximboldi/immerAvatar von arximboldi

    arximboldi/immer

    2,854Auf GitHub ansehen↗

    Postmodern immutable and persistent data structures for C++ — value semantics at scale

    C++
    Auf GitHub ansehen↗2,854
  • bits-and-blooms/bloomAvatar von bits-and-blooms

    bits-and-blooms/bloom

    2,791Auf GitHub ansehen↗

    Go package implementing Bloom filters, used by many important systems

    Go
    Auf GitHub ansehen↗2,791
  • alandefreitas/smallAvatar von alandefreitas

    alandefreitas/small

    150Auf GitHub ansehen↗

    C++ small containers

    C++
    Auf GitHub ansehen↗150
  • cameron314/concurrentqueueAvatar von cameron314

    cameron314/concurrentqueue

    12,070Auf GitHub ansehen↗

    ConcurrentQueue is a header-only C++ template library that provides a lock-free data structure for multi-producer multi-consumer thread communication. It functions as a synchronization primitive designed to coordinate data flow between concurrent execution units using atomic operations rather than traditional mutex locking. The library distinguishes itself through a design that minimizes contention and synchronization overhead. It utilizes sub-queue token mapping to distribute workloads across partitioned internal queues and supports bulk operations to transfer multiple data elements in singl

    C++
    Auf GitHub ansehen↗12,070
Alle 30 Alternativen zu Bitset anzeigen→

Häufig gestellte Fragen

Was macht bits-and-blooms/bitset?

Go package implementing bitsets

Was sind die Hauptfunktionen von bits-and-blooms/bitset?

Die Hauptfunktionen von bits-and-blooms/bitset sind: Data Structures.

Welche Open-Source-Alternativen gibt es zu bits-and-blooms/bitset?

Open-Source-Alternativen zu bits-and-blooms/bitset sind unter anderem: bits-and-blooms/bloom — Go package implementing Bloom filters, used by many important systems. deckarep/golang-set — This project is a set theory library for Go that provides a data structure for storing unique elements of any… alandefreitas/small — C++ small containers. arximboldi/immer — Postmodern immutable and persistent data structures for C++ — value semantics at scale. cameron314/concurrentqueue — ConcurrentQueue is a header-only C++ template library that provides a lock-free data structure for multi-producer… facebook/immutable-js — This is a persistent data structure library for JavaScript that provides collections which prevent the direct mutation…