### Ruby Redis Setbit/Getbit Bloom Filter Usage

Source: https://github.com/igrigorik/bloomfilter-rb/blob/master/README.md

Shows how to use a Redis-backed Bloom Filter leveraging `SETBIT` and `GETBIT` commands. This implementation is efficient, fast, and shareable across processes.

```ruby
bf = BloomFilter::Redis.new

bf.insert('test')
bf.include?('test')     # => true
bf.include?('blah')     # => false

bf.delete('test')
bf.include?('test')     # => false
```

--------------------------------

### Ruby Native Bloom Filter Operations

Source: https://github.com/igrigorik/bloomfilter-rb/blob/master/README.md

Demonstrates creating, inserting, checking, deleting, and retrieving statistics for an in-memory Bloom Filter using the native Ruby implementation. It shows basic usage and attribute access.

```ruby
require 'bloomfilter-rb'

bf = BloomFilter::Native.new(:size => 100, :hashes => 2, :seed => 1, :bucket => 3, :raise => false)
bf.insert("test")
bf.include?("test")     # => true
bf.include?("blah")     # => false

bf.delete("test")
bf.include?("test")     # => false

# Hash with a bloom filter!f["test2"] = "bar"f["test2"]             # => truef["test3"]             # => false

bf.stats
# => Number of filter bits (m): 10
# => Number of filter elements (n): 2
# => Number of filter hashes (k) : 2
# => Predicted false positive rate = 10.87%
```

--------------------------------

### Ruby Redis Counting Bloom Filter with TTL

Source: https://github.com/igrigorik/bloomfilter-rb/blob/master/README.md

Demonstrates a Redis-backed counting Bloom Filter that uses regular Redis counters. This implementation supports optional TTL expiry but incurs higher memory overhead due to per-counter keys.

```ruby
bf = BloomFilter::CountingRedis.new(:ttl => 2)

bf.insert('test')
bf.include?('test')     # => true

sleep(2)
bf.include?('test')     # => false
```

=== COMPLETE CONTENT === This response contains all available snippets from this library. No additional content exists. Do not make further requests.