stores
    Preparing search index...

    Class TieredDatastore

    A datastore that can combine multiple stores. Puts and deletes will write through to all datastores. Has and get will try each store sequentially. Query will always try the last one first.

    Hierarchy (View Summary)

    Index

    Constructors

    constructor

    Methods

    _all _allKeys batch delete deleteMany get getMany has put putMany query queryKeys

    Constructors

    Methods

    _all

    _allKeys

    • This will return an object with which you can chain multiple operations together, with them only being executed on calling commit.

      Returns Batch

      const b = store.batch()

      for (let i = 0; i < 100; i++) {
        b.put(new Key(`hello${i}`), new TextEncoder('utf8').encode(`hello world ${i}`))
      }

      await b.commit()
      console.log('put 100 values')

    • Check for the existence of a value for the passed key

      Parameters

      Returns Promise<boolean>

      const exists = await store.has(new Key('awesome'))

      if (exists) {
       console.log('it is there')
      } else {
       console.log('it is not there')
      }

    Settings

    Member Visibility

    On This Page

    Constructors
    Methods