ixfx
    Preparing search index...

    Simple priority queue implementation. Higher numbers mean higher priority.

    const pm = new PriorityMutable();

    // Add items with a priority (higher numeric value = higher value)
    pm.enqueueWithPriority(`hello`, 4);
    pm.enqueueWithPriotity(`there`, 1);

    Type Parameters

    • V

    Hierarchy (View Summary)

    Implements

    Index

    Accessors

    Constructors

    Methods

    • Parameters

      • result: readonly Readonly<{ item: V; priority: number }>[]
      • attemptedToAdd: readonly Readonly<{ item: V; priority: number }>[]

      Returns void

    • Parameters

      • removed: readonly Readonly<{ item: V; priority: number }>[]
      • finalData: readonly Readonly<{ item: V; priority: number }>[]

      Returns void

    Properties

    data: readonly Readonly<{ item: V; priority: number }>[]
    eq: IsEqual<Readonly<{ item: V; priority: number }>>
    options: QueueOpts<Readonly<{ item: V; priority: number }>>