A super-fast C++ hash table with Node.js wrapper. 

jhuckaby

megahash

Error

Ignore

Warn

License

Maintenance

Miscellaneous

Quality

Supply chain risk

Vulnerability

Admins only

Organization members

Dashboard

<upgradeLink>Upgrade</upgradeLink> to access this feature

About

Blog

Socket CLI

Customers

Socket Dependency Search

Docs

Socket for GitHub

Love

Impersonation Mode Active

Update your browser to the latest version for the best experience.

Your web browser is outdated

Use another browser for the best experience.

Your web browser is unsupported

{{count, number}} commits last two months

{{count, number}} critical severity alert

{{count, number}} critical severity alerts

{{count, number}} dependency vulnerability

{{count, number}} dependency vulnerabilities

{{count, number}} development dependencies

{{count, number}} transitive dependencies

{{count, number}} version published last month

{{count, number}} versions published last month

{{count, number}} version published in last two months

{{count, number}} versions published in last two months

{{count, number}} version published last week

{{count, number}} versions published last week

{{count, number}} version published last year

{{count, number}} versions published last year

Socket undergoes annual SOC2 Type II audits. Socket customers can request a copy of the full SOC2 Type II report.

Allows organization owners and admins to access detailed records of actions taken by members of their organization, complete with timestamps.

Prevent compromised packages from infiltrating your supply chain by monitoring for changes in real-time.

Join our Discord community to get help from Socket engineers and other Socket users.

Compare millions of open source packages on socket.dev

Detect malicious code and risky behavior (e.g. network) in your dependencies using "deep package inspection"

All data is encrypted in transit and at rest using industry standard encryption algorithms.

Get a dedicated Socket account manager and access to Socket’s Customer Success team.

Get dedicated support from Socket engineers via email and Slack.

"Shift left" with the Socket Chrome extension and give intervene early, before developers choose risky or low quality dependencies.

Catch developers using risky dependencies and give them a "speed bump" to encourage good behavior

Install the Socket GitHub app to receive real-time dependency scanning and reports with every pull request.

Integrate Socket into your GitHub SCM to prevent risky dependencies from being installed.

Socket scans for vulnerabilities in your dependencies, including CVEs, security advisories, and more.

Socket supports dependencies in many languages, with most popular ecosystems coming in 2024. We've got you covered no matter what languages you use.

Enforce license policies across your organization

Receive a Microsoft Teams message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Get help migrating from Socket's free plan to Socket's paid plans.

Run Socket on-premises or in your own cloud environment.

Query for any dependency (at any version) across your entire organization

Integrate Socket into your CI/CD pipeline to prevent risky dependencies from being deployed to production.

Analyze an entire project to find supply chain risks

Tag projects to organize and filter your projects

Restrict access based on the roles of individual users within an organization.

Receive a Slack message to the channel of your choice anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket is SOC2 Type II compliant and undergoes annual audits.

The Socket CLI allows teams to prevent risky dependencies from being installed, and to get dependency insights from the command line.

Socket supports SAML SSO for single sign-on and identity management.

Integrate Socket into your VS Code IDE to prevent risky dependencies from being installed.

Get a POST request anytime Socket runs a new analysis, has a new finding, or a policy has changed.

Socket will analyzed your SBOMs up to a maximum number of dependencies.

API that allows you to analyze a project, lookup package scores and alerts, and more.

Create API tokens to authenticate with the Socket API and CLI.

The number of developers in your team. A developer is someone who made a commit to your organization's repositories scanned by Socket in the past month.

Use Socket to protect your private repositories.

Socket is always free for open source projects.

Socket retains all reporting data for 3 months, 1 year, or a custom term of your choice.

Access the threat feed that powers Socket.

Unlimited scale, self-hosting, and priority support for large teams.

For open-source projects, individuals, and small teams.

For growing teams with enhanced scale, security, and support.

There is a package with a similar name that is downloaded much more often.

There are packages with similar names that are downloaded much more often.

This may not be the package you want!

Instance

Alert Locations

Package

The {{ecosystem}} package {{- packageName}} receives a total of <strong>{{numWeeklyDownloadCount, number}}</strong> weekly downloads. As such, {{- packageName}} popularity was classified as <strong>{{popularity}}</strong>.

Is {{- packageName}} popular?

Is {{- packageName}} safe to use?

Is {{- packageName}} well maintained?

What is {{- packageName}}?

{{packageDescription}}Version: {{versionString}} was published by {{publisherName}}. Start using Socket to analyze {{- packageName}} and its {{dependencyCount, number}} dependencies to secure your app from supply chain attacks.

Sorry, it seems this package was removed from the registry

Package was removed

This package version has been unpublished, mostly likely due to security reasons

Package version was removed

Provide a detailed description of the malware...

Socket fights vulnerabilities and provides visibility, defense-in-depth, and proactive supply chain protection for JavaScript, Python, and Go dependencies.

Socket - Secure your dependencies. Ship with confidence.

Compare versions

