♻️ Restructure: Move Astro to repository root
BREAKING CHANGE: Astro project is now at repository root - Removed dealplustech-astro subdirectory - Moved all Astro files to root - Updated PostCSS config to .cjs - Removed old Next.js files ✅ 11 pages built successfully ✅ Cookie consent banner included ✅ Privacy/Terms links in footer ✅ Ready for Easypanel deployment (no root dir needed) Migration path: - Old structure: /dealplustech-astro/ - New structure: / (root)
This commit is contained in:
24
dealplustech-astro/node_modules/get-east-asian-width/utilities.js
generated
vendored
24
dealplustech-astro/node_modules/get-east-asian-width/utilities.js
generated
vendored
@@ -1,24 +0,0 @@
|
||||
/**
|
||||
Binary search on a sorted flat array of [start, end] pairs.
|
||||
|
||||
@param {number[]} ranges - Flat array of inclusive [start, end] range pairs, e.g. [0, 5, 10, 20].
|
||||
@param {number} codePoint - The value to search for.
|
||||
@returns {boolean} Whether the value falls within any of the ranges.
|
||||
*/
|
||||
export const isInRange = (ranges, codePoint) => {
|
||||
let low = 0;
|
||||
let high = Math.floor(ranges.length / 2) - 1;
|
||||
while (low <= high) {
|
||||
const mid = Math.floor((low + high) / 2);
|
||||
const i = mid * 2;
|
||||
if (codePoint < ranges[i]) {
|
||||
high = mid - 1;
|
||||
} else if (codePoint > ranges[i + 1]) {
|
||||
low = mid + 1;
|
||||
} else {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
};
|
||||
Reference in New Issue
Block a user