Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat(sheets): support data validation (#1676)
- Loading branch information
Showing
189 changed files
with
13,445 additions
and
444 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,81 @@ | ||
| /** | ||
| * Copyright 2023-present DreamNum Inc. | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| import { Rectangle } from '../shared/rectangle'; | ||
| import type { IRange, IUnitRange } from '../types/interfaces'; | ||
|
|
||
| /** | ||
| * Copyright 2023-present DreamNum Inc. | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| export const isRangesEqual = (oldRanges: IRange[], ranges: IRange[]) => { | ||
| return ranges.length === oldRanges.length && !oldRanges.some((oldRange) => ranges.some((range) => !Rectangle.equals(range, oldRange))); | ||
| }; | ||
|
|
||
| export const isUnitRangesEqual = (oldRanges: IUnitRange[], ranges: IUnitRange[]) => { | ||
| return ranges.length === oldRanges.length && oldRanges.every((oldRange, i) => { | ||
| const current = ranges[i]; | ||
| return current.unitId === oldRange.unitId && current.sheetId === oldRange.sheetId && Rectangle.equals(oldRange.range, current.range); | ||
| }); | ||
| }; | ||
|
|
||
| export function shallowEqual(objA: any, objB: any) { | ||
| if (Object.is(objA, objB)) { | ||
| return true; | ||
| } | ||
|
|
||
| if (typeof objA !== 'object' || !objA || typeof objB !== 'object' || !objB) { | ||
| return false; | ||
| } | ||
|
|
||
| const keysA = Object.keys(objA); | ||
| const keysB = Object.keys(objB); | ||
|
|
||
| if (keysA.length !== keysB.length) { | ||
| return false; | ||
| } | ||
|
|
||
| const bHasOwnProperty = Object.prototype.hasOwnProperty.bind(objB); | ||
|
|
||
| // Test for A's keys different from B. | ||
| for (let idx = 0; idx < keysA.length; idx++) { | ||
| const key = keysA[idx]; | ||
|
|
||
| if (!bHasOwnProperty(key)) { | ||
| return false; | ||
| } | ||
|
|
||
| const valueA = objA[key]; | ||
| const valueB = objB[key]; | ||
| if (valueA !== valueB) { | ||
| return false; | ||
| } | ||
| } | ||
|
|
||
| return true; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,101 @@ | ||
| /** | ||
| * Copyright 2023-present DreamNum Inc. | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| import type { Nullable } from 'vitest'; | ||
| import { Range } from '../sheets/range'; | ||
| import type { IRange } from '../types/interfaces'; | ||
| import type { ObjectMatrix } from './object-matrix'; | ||
|
|
||
| function maximalRectangle<T>(matrix: T[][], match: (val: T) => boolean) { | ||
| if (matrix.length === 0 || matrix[0].length === 0) return null; | ||
|
|
||
| const heights = new Array(matrix[0].length).fill(0); | ||
| let maxArea = 0; | ||
| let maxRect = null; | ||
|
|
||
| for (let row = 0; row < matrix.length; row++) { | ||
| for (let col = 0; col < matrix[0].length; col++) { | ||
| heights[col] = match(matrix[row][col]) ? heights[col] + 1 : 0; | ||
| } | ||
|
|
||
| const areaWithRect = largestRectangleArea(heights); | ||
| if (areaWithRect.area > maxArea) { | ||
| maxArea = areaWithRect.area; | ||
| // Adjust the rectangle's top row to the current row minus the height plus one | ||
| maxRect = { | ||
| startColumn: areaWithRect.start, | ||
| startRow: row - areaWithRect.height + 1, | ||
| endColumn: areaWithRect.end, | ||
| endRow: row, | ||
| }; | ||
| } | ||
| } | ||
|
|
||
| return maxRect; | ||
| } | ||
|
|
||
| function largestRectangleArea(heights: number[]) { | ||
| const stack: number[] = []; | ||
| let maxArea = 0; | ||
| let maxRect = { area: 0, height: 0, start: 0, end: 0 }; | ||
| let index = 0; | ||
|
|
||
| while (index < heights.length) { | ||
| if (stack.length === 0 || heights[index] >= heights[stack[stack.length - 1]]) { | ||
| stack.push(index++); | ||
| } else { | ||
| const height = heights[stack.pop()!]; | ||
| const width = stack.length === 0 ? index : index - stack[stack.length - 1] - 1; | ||
| if (height * width > maxArea) { | ||
| maxArea = height * width; | ||
| maxRect = { area: maxArea, height, start: stack.length === 0 ? 0 : stack[stack.length - 1] + 1, end: index - 1 }; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| while (stack.length > 0) { | ||
| const height = heights[stack.pop()!]; | ||
| const width = stack.length === 0 ? index : index - stack[stack.length - 1] - 1; | ||
| if (height * width > maxArea) { | ||
| maxArea = height * width; | ||
| maxRect = { area: maxArea, height, start: stack.length === 0 ? 0 : stack[stack.length - 1] + 1, end: index - 1 }; | ||
| } | ||
| } | ||
|
|
||
| return maxRect; | ||
| } | ||
|
|
||
| function resetMatrix<T>(matrix: Nullable<T>[][], range: IRange) { | ||
| Range.foreach(range, (row, col) => { | ||
| matrix[row][col] = undefined; | ||
| }); | ||
| } | ||
|
|
||
| export function queryObjectMatrix<T>(matrix: ObjectMatrix<T>, match: (value: T) => boolean) { | ||
| const arrayMatrix = matrix.toFullArray(); | ||
| const results: IRange[] = []; | ||
| while (true) { | ||
| const rectangle = maximalRectangle(arrayMatrix, match); | ||
| if (!rectangle) { | ||
| break; | ||
| } | ||
|
|
||
| results.push(rectangle); | ||
| resetMatrix(arrayMatrix, rectangle); | ||
| } | ||
|
|
||
| return results; | ||
| } |
Oops, something went wrong.