KOMIHASH vs C++ B-tree

KOMIHASH

C++ B-tree

Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG

code.google.com DISCONTINUED. You can find some alternatives below.

A template library that implements ordered in-memory containers based on a B-tree data structure. [Apache2]

Compare KOMIHASH and C++ B-tree's popularity and activity

Popularity

2.8

Growing

Activity

6.7

Popularity

2.3

Stable

Activity

0.0

Stable

KOMIHASH		C++ B-tree
	Repository
179	Stars	71
12	Watchers	5
6	Forks	26
4 months ago	Last Commit	almost 10 years ago
	More
C	Language	C
MIT License	License	Apache License 2.0
Containers, Hash Map, Hashing, Hash Functions	Tags	Containers

Interest over time of KOMIHASH and C++ B-tree

Note: It is possible that some search terms could be used in multiple areas and that could skew some graphs.

The line chart is based on worldwide web search for the past 12 months.
If you don't see the graphs
either there isn't enough search volume
or you need to refresh the page

More comparisons

View all 19 Containers libraries

Do not miss the trending C++ projects and news
» Subscribe to our newsletter «

KOMIHASH VS C++ B-tree

Compare KOMIHASH and C++ B-tree's popularity and activity

Interest over time of KOMIHASH and C++ B-tree

More comparisons

KOMIHASH

VS

C++ B-tree