toni - npm Package Compare versions

Comparing version 0.4.1 to 0.4.2

lib/toni.js

		/*
		* Toni, a simple and efficient bitmap implementation for (32 bits) positive integer sets
		* (with no element repetition) using bitwise operations and a Buffer. Modifying
		* a single bit instead of an entire byte, obviously saves 87.5% of Buffer space,
		* but it also implies a gain greater than 200% in performances, when it was used
		* with big integer ranges.
		* Toni, a simple and efficient bitmap implementation for positive integer sets
		* (max 32 bits), with no element repetition, using bitwise operations and a Buffer.
		* Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer
		* space, but it also implies a gain greater than 200% in performances, when it was
		* used with big integer ranges.
		*
		@@ -8,0 +8,0 @@ * http://en.wikipedia.org/wiki/Bit_array

package.json

		{
		"name": "toni"
		, "version": "0.4.1"
		, "description": "Toni, a simple and efficient bitmap implementation for (32 bits) positive integer sets (with no element repetition), using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it also implies a gain greater than 200% in performances, for accessing values, when it was used with big integer ranges."
		, "version": "0.4.2"
		, "description": "Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an entire byte, obviously saves 87.5% of Buffer space, but it also implies a gain greater than 200% in performances, for accessing values, when it was used with big integer ranges."
		, "homepage": "https://github.com/rootslab/toni"
		@@ -6,0 +6,0 @@ , "private": false

Readme.md

		@@ -22,8 +22,9 @@ ### Toni

		> __Toni__, a simple and efficient bitmap implementation for (__32 bits__) positive integer sets,
		> __Toni__, a simple and efficient bitmap implementation for positive integer sets (max 32 bits),
		> with no element repetition, using bitwise operations and a Buffer.
		> Modifying a single bit instead of an entire byte, obviously saves __87.5%__ of Buffer space,
		> but it also implies a gain greater than 200% in performances, for accessing values, when it was
		> used with big integer ranges.

		> Modifying a single bit instead of an entire byte, to signal item presence in the current set,
		> obviously saves __87.5%__ of Buffer space, but it also implies a gain greater than __200%__ in
		> performances, for accessing values, when it was used with big integer ranges.

		> See [BitArray](http://en.wikipedia.org/wiki/Bit_array).
		@@ -30,0 +31,0 @@

New alerts