@sheetxl/sdk 0.1.98
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/LICENSE.md +11 -0
- package/README.md +30 -0
- package/build/browser/cjs/7Yh1PqgSd93uKFOq.cjs +6 -0
- package/build/browser/cjs/AbBzPqrBe_7Scafy.cjs +6 -0
- package/build/browser/cjs/B2jt9h-29UhlG-ir.cjs +6 -0
- package/build/browser/cjs/BAY6G2idlFTr3aXF.cjs +6 -0
- package/build/browser/cjs/BJAOd8ki61yYMUO8.cjs +6 -0
- package/build/browser/cjs/BNfn1no9QwiHEFwd.cjs +6 -0
- package/build/browser/cjs/BUkgy8lQRuxtyPlh.cjs +6 -0
- package/build/browser/cjs/B_O3B0P2cyGD9Rbm.cjs +6 -0
- package/build/browser/cjs/BkmEUMAKvuzsSqbR.cjs +7 -0
- package/build/browser/cjs/BlllxPbkhoY0sEC4.cjs +23 -0
- package/build/browser/cjs/BmT4qU5bgAIPFNTH.cjs +124 -0
- package/build/browser/cjs/BqZnbFL2t1u1XgPn.cjs +6 -0
- package/build/browser/cjs/Bs6xUWpBc0gC2FqH.cjs +6 -0
- package/build/browser/cjs/Bsv5BCVCW5dIA5It.cjs +1511 -0
- package/build/browser/cjs/ByZLM15SpxjqWDYX.cjs +6 -0
- package/build/browser/cjs/CaHv2p0pVvOc7XPO.cjs +42 -0
- package/build/browser/cjs/CcIliks7z_TMUXOM.cjs +6 -0
- package/build/browser/cjs/CpbUnis3pqWrW9H4.cjs +11 -0
- package/build/browser/cjs/CvGHijwHYOsCppoo.cjs +6 -0
- package/build/browser/cjs/D5m2Wlak7m4vG0kA.cjs +6 -0
- package/build/browser/cjs/DSNXa0HNC7bG9qZw.cjs +6 -0
- package/build/browser/cjs/DZ-H3oz78Mjq38DI.cjs +6 -0
- package/build/browser/cjs/Da34iNTZrWBA6OUT.cjs +6 -0
- package/build/browser/cjs/DfMNPyGio0O0RToU.cjs +6 -0
- package/build/browser/cjs/Dghi8Yq5nXZtUpoV.cjs +80 -0
- package/build/browser/cjs/Dk63Co0TJejVtNXp.cjs +6 -0
- package/build/browser/cjs/ErSjtO5fMJzUVHk4.cjs +6 -0
- package/build/browser/cjs/G-xZJIN6jjcTuQXA.cjs +6 -0
- package/build/browser/cjs/GPfZ0ZpBee250ywR.cjs +20 -0
- package/build/browser/cjs/IHypcrtWCiX_F0RJ.cjs +11 -0
- package/build/browser/cjs/X-HIF0659hMdI4Fu.cjs +6 -0
- package/build/browser/cjs/index.cjs +6 -0
- package/build/browser/cjs/qhBvSFMQ_DepDCwv.cjs +6 -0
- package/build/browser/cjs/wYOZ6mjOO7MbdyBZ.cjs +6 -0
- package/build/browser/esm/70LlV-Ub5gQiHal4.mjs +10 -0
- package/build/browser/esm/71Qocy3xStWv_56t.mjs +10 -0
- package/build/browser/esm/B9-WgxZWcZj4jdUC.mjs +10 -0
- package/build/browser/esm/BAKRnfUqPzHyyiLx.mjs +3966 -0
- package/build/browser/esm/BChNW8QNTMP8QXKM.mjs +484 -0
- package/build/browser/esm/BCzBxiWxCFs-jcmK.mjs +5651 -0
- package/build/browser/esm/BOn1aDBCyrMSMmVr.mjs +10 -0
- package/build/browser/esm/BPqJ7trmE53kA4iD.mjs +10 -0
- package/build/browser/esm/B_XqbIeKalrEkjs7.mjs +10 -0
- package/build/browser/esm/B_b5FIYJnm4UKAEc.mjs +28 -0
- package/build/browser/esm/BoWGCLoCBi99JpFs.mjs +10 -0
- package/build/browser/esm/Bq9W-xButcfpjGEk.mjs +433 -0
- package/build/browser/esm/ByxOyRbOjkmiHT8z.mjs +10 -0
- package/build/browser/esm/CAxIV1vPiKW9r_Yh.mjs +10 -0
- package/build/browser/esm/CFw23OkHfPquoVEk.mjs +10 -0
- package/build/browser/esm/CG8a93kgahRemVJe.mjs +10 -0
- package/build/browser/esm/CN45di2IcbM8P0Qu.mjs +10 -0
- package/build/browser/esm/COgfNXNmX_PF_eWZ.mjs +35 -0
- package/build/browser/esm/CPv7OpinaYcwbA_W.mjs +10 -0
- package/build/browser/esm/Cfhp3FCr7wP0Rnfu.mjs +10 -0
- package/build/browser/esm/D4GeLOfATuEzvjPr.mjs +1586 -0
- package/build/browser/esm/DMas1DZMe9F5tPaN.mjs +23970 -0
- package/build/browser/esm/DS4xBjO2TN0rQ1lJ.mjs +10 -0
- package/build/browser/esm/DTM0pK30PrZRsXYw.mjs +10 -0
- package/build/browser/esm/DgslJ1_vlPooGZHU.mjs +10 -0
- package/build/browser/esm/DmEPCZ9FSKO_TRTA.mjs +10 -0
- package/build/browser/esm/Do_EO3eQIyPgc7uz.mjs +30 -0
- package/build/browser/esm/ERMewE78C__HUblm.mjs +10 -0
- package/build/browser/esm/Qib5_XvQHWOPzGrm.mjs +10 -0
- package/build/browser/esm/SSYRYFzxzHWQzdAN.mjs +12 -0
- package/build/browser/esm/V_ha0oCA5_oDPanz.mjs +832 -0
- package/build/browser/esm/gTh1PiesKrQblf8O.mjs +10 -0
- package/build/browser/esm/g_p1uVDePbDJJ4nX.mjs +10 -0
- package/build/browser/esm/index.mjs +89 -0
- package/build/licenses/dependencies.txt +1239 -0
- package/build/node/esm/4HPektqH91Rh-rsq.mjs +2445 -0
- package/build/node/esm/70LlV-Ub5gQiHal4.mjs +10 -0
- package/build/node/esm/B9-WgxZWcZj4jdUC.mjs +10 -0
- package/build/node/esm/BDxewg-utn4BhUXl.mjs +35 -0
- package/build/node/esm/BPqJ7trmE53kA4iD.mjs +10 -0
- package/build/node/esm/BUOg554dxBM0VWFi.mjs +22 -0
- package/build/node/esm/B_XqbIeKalrEkjs7.mjs +10 -0
- package/build/node/esm/BoWGCLoCBi99JpFs.mjs +10 -0
- package/build/node/esm/ByxOyRbOjkmiHT8z.mjs +10 -0
- package/build/node/esm/CFw23OkHfPquoVEk.mjs +10 -0
- package/build/node/esm/CG8a93kgahRemVJe.mjs +10 -0
- package/build/node/esm/CN45di2IcbM8P0Qu.mjs +10 -0
- package/build/node/esm/CNOiP4baOWSizP6F.mjs +1070 -0
- package/build/node/esm/CPv7OpinaYcwbA_W.mjs +10 -0
- package/build/node/esm/CVAFJAiy4lznWzaG.mjs +10 -0
- package/build/node/esm/CZd8SSXlusZy49FM.mjs +10 -0
- package/build/node/esm/CZw7SgmfxSHhZZe0.mjs +10 -0
- package/build/node/esm/Cdjab80o1WocCHgN.mjs +13 -0
- package/build/node/esm/CfWoSrOmaP9LrFja.mjs +466 -0
- package/build/node/esm/CnaBpzYiURAKhAxF.mjs +825 -0
- package/build/node/esm/Cp5ea9Hpxse8B4mC.mjs +10 -0
- package/build/node/esm/DH_fbhyW3PwE1rYa.mjs +10 -0
- package/build/node/esm/DNHqdv3-ufdcF5zc.mjs +20 -0
- package/build/node/esm/DS4xBjO2TN0rQ1lJ.mjs +10 -0
- package/build/node/esm/DTM0pK30PrZRsXYw.mjs +10 -0
- package/build/node/esm/DlFgt0KLeXDowatv.mjs +10 -0
- package/build/node/esm/ERMewE78C__HUblm.mjs +10 -0
- package/build/node/esm/GTFYlX2Atw10TdFe.mjs +86 -0
- package/build/node/esm/Qib5_XvQHWOPzGrm.mjs +10 -0
- package/build/node/esm/gTh1PiesKrQblf8O.mjs +10 -0
- package/build/node/esm/g_p1uVDePbDJJ4nX.mjs +10 -0
- package/build/node/esm/index.mjs +23412 -0
- package/build/package.json +58 -0
- package/build/types/index.d.ts +20624 -0
- package/package.json +85 -0
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { ADDRESS: { s: "Creates a cell reference as text, given specified row and column numbers", p: { rowNum: { d: "is the row number to use in the cell reference: Row_number = 1 for row 1" }, columnNum: { d: "is the column number to use in the cell reference. For example, Column_number = 4 for column D" }, absNum: { d: "specifies the reference type: absolute = 1; absolute row/relative column = 2; relative row/absolute column = 3; relative = 4", v: 1 }, a1: { d: "is a logical value that specifies the reference style: A1 style = 1 or TRUE; R1C1 style = 0 or FALSE", v: !0 }, sheetText: { d: "is text specifying the name of the worksheet to be used as the external reference", v: "" } } }, AREAS: { s: "Returns the number of areas in a reference. An area is a range of contiguous cells or a single cell", p: { references: { d: "is a reference to a cell or range of cells and can refer to multiple areas" } } }, CHOOSE: { s: "Chooses a value or action to perform from a list of values, based on an index number", p: { indexNum: { d: "specifies which value argument is selected. Index_num must be between 1 and 254, or a formula or a reference to a number between 1 and 254" }, value1: { d: "value1,value2,... are 1 to 254 numbers, cell references, defined names, formulas, functions, or text arguments from which CHOOSE selects" }, value: {} } }, CHOOSECOLS: { s: "Returns columns from an array or reference.", p: { array: { d: "The array or reference from which to choose columns." }, colNum1: { d: "col_num1,col_num2,... The number of the column to be returned." }, colNum: {} } }, CHOOSEROWS: { s: "Returns rows from an array or reference.", p: { array: { d: "The array or reference from which to choose rows." }, rowNum1: { d: "row_num1,row_num2,... The number of the row to be returned." }, rowNum: {} } }, COLUMN: { s: "Returns the column number of a reference", p: { reference: { d: "is the cell or range of contiguous cells for which you want the column number. If omitted, the cell containing the COLUMN function is used" } } }, COLUMNS: { s: "Returns the number of columns in an array or reference", p: { array: { d: "is an array or array formula, or a reference to a range of cells for which you want the number of columns" } } }, DROP: { s: "Drops rows or columns from array start or end.", p: { array: { d: "The array from which to drop rows or columns." }, row: { d: "The number of rows to drop. A negative value drops from the end of the array." }, columns: { d: "The number of columns to drop. A negative value drops from the end of the array.", v: 0 } }, h: "Unimplemented" }, EXPAND: { s: "Expands an array to the specified dimensions.", p: { array: { d: "The array to expand." }, row: { d: "The number of rows in the expanded array. If missing, rows will not be expanded." }, columns: { d: "The number of columns in the expanded array. If missing, columns will not be expanded.", v: 0 }, padWidth: { d: "The value with which to pad. The default is #N/A.", v: "FormulaError.BuiltIn.NA" } }, h: "Unimplemented" }, FIELDVALUE: { s: "Extracts a value from a field of a given record", p: { value: { d: "The record from which you want to extract the field" }, fieldName: { d: "The names of the field or fields that you want to extract" } }, h: "Unimplemented" }, FILTER: { s: "Filter a range or array", p: { array: { d: "the range or array to filter" }, include: { d: "an array of booleans where TRUE represents a row or column to retain" }, ifEmpty: { d: "return if no items are retained" } }, h: "Unimplemented" }, FORMULATEXT: { s: "Returns a formula as a string", p: { reference: { d: "is a reference to a formula" } } }, GETPIVOTDATA: { s: "Extracts data stored in a PivotTable.", p: { dataField: { d: "is the name of the data field to extract data from" }, pivotTable: { d: "is a reference to a cell or range of cells in the PivotTable that contains the data you want to retrieve" }, field1: { d: "field1,field2,... field to refer to" }, item1: { d: "item1,item2,... field item to refer to" } }, h: "Unimplemented" }, GROUPBY: { s: "Aggregate values by row fields", p: { rowFields: { d: "The range or array containing the row fields" }, values: { d: "The range or array containing the values to aggregate" }, fn: { d: "The function used to do the aggregations" }, fieldHeaders: { d: "A number between 0 and 3 that specifies whether the field data has headers and whether field headers should be returned in the results", v: null }, totalDepth: { d: "Show totals for the row fields. 0 for none, 1 for grand totals, 2 for grand total and first level subtotals, etc", v: 2 }, sortOrder: { d: "The column index to sort the row fields on. A negative index will sort in reverse order", v: null }, filterArray: { d: "param-534 paramName-535", v: null }, fieldRelationship: { d: "The relationship of fields when multiple columns are supplied to the row_fields argument", v: 0 } }, h: "Unimplemented" }, HLOOKUP: { p: { lookupValue: { d: "is the value to be found in the first row of the table and can be a value, a reference, or a text string" }, tableArray: { d: "is a table of text, numbers, or logical values in which data is looked up. Table_array can be a reference to a range or a range name" }, rowIndexNum: { d: "is the row number in table_array from which the matching value should be returned. The first row of values in the table is row 1" }, rangeLookup: { d: "is a logical value: to find the closest match in the top row (sorted in ascending order) = TRUE; find an exact match = FALSE", v: !0 } } }, HSTACK: { s: "Horizontally stacks arrays into one array.", p: { array1: {}, array: { d: "array1,array2,... An array or reference to be stacked." } }, h: "Unimplemented" }, HYPERLINK: { s: "Creates a shortcut or jump that opens a document stored on your hard drive, a network server, or on the Internet", p: { linkLocation: { d: "is the text giving the path and file name to the document to be opened, a hard drive location, UNC address, or URL path" }, friendlyName: { d: "is text or a number that is displayed in the cell. If omitted, the cell displays the Link_location text" } }, h: "Unimplemented" }, IMAGE: { s: "Returns an image from a given source", p: { source: { d: "The path of the source that points to the image" }, alternateText: { d: "The alternative text that describes the image for accessibility" }, sizing: { d: "The setting that determines the dimensions in which the image will be rendered in the cell" }, height: { d: "The custom height of the image in pixels" }, width: { d: "The custom width of the image in pixels" } }, h: "Unimplemented" }, INDEX: { s: "Returns a value or reference of the cell at the intersection of a particular row and column, in a given range", p: { array: { d: "is a range of cells or an array constant." }, rowNum: { d: "selects the row in Array or Reference from which to return a value. If omitted, Column_num is required", v: 0 }, colNum: { d: "selects the column in Array or Reference from which to return a value. If omitted, Row_num is required", v: 0 }, areaNum: { d: "selects the area in Array or Reference from which to return a value. If omitted, the first area is used", v: 1 } } }, INDIRECT: { s: "Returns the reference specified by a text string", p: { refText: { d: "is a reference to a cell that contains an A1- or R1C1-style reference, a name defined as a reference, or a reference to a cell as a text string" }, a1: { d: "is a logical value that specifies the type of reference in Ref_text: R1C1-style = FALSE; A1-style = TRUE.", v: !0 } } }, LOOKUP: { s: "Looks up a value either from a one-row or one-column range or from an array. Provided for backward compatibility", p: { lookupValue: { d: "is a value that LOOKUP searches for in Lookup_vector and can be a number, text, a logical value, or a name or reference to a value" }, lookupVector: { d: "is a range that contains only one row or one column of text, numbers, or logical values, placed in ascending order" }, resultVector: { d: "is a range that contains only one row or column, the same size as Lookup_vector" } }, h: "Unimplemented" }, MATCH: { s: "Returns the relative position of an item in an array that matches a specified value in a specified order", p: { lookupValue: { d: "is the value you use to find the value you want in the array, a number, text, or logical value, or a reference to one of these" }, lookupArray: { d: "is a contiguous range of cells containing possible lookup values, an array of values, or a reference to an array" }, matchType: { d: "is a number 1, 0, or -1 indicating which value to return." } }, h: "Unimplemented" }, OFFSET: { s: "Returns a reference to a range that is a given number of rows and columns from a given reference", p: { reference: { d: "is the reference from which you want to base the offset, a reference to a cell or range of adjacent cells" }, rows: { d: "is the number of rows, up or down, that you want the upper-left cell of the result to refer to" }, cols: { d: "is the number of columns, to the left or right, that you want the upper-left cell of the result to refer to" }, height: { d: "is the height, in number of rows, that you want the result to be, the same height as Reference if omitted" }, width: { d: "is the width, in number of columns, that you want the result to be, the same width as Reference if omitted" } } }, PIVOTBY: { p: { rowFields: {}, colFields: {}, values: {}, fn: {}, fieldHeaders: { v: null }, rowTotalDepth: { v: 2 }, rowSortOrder: { v: null }, colTotalDepth: { v: 2 }, colSortOrder: { v: null }, filterArray: { v: null }, relativeTo: { v: 0 } }, h: "Unimplemented" }, ROW: { s: "Returns the row number of a reference", p: { reference: { d: "is the cell or a single range of cells for which you want the row number; if omitted, returns the cell containing the ROW function" } } }, ROWS: { s: "Returns the number of rows in a reference or array", p: { array: { d: "is an array, an array formula, or a reference to a range of cells for which you want the number of rows" } } }, RTD: { s: "Retrieves the real-time data (RTD) from a program that supports COM automation", p: { progId: { d: "is the programmatic identifier (ProgID) of a registered COM automation add-in. Enclose the id in quotation marks" }, server: { d: "is the name of the server that provides the real-time data. If running locally us an empty string" }, topic: { d: "topic1,topic2,... are 1 to 38 parameters that specify a piece of data" } }, h: "Unimplemented" }, SORT: { s: "Sorts a range or array", p: { array: { d: "the range or array to sort" }, sortIndex: { d: "a number indicating the row or column to sort by" }, sortOrder: { d: "a number indicating the desired sort order; 1 for ascending order (default), -1 for descending order" }, byCol: { d: "a logical value indicating the desired sort direction: FALSE to sort by row (default), TRUE to sort by column", v: !1 } }, h: "Unimplemented" }, SORTBY: { s: "Sorts a range or array based on the values in a corresponding range or array", p: { array: { d: "the range or array to sort" }, byArray1: { d: "by_array1,by_array2,... the range or array to sort on" }, sortOrder: { d: "sort_order1,sort_order2,... a number indicating the desired sort order; 1 for ascending order (default), -1 for descending order" } }, h: "Unimplemented" }, TAKE: { s: "Returns rows or columns from array start or end.", p: { array: { d: "The array from which to take rows or columns." }, rows: { d: "The number of rows to take. A negative value takes from the end of the array." }, columns: { d: "The number of columns to take. A negative value takes from the end of the array.", v: 0 } }, h: "Unimplemented" }, TOCOL: { s: "Returns the array as one column.", p: { array: { d: "The array or reference to return as a column." }, ignore: { d: "Whether to ignore certain types of values. By default, no values are ignored.", v: 0 }, scanByColumn: { d: "Scan the array by column. By default, the array is scanned by row.", v: !1 } }, h: "Unimplemented" }, TOROW: { s: "Returns the array as one row.", p: { array: { d: "The array or reference to return as a column." }, ignore: { d: "Whether to ignore certain types of values. By default, no values are ignored.", v: 0 }, scanByColumn: { d: "Scan the array by column. By default, the array is scanned by row.", v: !1 } }, h: "Unimplemented" }, TRANSPOSE: { s: "Converts a vertical range of cells to a horizontal range, or vice versa", p: { array: { d: "is a range of cells on a worksheet or an array of values that you want to transpose" } } }, TRIMRANGE: { s: "Trims a range to the last used cell in any direction.", p: { range: { d: "The range to be trimmed" }, rowTrimMode: { d: "Row trim direction. 0 - none, 1 - leading, 2 - trailing, 3 - both.", v: 3 }, colTrimMode: { d: "Column trim direction. 0 - none. 1 - leading, 2 - trailing, 3 - both.", v: 3 } } }, UNIQUE: { s: "Returns the unique values from a range or array.", p: { array: { d: "the range or array from which to return unique rows or columns" }, byCol: { d: "is a logical value: compare rows against each other and return the unique rows = FALSE; compare columns against each other and return the unique columns = TRUE", v: !1 }, exactlyOnce: { d: "is a logical value: return rows or columns that occur exactly once from the array = TRUE; return all distinct rows or columns from the array = FALSE", v: !1 } }, h: "Unimplemented" }, VLOOKUP: { s: "Looks for a value in the leftmost column of a table, and then returns a value in the same row from a column you specify. By default, the table must be sorted in an ascending order", p: { lookupValue: { d: "is the value to be found in the first column of the table, and can be a value, a reference, or a text string" }, tableArray: { d: "is a table of text, numbers, or logical values, in which data is retrieved. Table_array can be a reference to a range or a range name" }, colIndexNum: { d: "is the column number in table_array from which the matching value should be returned. The first column of values in the table is column 1" }, rangeLookup: { d: "is a logical value: to find the closest match in the first column (sorted in ascending order) = TRUE; find an exact match = FALSE", v: !0 } } }, VSTACK: { s: "Vertically stacks arrays into one array.", p: { array1: { d: "array1,array2,... An array or reference to be stacked." }, array: { d: "array1,array2,... An array or reference to be stacked." } }, h: "Unimplemented" }, WRAPCOLS: { s: "Wraps a row or column vector after a specified number of values.", p: { vector: { d: "The vector or reference to wrap." }, wrapCount: { d: "The maximum number of values per column." }, padWith: { d: "The value with which to pad. The default is #N/A.", v: "FormulaError.BuiltIn.NA" } }, h: "Unimplemented" }, WRAPROWS: { s: "Wraps a row or column vector after a specified number of values.", p: { vector: { d: "The vector or reference to wrap." }, wrapCount: { d: "The maximum number of values per column." }, padWith: { d: "The value with which to pad. The default is #N/A.", v: "FormulaError.BuiltIn.NA" } }, h: "Unimplemented" }, XLOOKUP: { s: "Searches a range or an array for a match and returns the corresponding item from a second range or array. By default, an exact match is used", p: { lookupValue: { d: "is the value to search for" }, lookupArray: { d: "is the array or range to search" }, returnArray: { d: "is the array or range to return" }, ifNotFound: { d: "returned if no match is found" }, rangeLookup: { v: !0 }, matchMode: { d: "specify how to match lookup_value against the values in lookup_array" }, searchMode: { d: "specify the search mode to use. By default, a first to last search will be used", v: !0 } }, h: "Unimplemented" }, XMATCH: { s: "Returns the relative position of an item in an array. By default, an exact match is required", p: { lookupValue: { d: "is the value to search for" }, lookupArray: { d: "is the array or range to search" }, matchMode: { d: "specify how to match the lookup_value against the values in lookup_array" }, searchMode: { d: "specify the search mode to use. By default, a first to last search will be used", v: !0 } }, h: "Unimplemented" } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const r = { ERF: { s: "Returns the error function", p: { lowerLimit: { d: "is the lower bound for integrating ERF" }, upperLimit: { d: "is the upper bound for integrating ERF", v: 0 } } }, "ERF.PRECISE": { s: "Returns the error function", p: { x: { d: "is the lower bound for integrating ERF.PRECISE" } } }, ERFC: { s: "Returns the complementary error function", p: { x: { d: "is the lower bound for integrating ERF" } } } };
|
|
8
|
+
export {
|
|
9
|
+
r as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { COMPLEX: { s: "Converts real and imaginary coefficients into a complex number", p: { realNum: { d: "is the real coefficient of the complex number" }, iNum: { d: "is the imaginary coefficient of the complex number" }, suffix: { d: "is the suffix for the imaginary component of the complex number", v: "i" } } }, IMABS: { s: "Returns the absolute value (modulus) of a complex number", p: { inumber: { d: "is a complex number for which you want the absolute value" } } }, IMAGINARY: { s: "Returns the imaginary coefficient of a complex number", p: { inumber: { d: "is a complex number for which you want the imaginary coefficient" } } }, IMARGUMENT: { s: "Returns the argument q, an angle expressed in radians", p: { inumber: { d: "is a complex number for which you want the argument" } } }, IMCONJUGATE: { s: "Returns the complex conjugate of a complex number", p: { inumber: { d: "is a complex number for which you want the conjugate" } } }, IMCOS: { s: "Returns the cosine of a complex number", p: { inumber: { d: "is a complex number for which you want the cosine" } } }, IMCOSH: { s: "Returns the hyperbolic cosine of a complex number", p: { inumber: { d: "is a complex number for which you want the hyperbolic cosine" } } }, IMCOT: { s: "Returns the cotangent of a complex number", p: { inumber: { d: "is a complex number for which you want the cotangent" } } }, IMCSC: { s: "Returns the cosecant of a complex number", p: { inumber: { d: "is a complex number for which you want the cosecant" } } }, IMCSCH: { s: "Returns the hyperbolic cosecant of a complex number", p: { inumber: { d: "is a complex number for which you want the hyperbolic cosecant" } } }, IMDIV: { s: "Returns the quotient of two complex numbers", p: { inumber1: { d: "is the complex numerator or dividend" }, inumber2: { d: "is the complex denominator or divisor" } } }, IMEXP: { s: "Returns the exponential of a complex number", p: { inumber: { d: "is a complex number for which you want the exponential" } } }, IMLN: { s: "Returns the exponential of a complex number", p: { inumber: { d: "is a complex number for which you want the exponential" } } }, IMLOG10: { s: "Returns the base-10 logarithm of a complex number", p: { inumber: { d: "is a complex number for which you want the common logarithm" } } }, IMLOG2: { s: "Returns the base-2 logarithm of a complex number", p: { inumber: { d: "is a complex number for which you want the base-2 logarithm" } } }, IMPOWER: { s: "Returns the base-2 logarithm of a complex number", p: { inumber: { d: "is a complex number for which you want the base-2 logarithm" }, number: {} } }, IMPRODUCT: { s: "Returns the product of 1 to 255 complex numbers", p: { inumber: { d: "inumber1,inumber2,... Inumber1, Inumber2,... are from 1 to 255 complex numbers to multiply." } } }, IMREAL: { s: "Returns the real coefficient of a complex number", p: { inumber: { d: "is a complex number for which you want the real coefficient" } } }, IMSEC: { s: "Returns the secant of a complex number", p: { inumber: { d: "is a complex number for which you want the secant" } } }, IMSECH: { s: "Returns the hyperbolic secant of a complex number", p: { inumber: { d: "is a complex number for which you want the hyperbolic secant" } } }, IMSIN: { s: "Returns the sine of a complex number", p: { inumber: { d: "is a complex number for which you want the sine" } } }, IMSINH: { s: "Returns the hyperbolic sine of a complex number", p: { inumber: { d: "is a complex number for which you want the hyperbolic sine" } } }, IMSQRT: { s: "Returns the square root of a complex number", p: { inumber: { d: "is a complex number for which you want the square root" } } }, IMSUB: { s: "Returns the difference of two complex numbers", p: { inumber1: { d: "is the complex number from which to subtract inumber2" }, inumber2: { d: "is the complex number to subtract from inumber1" } } }, IMSUM: { s: "Returns the sum of complex numbers", p: { inumber: { d: "inumber1,inumber2,... are from 1 to 255 complex numbers to add" } } }, IMTAN: { s: "Returns the tangent of a complex number", p: { inumber: { d: "is a complex number for which you want the tangent" } } } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
/**
|
|
8
|
+
* @license @sheetxl/scripting - SheetXL scripting utilities including TypeScript compilation. - v0.0.0
|
|
9
|
+
*
|
|
10
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
11
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
12
|
+
*/
|
|
13
|
+
let e = null;
|
|
14
|
+
async function n() {
|
|
15
|
+
return e || (e = new Promise(async (r, o) => {
|
|
16
|
+
console.log("🔄 Initializing Browser TypeScript module...");
|
|
17
|
+
let i = null;
|
|
18
|
+
try {
|
|
19
|
+
i = await import("https://esm.sh/typescript@5.7.2");
|
|
20
|
+
} catch (l) {
|
|
21
|
+
console.error("Error initializing Browser TypeScript module:", l);
|
|
22
|
+
}
|
|
23
|
+
i || console.log("use script fallback"), r(i);
|
|
24
|
+
}), e);
|
|
25
|
+
}
|
|
26
|
+
export {
|
|
27
|
+
n as initialize
|
|
28
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { CUBEKPIMEMBER: { s: "Returns a key performance indicator (KPI) property and displays the KPI name in the cell.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, kpiName: { d: "is the KPI name" }, kpiProperty: { d: "is the KPI property" }, caption: { d: "is the caption to be displayed in the cell" } }, h: "Unimplemented" }, CUBEMEMBER: { s: "Returns a member or tuple from the cube.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, memberExpression: { d: "is the expression representing the name of a member or tuple in the OLAP cube" }, caption: { d: "is the caption to be displayed in the cell" } }, h: "Unimplemented" }, CUBEMEMBERPROPERTY: { s: "Returns the value of a member property from the cube.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, memberExpression: { d: "is the expression representing the name of a member in the OLAP cube" }, kpiProperty: { d: "is the property name" } }, h: "Unimplemented" }, CUBERANKEDMEMBER: { s: "Returns the nth, or ranked, member in a set.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, setExpression: { d: "is the set from which the element is to be retrieved" }, rank: { d: "is the rank of the element to be retrieved" }, caption: { d: "is the caption to be displayed in the cell" } }, h: "Unimplemented" }, CUBESET: { s: "Defines a calculated set of members or tuples by sending a set expression to the cube on the server, which creates the set, and then returns that set to Microsoft Excel.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, setExpression: { d: "is the expression for the set" }, caption: { d: "is the caption to be displayed in the cell" }, sortOrder: { d: "is the sort order" }, sortBy: { d: "is the sort by" } }, h: "Unimplemented" }, CUBESETCOUNT: { s: "Returns the number of items in a set.", p: { set: { d: "is the set whose elements are to be counted" } }, h: "Unimplemented" }, CUBEVALUE: { s: "Returns an aggregated value from the cube.", p: { connection: { d: "is the name of a connection to an OLAP cube" }, memberExpression: {} }, h: "Unimplemented" } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,433 @@
|
|
|
1
|
+
import { h as yt } from "./DMas1DZMe9F5tPaN.mjs";
|
|
2
|
+
/**
|
|
3
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
4
|
+
*
|
|
5
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
6
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
7
|
+
*/
|
|
8
|
+
function kt(Y, H) {
|
|
9
|
+
for (var k = 0; k < H.length; k++) {
|
|
10
|
+
const P = H[k];
|
|
11
|
+
if (typeof P != "string" && !Array.isArray(P)) {
|
|
12
|
+
for (const N in P) if (N !== "default" && !(N in Y)) {
|
|
13
|
+
const Q = Object.getOwnPropertyDescriptor(P, N);
|
|
14
|
+
Q && Object.defineProperty(Y, N, Q.get ? Q : { enumerable: !0, get: () => P[N] });
|
|
15
|
+
}
|
|
16
|
+
}
|
|
17
|
+
}
|
|
18
|
+
return Object.freeze(Object.defineProperty(Y, Symbol.toStringTag, { value: "Module" }));
|
|
19
|
+
}
|
|
20
|
+
var ct, pt = { exports: {} };
|
|
21
|
+
/* @license
|
|
22
|
+
Papa Parse
|
|
23
|
+
v5.5.3
|
|
24
|
+
https://github.com/mholt/PapaParse
|
|
25
|
+
License: MIT
|
|
26
|
+
*/
|
|
27
|
+
var gt = (ct || (ct = 1, pt.exports = function Y() {
|
|
28
|
+
var H, k = typeof self < "u" ? self : typeof window < "u" ? window : k !== void 0 ? k : {}, P = !k.document && !!k.postMessage, N = k.IS_PAPA_WORKER || !1, Q = {}, mt = 0, o = {};
|
|
29
|
+
function B(t) {
|
|
30
|
+
this._handle = null, this._finished = !1, this._completed = !1, this._halted = !1, this._input = null, this._baseIndex = 0, this._partialLine = "", this._rowCount = 0, this._start = 0, this._nextChunk = null, this.isFirstChunk = !0, this._completeResults = { data: [], errors: [], meta: {} }, function(e) {
|
|
31
|
+
var i = at(e);
|
|
32
|
+
i.chunkSize = parseInt(i.chunkSize), e.step || e.chunk || (i.chunkSize = null), this._handle = new ht(i), (this._handle.streamer = this)._config = i;
|
|
33
|
+
}.call(this, t), this.parseChunk = function(e, i) {
|
|
34
|
+
var n = parseInt(this._config.skipFirstNLines) || 0;
|
|
35
|
+
if (this.isFirstChunk && 0 < n) {
|
|
36
|
+
let c = this._config.newline;
|
|
37
|
+
c || (r = this._config.quoteChar || '"', c = this._handle.guessLineEndings(e, r)), e = [...e.split(c).slice(n)].join(c);
|
|
38
|
+
}
|
|
39
|
+
this.isFirstChunk && _(this._config.beforeFirstChunk) && (r = this._config.beforeFirstChunk(e)) !== void 0 && (e = r), this.isFirstChunk = !1, this._halted = !1, n = this._partialLine + e;
|
|
40
|
+
var r = (this._partialLine = "", this._handle.parse(n, this._baseIndex, !this._finished));
|
|
41
|
+
if (!this._handle.paused() && !this._handle.aborted()) {
|
|
42
|
+
if (e = r.meta.cursor, this._finished || (this._partialLine = n.substring(e - this._baseIndex), this._baseIndex = e), r && r.data && (this._rowCount += r.data.length), n = this._finished || this._config.preview && this._rowCount >= this._config.preview, N) k.postMessage({ results: r, workerId: o.WORKER_ID, finished: n });
|
|
43
|
+
else if (_(this._config.chunk) && !i) {
|
|
44
|
+
if (this._config.chunk(r, this._handle), this._handle.paused() || this._handle.aborted()) return void (this._halted = !0);
|
|
45
|
+
this._completeResults = r = void 0;
|
|
46
|
+
}
|
|
47
|
+
return this._config.step || this._config.chunk || (this._completeResults.data = this._completeResults.data.concat(r.data), this._completeResults.errors = this._completeResults.errors.concat(r.errors), this._completeResults.meta = r.meta), this._completed || !n || !_(this._config.complete) || r && r.meta.aborted || (this._config.complete(this._completeResults, this._input), this._completed = !0), n || r && r.meta.paused || this._nextChunk(), r;
|
|
48
|
+
}
|
|
49
|
+
this._halted = !0;
|
|
50
|
+
}, this._sendError = function(e) {
|
|
51
|
+
_(this._config.error) ? this._config.error(e) : N && this._config.error && k.postMessage({ workerId: o.WORKER_ID, error: e, finished: !1 });
|
|
52
|
+
};
|
|
53
|
+
}
|
|
54
|
+
function it(t) {
|
|
55
|
+
var e;
|
|
56
|
+
(t = t || {}).chunkSize || (t.chunkSize = o.RemoteChunkSize), B.call(this, t), this._nextChunk = P ? function() {
|
|
57
|
+
this._readChunk(), this._chunkLoaded();
|
|
58
|
+
} : function() {
|
|
59
|
+
this._readChunk();
|
|
60
|
+
}, this.stream = function(i) {
|
|
61
|
+
this._input = i, this._nextChunk();
|
|
62
|
+
}, this._readChunk = function() {
|
|
63
|
+
if (this._finished) this._chunkLoaded();
|
|
64
|
+
else {
|
|
65
|
+
if (e = new XMLHttpRequest(), this._config.withCredentials && (e.withCredentials = this._config.withCredentials), P || (e.onload = J(this._chunkLoaded, this), e.onerror = J(this._chunkError, this)), e.open(this._config.downloadRequestBody ? "POST" : "GET", this._input, !P), this._config.downloadRequestHeaders) {
|
|
66
|
+
var i, n = this._config.downloadRequestHeaders;
|
|
67
|
+
for (i in n) e.setRequestHeader(i, n[i]);
|
|
68
|
+
}
|
|
69
|
+
var r;
|
|
70
|
+
this._config.chunkSize && (r = this._start + this._config.chunkSize - 1, e.setRequestHeader("Range", "bytes=" + this._start + "-" + r));
|
|
71
|
+
try {
|
|
72
|
+
e.send(this._config.downloadRequestBody);
|
|
73
|
+
} catch (c) {
|
|
74
|
+
this._chunkError(c.message);
|
|
75
|
+
}
|
|
76
|
+
P && e.status === 0 && this._chunkError();
|
|
77
|
+
}
|
|
78
|
+
}, this._chunkLoaded = function() {
|
|
79
|
+
e.readyState === 4 && (e.status < 200 || 400 <= e.status ? this._chunkError() : (this._start += this._config.chunkSize || e.responseText.length, this._finished = !this._config.chunkSize || this._start >= ((i) => (i = i.getResponseHeader("Content-Range")) !== null ? parseInt(i.substring(i.lastIndexOf("/") + 1)) : -1)(e), this.parseChunk(e.responseText)));
|
|
80
|
+
}, this._chunkError = function(i) {
|
|
81
|
+
i = e.statusText || i, this._sendError(new Error(i));
|
|
82
|
+
};
|
|
83
|
+
}
|
|
84
|
+
function rt(t) {
|
|
85
|
+
(t = t || {}).chunkSize || (t.chunkSize = o.LocalChunkSize), B.call(this, t);
|
|
86
|
+
var e, i, n = typeof FileReader < "u";
|
|
87
|
+
this.stream = function(r) {
|
|
88
|
+
this._input = r, i = r.slice || r.webkitSlice || r.mozSlice, n ? ((e = new FileReader()).onload = J(this._chunkLoaded, this), e.onerror = J(this._chunkError, this)) : e = new FileReaderSync(), this._nextChunk();
|
|
89
|
+
}, this._nextChunk = function() {
|
|
90
|
+
this._finished || this._config.preview && !(this._rowCount < this._config.preview) || this._readChunk();
|
|
91
|
+
}, this._readChunk = function() {
|
|
92
|
+
var r = this._input, c = (this._config.chunkSize && (c = Math.min(this._start + this._config.chunkSize, this._input.size), r = i.call(r, this._start, c)), e.readAsText(r, this._config.encoding));
|
|
93
|
+
n || this._chunkLoaded({ target: { result: c } });
|
|
94
|
+
}, this._chunkLoaded = function(r) {
|
|
95
|
+
this._start += this._config.chunkSize, this._finished = !this._config.chunkSize || this._start >= this._input.size, this.parseChunk(r.target.result);
|
|
96
|
+
}, this._chunkError = function() {
|
|
97
|
+
this._sendError(e.error);
|
|
98
|
+
};
|
|
99
|
+
}
|
|
100
|
+
function X(t) {
|
|
101
|
+
var e;
|
|
102
|
+
B.call(this, t = t || {}), this.stream = function(i) {
|
|
103
|
+
return e = i, this._nextChunk();
|
|
104
|
+
}, this._nextChunk = function() {
|
|
105
|
+
var i, n;
|
|
106
|
+
if (!this._finished) return i = this._config.chunkSize, e = i ? (n = e.substring(0, i), e.substring(i)) : (n = e, ""), this._finished = !e, this.parseChunk(n);
|
|
107
|
+
};
|
|
108
|
+
}
|
|
109
|
+
function nt(t) {
|
|
110
|
+
B.call(this, t = t || {});
|
|
111
|
+
var e = [], i = !0, n = !1;
|
|
112
|
+
this.pause = function() {
|
|
113
|
+
B.prototype.pause.apply(this, arguments), this._input.pause();
|
|
114
|
+
}, this.resume = function() {
|
|
115
|
+
B.prototype.resume.apply(this, arguments), this._input.resume();
|
|
116
|
+
}, this.stream = function(r) {
|
|
117
|
+
this._input = r, this._input.on("data", this._streamData), this._input.on("end", this._streamEnd), this._input.on("error", this._streamError);
|
|
118
|
+
}, this._checkIsFinished = function() {
|
|
119
|
+
n && e.length === 1 && (this._finished = !0);
|
|
120
|
+
}, this._nextChunk = function() {
|
|
121
|
+
this._checkIsFinished(), e.length ? this.parseChunk(e.shift()) : i = !0;
|
|
122
|
+
}, this._streamData = J(function(r) {
|
|
123
|
+
try {
|
|
124
|
+
e.push(typeof r == "string" ? r : r.toString(this._config.encoding)), i && (i = !1, this._checkIsFinished(), this.parseChunk(e.shift()));
|
|
125
|
+
} catch (c) {
|
|
126
|
+
this._streamError(c);
|
|
127
|
+
}
|
|
128
|
+
}, this), this._streamError = J(function(r) {
|
|
129
|
+
this._streamCleanUp(), this._sendError(r);
|
|
130
|
+
}, this), this._streamEnd = J(function() {
|
|
131
|
+
this._streamCleanUp(), n = !0, this._streamData("");
|
|
132
|
+
}, this), this._streamCleanUp = J(function() {
|
|
133
|
+
this._input.removeListener("data", this._streamData), this._input.removeListener("end", this._streamEnd), this._input.removeListener("error", this._streamError);
|
|
134
|
+
}, this);
|
|
135
|
+
}
|
|
136
|
+
function ht(t) {
|
|
137
|
+
var e, i, n, r, c = Math.pow(2, 53), C = -c, j = /^\s*-?(\d+\.?|\.\d+|\d+\.\d+)([eE][-+]?\d+)?\s*$/, z = /^((\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d:[0-5]\d\.\d+([+-][0-2]\d:[0-5]\d|Z))|(\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d:[0-5]\d([+-][0-2]\d:[0-5]\d|Z))|(\d{4}-[01]\d-[0-3]\dT[0-2]\d:[0-5]\d([+-][0-2]\d:[0-5]\d|Z)))$/, p = this, w = 0, a = 0, L = !1, u = !1, g = [], s = { data: [], errors: [], meta: {} };
|
|
138
|
+
function O(h) {
|
|
139
|
+
return t.skipEmptyLines === "greedy" ? h.join("").trim() === "" : h.length === 1 && h[0].length === 0;
|
|
140
|
+
}
|
|
141
|
+
function R() {
|
|
142
|
+
if (s && n && (M("Delimiter", "UndetectableDelimiter", "Unable to auto-detect delimiting character; defaulted to '" + o.DefaultDelimiter + "'"), n = !1), t.skipEmptyLines && (s.data = s.data.filter(function(l) {
|
|
143
|
+
return !O(l);
|
|
144
|
+
})), T()) {
|
|
145
|
+
let l = function(S, A) {
|
|
146
|
+
_(t.transformHeader) && (S = t.transformHeader(S, A)), g.push(S);
|
|
147
|
+
};
|
|
148
|
+
if (s) if (Array.isArray(s.data[0])) {
|
|
149
|
+
for (var h = 0; T() && h < s.data.length; h++) s.data[h].forEach(l);
|
|
150
|
+
s.data.splice(0, 1);
|
|
151
|
+
} else s.data.forEach(l);
|
|
152
|
+
}
|
|
153
|
+
function d(l, S) {
|
|
154
|
+
for (var A = t.header ? {} : [], b = 0; b < l.length; b++) {
|
|
155
|
+
var y = b, m = l[b];
|
|
156
|
+
m = ((U, f) => ((v) => (t.dynamicTypingFunction && t.dynamicTyping[v] === void 0 && (t.dynamicTyping[v] = t.dynamicTypingFunction(v)), (t.dynamicTyping[v] || t.dynamicTyping) === !0))(U) ? f === "true" || f === "TRUE" || f !== "false" && f !== "FALSE" && (((v) => {
|
|
157
|
+
if (j.test(v) && (v = parseFloat(v), C < v && v < c)) return 1;
|
|
158
|
+
})(f) ? parseFloat(f) : z.test(f) ? new Date(f) : f === "" ? null : f) : f)(y = t.header ? b >= g.length ? "__parsed_extra" : g[b] : y, m = t.transform ? t.transform(m, y) : m), y === "__parsed_extra" ? (A[y] = A[y] || [], A[y].push(m)) : A[y] = m;
|
|
159
|
+
}
|
|
160
|
+
return t.header && (b > g.length ? M("FieldMismatch", "TooManyFields", "Too many fields: expected " + g.length + " fields but parsed " + b, a + S) : b < g.length && M("FieldMismatch", "TooFewFields", "Too few fields: expected " + g.length + " fields but parsed " + b, a + S)), A;
|
|
161
|
+
}
|
|
162
|
+
var E;
|
|
163
|
+
s && (t.header || t.dynamicTyping || t.transform) && (E = 1, !s.data.length || Array.isArray(s.data[0]) ? (s.data = s.data.map(d), E = s.data.length) : s.data = d(s.data, 0), t.header && s.meta && (s.meta.fields = g), a += E);
|
|
164
|
+
}
|
|
165
|
+
function T() {
|
|
166
|
+
return t.header && g.length === 0;
|
|
167
|
+
}
|
|
168
|
+
function M(h, d, E, l) {
|
|
169
|
+
h = { type: h, code: d, message: E }, l !== void 0 && (h.row = l), s.errors.push(h);
|
|
170
|
+
}
|
|
171
|
+
_(t.step) && (r = t.step, t.step = function(h) {
|
|
172
|
+
s = h, T() ? R() : (R(), s.data.length !== 0 && (w += h.data.length, t.preview && w > t.preview ? i.abort() : (s.data = s.data[0], r(s, p))));
|
|
173
|
+
}), this.parse = function(h, d, E) {
|
|
174
|
+
var l = t.quoteChar || '"';
|
|
175
|
+
return t.newline || (t.newline = this.guessLineEndings(h, l)), n = !1, t.delimiter ? _(t.delimiter) && (t.delimiter = t.delimiter(h), s.meta.delimiter = t.delimiter) : ((l = ((S, A, b, y, m) => {
|
|
176
|
+
var U, f, v, $;
|
|
177
|
+
m = m || [",", " ", "|", ";", o.RECORD_SEP, o.UNIT_SEP];
|
|
178
|
+
for (var Z = 0; Z < m.length; Z++) {
|
|
179
|
+
for (var K, tt = m[Z], F = 0, D = 0, x = 0, I = (v = void 0, new st({ comments: y, delimiter: tt, newline: A, preview: 10 }).parse(S)), W = 0; W < I.data.length; W++) b && O(I.data[W]) ? x++ : (D += K = I.data[W].length, v === void 0 ? v = K : 0 < K && (F += Math.abs(K - v), v = K));
|
|
180
|
+
0 < I.data.length && (D /= I.data.length - x), (f === void 0 || F <= f) && ($ === void 0 || $ < D) && 1.99 < D && (f = F, U = tt, $ = D);
|
|
181
|
+
}
|
|
182
|
+
return { successful: !!(t.delimiter = U), bestDelimiter: U };
|
|
183
|
+
})(h, t.newline, t.skipEmptyLines, t.comments, t.delimitersToGuess)).successful ? t.delimiter = l.bestDelimiter : (n = !0, t.delimiter = o.DefaultDelimiter), s.meta.delimiter = t.delimiter), l = at(t), t.preview && t.header && l.preview++, e = h, i = new st(l), s = i.parse(e, d, E), R(), L ? { meta: { paused: !0 } } : s || { meta: { paused: !1 } };
|
|
184
|
+
}, this.paused = function() {
|
|
185
|
+
return L;
|
|
186
|
+
}, this.pause = function() {
|
|
187
|
+
L = !0, i.abort(), e = _(t.chunk) ? "" : e.substring(i.getCharIndex());
|
|
188
|
+
}, this.resume = function() {
|
|
189
|
+
p.streamer._halted ? (L = !1, p.streamer.parseChunk(e, !0)) : setTimeout(p.resume, 3);
|
|
190
|
+
}, this.aborted = function() {
|
|
191
|
+
return u;
|
|
192
|
+
}, this.abort = function() {
|
|
193
|
+
u = !0, i.abort(), s.meta.aborted = !0, _(t.complete) && t.complete(s), e = "";
|
|
194
|
+
}, this.guessLineEndings = function(h, d) {
|
|
195
|
+
h = h.substring(0, 1048576), d = new RegExp(V(d) + "([^]*?)" + V(d), "gm");
|
|
196
|
+
var E = (h = h.replace(d, "")).split("\r");
|
|
197
|
+
if (h = 1 < (d = h.split(`
|
|
198
|
+
`)).length && d[0].length < E[0].length, E.length === 1 || h) return `
|
|
199
|
+
`;
|
|
200
|
+
for (var l = 0, S = 0; S < E.length; S++) E[S][0] === `
|
|
201
|
+
` && l++;
|
|
202
|
+
return l >= E.length / 2 ? `\r
|
|
203
|
+
` : "\r";
|
|
204
|
+
};
|
|
205
|
+
}
|
|
206
|
+
function V(t) {
|
|
207
|
+
return t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
|
|
208
|
+
}
|
|
209
|
+
function st(t) {
|
|
210
|
+
var e = (t = t || {}).delimiter, i = t.newline, n = t.comments, r = t.step, c = t.preview, C = t.fastMode, j = null, z = !1, p = t.quoteChar == null ? '"' : t.quoteChar, w = p;
|
|
211
|
+
if (t.escapeChar !== void 0 && (w = t.escapeChar), (typeof e != "string" || -1 < o.BAD_DELIMITERS.indexOf(e)) && (e = ","), n === e) throw new Error("Comment character same as delimiter");
|
|
212
|
+
n === !0 ? n = "#" : (typeof n != "string" || -1 < o.BAD_DELIMITERS.indexOf(n)) && (n = !1), i !== `
|
|
213
|
+
` && i !== "\r" && i !== `\r
|
|
214
|
+
` && (i = `
|
|
215
|
+
`);
|
|
216
|
+
var a = 0, L = !1;
|
|
217
|
+
this.parse = function(u, g, s) {
|
|
218
|
+
if (typeof u != "string") throw new Error("Input must be a string");
|
|
219
|
+
var O = u.length, R = e.length, T = i.length, M = n.length, h = _(r), d = [], E = [], l = [], S = a = 0;
|
|
220
|
+
if (!u) return F();
|
|
221
|
+
if (C || C !== !1 && u.indexOf(p) === -1) {
|
|
222
|
+
for (var A = u.split(i), b = 0; b < A.length; b++) {
|
|
223
|
+
if (l = A[b], a += l.length, b !== A.length - 1) a += i.length;
|
|
224
|
+
else if (s) return F();
|
|
225
|
+
if (!n || l.substring(0, M) !== n) {
|
|
226
|
+
if (h) {
|
|
227
|
+
if (d = [], $(l.split(e)), D(), L) return F();
|
|
228
|
+
} else $(l.split(e));
|
|
229
|
+
if (c && c <= b) return d = d.slice(0, c), F(!0);
|
|
230
|
+
}
|
|
231
|
+
}
|
|
232
|
+
return F();
|
|
233
|
+
}
|
|
234
|
+
for (var y = u.indexOf(e, a), m = u.indexOf(i, a), U = new RegExp(V(w) + V(p), "g"), f = u.indexOf(p, a); ; ) if (u[a] === p) for (f = a, a++; ; ) {
|
|
235
|
+
if ((f = u.indexOf(p, f + 1)) === -1) return s || E.push({ type: "Quotes", code: "MissingQuotes", message: "Quoted field unterminated", row: d.length, index: a }), K();
|
|
236
|
+
if (f === O - 1) return K(u.substring(a, f).replace(U, p));
|
|
237
|
+
if (p === w && u[f + 1] === w) f++;
|
|
238
|
+
else if (p === w || f === 0 || u[f - 1] !== w) {
|
|
239
|
+
y !== -1 && y < f + 1 && (y = u.indexOf(e, f + 1));
|
|
240
|
+
var v = Z((m = m !== -1 && m < f + 1 ? u.indexOf(i, f + 1) : m) === -1 ? y : Math.min(y, m));
|
|
241
|
+
if (u.substr(f + 1 + v, R) === e) {
|
|
242
|
+
l.push(u.substring(a, f).replace(U, p)), u[a = f + 1 + v + R] !== p && (f = u.indexOf(p, a)), y = u.indexOf(e, a), m = u.indexOf(i, a);
|
|
243
|
+
break;
|
|
244
|
+
}
|
|
245
|
+
if (v = Z(m), u.substring(f + 1 + v, f + 1 + v + T) === i) {
|
|
246
|
+
if (l.push(u.substring(a, f).replace(U, p)), tt(f + 1 + v + T), y = u.indexOf(e, a), f = u.indexOf(p, a), h && (D(), L)) return F();
|
|
247
|
+
if (c && d.length >= c) return F(!0);
|
|
248
|
+
break;
|
|
249
|
+
}
|
|
250
|
+
E.push({ type: "Quotes", code: "InvalidQuotes", message: "Trailing quote on quoted field is malformed", row: d.length, index: a }), f++;
|
|
251
|
+
}
|
|
252
|
+
}
|
|
253
|
+
else if (n && l.length === 0 && u.substring(a, a + M) === n) {
|
|
254
|
+
if (m === -1) return F();
|
|
255
|
+
a = m + T, m = u.indexOf(i, a), y = u.indexOf(e, a);
|
|
256
|
+
} else if (y !== -1 && (y < m || m === -1)) l.push(u.substring(a, y)), a = y + R, y = u.indexOf(e, a);
|
|
257
|
+
else {
|
|
258
|
+
if (m === -1) break;
|
|
259
|
+
if (l.push(u.substring(a, m)), tt(m + T), h && (D(), L)) return F();
|
|
260
|
+
if (c && d.length >= c) return F(!0);
|
|
261
|
+
}
|
|
262
|
+
return K();
|
|
263
|
+
function $(x) {
|
|
264
|
+
d.push(x), S = a;
|
|
265
|
+
}
|
|
266
|
+
function Z(x) {
|
|
267
|
+
var I = 0;
|
|
268
|
+
return x !== -1 && (x = u.substring(f + 1, x)) && x.trim() === "" ? x.length : I;
|
|
269
|
+
}
|
|
270
|
+
function K(x) {
|
|
271
|
+
return s || (x === void 0 && (x = u.substring(a)), l.push(x), a = O, $(l), h && D()), F();
|
|
272
|
+
}
|
|
273
|
+
function tt(x) {
|
|
274
|
+
a = x, $(l), l = [], m = u.indexOf(i, a);
|
|
275
|
+
}
|
|
276
|
+
function F(x) {
|
|
277
|
+
if (t.header && !g && d.length && !z) {
|
|
278
|
+
var I = d[0], W = /* @__PURE__ */ Object.create(null), ot = new Set(I);
|
|
279
|
+
let lt = !1;
|
|
280
|
+
for (let G = 0; G < I.length; G++) {
|
|
281
|
+
let q = I[G];
|
|
282
|
+
if (W[q = _(t.transformHeader) ? t.transformHeader(q, G) : q]) {
|
|
283
|
+
let et, dt = W[q];
|
|
284
|
+
for (; et = q + "_" + dt, dt++, ot.has(et); ) ;
|
|
285
|
+
ot.add(et), I[G] = et, W[q]++, lt = !0, (j = j === null ? {} : j)[et] = q;
|
|
286
|
+
} else W[q] = 1, I[G] = q;
|
|
287
|
+
ot.add(q);
|
|
288
|
+
}
|
|
289
|
+
lt && console.warn("Duplicate headers found and renamed."), z = !0;
|
|
290
|
+
}
|
|
291
|
+
return { data: d, errors: E, meta: { delimiter: e, linebreak: i, aborted: L, truncated: !!x, cursor: S + (g || 0), renamedHeaders: j } };
|
|
292
|
+
}
|
|
293
|
+
function D() {
|
|
294
|
+
r(F()), d = [], E = [];
|
|
295
|
+
}
|
|
296
|
+
}, this.abort = function() {
|
|
297
|
+
L = !0;
|
|
298
|
+
}, this.getCharIndex = function() {
|
|
299
|
+
return a;
|
|
300
|
+
};
|
|
301
|
+
}
|
|
302
|
+
function _t(t) {
|
|
303
|
+
var e = t.data, i = Q[e.workerId], n = !1;
|
|
304
|
+
if (e.error) i.userError(e.error, e.file);
|
|
305
|
+
else if (e.results && e.results.data) {
|
|
306
|
+
var r = { abort: function() {
|
|
307
|
+
n = !0, ut(e.workerId, { data: [], errors: [], meta: { aborted: !0 } });
|
|
308
|
+
}, pause: ft, resume: ft };
|
|
309
|
+
if (_(i.userStep)) {
|
|
310
|
+
for (var c = 0; c < e.results.data.length && (i.userStep({ data: e.results.data[c], errors: e.results.errors, meta: e.results.meta }, r), !n); c++) ;
|
|
311
|
+
delete e.results;
|
|
312
|
+
} else _(i.userChunk) && (i.userChunk(e.results, r, e.file), delete e.results);
|
|
313
|
+
}
|
|
314
|
+
e.finished && !n && ut(e.workerId, e.results);
|
|
315
|
+
}
|
|
316
|
+
function ut(t, e) {
|
|
317
|
+
var i = Q[t];
|
|
318
|
+
_(i.userComplete) && i.userComplete(e), i.terminate(), delete Q[t];
|
|
319
|
+
}
|
|
320
|
+
function ft() {
|
|
321
|
+
throw new Error("Not implemented.");
|
|
322
|
+
}
|
|
323
|
+
function at(t) {
|
|
324
|
+
if (typeof t != "object" || t === null) return t;
|
|
325
|
+
var e, i = Array.isArray(t) ? [] : {};
|
|
326
|
+
for (e in t) i[e] = at(t[e]);
|
|
327
|
+
return i;
|
|
328
|
+
}
|
|
329
|
+
function J(t, e) {
|
|
330
|
+
return function() {
|
|
331
|
+
t.apply(e, arguments);
|
|
332
|
+
};
|
|
333
|
+
}
|
|
334
|
+
function _(t) {
|
|
335
|
+
return typeof t == "function";
|
|
336
|
+
}
|
|
337
|
+
return o.parse = function(t, e) {
|
|
338
|
+
var i = (e = e || {}).dynamicTyping || !1;
|
|
339
|
+
if (_(i) && (e.dynamicTypingFunction = i, i = {}), e.dynamicTyping = i, e.transform = !!_(e.transform) && e.transform, !e.worker || !o.WORKERS_SUPPORTED) return i = null, o.NODE_STREAM_INPUT, typeof t == "string" ? (t = ((n) => n.charCodeAt(0) !== 65279 ? n : n.slice(1))(t), i = new (e.download ? it : X)(e)) : t.readable === !0 && _(t.read) && _(t.on) ? i = new nt(e) : (k.File && t instanceof File || t instanceof Object) && (i = new rt(e)), i.stream(t);
|
|
340
|
+
(i = (() => {
|
|
341
|
+
var n;
|
|
342
|
+
return !!o.WORKERS_SUPPORTED && (n = (() => {
|
|
343
|
+
var r = k.URL || k.webkitURL || null, c = Y.toString();
|
|
344
|
+
return o.BLOB_URL || (o.BLOB_URL = r.createObjectURL(new Blob(["var global = (function() { if (typeof self !== 'undefined') { return self; } if (typeof window !== 'undefined') { return window; } if (typeof global !== 'undefined') { return global; } return {}; })(); global.IS_PAPA_WORKER=true; ", "(", c, ")();"], { type: "text/javascript" })));
|
|
345
|
+
})(), (n = new k.Worker(n)).onmessage = _t, n.id = mt++, Q[n.id] = n);
|
|
346
|
+
})()).userStep = e.step, i.userChunk = e.chunk, i.userComplete = e.complete, i.userError = e.error, e.step = _(e.step), e.chunk = _(e.chunk), e.complete = _(e.complete), e.error = _(e.error), delete e.worker, i.postMessage({ input: t, config: e, workerId: i.id });
|
|
347
|
+
}, o.unparse = function(t, e) {
|
|
348
|
+
var i = !1, n = !0, r = ",", c = `\r
|
|
349
|
+
`, C = '"', j = C + C, z = !1, p = null, w = !1, a = ((() => {
|
|
350
|
+
if (typeof e == "object") {
|
|
351
|
+
if (typeof e.delimiter != "string" || o.BAD_DELIMITERS.filter(function(g) {
|
|
352
|
+
return e.delimiter.indexOf(g) !== -1;
|
|
353
|
+
}).length || (r = e.delimiter), typeof e.quotes != "boolean" && typeof e.quotes != "function" && !Array.isArray(e.quotes) || (i = e.quotes), typeof e.skipEmptyLines != "boolean" && typeof e.skipEmptyLines != "string" || (z = e.skipEmptyLines), typeof e.newline == "string" && (c = e.newline), typeof e.quoteChar == "string" && (C = e.quoteChar), typeof e.header == "boolean" && (n = e.header), Array.isArray(e.columns)) {
|
|
354
|
+
if (e.columns.length === 0) throw new Error("Option columns is empty");
|
|
355
|
+
p = e.columns;
|
|
356
|
+
}
|
|
357
|
+
e.escapeChar !== void 0 && (j = e.escapeChar + C), e.escapeFormulae instanceof RegExp ? w = e.escapeFormulae : typeof e.escapeFormulae == "boolean" && e.escapeFormulae && (w = /^[=+\-@\t\r].*$/);
|
|
358
|
+
}
|
|
359
|
+
})(), new RegExp(V(C), "g"));
|
|
360
|
+
if (typeof t == "string" && (t = JSON.parse(t)), Array.isArray(t)) {
|
|
361
|
+
if (!t.length || Array.isArray(t[0])) return L(null, t, z);
|
|
362
|
+
if (typeof t[0] == "object") return L(p || Object.keys(t[0]), t, z);
|
|
363
|
+
} else if (typeof t == "object") return typeof t.data == "string" && (t.data = JSON.parse(t.data)), Array.isArray(t.data) && (t.fields || (t.fields = t.meta && t.meta.fields || p), t.fields || (t.fields = Array.isArray(t.data[0]) ? t.fields : typeof t.data[0] == "object" ? Object.keys(t.data[0]) : []), Array.isArray(t.data[0]) || typeof t.data[0] == "object" || (t.data = [t.data])), L(t.fields || [], t.data || [], z);
|
|
364
|
+
throw new Error("Unable to serialize unrecognized input");
|
|
365
|
+
function L(g, s, O) {
|
|
366
|
+
var R = "", T = (typeof g == "string" && (g = JSON.parse(g)), typeof s == "string" && (s = JSON.parse(s)), Array.isArray(g) && 0 < g.length), M = !Array.isArray(s[0]);
|
|
367
|
+
if (T && n) {
|
|
368
|
+
for (var h = 0; h < g.length; h++) 0 < h && (R += r), R += u(g[h], h);
|
|
369
|
+
0 < s.length && (R += c);
|
|
370
|
+
}
|
|
371
|
+
for (var d = 0; d < s.length; d++) {
|
|
372
|
+
var E = (T ? g : s[d]).length, l = !1, S = T ? Object.keys(s[d]).length === 0 : s[d].length === 0;
|
|
373
|
+
if (O && !T && (l = O === "greedy" ? s[d].join("").trim() === "" : s[d].length === 1 && s[d][0].length === 0), O === "greedy" && T) {
|
|
374
|
+
for (var A = [], b = 0; b < E; b++) {
|
|
375
|
+
var y = M ? g[b] : b;
|
|
376
|
+
A.push(s[d][y]);
|
|
377
|
+
}
|
|
378
|
+
l = A.join("").trim() === "";
|
|
379
|
+
}
|
|
380
|
+
if (!l) {
|
|
381
|
+
for (var m = 0; m < E; m++) {
|
|
382
|
+
0 < m && !S && (R += r);
|
|
383
|
+
var U = T && M ? g[m] : m;
|
|
384
|
+
R += u(s[d][U], m);
|
|
385
|
+
}
|
|
386
|
+
d < s.length - 1 && (!O || 0 < E && !S) && (R += c);
|
|
387
|
+
}
|
|
388
|
+
}
|
|
389
|
+
return R;
|
|
390
|
+
}
|
|
391
|
+
function u(g, s) {
|
|
392
|
+
var O, R;
|
|
393
|
+
return g == null ? "" : g.constructor === Date ? JSON.stringify(g).slice(1, 25) : (R = !1, w && typeof g == "string" && w.test(g) && (g = "'" + g, R = !0), O = g.toString().replace(a, j), (R = R || i === !0 || typeof i == "function" && i(g, s) || Array.isArray(i) && i[s] || ((T, M) => {
|
|
394
|
+
for (var h = 0; h < M.length; h++) if (-1 < T.indexOf(M[h])) return !0;
|
|
395
|
+
return !1;
|
|
396
|
+
})(O, o.BAD_DELIMITERS) || -1 < O.indexOf(r) || O.charAt(0) === " " || O.charAt(O.length - 1) === " ") ? C + O + C : O);
|
|
397
|
+
}
|
|
398
|
+
}, o.RECORD_SEP = "", o.UNIT_SEP = "", o.BYTE_ORDER_MARK = "\uFEFF", o.BAD_DELIMITERS = ["\r", `
|
|
399
|
+
`, '"', o.BYTE_ORDER_MARK], o.WORKERS_SUPPORTED = !P && !!k.Worker, o.NODE_STREAM_INPUT = 1, o.LocalChunkSize = 10485760, o.RemoteChunkSize = 5242880, o.DefaultDelimiter = ",", o.Parser = st, o.ParserHandle = ht, o.NetworkStreamer = it, o.FileStreamer = rt, o.StringStreamer = X, o.ReadableStreamStreamer = nt, k.jQuery && ((H = k.jQuery).fn.parse = function(t) {
|
|
400
|
+
var e = t.config || {}, i = [];
|
|
401
|
+
return this.each(function(c) {
|
|
402
|
+
if (H(this).prop("tagName").toUpperCase() !== "INPUT" || H(this).attr("type").toLowerCase() !== "file" || !k.FileReader || !this.files || this.files.length === 0) return !0;
|
|
403
|
+
for (var C = 0; C < this.files.length; C++) i.push({ file: this.files[C], inputElem: this, instanceConfig: H.extend({}, e) });
|
|
404
|
+
}), n(), this;
|
|
405
|
+
function n() {
|
|
406
|
+
if (i.length === 0) _(t.complete) && t.complete();
|
|
407
|
+
else {
|
|
408
|
+
var c, C, j, z, p = i[0];
|
|
409
|
+
if (_(t.before)) {
|
|
410
|
+
var w = t.before(p.file, p.inputElem);
|
|
411
|
+
if (typeof w == "object") {
|
|
412
|
+
if (w.action === "abort") return c = "AbortError", C = p.file, j = p.inputElem, z = w.reason, void (_(t.error) && t.error({ name: c }, C, j, z));
|
|
413
|
+
if (w.action === "skip") return void r();
|
|
414
|
+
typeof w.config == "object" && (p.instanceConfig = H.extend(p.instanceConfig, w.config));
|
|
415
|
+
} else if (w === "skip") return void r();
|
|
416
|
+
}
|
|
417
|
+
var a = p.instanceConfig.complete;
|
|
418
|
+
p.instanceConfig.complete = function(L) {
|
|
419
|
+
_(a) && a(L, p.file, p.inputElem), r();
|
|
420
|
+
}, o.parse(p.file, p.instanceConfig);
|
|
421
|
+
}
|
|
422
|
+
}
|
|
423
|
+
function r() {
|
|
424
|
+
i.splice(0, 1), n();
|
|
425
|
+
}
|
|
426
|
+
}), N && (k.onmessage = function(t) {
|
|
427
|
+
t = t.data, o.WORKER_ID === void 0 && t && (o.WORKER_ID = t.workerId), typeof t.input == "string" ? k.postMessage({ workerId: o.WORKER_ID, results: o.parse(t.input, t.config), finished: !0 }) : (k.File && t.input instanceof File || t.input instanceof Object) && (t = o.parse(t.input, t.config)) && k.postMessage({ workerId: o.WORKER_ID, results: t, finished: !0 });
|
|
428
|
+
}), (it.prototype = Object.create(B.prototype)).constructor = it, (rt.prototype = Object.create(B.prototype)).constructor = rt, (X.prototype = Object.create(X.prototype)).constructor = X, (nt.prototype = Object.create(B.prototype)).constructor = nt, o;
|
|
429
|
+
}()), pt.exports);
|
|
430
|
+
const vt = kt({ __proto__: null, default: yt(gt) }, [gt]);
|
|
431
|
+
export {
|
|
432
|
+
vt as p
|
|
433
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { CELL: { s: "Returns information about the cell.", p: { infoType: { d: "The type of information to return." }, reference: {} } }, "ERROR.TYPE": { s: "Returns a number matching an error value", p: { errorVal: { d: "is the error value for which you want the identifying number, and can be an actual error value or a reference to a cell containing an error value." } } }, INFO: { s: "Returns information about the current operating system.", p: { typeText: { d: "The type of information to return" } } }, ISBLANK: { s: "Checks whether a reference is to an empty cell, and returns TRUE or FALSE", p: { value: { d: "is the cell or a name that refers to the cell you want to test" } } }, ISERR: { s: "Checks whether a value is an error other than #N/A, and returns TRUE or FALSE", p: { value: { d: "is the value you want to test. Value can refer to a cell, a formula, or a name that refers to a cell, formula, or value" } } }, ISERROR: { s: "Checks whether a value is an error, and returns TRUE or FALSE", p: { value: { d: "is the value you want to test. Value can refer to a cell, a formula, or a name that refers to a cell, formula, or value" } } }, ISEVEN: { s: "Returns TRUE if the number is even", p: { number: { d: "is the value to test" } } }, ISFORMULA: { s: "Checks whether a reference is to a cell containing a formula, and returns TRUE or FALSE", p: { reference: { d: "is a reference to the cell you want to test. Reference can be a cell reference, a formula, or name that refers to a cell" } } }, ISLOGICAL: { s: "Checks whether a value is a logical value (TRUE or FALSE), and returns TRUE or FALSE", p: { value: { d: "is the value you want to test. Value can refer to a cell, a formula, or a name that refers to a cell, formula, or value" } } }, ISNA: { s: "Checks whether a value is #N/A, and returns TRUE or FALSE", p: { value: { d: "is the value you want to test. Value can refer to a cell, a formula, or a name that refers to a cell, formula, or value" } } }, ISNONTEXT: { s: "Checks whether a value is not text (blank cells are not text), and returns TRUE or FALSE", p: { value: { d: "is the value you want tested: a cell; a formula; or a name referring to a cell, formula, or value" } } }, ISNUMBER: { s: "Checks whether a value is not text (blank cells are not text), and returns TRUE or FALSE", p: { value: { d: "is the value you want tested: a cell; a formula; or a name referring to a cell, formula, or value" } } }, ISODD: { s: "Returns TRUE if the number is odd", p: { number: { d: "is the value to test" } } }, ISOMITTED: { s: "Checks whether the value is omitted, and returns TRUE or FALSE", p: { argument: { d: "is the value you want to test, such as a LAMBDA parameter" } } }, ISREF: { s: "Checks whether a value is a reference, and returns TRUE or FALSE", p: { value: { d: "is the value you want to test. Value can refer to a cell, a formula, or a name that refers to a cell, formula, or value" } } }, ISTEXT: { s: "Converts a value to text in a specific number format", p: { value: { d: "is a number, a formula that evaluates to a numeric value, or a reference to a cell containing a numeric value" } } }, N: { s: "Converts non-number value to a number, dates to serial numbers, TRUE to 1, anything else to 0 (zero)", p: { value: { d: "is the value to convert" } } }, NA: { s: "Returns the #N/A error value", p: {} }, SHEET: { s: "Returns the sheet number of the referenced sheet", p: { value: { d: "is the name of a sheet or a reference that you want the sheet number of. If omitted the number of the sheet containing the function is returned" } } }, SHEETS: { s: "Returns the number of sheets in a reference", p: { reference: { d: "is a reference for which you want to know the number of sheets it contains. If omitted the number of sheets in the workbook containing the function is returned" } } }, TYPE: { s: "Returns an integer representing the data type of a value: number = 1; text = 2; logical value = 4; error value = 16; array = 64; compound data = 128", p: { value: { d: "is the value to check" } } } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { DATE: { s: "Returns the number that represents the date in Microsoft Excel date-time code", p: { year: { d: "is a number from 1900 or 1904 (depending on the workbook's date system) to 9999" }, month: { d: "is a number from 1 to 12 representing the month of the year" }, day: { d: "is a number from 1 to 31 representing the day of the month" } } }, DATEDIF: { s: "Returns the number of days between two dates", p: { startDate: { d: "is a serial date number that represents the start date" }, endDate: { d: "is a serial date number that represents the end date" }, unit: { d: "is a string that specifies the unit of time to use" } }, h: "Legacy" }, DATESTRING: { s: "Returns NA.", p: { number: { d: "is a number that is ignored" } }, h: "Legacy" }, DATEVALUE: { s: "Converts a date in the form of text to a number that represents the date in Microsoft Excel date-time code", p: { dateText: { d: "is text that represents a date in a Microsoft Excel date format, between 1/1/1900 or 1/1/1904 (depending on the workbook's date system) and 12/31/9999" } } }, DAY: { s: "Returns the day of the month, a number from 1 to 31.", p: { serialOrString: { d: "is a number in the date-time code used by Excel or text in time format, such as 16:48:00 or 4:48:00 PM" } } }, DAYS: { s: "Returns the number of days between the two dates.", p: { endDate: { d: "start_date and end_date are the two dates between which you want to know the number of days" }, startDate: { d: "start_date and end_date are the two dates between which you want to know the number of days" } } }, DAYS360: { s: "Returns the number of days between two dates based on a 360-day year (twelve 30-day months)", p: { startDate: { d: "start_date and end_date are the two dates between which you want to know the number of days" }, endDate: { d: "start_date and end_date are the two dates between which you want to know the number of days" }, method: { d: "is a logical value specifying the calculation method: U.S. (NASD) = FALSE; European = TRUE.", v: !1 } } }, EDATE: { s: "Returns the serial number of the date that is the indicated number of months before or after the start date", p: { startDate: { d: "is a serial date number that represents the start date" }, months: { d: "is the number of months before or after start_date" } } }, EOMONTH: { s: "Returns the serial number of the last day of the month before or after a specified number of months", p: { startDate: { d: "is a serial date number that represents the start date" }, months: { d: "is the number of months before or after the start_date" } } }, HOUR: { s: "Returns the hour as a number from 0 (12:00 A.M.) to 23 (11:00 P.M.).", p: { serialOrString: { d: "is a number in the date-time code used by Excel or text in time format, such as 16:48:00 or 4:48:00 PM" } } }, ISOWEEKNUM: { s: "Returns the ISO week number in the year for a given date", p: { serialOrString: { d: "is a number in the date-time code used by Excel or text in time format, such as 16:48:00 or 4:48:00 PM" } } }, MINUTE: { s: "Returns the minute, a number from 0 to 59.", p: { serialOrString: { d: "is a number in the date-time code used by Excel or text in time format, such as 16:48:00 or 4:48:00 PM" } } }, MONTH: { s: "Returns the month, a number from 1 (January) to 12 (December).", p: { serialOrString: { d: "is a number in the date-time code used by Excel" } } }, NETWORKDAYS: { s: "Returns the number of whole workdays between two dates", p: { startDate: { d: "is a serial date number that represents the start date" }, endDate: { d: "is a serial date number that represents the end date" }, holidays: { d: "is an optional set of one or more serial date numbers to exclude from the working calendar, such as state and federal holidays and floating holidays", v: null } } }, "NETWORKDAYS.INTL": { s: "Returns the number of whole workdays between two dates with custom weekend parameters", p: { startDate: { d: "is a serial date number that represents the start date" }, endDate: { d: "is a serial date number that represents the end date" }, weekend: { d: "is a number or string specifying when weekends occur", v: 1 }, holidays: { d: "is an optional set of one or more serial date numbers to exclude from the working calendar, such as state and federal holidays and floating holidays", v: null } } }, NOW: { s: "Returns the current date and time formatted as a date and time.", p: {} }, SECOND: { s: "Returns the second, a number from 0 to 59.", p: { serialOrString: { d: "is a number in the date-time code used by Excel or text in time format, such as 16:48:23 or 4:48:47 PM" } } }, TIME: { s: "Converts hours, minutes, and seconds given as numbers to an Excel serial number, formatted with a time format", p: { hour: { d: "is a number from 0 to 23 representing the hour" }, minute: { d: "is a number from 0 to 59 representing the minute" }, second: { d: "is a number from 0 to 59 representing the second" } } }, TIMEVALUE: { s: "Converts a text time to an Excel serial number for a time, a number from 0 (12:00:00 AM) to 0.999988426 (11:59:59 PM). Format the number with a time format after entering the formula", p: { timeText: { d: "is a text string that gives a time in any one of the Excel time formats (date information in the string is ignored)" } } }, TODAY: { s: "Returns the current date formatted as a date.", p: {} }, WEEKDAY: { s: "Returns a number from 1 to 7 identifying the day of the week of a date.", p: { serialOrString: { d: "is a number that represents a date" }, returnType: { d: "is a number: for Sunday=1 through Saturday=7, use 1; for Monday=1 through Sunday=7, use 2; for Monday=0 through Sunday=6, use 3", v: 1 } } }, WEEKNUM: { s: "Returns the week number in the year", p: { serialOrString: { d: "is the date-time code used by Excel for date and time calculation" }, returnType: { d: "is a number (1 or 2) that determines the type of the return value", v: 1 } } }, WORKDAY: { s: "Returns the serial number of the date before or after a specified number of workdays", p: { startDate: { d: "is a serial date number that represents the start date" }, days: { d: "is the number of nonweekend and non-holiday days before or after start_date" }, holidays: { d: "is an optional array of one or more serial date numbers to exclude from the working calendar, such as state and federal holidays and floating holidays", v: null } } }, "WORKDAY.INTL": { s: "Returns the serial number of the date before or after a specified number of workdays with custom weekend parameters", p: { startDate: { d: "is a serial date number that represents the start date" }, days: { d: "is the number of nonweekend and non-holiday days before or after start_date" }, weekend: { d: "is a number or string specifying when weekends occur", v: 1 }, holidays: { d: "is an optional array of one or more serial date numbers to exclude from the working calendar, such as state and federal holidays and floating holidays", v: null } } }, YEAR: { s: "Returns the year of a date, an integer in the range 1900 - 9999.", p: { serialOrString: { d: "is a number in the date-time code used by Excel" } } }, YEARFRAC: { s: "Returns the year fraction representing the number of whole days between start_date and end_date", p: { startDate: { d: "is a serial date number that represents the start date" }, endDate: { d: "is a serial date number that represents the end date" }, basis: { d: "is the type of day count basis to use", v: 0 } } } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* @license @sheetxl/sdk - A high-performance, embeddable spreadsheet engine. - v0.0.0
|
|
3
|
+
*
|
|
4
|
+
* (C) 2025-present SheetXL Inc. & Michael T. Ford
|
|
5
|
+
* License: The license can be found at https://www.sheetxl.com/license.
|
|
6
|
+
*/
|
|
7
|
+
const e = { AVEDEV: { s: "Returns the average of the absolute deviations of data points from their mean. Arguments can be numbers or names, arrays, or references that contain numbers", p: { number: { d: "number1,number2,... are 1 to 255 arguments for which you want the average of the absolute deviations" } } }, AVERAGE: { s: "Returns the average (arithmetic mean) of its arguments, which can be numbers or names, arrays, or references that contain numbers", p: { number: { d: "number1,number2,... are 1 to 255 numeric arguments for which you want the average" } } }, AVERAGEA: { s: "Returns the average (arithmetic mean) of its arguments, evaluating text and FALSE in arguments as 0; TRUE evaluates as 1. Arguments can be numbers, names, arrays, or references", p: { value: { d: "value1,value2,... are 1 to 255 arguments for which you want the average" } } }, AVERAGEIF: { s: "Finds average(arithmetic mean) for the cells specified by a given condition or criteria", p: { range: { d: "is the range of cells you want evaluated" }, criteria: { d: "is the condition or criteria in the form of a number, expression, or text that defines which cells will be used to find the average" }, averageRange: { d: "are the actual cells to be used to find the average. If omitted, the cells in range are used" } }, h: "Unimplemented" }, AVERAGEIFS: { s: "Finds average(arithmetic mean) for the cells specified by a given set of conditions or criteria", p: { averageRange: { d: "are the actual cells to be used to find the average." }, criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want evaluated for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition or criteria in the form of a number, expression, or text that defines which cells will be used to find the average" } }, h: "Unimplemented" }, COUNT: { s: "Counts the number of cells in a range that contain numbers", p: { number: { d: "value1,value2,... are 1 to 255 arguments that can contain or refer to a variety of different types of data, but only numbers are counted" } } }, COUNTA: { s: "Counts the number of cells in a range that are not empty", p: { value: { d: "value1,value2,... are 1 to 255 arguments representing the values and cells you want to count. Values can be any type of information" } } }, COUNTBLANK: { s: "Counts the number of empty cells in a specified range of cells", p: { range: { d: "is the range from which you want to count the empty cells" } }, h: "Unimplemented" }, COUNTIF: { s: "Counts the number of cells within a range that meet the given condition", p: { range: { d: "is the range of cells from which you want to count nonblank cells" }, criteria: { d: "is the condition in the form of a number, expression, or text that defines which cells will be counted" } }, h: "Unimplemented" }, COUNTIFS: { s: "Counts the number of cells specified by a given set of conditions or criteria", p: { criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want evaluated for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition in the form of a number, expression, or text that defines which cells will be counted" } }, h: "Unimplemented" }, LARGE: { s: "Returns the k-th largest value in a data set. For example, the fifth largest number.", p: { array: { d: "is the array or range of data for which you want to determine the k-th largest value." }, k: { d: "is the position (from the largest) in the array or cell range of the value to return." } } }, MAX: { s: "Returns the largest value in a set of values. Ignores logical values and text", p: { number: { d: "number1,number2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the maximum" } } }, MAXA: { s: "Returns the largest value in a set of values. Does not ignore logical values and text", p: { value: { d: "value1,value2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the maximum" } } }, MAXIFS: { s: "Returns the maximum value among cells specified by a given set of conditions or criteria", p: { maxRange: { d: "the cells in which to determine the maximum value" }, criteriaRange: { d: "criteria_range1,criteria_range2,... is the range of cells you want to evaluate for the particular condition" }, criteria: { d: "criteria1,criteria2,... is the condition or criteria in the form of a number, expression, or text that defines which cells will be included when determining the maximum value" } }, h: "Unimplemented" }, MEDIAN: { s: "Returns the median, or the number in the middle of the set of given numbers", p: { number: { d: "number1,number2,... are 1 to 255 numbers or names, arrays, or references that contain numbers for which you want the median" } } }, MIN: { s: "Returns the smallest number in a set of values. Ignores logical values and text", p: { number: { d: "number1,number2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the minimum" } } }, MINA: { s: "Returns the smallest value in a set of values. Does not ignore logical values and text", p: { value: { d: "value1,value2,... are 1 to 255 numbers, empty cells, logical values, or text numbers for which you want the minimum" } } }, MINIFS: { s: "Returns the minimum value among cells specified by a given set of conditions or criteria", p: { maxRange: { d: "is the range of cells to evaluate for the minimum value" }, criteriaRange: { d: "is the range of cells to evaluate against the criteria" }, criteria: { d: "is the criteria to evaluate against the criteria range" } }, h: "Unimplemented" }, PERMUT: { s: "Returns the number of permutations for a given number of objects that can be selected from the total objects", p: { number: { d: "is the total number of objects" }, numberChoosen: { d: "is the number of objects in each permutation" } }, h: "Unimplemented" }, PERMUTATIONA: { s: "Returns the number of permutations for a given number of objects (with repetitions) that can be selected from the total objects", p: { number: { d: "is the total number of objects" }, numberChoosen: { d: "is the number of objects in each permutation" } }, h: "Unimplemented" }, SMALL: { s: "Returns the k-th smallest value in a data set. For example, the fifth smallest number", p: { array: { d: "is an array or range of numerical data for which you want to determine the k-th smallest value" }, k: { d: "is the position (from the smallest) in the array or range of the value to return" } } } };
|
|
8
|
+
export {
|
|
9
|
+
e as default
|
|
10
|
+
};
|