Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Catalog / kevin-zhong / bits_tree
Public GitHub Catalog Discovered Sep 26, 2026

kevin-zhong / bits_tree

如何最快的求出两个整数集合(每元素大小已知在一定范围内)的交集?一颗bits树,能记录一定范围(范围取决于树的层数)内的整数集合,功能类比set<int>,但内存更小,速度更快;特别是在求交集的时候;

View repository on GitHub ↗ View creator profile Browse directory

About this discovery

This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.

#6577446GitHub System ID
kevin-zhongOrganization / User
PublicVisibility
ActiveCatalog Status

More from kevin-zhong

↗

kevin-zhong/yf_coroutine

已知的史上 功能最强大 的协程库;最大的特点:非侵入的兼容所有的已存在的同步阻塞库--例如mysql,memcache客户端;用阻塞的方式写socket程序!!新概念少,直接采用现有的socket api,使用异常简单;

Discovered
FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.