libp2p
    Preparing search index...

    Class PeerSet

    We can't use PeerIds as set entries because set entries are compared using same-value-zero equality, so this is just a map that stringifies the PeerIds before storing them.

    PeerIds cache stringified versions of themselves so this should be a cheap operation.

    import { peerSet } from '@libp2p/peer-collections'

    const set = peerSet()
    set.add(peerId)
    Index

    Constructors

    constructor

    Accessors

    size

    Methods

    [iterator] add clear delete difference entries forEach has intersection union values

    Constructors

    Accessors

    • get size(): number

      Returns number

    Methods

    • Returns void

    Settings

    Member Visibility

    On This Page

    Constructors
    Accessors
    Methods