ol 7.3.1-dev.1679343279122 → 7.3.1-dev.1679343964054

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/array.d.ts.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"array.d.ts","sourceRoot":"","sources":["array.js"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;;;;;;GAQG;AACH,uCALW,UAAQ,mDAGP,MAAM,CA2BjB;AAED;;;;;;GAMG;AACH,2CAHY,MAAM,CAKjB;AAED;;;;;;;;;;;;GAYG;AAEH;;;;;;;;GAQG;AACH,uCARW,MAAM,MAAM,CAAC,UACb,MAAM,aACN,MAAM,GAAC,wBAAwB,GAI9B,MAAM,CA2CjB;AAED;;;;GAIG;AACH,qCAJW,UAAQ,SACR,MAAM,OACN,MAAM,QAUhB;AAED;;;;GAIG;AACH,yEAMC;AAED;;;;;GAKG;AACH,yDAFY,OAAO,CASlB;AAED;;;;GAIG;AACH,6BAJW,QAAM,iBAAiB,QACvB,QAAM,iBAAiB,GACtB,OAAO,CAalB;AAED;;;;;;GAMG;AACH,gCAJW,UAAQ,wCACS,MAAM,QAgBjC;AAED;;;;;GAKG;AACH,8BALW,UAAQ,8DAGP,OAAO,CAWlB;;;;;;;;;;;;8CA1JqB,MAAM,QAAE,MAAM,QAAE,MAAM,KAAG,MAAM"}
1
+ {"version":3,"file":"array.d.ts","sourceRoot":"","sources":["array.js"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;;;;;;;GAQG;AACH,uCALW,UAAQ,mDAGP,MAAM,CA2BjB;AAED;;;;;;GAMG;AACH,2CAHY,MAAM,CAKjB;AAED;;;;;;;;;;;;GAYG;AAEH;;;;;;;;GAQG;AACH,uCARW,MAAM,MAAM,CAAC,UACb,MAAM,aACN,MAAM,GAAC,wBAAwB,GAI9B,MAAM,CA0DjB;AAED;;;;GAIG;AACH,qCAJW,UAAQ,SACR,MAAM,OACN,MAAM,QAUhB;AAED;;;;GAIG;AACH,yEAMC;AAED;;;;;GAKG;AACH,yDAFY,OAAO,CASlB;AAED;;;;GAIG;AACH,6BAJW,QAAM,iBAAiB,QACvB,QAAM,iBAAiB,GACtB,OAAO,CAalB;AAED;;;;;;GAMG;AACH,gCAJW,UAAQ,wCACS,MAAM,QAgBjC;AAED;;;;;GAKG;AACH,8BALW,UAAQ,8DAGP,OAAO,CAWlB;;;;;;;;;;;;8CAzKqB,MAAM,QAAE,MAAM,QAAE,MAAM,KAAG,MAAM"}
package/array.js CHANGED
@@ -73,43 +73,58 @@ export function ascending(a, b) {
73
73
  * @return {number} Index.
74
74
  */
75
75
  export function linearFindNearest(arr, target, direction) {
76
- const n = arr.length;
77
76
  if (arr[0] <= target) {
78
77
  return 0;
79
78
  }
79
+
80
+ const n = arr.length;
80
81
  if (target <= arr[n - 1]) {
81
82
  return n - 1;
82
83
  }
83
- let i;
84
+
85
+ if (typeof direction === 'function') {
86
+ for (let i = 1; i < n; ++i) {
87
+ const candidate = arr[i];
88
+ if (candidate === target) {
89
+ return i;
90
+ }
91
+ if (candidate < target) {
92
+ if (direction(target, arr[i - 1], candidate) > 0) {
93
+ return i - 1;
94
+ }
95
+ return i;
96
+ }
97
+ }
98
+ return n - 1;
99
+ }
100
+
84
101
  if (direction > 0) {
85
- for (i = 1; i < n; ++i) {
102
+ for (let i = 1; i < n; ++i) {
86
103
  if (arr[i] < target) {
87
104
  return i - 1;
88
105
  }
89
106
  }
90
- } else if (direction < 0) {
91
- for (i = 1; i < n; ++i) {
107
+ return n - 1;
108
+ }
109
+
110
+ if (direction < 0) {
111
+ for (let i = 1; i < n; ++i) {
92
112
  if (arr[i] <= target) {
93
113
  return i;
94
114
  }
95
115
  }
96
- } else {
97
- for (i = 1; i < n; ++i) {
98
- if (arr[i] == target) {
99
- return i;
100
- }
101
- if (arr[i] < target) {
102
- if (typeof direction === 'function') {
103
- if (direction(target, arr[i - 1], arr[i]) > 0) {
104
- return i - 1;
105
- }
106
- return i;
107
- }
108
- if (arr[i - 1] - target < target - arr[i]) {
109
- return i - 1;
110
- }
111
- return i;
116
+ return n - 1;
117
+ }
118
+
119
+ for (let i = 1; i < n; ++i) {
120
+ if (arr[i] == target) {
121
+ return i;
122
+ }
123
+ if (arr[i] < target) {
124
+ if (arr[i - 1] - target < target - arr[i]) {
125
+ return i - 1;
112
126
  }
127
+ return i;
113
128
  }
114
129
  }
115
130
  return n - 1;