@libp2p/utils 5.3.2 → 5.4.0-1488a7371
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/src/abort-options.d.ts +7 -0
- package/dist/src/abort-options.d.ts.map +1 -0
- package/dist/src/abort-options.js +14 -0
- package/dist/src/abort-options.js.map +1 -0
- package/dist/src/close.d.ts +21 -0
- package/dist/src/close.d.ts.map +1 -0
- package/dist/src/close.js +49 -0
- package/dist/src/close.js.map +1 -0
- package/dist/src/filters/bloom-filter.d.ts +34 -0
- package/dist/src/filters/bloom-filter.d.ts.map +1 -0
- package/dist/src/filters/bloom-filter.js +113 -0
- package/dist/src/filters/bloom-filter.js.map +1 -0
- package/dist/src/filters/bucket.d.ts +10 -0
- package/dist/src/filters/bucket.d.ts.map +1 -0
- package/dist/src/filters/bucket.js +53 -0
- package/dist/src/filters/bucket.js.map +1 -0
- package/dist/src/filters/cuckoo-filter.d.ts +41 -0
- package/dist/src/filters/cuckoo-filter.d.ts.map +1 -0
- package/dist/src/filters/cuckoo-filter.js +134 -0
- package/dist/src/filters/cuckoo-filter.js.map +1 -0
- package/dist/src/filters/fingerprint.d.ts +11 -0
- package/dist/src/filters/fingerprint.d.ts.map +1 -0
- package/dist/src/filters/fingerprint.js +34 -0
- package/dist/src/filters/fingerprint.js.map +1 -0
- package/dist/src/filters/hashes.d.ts +8 -0
- package/dist/src/filters/hashes.d.ts.map +1 -0
- package/dist/src/filters/hashes.js +29 -0
- package/dist/src/filters/hashes.js.map +1 -0
- package/dist/src/filters/index.d.ts +9 -0
- package/dist/src/filters/index.d.ts.map +1 -0
- package/dist/src/filters/index.js +4 -0
- package/dist/src/filters/index.js.map +1 -0
- package/dist/src/filters/scalable-cuckoo-filter.d.ts +24 -0
- package/dist/src/filters/scalable-cuckoo-filter.d.ts.map +1 -0
- package/dist/src/filters/scalable-cuckoo-filter.js +87 -0
- package/dist/src/filters/scalable-cuckoo-filter.js.map +1 -0
- package/dist/src/filters/utils.d.ts +2 -0
- package/dist/src/filters/utils.d.ts.map +1 -0
- package/dist/src/filters/utils.js +4 -0
- package/dist/src/filters/utils.js.map +1 -0
- package/package.json +24 -7
- package/src/abort-options.ts +20 -0
- package/src/close.ts +65 -0
- package/src/filters/bloom-filter.ts +142 -0
- package/src/filters/bucket.ts +64 -0
- package/src/filters/cuckoo-filter.ts +197 -0
- package/src/filters/fingerprint.ts +44 -0
- package/src/filters/hashes.ts +38 -0
- package/src/filters/index.ts +9 -0
- package/src/filters/scalable-cuckoo-filter.ts +111 -0
- package/src/filters/utils.ts +3 -0
- package/dist/typedoc-urls.json +0 -76
|
@@ -0,0 +1,197 @@
|
|
|
1
|
+
import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string'
|
|
2
|
+
import { Bucket } from './bucket.js'
|
|
3
|
+
import { Fingerprint, MAX_FINGERPRINT_SIZE } from './fingerprint.js'
|
|
4
|
+
import { fnv1a, type Hash } from './hashes.js'
|
|
5
|
+
import { getRandomInt } from './utils.js'
|
|
6
|
+
import type { Filter } from './index.js'
|
|
7
|
+
|
|
8
|
+
const maxCuckooCount = 500
|
|
9
|
+
|
|
10
|
+
export interface CuckooFilterInit {
|
|
11
|
+
/**
|
|
12
|
+
* How many items the filter is expected to contain
|
|
13
|
+
*/
|
|
14
|
+
filterSize: number
|
|
15
|
+
|
|
16
|
+
/**
|
|
17
|
+
* How many items to put in each bucket
|
|
18
|
+
*/
|
|
19
|
+
bucketSize?: number
|
|
20
|
+
|
|
21
|
+
/**
|
|
22
|
+
* How many bytes the fingerprint is expected to be
|
|
23
|
+
*/
|
|
24
|
+
fingerprintSize?: number
|
|
25
|
+
|
|
26
|
+
/**
|
|
27
|
+
* A non-cryptographic hash implementation
|
|
28
|
+
*/
|
|
29
|
+
hash?: Hash
|
|
30
|
+
|
|
31
|
+
/**
|
|
32
|
+
* A number used to seed the hash
|
|
33
|
+
*/
|
|
34
|
+
seed?: number
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
export class CuckooFilter implements Filter {
|
|
38
|
+
private readonly bucketSize: number
|
|
39
|
+
private readonly filterSize: number
|
|
40
|
+
private readonly fingerprintSize: number
|
|
41
|
+
private readonly buckets: Bucket[]
|
|
42
|
+
public count: number
|
|
43
|
+
private readonly hash: Hash
|
|
44
|
+
private readonly seed: number
|
|
45
|
+
|
|
46
|
+
constructor (init: CuckooFilterInit) {
|
|
47
|
+
this.filterSize = init.filterSize
|
|
48
|
+
this.bucketSize = init.bucketSize ?? 4
|
|
49
|
+
this.fingerprintSize = init.fingerprintSize ?? 2
|
|
50
|
+
this.count = 0
|
|
51
|
+
this.buckets = []
|
|
52
|
+
this.hash = init.hash ?? fnv1a
|
|
53
|
+
this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10))
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
add (item: Uint8Array | string): boolean {
|
|
57
|
+
if (typeof item === 'string') {
|
|
58
|
+
item = uint8ArrayFromString(item)
|
|
59
|
+
}
|
|
60
|
+
|
|
61
|
+
const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize)
|
|
62
|
+
const j = this.hash.hash(item, this.seed) % this.filterSize
|
|
63
|
+
const k = (j ^ fingerprint.hash()) % this.filterSize
|
|
64
|
+
|
|
65
|
+
if (this.buckets[j] == null) {
|
|
66
|
+
this.buckets[j] = new Bucket(this.bucketSize)
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
if (this.buckets[k] == null) {
|
|
70
|
+
this.buckets[k] = new Bucket(this.bucketSize)
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
if (this.buckets[j].add(fingerprint) || this.buckets[k].add(fingerprint)) {
|
|
74
|
+
this.count++
|
|
75
|
+
return true
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
const rand = [j, k]
|
|
79
|
+
let i = rand[getRandomInt(0, rand.length - 1)]
|
|
80
|
+
|
|
81
|
+
if (this.buckets[i] == null) {
|
|
82
|
+
this.buckets[i] = new Bucket(this.bucketSize)
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
for (let n = 0; n < maxCuckooCount; n++) {
|
|
86
|
+
const swapped = this.buckets[i].swap(fingerprint)
|
|
87
|
+
|
|
88
|
+
if (swapped == null) {
|
|
89
|
+
continue
|
|
90
|
+
}
|
|
91
|
+
|
|
92
|
+
i = (i ^ swapped.hash()) % this.filterSize
|
|
93
|
+
|
|
94
|
+
if (this.buckets[i] == null) {
|
|
95
|
+
this.buckets[i] = new Bucket(this.bucketSize)
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
if (this.buckets[i].add(swapped)) {
|
|
99
|
+
this.count++
|
|
100
|
+
|
|
101
|
+
return true
|
|
102
|
+
} else {
|
|
103
|
+
continue
|
|
104
|
+
}
|
|
105
|
+
}
|
|
106
|
+
|
|
107
|
+
return false
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
has (item: Uint8Array | string): boolean {
|
|
111
|
+
if (typeof item === 'string') {
|
|
112
|
+
item = uint8ArrayFromString(item)
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize)
|
|
116
|
+
const j = this.hash.hash(item, this.seed) % this.filterSize
|
|
117
|
+
const inJ = this.buckets[j]?.has(fingerprint) ?? false
|
|
118
|
+
|
|
119
|
+
if (inJ) {
|
|
120
|
+
return inJ
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
const k = (j ^ fingerprint.hash()) % this.filterSize
|
|
124
|
+
|
|
125
|
+
return this.buckets[k]?.has(fingerprint) ?? false
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
remove (item: Uint8Array | string): boolean {
|
|
129
|
+
if (typeof item === 'string') {
|
|
130
|
+
item = uint8ArrayFromString(item)
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
const fingerprint = new Fingerprint(item, this.hash, this.seed, this.fingerprintSize)
|
|
134
|
+
const j = this.hash.hash(item, this.seed) % this.filterSize
|
|
135
|
+
const inJ = this.buckets[j]?.remove(fingerprint) ?? false
|
|
136
|
+
|
|
137
|
+
if (inJ) {
|
|
138
|
+
this.count--
|
|
139
|
+
return inJ
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
const k = (j ^ fingerprint.hash()) % this.filterSize
|
|
143
|
+
const inK = this.buckets[k]?.remove(fingerprint) ?? false
|
|
144
|
+
|
|
145
|
+
if (inK) {
|
|
146
|
+
this.count--
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
return inK
|
|
150
|
+
}
|
|
151
|
+
|
|
152
|
+
get reliable (): boolean {
|
|
153
|
+
return Math.floor(100 * (this.count / this.filterSize)) <= 95
|
|
154
|
+
}
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
// max load constants, defined in the cuckoo paper
|
|
158
|
+
const MAX_LOAD = {
|
|
159
|
+
1: 0.5,
|
|
160
|
+
2: 0.84,
|
|
161
|
+
4: 0.95,
|
|
162
|
+
8: 0.98
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
function calculateBucketSize (errorRate: number = 0.001): 2 | 4 | 8 {
|
|
166
|
+
if (errorRate > 0.002) {
|
|
167
|
+
return 2
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
if (errorRate > 0.00001) {
|
|
171
|
+
return 4
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
return 8
|
|
175
|
+
}
|
|
176
|
+
|
|
177
|
+
export function optimize (maxItems: number, errorRate: number = 0.001): CuckooFilterInit {
|
|
178
|
+
// https://www.eecs.harvard.edu/~michaelm/postscripts/cuckoo-conext2014.pdf
|
|
179
|
+
// Section 5.1 Optimal Bucket Size
|
|
180
|
+
const bucketSize = calculateBucketSize(errorRate)
|
|
181
|
+
const load = MAX_LOAD[bucketSize]
|
|
182
|
+
|
|
183
|
+
// https://stackoverflow.com/questions/57555236/how-to-size-a-cuckoo-filter/57617208#57617208
|
|
184
|
+
const filterSize = Math.round(maxItems / load)
|
|
185
|
+
const fingerprintSize = Math.min(Math.ceil(Math.log(filterSize / bucketSize)) + 2, MAX_FINGERPRINT_SIZE)
|
|
186
|
+
|
|
187
|
+
return {
|
|
188
|
+
filterSize,
|
|
189
|
+
bucketSize,
|
|
190
|
+
fingerprintSize
|
|
191
|
+
}
|
|
192
|
+
}
|
|
193
|
+
|
|
194
|
+
export function createCuckooFilter (maxItems: number, errorRate: number = 0.005): Filter {
|
|
195
|
+
const opts = optimize(maxItems, errorRate)
|
|
196
|
+
return new CuckooFilter(opts)
|
|
197
|
+
}
|
|
@@ -0,0 +1,44 @@
|
|
|
1
|
+
import { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc'
|
|
2
|
+
import { equals as uint8ArrayEquals } from 'uint8arrays/equals'
|
|
3
|
+
import type { Hash } from './hashes'
|
|
4
|
+
|
|
5
|
+
export const MAX_FINGERPRINT_SIZE = 64
|
|
6
|
+
|
|
7
|
+
export class Fingerprint {
|
|
8
|
+
private readonly fp: Uint8Array
|
|
9
|
+
private readonly h: Hash
|
|
10
|
+
private readonly seed: number
|
|
11
|
+
|
|
12
|
+
constructor (buf: Uint8Array, hash: Hash, seed: number, fingerprintSize: number = 2) {
|
|
13
|
+
if (fingerprintSize > MAX_FINGERPRINT_SIZE) {
|
|
14
|
+
throw new TypeError('Invalid Fingerprint Size')
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
const fnv = hash.hashV(buf, seed)
|
|
18
|
+
const fp = uint8ArrayAlloc(fingerprintSize)
|
|
19
|
+
|
|
20
|
+
for (let i = 0; i < fp.length; i++) {
|
|
21
|
+
fp[i] = fnv[i]
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
if (fp.length === 0) {
|
|
25
|
+
fp[0] = 7
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
this.fp = fp
|
|
29
|
+
this.h = hash
|
|
30
|
+
this.seed = seed
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
hash (): number {
|
|
34
|
+
return this.h.hash(this.fp, this.seed)
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
equals (other?: any): boolean {
|
|
38
|
+
if (!(other?.fp instanceof Uint8Array)) {
|
|
39
|
+
return false
|
|
40
|
+
}
|
|
41
|
+
|
|
42
|
+
return uint8ArrayEquals(this.fp, other.fp)
|
|
43
|
+
}
|
|
44
|
+
}
|
|
@@ -0,0 +1,38 @@
|
|
|
1
|
+
import fnv1aHash from '@sindresorhus/fnv1a'
|
|
2
|
+
import mur from 'murmurhash3js-revisited'
|
|
3
|
+
import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string'
|
|
4
|
+
|
|
5
|
+
export interface Hash {
|
|
6
|
+
hash(input: Uint8Array, seed: number): number
|
|
7
|
+
hashV(input: Uint8Array, seed: number): Uint8Array
|
|
8
|
+
}
|
|
9
|
+
|
|
10
|
+
export const murmur3: Hash = {
|
|
11
|
+
hash: (input, seed) => {
|
|
12
|
+
return mur.x86.hash32(input, seed)
|
|
13
|
+
},
|
|
14
|
+
hashV: (input, seed) => {
|
|
15
|
+
return numberToBuffer(murmur3.hash(input, seed))
|
|
16
|
+
}
|
|
17
|
+
}
|
|
18
|
+
|
|
19
|
+
export const fnv1a: Hash = {
|
|
20
|
+
hash: (input) => {
|
|
21
|
+
return Number(fnv1aHash(input, {
|
|
22
|
+
size: 32
|
|
23
|
+
}))
|
|
24
|
+
},
|
|
25
|
+
hashV: (input, seed) => {
|
|
26
|
+
return numberToBuffer(fnv1a.hash(input, seed))
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
export function numberToBuffer (num: bigint | number): Uint8Array {
|
|
31
|
+
let hex = num.toString(16)
|
|
32
|
+
|
|
33
|
+
if (hex.length % 2 === 1) {
|
|
34
|
+
hex = `0${hex}`
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
return uint8ArrayFromString(hex, 'base16')
|
|
38
|
+
}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
export { BloomFilter, createBloomFilter, type BloomFilterOptions } from './bloom-filter.js'
|
|
2
|
+
export { CuckooFilter, createCuckooFilter, type CuckooFilterInit } from './cuckoo-filter.js'
|
|
3
|
+
export { ScalableCuckooFilter, createScalableCuckooFilter, type ScalableCuckooFilterInit } from './scalable-cuckoo-filter.js'
|
|
4
|
+
|
|
5
|
+
export interface Filter {
|
|
6
|
+
add(item: Uint8Array | string): void
|
|
7
|
+
has(item: Uint8Array | string): boolean
|
|
8
|
+
remove?(buf: Uint8Array | string): boolean
|
|
9
|
+
}
|
|
@@ -0,0 +1,111 @@
|
|
|
1
|
+
import { fromString as uint8ArrayFromString } from 'uint8arrays/from-string'
|
|
2
|
+
import { CuckooFilter, optimize, type CuckooFilterInit } from './cuckoo-filter.js'
|
|
3
|
+
import { fnv1a, type Hash } from './hashes.js'
|
|
4
|
+
import { getRandomInt } from './utils.js'
|
|
5
|
+
import type { Filter } from './index.js'
|
|
6
|
+
|
|
7
|
+
export interface ScalableCuckooFilterInit extends CuckooFilterInit {
|
|
8
|
+
/**
|
|
9
|
+
* A number to multiply maxItems by when adding new sub-filters
|
|
10
|
+
*/
|
|
11
|
+
scale?: number
|
|
12
|
+
}
|
|
13
|
+
|
|
14
|
+
export class ScalableCuckooFilter implements Filter {
|
|
15
|
+
private readonly filterSize: number
|
|
16
|
+
private readonly bucketSize: number
|
|
17
|
+
private readonly fingerprintSize: number
|
|
18
|
+
private readonly scale: number
|
|
19
|
+
private readonly filterSeries: CuckooFilter[]
|
|
20
|
+
private readonly hash: Hash
|
|
21
|
+
private readonly seed: number
|
|
22
|
+
|
|
23
|
+
constructor (init: ScalableCuckooFilterInit) {
|
|
24
|
+
this.bucketSize = init.bucketSize ?? 4
|
|
25
|
+
this.filterSize = init.filterSize ?? (1 << 18) / this.bucketSize
|
|
26
|
+
this.fingerprintSize = init.fingerprintSize ?? 2
|
|
27
|
+
this.scale = init.scale ?? 2
|
|
28
|
+
this.hash = init.hash ?? fnv1a
|
|
29
|
+
this.seed = init.seed ?? getRandomInt(0, Math.pow(2, 10))
|
|
30
|
+
this.filterSeries = [
|
|
31
|
+
new CuckooFilter({
|
|
32
|
+
filterSize: this.filterSize,
|
|
33
|
+
bucketSize: this.bucketSize,
|
|
34
|
+
fingerprintSize: this.fingerprintSize,
|
|
35
|
+
hash: this.hash,
|
|
36
|
+
seed: this.seed
|
|
37
|
+
})
|
|
38
|
+
]
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
add (item: Uint8Array | string): boolean {
|
|
42
|
+
if (typeof item === 'string') {
|
|
43
|
+
item = uint8ArrayFromString(item)
|
|
44
|
+
}
|
|
45
|
+
|
|
46
|
+
if (this.has(item)) {
|
|
47
|
+
return true
|
|
48
|
+
}
|
|
49
|
+
|
|
50
|
+
let current = this.filterSeries.find((cuckoo) => {
|
|
51
|
+
return cuckoo.reliable
|
|
52
|
+
})
|
|
53
|
+
|
|
54
|
+
if (current == null) {
|
|
55
|
+
const curSize = this.filterSize * Math.pow(this.scale, this.filterSeries.length)
|
|
56
|
+
|
|
57
|
+
current = new CuckooFilter({
|
|
58
|
+
filterSize: curSize,
|
|
59
|
+
bucketSize: this.bucketSize,
|
|
60
|
+
fingerprintSize: this.fingerprintSize,
|
|
61
|
+
hash: this.hash,
|
|
62
|
+
seed: this.seed
|
|
63
|
+
})
|
|
64
|
+
|
|
65
|
+
this.filterSeries.push(current)
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
return current.add(item)
|
|
69
|
+
}
|
|
70
|
+
|
|
71
|
+
has (item: Uint8Array | string): boolean {
|
|
72
|
+
if (typeof item === 'string') {
|
|
73
|
+
item = uint8ArrayFromString(item)
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
for (let i = 0; i < this.filterSeries.length; i++) {
|
|
77
|
+
if (this.filterSeries[i].has(item)) {
|
|
78
|
+
return true
|
|
79
|
+
}
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
return false
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
remove (item: Uint8Array | string): boolean {
|
|
86
|
+
if (typeof item === 'string') {
|
|
87
|
+
item = uint8ArrayFromString(item)
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
for (let i = 0; i < this.filterSeries.length; i++) {
|
|
91
|
+
if (this.filterSeries[i].remove(item)) {
|
|
92
|
+
return true
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
return false
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
get count (): number {
|
|
100
|
+
return this.filterSeries.reduce((acc, curr) => {
|
|
101
|
+
return acc + curr.count
|
|
102
|
+
}, 0)
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
|
|
106
|
+
export function createScalableCuckooFilter (maxItems: number, errorRate: number = 0.001, options?: Pick<ScalableCuckooFilterInit, 'hash' | 'seed' | 'scale'>): Filter {
|
|
107
|
+
return new ScalableCuckooFilter({
|
|
108
|
+
...optimize(maxItems, errorRate),
|
|
109
|
+
...(options ?? {})
|
|
110
|
+
})
|
|
111
|
+
}
|
package/dist/typedoc-urls.json
DELETED
|
@@ -1,76 +0,0 @@
|
|
|
1
|
-
{
|
|
2
|
-
"AbstractStream": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.abstract_stream.AbstractStream.html",
|
|
3
|
-
"./abstract-stream:AbstractStream": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.abstract_stream.AbstractStream.html",
|
|
4
|
-
"AbstractStreamInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.abstract_stream.AbstractStreamInit.html",
|
|
5
|
-
"./abstract-stream:AbstractStreamInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.abstract_stream.AbstractStreamInit.html",
|
|
6
|
-
"certifiedAddressesFirst": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.certifiedAddressesFirst.html",
|
|
7
|
-
"./address-sort:certifiedAddressesFirst": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.certifiedAddressesFirst.html",
|
|
8
|
-
"circuitRelayAddressesLast": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.circuitRelayAddressesLast.html",
|
|
9
|
-
"./address-sort:circuitRelayAddressesLast": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.circuitRelayAddressesLast.html",
|
|
10
|
-
"defaultAddressSort": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.defaultAddressSort.html",
|
|
11
|
-
"./address-sort:defaultAddressSort": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.defaultAddressSort.html",
|
|
12
|
-
"publicAddressesFirst": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.publicAddressesFirst.html",
|
|
13
|
-
"./address-sort:publicAddressesFirst": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.address_sort.publicAddressesFirst.html",
|
|
14
|
-
"arrayEquals": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.array_equals.arrayEquals.html",
|
|
15
|
-
"./array-equals:arrayEquals": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.array_equals.arrayEquals.html",
|
|
16
|
-
"closeSource": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.close_source.closeSource.html",
|
|
17
|
-
"./close-source:closeSource": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.close_source.closeSource.html",
|
|
18
|
-
"Errors": "https://libp2p.github.io/js-libp2p/variables/_libp2p_utils.ip_port_to_multiaddr.Errors.html",
|
|
19
|
-
"./ip-port-to-multiaddr:Errors": "https://libp2p.github.io/js-libp2p/variables/_libp2p_utils.ip_port_to_multiaddr.Errors.html",
|
|
20
|
-
"ipPortToMultiaddr": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.ip_port_to_multiaddr.ipPortToMultiaddr.html",
|
|
21
|
-
"./ip-port-to-multiaddr:ipPortToMultiaddr": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.ip_port_to_multiaddr.ipPortToMultiaddr.html",
|
|
22
|
-
"isPromise": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.is_promise.isPromise.html",
|
|
23
|
-
"./is-promise:isPromise": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.is_promise.isPromise.html",
|
|
24
|
-
"isLoopback": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.multiaddr_is_loopback.isLoopback.html",
|
|
25
|
-
"./multiaddr/is-loopback:isLoopback": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.multiaddr_is_loopback.isLoopback.html",
|
|
26
|
-
"isPrivate": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.multiaddr_is_private.isPrivate.html",
|
|
27
|
-
"./multiaddr/is-private:isPrivate": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.multiaddr_is_private.isPrivate.html",
|
|
28
|
-
"PeerQueue": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.peer_queue.PeerQueue.html",
|
|
29
|
-
"./peer-queue:PeerQueue": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.peer_queue.PeerQueue.html",
|
|
30
|
-
"PeerQueueJobOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.peer_queue.PeerQueueJobOptions.html",
|
|
31
|
-
"./peer-queue:PeerQueueJobOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.peer_queue.PeerQueueJobOptions.html",
|
|
32
|
-
"isPrivateIp": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.private_ip.isPrivateIp.html",
|
|
33
|
-
"./private-ip:isPrivateIp": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.private_ip.isPrivateIp.html",
|
|
34
|
-
"Queue": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.queue.Queue.html",
|
|
35
|
-
"./queue:Queue": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.queue.Queue.html",
|
|
36
|
-
"JobMatcher": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.JobMatcher.html",
|
|
37
|
-
"./queue:JobMatcher": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.JobMatcher.html",
|
|
38
|
-
"QueueAddOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueAddOptions.html",
|
|
39
|
-
"./queue:QueueAddOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueAddOptions.html",
|
|
40
|
-
"QueueEvents": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueEvents.html",
|
|
41
|
-
"./queue:QueueEvents": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueEvents.html",
|
|
42
|
-
"QueueInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueInit.html",
|
|
43
|
-
"./queue:QueueInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueInit.html",
|
|
44
|
-
"QueueJobFailure": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueJobFailure.html",
|
|
45
|
-
"./queue:QueueJobFailure": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueJobFailure.html",
|
|
46
|
-
"QueueJobSuccess": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueJobSuccess.html",
|
|
47
|
-
"./queue:QueueJobSuccess": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.QueueJobSuccess.html",
|
|
48
|
-
"RunFunction": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.RunFunction.html",
|
|
49
|
-
"./queue:RunFunction": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.queue.RunFunction.html",
|
|
50
|
-
"JobStatus": "https://libp2p.github.io/js-libp2p/types/_libp2p_utils.queue.JobStatus.html",
|
|
51
|
-
"./queue:JobStatus": "https://libp2p.github.io/js-libp2p/types/_libp2p_utils.queue.JobStatus.html",
|
|
52
|
-
"RateLimiter": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.rate_limiter.RateLimiter.html",
|
|
53
|
-
"./rate-limiter:RateLimiter": "https://libp2p.github.io/js-libp2p/classes/_libp2p_utils.rate_limiter.RateLimiter.html",
|
|
54
|
-
"GetKeySecDurationOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.GetKeySecDurationOptions.html",
|
|
55
|
-
"./rate-limiter:GetKeySecDurationOptions": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.GetKeySecDurationOptions.html",
|
|
56
|
-
"RateLimiterInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateLimiterInit.html",
|
|
57
|
-
"./rate-limiter:RateLimiterInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateLimiterInit.html",
|
|
58
|
-
"RateLimiterResult": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateLimiterResult.html",
|
|
59
|
-
"./rate-limiter:RateLimiterResult": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateLimiterResult.html",
|
|
60
|
-
"RateRecord": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateRecord.html",
|
|
61
|
-
"./rate-limiter:RateRecord": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.rate_limiter.RateRecord.html",
|
|
62
|
-
"StreamProperties": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.stream_to_ma_conn.StreamProperties.html",
|
|
63
|
-
"./stream-to-ma-conn:StreamProperties": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.stream_to_ma_conn.StreamProperties.html",
|
|
64
|
-
"streamToMaConnection": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.stream_to_ma_conn.streamToMaConnection.html",
|
|
65
|
-
"./stream-to-ma-conn:streamToMaConnection": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.stream_to_ma_conn.streamToMaConnection.html",
|
|
66
|
-
"CreateTrackedListInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_list.CreateTrackedListInit.html",
|
|
67
|
-
"./tracked-list:CreateTrackedListInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_list.CreateTrackedListInit.html",
|
|
68
|
-
"trackedList": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.tracked_list.trackedList.html",
|
|
69
|
-
"./tracked-list:trackedList": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.tracked_list.trackedList.html",
|
|
70
|
-
"CreateTrackedMapInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_map.CreateTrackedMapInit.html",
|
|
71
|
-
"./tracked-map:CreateTrackedMapInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_map.CreateTrackedMapInit.html",
|
|
72
|
-
"TrackedMapInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_map.TrackedMapInit.html",
|
|
73
|
-
"./tracked-map:TrackedMapInit": "https://libp2p.github.io/js-libp2p/interfaces/_libp2p_utils.tracked_map.TrackedMapInit.html",
|
|
74
|
-
"trackedMap": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.tracked_map.trackedMap.html",
|
|
75
|
-
"./tracked-map:trackedMap": "https://libp2p.github.io/js-libp2p/functions/_libp2p_utils.tracked_map.trackedMap.html"
|
|
76
|
-
}
|