@quenty/binarysearch 2.2.2 → 2.2.3-canary.11a5dcf.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/CHANGELOG.md CHANGED
@@ -3,6 +3,17 @@
3
3
  All notable changes to this project will be documented in this file.
4
4
  See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
5
5
 
6
+ ## [2.2.3-canary.11a5dcf.0](https://github.com/Quenty/NevermoreEngine/compare/@quenty/binarysearch@2.2.2...@quenty/binarysearch@2.2.3-canary.11a5dcf.0) (2025-05-10)
7
+
8
+
9
+ ### Bug Fixes
10
+
11
+ * Additional type checking updates ([05ba29a](https://github.com/Quenty/NevermoreEngine/commit/05ba29a03efc9f3feed74b34f1d9dfb237496214))
12
+
13
+
14
+
15
+
16
+
6
17
  ## [2.2.2](https://github.com/Quenty/NevermoreEngine/compare/@quenty/binarysearch@2.2.0...@quenty/binarysearch@2.2.2) (2025-04-07)
7
18
 
8
19
 
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@quenty/binarysearch",
3
- "version": "2.2.2",
3
+ "version": "2.2.3-canary.11a5dcf.0",
4
4
  "description": "Binary search for Roblox",
5
5
  "keywords": [
6
6
  "Roblox",
@@ -28,5 +28,5 @@
28
28
  "publishConfig": {
29
29
  "access": "public"
30
30
  },
31
- "gitHead": "64def70499ec067077ee39f279936b620b217847"
31
+ "gitHead": "11a5dcf7d4c7a0bfbf3337e97d30e8346ea09d3f"
32
32
  }
@@ -90,7 +90,7 @@ end
90
90
  @return number
91
91
  @return number
92
92
  ]=]
93
- function BinarySearchUtils.spanSearchAnything(n: number, indexFunc: (number) -> (number), t: number): (number?, number?)
93
+ function BinarySearchUtils.spanSearchAnything(n: number, indexFunc: (number) -> number, t: number): (number?, number?)
94
94
  local l = 1
95
95
  local h = n
96
96
 
@@ -105,8 +105,8 @@ function BinarySearchUtils.spanSearchAnything(n: number, indexFunc: (number) ->
105
105
  end
106
106
 
107
107
  while 1 < h - l do
108
- local m = (l + h)/2
109
- m = m - m%1
108
+ local m = (l + h) / 2
109
+ m = m - m % 1
110
110
 
111
111
  if t < indexFunc(m) then
112
112
  h = m
@@ -117,4 +117,4 @@ function BinarySearchUtils.spanSearchAnything(n: number, indexFunc: (number) ->
117
117
  return l, h
118
118
  end
119
119
 
120
- return BinarySearchUtils
120
+ return BinarySearchUtils