Skip to content

Commit e7aebbb

Browse files
committed
update readme
1 parent bb1795c commit e7aebbb

File tree

2 files changed

+14
-15
lines changed

2 files changed

+14
-15
lines changed

.github/workflows/go.yml

Lines changed: 12 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -2,28 +2,27 @@ name: Go
22

33
on:
44
push:
5-
branches: [ master ]
5+
branches: [master]
66
pull_request:
7-
branches: [ master ]
7+
branches: [master]
88

99
jobs:
10-
1110
build:
1211
runs-on: ${{ matrix.os }}
1312
strategy:
1413
matrix:
15-
os: [ubuntu-latest, macos-latest,windows-latest]
14+
os: [ubuntu-latest, macos-latest]
1615
go-version: ["1.17"]
1716
steps:
18-
- uses: actions/checkout@v2
17+
- uses: actions/checkout@v2
1918

20-
- name: Set up workflow for ${{ matrix.go-version }} on ${{ matrix.os }}
21-
uses: actions/setup-go@v2
22-
with:
23-
go-version: 1.17
19+
- name: Set up workflow for ${{ matrix.go-version }} on ${{ matrix.os }}
20+
uses: actions/setup-go@v2
21+
with:
22+
go-version: 1.17
2423

25-
- name: Build
26-
run: go build -v ./...
24+
- name: Build
25+
run: go build -v ./...
2726

28-
- name: Test
29-
run: go test -v ./...
27+
- name: Test
28+
run: go test -v ./...

readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -12,8 +12,8 @@ A scalable bloom filter allows you to grow the filter beyond the initial filter
1212

1313
### Memory Usage
1414

15-
Bloom filters are space efficient, as they are only storing the bits that are set. For a filter with a capacity of 20,000,000 and a error rate of 0.001, the storage size is approximately 34MB. That implies approx 1.78 bytes (~14 bits) per element.
16-
The number of bits per element is as a result of the number of hash functions derived from the capacity and the error rate.
15+
Bloom filters are space efficient, as they only store the bits that are set. For a filter with a capacity of 20,000,000 and a error rate of 0.001, the storage size is approximately 34MB. That implies that there are approximately 1.78 bytes (~14 bits) per element.
16+
The number of bits per element is as a result of the number of hash functions, which is derived from the capacity and the error rate.
1717

1818
**Scalable Bloom Filters**
1919
The scalable bloom filter initialized with a capacity of 2,000,000 and a error rate of 0.001, when grown to a capacity of 20,000,000, the total storage size is approximately 37.3MB.

0 commit comments

Comments
 (0)