13 Commits

Author	SHA1	Message	Date
alexander.akait	7aef2e359c	perf: a faster Queue implementation	2024-11-20 16:51:43 +03:00
Muthukumar M	affadffeec	Refactor Queue class: remove unnecessary iterator property, streamline dequeue method	2024-11-19 10:25:41 +05:30
alexander.akait	93743d233a	refactor: code	2024-08-02 19:32:31 +03:00
alexander.akait	81f2e865a6	chore: update eslint to v9	2024-06-11 15:32:02 +03:00
Tobias Koppers	3465b00a62	performance, cleanup	2020-07-28 22:05:13 +02:00
Tobias Koppers	cf5f1d723c	format existing code	2018-07-30 21:29:21 +02:00
Tobias Koppers	0f587763e1	add per chunk index and index2 ... refactor index generation	2018-06-26 18:26:47 +02:00
Tobias Koppers	f2ad440de8	More strict linting of jsdocs ... Use TODO over any when type is possible	2018-05-08 14:53:33 +02:00
Florent Cailhol	6b583e3751	Add Queue typing	2018-04-23 09:02:34 +02:00
Tobias Koppers	5238159d21	run prettier on existing code	2018-02-25 02:00:20 +01:00
Tobias Koppers	0404564468	ensure that items are not enqueued twice ... Use nice SetIterator trick	2018-01-11 13:37:29 +01:00
Tobias Koppers	0376a321de	recycle nodes in Queue	2017-12-01 11:27:02 +01:00
Tobias Koppers	11e28793fa	improve performance by doing a breath-first traversal in the chunk graph ... This is faster because shorter paths usually have less modules available. This allows to reach minimal modules faster	2017-10-12 20:03:36 +02:00