30 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			30 lines
		
	
	
		
			1.1 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
| ## 2.1.0
 | |
| 
 | |
|  - fix: issue where `clear()` is still keeping references to the elements (#47)
 | |
|  - refactor: performance optimizations for growth and array copy (#43)
 | |
|  - refactor: performance optimizations for toArray and fromArray (#46)
 | |
|  - test: add additional benchmarks for queue growth and `toArray` (#45)
 | |
| 
 | |
| ## 2.0.1
 | |
| 
 | |
|  - fix(types): incorrect return type on `size()`
 | |
| 
 | |
| ## 2.0.0
 | |
| 
 | |
|  - fix!: `push` & `unshift` now accept `undefined` values to match behaviour of `Array` (fixes #25) (#35)
 | |
|    - This is only a **BREAKING** change if you are currently expecting `push(undefined)` and `unshift(undefined)` to do
 | |
|      nothing - the new behaviour now correctly adds undefined values to the queue.
 | |
|    - **Note**: behaviour of `push()` & `unshift()` (no arguments) remains unchanged (nothing gets added to the queue).
 | |
|    - **Note**: If you need to differentiate between `undefined` values in the queue and the return value of `pop()` then
 | |
|      check the queue `.length` before popping.
 | |
|  - fix: incorrect methods in types definition file
 | |
| 
 | |
| ## 1.5.1
 | |
| 
 | |
|  - perf: minor performance tweak when growing queue size (#29)
 | |
| 
 | |
| ## 1.5.0
 | |
| 
 | |
|  - feat: adds capacity option for circular buffers (#27)
 | |
| 
 |