Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r72444 - in sandbox/bloom_filter/trunk: boost doc libs/bloom_filter/doc/txt
From: cpp.cabrera_at_[hidden]
Date: 2011-06-06 16:38:01

Author: alejandro
Date: 2011-06-06 16:38:00 EDT (Mon, 06 Jun 2011)
New Revision: 72444

Removed empty doc directory at root level. Moved README from boost directory to libs/bloom_filter/doc/txt/.

      - copied unchanged from r72442, /sandbox/bloom_filter/trunk/boost/README

Deleted: sandbox/bloom_filter/trunk/boost/README
--- sandbox/bloom_filter/trunk/boost/README 2011-06-06 16:38:00 EDT (Mon, 06 Jun 2011)
+++ (empty file)
@@ -1,38 +0,0 @@
-===== Compression =====
-(Lossless) Compression policies to investigate:
-- LZ (Lempel-Ziv), e.g., DEFLATE
-- LZR (LZ-Renau), Zip
-- LZX, MSFT Cab format
-- Burrows-Wheeler
-- check wiki page on compression
-A compression policy looks as below:
-template <size_t Size>
-struct CompressionPolicy {
- size_t compress(const char *const in, char *out, const size_t insize);
- void decompress(const char *const in, char *out, const size_t insize);
-compress() returns the size of the data when compressed.
-Since compress and decompress will only ever used in association
-with the bits of a Bloom filter, the Size parameter can be embedded in
-the policy template. This represents the uncompressed size of the Bloom
-===== Deleting Variants =====
-Deletion should not be embedded as a policy. Inherently,
-Bloom filters that use a deletion policy have different data layouts.
-For example, Scalable Bloom filters must be grown to always satisfy
-the desired false positive rate. There are also Counting Bloom filters,
-that instead of storing a bit array, require storing an array of 3-4 bit
-A few deleting variants:
-- Scalable Counting Bloom filter
-- Counting Bloom filter
-- Bloomier filters
--Alejandro Cabrera

Boost-Commit list run by bdawes at, david.abrahams at, gregod at, cpdaniel at, john at