Bump minor version.

Author: ioquatix

lib/io/event/version.rb

@@ -7,6 +7,6 @@
 class IO
 	# @namespace
 	module Event
-		VERSION = "1.13.0"
+		VERSION = "1.14.0"
 	end
 end

readme.md

@@ -18,6 +18,10 @@ Please see the [project documentation](https://socketry.github.io/io-event/) for
 
 Please see the [project releases](https://socketry.github.io/io-event/releases/index) for all releases.
 
+### v1.14.0
+
+  - [Enhanced `IO::Event::PriorityHeap` with deletion and bulk insertion methods](https://socketry.github.io/io-event/releases/index#enhanced-io::event::priorityheap-with-deletion-and-bulk-insertion-methods)
+
 ### v1.11.2
 
   - Fix Windows build.

releases.md

@@ -1,14 +1,16 @@
 # Releases
 
-## Unreleased
+## v1.14.0
 
 ### Enhanced `IO::Event::PriorityHeap` with deletion and bulk insertion methods
 
 The {ruby IO::Event::PriorityHeap} now supports efficient element removal and bulk insertion:
 
-- **`delete(element)`**: Remove a specific element from the heap in O(n) time
-- **`delete_if(&block)`**: Remove elements matching a condition with O(n) amortized bulk deletion
-- **`concat(elements)`**: Add multiple elements efficiently in O(n) time
+  - **`delete(element)`**: Remove a specific element from the heap in O(n) time
+  - **`delete_if(&block)`**: Remove elements matching a condition with O(n) amortized bulk deletion
+  - **`concat(elements)`**: Add multiple elements efficiently in O(n) time
+
+<!-- end list -->
 
 ``` ruby
 heap = IO::Event::PriorityHeap.new
@@ -24,8 +26,9 @@ count = heap.delete_if { |x| x.even? }  # Removes 2, 8 efficiently
 ```
 
 The `delete_if` and `concat` methods are particularly efficient for bulk operations, using bottom-up heapification to maintain the heap property in O(n) time. This provides significant performance improvements:
-- **Bulk insertion**: O(n log n) → O(n) for adding multiple elements
-- **Bulk deletion**: O(k×n) → O(n) for removing k elements
+
+  - **Bulk insertion**: O(n log n) → O(n) for adding multiple elements
+  - **Bulk deletion**: O(k×n) → O(n) for removing k elements
 
 Both methods maintain the heap invariant and include comprehensive test coverage with edge case validation.