{{- packageName}} - npm Package Compare versions

	"description": "A super-fast C++ hash table with Node.js wrapper.",

	"author": "Joseph Huckaby <jhuckaby@gmail.com>",

	"homepage": "https://github.com/jhuckaby/megahash",

		"url": "https://github.com/jhuckaby/megahash"

		"url": "https://github.com/jhuckaby/megahash/issues"

// Simple benchmarking script for MegaHash

var metrics_log_file = args.metrics || false;

	print("Writing metrics to log: " + metrics_log_file + "\n");

	if (fs.existsSync(metrics_log_file)) fs.unlinkSync(metrics_log_file);

print("\nMax Keys: " + Tools.commify(MAX_KEYS) + "\n");

print("Max Reads: " + Tools.commify(MAX_READS) + "\n");

	key = '' + idx; //  + Tools.digestHex( "SALT_7fb1b7485647b1782c715474fba28fd1" + idx, 'md5' ).substring( idx % 8 );

	// value = Tools.digestHex( key, "sha512" ).substring( idx % 32 );

	// print("Writing key " + idx + ": " + key + " (" + value.length + " value len)\n");

	value = 'b66f91437d85f726506c3e14b56b3ef474f9e8e5af623f110775d999cc3a46150e20d307201d696a40fe39347576d51d229e8661cef8aa70aa6d45d5b3e49aef'.substring( idx % 32 );

	dataBytes += keyBuf.length + valueBuf.length;

	if (idx && (idx % METRICS_EVERY == 0)) {

		iter_per_sec = Math.floor( METRICS_EVERY / ((now - last_report) / 1000) );

		print("Total Keys: " + Tools.commify(idx) + ", Writes/sec: " + Tools.commify(iter_per_sec) + ", Memory: " + Tools.getTextFromBytes(mem.rss) + "\n");

		if (metrics_log_file) fs.appendFileSync( metrics_log_file, JSON.stringify({

var elapsed = Tools.timeNow() - time_start;

print("Overall writes/sec: " + Tools.commify( Math.floor(MAX_KEYS / elapsed) ) + "\n");

print("Raw Data Size: " + Tools.getTextFromBytes(dataBytes) + " (" + Tools.commify(dataBytes) + " bytes)\n");

for (var idx = 0; idx < MAX_READS; idx++) {

	var ridx = Math.floor( Math.random() * MAX_KEYS );

	key = '' + ridx; //  + Tools.digestHex( "SALT_7fb1b7485647b1782c715474fba28fd1" + ridx, 'md5' ).substring( ridx % 8 );

	// var value = Tools.digestHex( key, "sha512" ).substring( ridx % 32 );

	if (!buf) die("Failed to fetch key " + idx + ": " + key);

	// if (buf.toString() != value) die("Value " + idx + " does not match: " + key + "\n");

		print("Reads/sec: " + Tools.commify(iter_per_sec) + ", Memory: " + Tools.getTextFromBytes(mem.rss) + "\n");

print("Overall reads/sec: " + Tools.commify( Math.floor(MAX_READS / elapsed) ) + "\n");

print("Index Size: " + Tools.getTextFromBytes(stats.indexSize) + " (" + Tools.commify(stats.indexSize) + " bytes)\n");

print("Meta Size: " + Tools.getTextFromBytes(stats.metaSize) + " (" + Tools.commify(stats.metaSize) + " bytes)\n");

print("Data Size: " + Tools.getTextFromBytes(stats.dataSize) + " (" + Tools.commify(stats.dataSize) + " bytes)\n");

print("Total Overhead: " + Tools.getTextFromBytes(stats.indexSize + stats.metaSize) + "\n");

print("Number of Indexes: " + Tools.commify(stats.numIndexes) + "\n");

print("Number of Buckets: " + Tools.commify(stats.numKeys) + "\n");

		mem[key] = Tools.getTextFromBytes(mem[key]);

	print( "Memory Report: " + JSON.stringify(mem) + "\n" );

			test.ok(stats.numKeys === 1, '1 key in stats');

			test.ok(stats.numIndexes === 1, '1 index in stats');

			test.ok(stats.dataSize === 10, '10 bytes in data store');

			test.ok(stats.indexSize > 0, 'Index size is non-zero');

			test.ok(stats.metaSize > 0, 'Meta size is non-zero');

			test.ok(value === "there", 'Basic string set/get');

			test.ok(value === "😃", 'Unicode value set/get');

			test.ok(value === "there", 'Unicode key set/get');

				test.ok( !!err, "Expected error with zero-length key (set)" );

				test.ok( !!err, "Expected error with zero-length key (get)" );

				test.ok( !!err, "Expected error with zero-length key (has)" );

				test.ok( !!err, "Expected error with zero-length key (remove)" );

			hash.set("hello", Buffer.from("there"));

			test.ok( Buffer.isBuffer(value), "Value is buffer" );

			test.ok( value.toString() === "there", 'Buffer set/get');

			test.ok(value === "there", 'Correct value with buffer key');

			test.ok( !!hash.remove("key1"), "remove returned true for good key" );

			test.ok( !hash.remove("key3"), "remove returned false for missing key" );

			test.ok( !hash.has("key1"), "Key1 was removed" );

			test.ok( hash.has("key2"), "Key2 is still there" );

			for (var idx = 0; idx < 1000; idx++) {

				hash.set( "key" + idx, "value here " + idx );

			for (var idx = 0; idx < 1000; idx += 2) {

				var result = hash.has( "key" + idx );

				// test.debug( '' + idx + ": " + result + "\n" );

				test.ok( (idx % 2 == 0) ? !result : result, "Odd keys should exist, even keys should not" );

			test.ok( stats.numKeys == 500, "500 keys remain" );

			test.ok(stats.numKeys === 0, '0 keys in stats: ' + stats.numKeys);

			test.ok(stats.dataSize === 0, '0 bytes in data store: ' + stats.dataSize);

			test.ok(stats.metaSize === 0, '0 bytes in meta store: ' + stats.metaSize);

			test.ok(stats.numKeys === 0, '0 keys in stats');

			test.ok(stats.dataSize === 0, '0 bytes in data store');

			var lastNumKeys = hash.stats().numKeys;

				test.ok( numKeys <= lastNumKeys, "numKeys is dropping" );

			test.ok(stats.numIndexes === 1, '1 index in stats: ' + stats.numIndexes);

			test.ok( !!key, "Got key from nextKey" );

			test.ok( key.match(/^(key1|key2)$/), "Key is one or the other" );

			test.ok( !!key, "Got another key from nextKey" );

			test.ok( !key, "Nothing after 2nd key, end of list" );

				test.ok( !allKeys.has(key), "Key is unique" );

			test.ok( idx == 1000, "Iterated exactly 1000 times: " + idx );

		function testKeyIterationRemoval500(test) {

				test.ok( key.match(/^key\d*[13579]$/), "Key is odd: " + key );

			test.ok( idx == 500, "Iterated exactly 500 times: " + idx );

			for (var idx = 0; idx < 10000; idx++) {

			test.ok( idx == 10000, "Iterated exactly 10000 times: " + idx );

		function testKeyIterationRemoval5000(test) {

			for (var idx = 0; idx < 10000; idx += 2) {

			test.ok( !key, "nextKey found nothing with missing key" );

			// add enough keys so we trigger at least one reindex

					test.ok( false, "Key " + idx + " does not match spec after reindex: " + value );

			test.ok(stats.numKeys === 10000, 'Correct keys in stats: ' + stats.numKeys);

			test.ok(stats.numIndexes > 1, 'More indexes in stats: ' + stats.numIndexes);

		{
		"name": "megahash",
		"version": "1.0.1",
		"version": "1.0.2",
		"description": "A super-fast C++ hash table with Node.js wrapper.",
		@@ -5,0 +5,0 @@ "author": "Joseph Huckaby <jhuckaby@gmail.com>",

		@@ -19,5 +19,5 @@ // Simple benchmarking script for MegaHash

		const MAX_KEYS = 8000000;
		const MAX_READS = 2000000;
		const METRICS_EVERY = 100000;
		const MAX_KEYS = 100000000;
		const MAX_READS = 4000000;
		const METRICS_EVERY = 1000000;

		@@ -24,0 +24,0 @@ print("\nMax Keys: " + Tools.commify(MAX_KEYS) + "\n");

		@@ -217,4 +217,6 @@ // Unit tests for MegaHash
		hash.set("key2", "value2");
		hash.remove("key1");

		test.ok( !!hash.remove("key1"), "remove returned true for good key" );
		test.ok( !hash.remove("key3"), "remove returned false for missing key" );

		test.ok( !hash.has("key1"), "Key1 was removed" );
		@@ -289,3 +291,3 @@ test.ok( hash.has("key2"), "Key2 is still there" );
		var lastNumKeys = hash.stats().numKeys;
		for (var idx = 0; idx < 16; idx++) {
		for (var idx = 0; idx < 256; idx++) {
		hash.clear(idx);
		@@ -298,5 +300,5 @@ var numKeys = hash.stats().numKeys;
		var stats = hash.stats();
		test.ok(stats.numKeys === 0, '0 keys in stats');
		test.ok(stats.dataSize === 0, '0 bytes in data store');
		test.ok(stats.numIndexes === 1, '1 index in stats');
		test.ok(stats.numKeys === 0, '0 keys in stats: ' + stats.numKeys);
		test.ok(stats.dataSize === 0, '0 bytes in data store: ' + stats.dataSize);
		test.ok(stats.numIndexes === 1, '1 index in stats: ' + stats.numIndexes);

		@@ -429,2 +431,13 @@ test.done();

		function testKeyIterationBad(test) {
		var hash = new MegaHash();
		hash.set("key1", "value1");
		hash.set("key2", "value2");

		var key = hash.nextKey("key3");
		test.ok( !key, "nextKey found nothing with missing key" );

		test.done();
		},

		function testReindex(test) {
		@@ -431,0 +444,0 @@ // add enough keys so we trigger at least one reindex

Improved metrics