goog.async.WorkQueue

Module ID	`goog.async.WorkQueue`

A low GC workqueue. The key elements of this design:

avoids the need for goog.bind or equivalent by carrying scope
avoids the need for array reallocation by using a linked list
minimizes work entry objects allocation by recycling objects

new WorkQueue()

Parameters	None.

VIEW SOURCE

Instance Methods

Parameters

`fn`	`function(): ?`

`scope`	`(Object\|null\|undefined)`

VIEW SOURCE

Parameters

None.

Returns

(module$contents$goog$async$WorkQueue_WorkItem|null)

VIEW SOURCE

Parameters

`item`	`module$contents$goog$async$WorkQueue_WorkItem`

VIEW SOURCE

Instance Properties

No information.

VIEW SOURCE

No information.

VIEW SOURCE

Compiler Constants

The maximum number of entries to keep for recycling.

VIEW SOURCE

goog.async.WorkQueue

new WorkQueue()

Instance Methods

`this.`add( `fn`, `scope` ) `→` `void`

`this.`remove() `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

`this.`returnUnused( `item` ) `→` `void`

Instance Properties

`this.`workHead_ `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

`this.`workTail_ `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

Compiler Constants

goog.async.WorkQueue.DEFAULT_MAX_UNUSED `→` `number`

goog.async.WorkQueue

new WorkQueue()

Instance Methods

this.add( fn, scope ) → void

this.remove() → (module$contents$goog$async$WorkQueue_WorkItem|null)

this.returnUnused( item ) → void

Instance Properties

this.workHead_ → (module$contents$goog$async$WorkQueue_WorkItem|null)

this.workTail_ → (module$contents$goog$async$WorkQueue_WorkItem|null)

Compiler Constants

goog.async.WorkQueue.DEFAULT_MAX_UNUSED → number

`this.`add( `fn`, `scope` ) `→` `void`

`this.`remove() `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

`this.`returnUnused( `item` ) `→` `void`

`this.`workHead_ `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

`this.`workTail_ `→` `(module$contents$goog$async$WorkQueue_WorkItem|null)`

goog.async.WorkQueue.DEFAULT_MAX_UNUSED `→` `number`