libp2p
    Preparing search index...

    Class PeerMap<T>

    We can't use PeerIds as map keys because map keys 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 { peerMap } from '@libp2p/peer-collections'

    const map = peerMap<string>()
    map.set(peerId, 'value')

    Type Parameters

    • T
    Index

    Constructors

    constructor

    Accessors

    size

    Methods

    [iterator] clear delete entries forEach get has keys set values

    Constructors

    Accessors

    • get size(): number

      Returns number

    Methods

    • Returns void

    • Returns IterableIterator<T>

    Settings

    Member Visibility

    On This Page

    Constructors
    Accessors
    Methods