Spaces:
Sleeping
Sleeping
File size: 16,688 Bytes
78c921d |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 |
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you 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 } from './enum.js';
import { Data, makeData } from './data.js';
import { vectorFromArray } from './factories.js';
import { makeVector, Vector } from './vector.js';
import { Field, Schema } from './schema.js';
import { DataType, Null, Struct, TypeMap } from './type.js';
import { compareSchemas } from './visitor/typecomparator.js';
import { distributeVectorsIntoRecordBatches } from './util/recordbatch.js';
import {
isChunkedValid,
computeChunkOffsets,
computeChunkNullCounts,
wrapChunkedCall1,
wrapChunkedCall2,
wrapChunkedIndexOf,
sliceChunks,
} from './util/chunk.js';
import { instance as getVisitor } from './visitor/get.js';
import { instance as setVisitor } from './visitor/set.js';
import { instance as indexOfVisitor } from './visitor/indexof.js';
import { instance as iteratorVisitor } from './visitor/iterator.js';
import { instance as byteLengthVisitor } from './visitor/bytelength.js';
import { DataProps } from './data.js';
import { clampRange } from './util/vector.js';
import { ArrayDataType, BigIntArray, TypedArray, TypedArrayDataType } from './interfaces.js';
import { RecordBatch, _InternalEmptyPlaceholderRecordBatch } from './recordbatch.js';
/** @ignore */
export interface Table<T extends TypeMap = any> {
///
// Virtual properties for the TypeScript compiler.
// These do not exist at runtime.
///
readonly TType: Struct<T>;
readonly TArray: Struct<T>['TArray'];
readonly TValue: Struct<T>['TValue'];
/**
* @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol/isConcatSpreadable
*/
[Symbol.isConcatSpreadable]: true;
}
/**
* Tables are collections of {@link Vector}s and have a {@link Schema}. Use the convenience methods {@link makeTable}
* or {@link tableFromArrays} to create a table in JavaScript. To create a table from the IPC format, use
* {@link tableFromIPC}.
*/
export class Table<T extends TypeMap = any> {
constructor();
constructor(batches: Iterable<RecordBatch<T>>);
constructor(...batches: readonly RecordBatch<T>[]);
constructor(...columns: { [P in keyof T]: Vector<T[P]> }[]);
constructor(...columns: { [P in keyof T]: Data<T[P]> | DataProps<T[P]> }[]);
constructor(schema: Schema<T>, data?: RecordBatch<T> | RecordBatch<T>[]);
constructor(schema: Schema<T>, data?: RecordBatch<T> | RecordBatch<T>[], offsets?: Uint32Array);
constructor(...args: any[]) {
if (args.length === 0) {
this.batches = [];
this.schema = new Schema([]);
this._offsets = [0];
return this;
}
let schema: Schema<T> | undefined;
let offsets: Uint32Array | number[] | undefined;
if (args[0] instanceof Schema) {
schema = args.shift() as Schema<T>;
}
if (args[args.length - 1] instanceof Uint32Array) {
offsets = args.pop();
}
const unwrap = (x: any): RecordBatch<T>[] => {
if (x) {
if (x instanceof RecordBatch) {
return [x];
} else if (x instanceof Table) {
return x.batches;
} else if (x instanceof Data) {
if (x.type instanceof Struct) {
return [new RecordBatch(new Schema(x.type.children), x)];
}
} else if (Array.isArray(x)) {
return x.flatMap(v => unwrap(v));
} else if (typeof x[Symbol.iterator] === 'function') {
return [...x].flatMap(v => unwrap(v));
} else if (typeof x === 'object') {
const keys = Object.keys(x) as (keyof T)[];
const vecs = keys.map((k) => new Vector([x[k]]));
const schema = new Schema(keys.map((k, i) => new Field(String(k), vecs[i].type)));
const [, batches] = distributeVectorsIntoRecordBatches(schema, vecs);
return batches.length === 0 ? [new RecordBatch(x)] : batches;
}
}
return [];
};
const batches = args.flatMap(v => unwrap(v));
schema = schema ?? batches[0]?.schema ?? new Schema([]);
if (!(schema instanceof Schema)) {
throw new TypeError('Table constructor expects a [Schema, RecordBatch[]] pair.');
}
for (const batch of batches) {
if (!(batch instanceof RecordBatch)) {
throw new TypeError('Table constructor expects a [Schema, RecordBatch[]] pair.');
}
if (!compareSchemas(schema, batch.schema)) {
throw new TypeError('Table and inner RecordBatch schemas must be equivalent.');
}
}
this.schema = schema;
this.batches = batches;
this._offsets = offsets ?? computeChunkOffsets(this.data);
}
declare protected _offsets: Uint32Array | number[];
declare protected _nullCount: number;
declare public readonly schema: Schema<T>;
/**
* The contiguous {@link RecordBatch `RecordBatch`} chunks of the Table rows.
*/
declare public readonly batches: RecordBatch<T>[];
/**
* The contiguous {@link RecordBatch `RecordBatch`} chunks of the Table rows.
*/
public get data() { return this.batches.map(({ data }) => data); }
/**
* The number of columns in this Table.
*/
public get numCols() { return this.schema.fields.length; }
/**
* The number of rows in this Table.
*/
public get numRows() {
return this.data.reduce((numRows, data) => numRows + data.length, 0);
}
/**
* The number of null rows in this Table.
*/
public get nullCount() {
if (this._nullCount === -1) {
this._nullCount = computeChunkNullCounts(this.data);
}
return this._nullCount;
}
/**
* Check whether an element is null.
*
* @param index The index at which to read the validity bitmap.
*/
// @ts-ignore
public isValid(index: number): boolean { return false; }
/**
* Get an element value by position.
*
* @param index The index of the element to read.
*/
// @ts-ignore
public get(index: number): Struct<T>['TValue'] | null { return null; }
/**
* Set an element value by position.
*
* @param index The index of the element to write.
* @param value The value to set.
*/
// @ts-ignore
public set(index: number, value: Struct<T>['TValue'] | null): void { return; }
/**
* Retrieve the index of the first occurrence of a value in an Vector.
*
* @param element The value to locate in the Vector.
* @param offset The index at which to begin the search. If offset is omitted, the search starts at index 0.
*/
// @ts-ignore
public indexOf(element: Struct<T>['TValue'], offset?: number): number { return -1; }
/**
* Get the size in bytes of an element by index.
* @param index The index at which to get the byteLength.
*/
// @ts-ignore
public getByteLength(index: number): number { return 0; }
/**
* Iterator for rows in this Table.
*/
public [Symbol.iterator]() {
if (this.batches.length > 0) {
return iteratorVisitor.visit(new Vector(this.data)) as IterableIterator<Struct<T>['TValue']>;
}
return (new Array(0))[Symbol.iterator]();
}
/**
* Return a JavaScript Array of the Table rows.
*
* @returns An Array of Table rows.
*/
public toArray() {
return [...this];
}
/**
* Returns a string representation of the Table rows.
*
* @returns A string representation of the Table rows.
*/
public toString() {
return `[\n ${this.toArray().join(',\n ')}\n]`;
}
/**
* Combines two or more Tables of the same schema.
*
* @param others Additional Tables to add to the end of this Tables.
*/
public concat(...others: Table<T>[]) {
const schema = this.schema;
const data = this.data.concat(others.flatMap(({ data }) => data));
return new Table(schema, data.map((data) => new RecordBatch(schema, data)));
}
/**
* Return a zero-copy sub-section of this Table.
*
* @param begin The beginning of the specified portion of the Table.
* @param end The end of the specified portion of the Table. This is exclusive of the element at the index 'end'.
*/
public slice(begin?: number, end?: number): Table<T> {
const schema = this.schema;
[begin, end] = clampRange({ length: this.numRows }, begin, end);
const data = sliceChunks(this.data, this._offsets, begin, end);
return new Table(schema, data.map((chunk) => new RecordBatch(schema, chunk)));
}
/**
* Returns a child Vector by name, or null if this Vector has no child with the given name.
*
* @param name The name of the child to retrieve.
*/
public getChild<P extends keyof T>(name: P) {
return this.getChildAt<T[P]>(this.schema.fields.findIndex((f) => f.name === name));
}
/**
* Returns a child Vector by index, or null if this Vector has no child at the supplied index.
*
* @param index The index of the child to retrieve.
*/
public getChildAt<R extends T[keyof T] = any>(index: number): Vector<R> | null {
if (index > -1 && index < this.schema.fields.length) {
const data = this.data.map((data) => data.children[index] as Data<R>);
if (data.length === 0) {
const { type } = this.schema.fields[index] as Field<R>;
const empty = makeData<R>({ type, length: 0, nullCount: 0 });
data.push(empty._changeLengthAndBackfillNullBitmap(this.numRows));
}
return new Vector(data);
}
return null;
}
/**
* Sets a child Vector by name.
*
* @param name The name of the child to overwrite.
* @returns A new Table with the supplied child for the specified name.
*/
public setChild<P extends keyof T, R extends DataType>(name: P, child: Vector<R>) {
return this.setChildAt(this.schema.fields?.findIndex((f) => f.name === name), child) as Table<T & { [K in P]: R }>;
}
/**
* Sets a child Vector by index.
*
* @param index The index of the child to overwrite.
* @returns A new Table with the supplied child at the specified index.
*/
public setChildAt(index: number, child?: null): Table;
public setChildAt<R extends DataType = any>(index: number, child: Vector<R>): Table;
public setChildAt(index: number, child: any) {
let schema: Schema = this.schema;
let batches: RecordBatch[] = [...this.batches];
if (index > -1 && index < this.numCols) {
if (!child) {
child = new Vector([makeData({ type: new Null, length: this.numRows })]);
}
const fields = schema.fields.slice() as Field<any>[];
const field = fields[index].clone({ type: child.type });
const children = this.schema.fields.map((_, i) => this.getChildAt(i)!);
[fields[index], children[index]] = [field, child];
[schema, batches] = distributeVectorsIntoRecordBatches(schema, children);
}
return new Table(schema, batches);
}
/**
* Construct a new Table containing only specified columns.
*
* @param columnNames Names of columns to keep.
* @returns A new Table of columns matching the specified names.
*/
public select<K extends keyof T = any>(columnNames: K[]) {
const nameToIndex = this.schema.fields.reduce((m, f, i) => m.set(f.name as K, i), new Map<K, number>());
return this.selectAt(columnNames.map((columnName) => nameToIndex.get(columnName)!).filter((x) => x > -1));
}
/**
* Construct a new Table containing only columns at the specified indices.
*
* @param columnIndices Indices of columns to keep.
* @returns A new Table of columns at the specified indices.
*/
public selectAt<K extends T[keyof T] = any>(columnIndices: number[]) {
const schema = this.schema.selectAt(columnIndices);
const data = this.batches.map((batch) => batch.selectAt(columnIndices));
return new Table<{ [key: string]: K }>(schema, data);
}
public assign<R extends TypeMap = any>(other: Table<R>) {
const fields = this.schema.fields;
const [indices, oldToNew] = other.schema.fields.reduce((memo, f2, newIdx) => {
const [indices, oldToNew] = memo;
const i = fields.findIndex((f) => f.name === f2.name);
~i ? (oldToNew[i] = newIdx) : indices.push(newIdx);
return memo;
}, [[], []] as number[][]);
const schema = this.schema.assign(other.schema);
const columns = [
...fields.map((_, i) => [i, oldToNew[i]]).map(([i, j]) =>
(j === undefined ? this.getChildAt(i) : other.getChildAt(j))!),
...indices.map((i) => other.getChildAt(i)!)
].filter(Boolean) as Vector<(T & R)[keyof T | keyof R]>[];
return new Table<T & R>(...distributeVectorsIntoRecordBatches<any>(schema, columns));
}
// Initialize this static property via an IIFE so bundlers don't tree-shake
// out this logic, but also so we're still compliant with `"sideEffects": false`
protected static [Symbol.toStringTag] = ((proto: Table) => {
(proto as any).schema = null;
(proto as any).batches = [];
(proto as any)._offsets = new Uint32Array([0]);
(proto as any)._nullCount = -1;
(proto as any)[Symbol.isConcatSpreadable] = true;
(proto as any)['isValid'] = wrapChunkedCall1(isChunkedValid);
(proto as any)['get'] = wrapChunkedCall1(getVisitor.getVisitFn(Type.Struct));
(proto as any)['set'] = wrapChunkedCall2(setVisitor.getVisitFn(Type.Struct));
(proto as any)['indexOf'] = wrapChunkedIndexOf(indexOfVisitor.getVisitFn(Type.Struct));
(proto as any)['getByteLength'] = wrapChunkedCall1(byteLengthVisitor.getVisitFn(Type.Struct));
return 'Table';
})(Table.prototype);
}
type VectorsMap<T extends TypeMap> = { [P in keyof T]: Vector<T[P]> };
/**
* Creates a new Table from an object of typed arrays.
*
* @example
* ```ts
* const table = makeTable({
* a: new Int8Array([1, 2, 3]),
* })
* ```
*
* @param input Input an object of typed arrays.
* @returns A new Table.
*/
export function makeTable<I extends Record<string | number | symbol, TypedArray>>(input: I): Table<{ [P in keyof I]: TypedArrayDataType<I[P]> }> {
type T = { [P in keyof I]: TypedArrayDataType<I[P]> };
const vecs = {} as VectorsMap<T>;
const inputs = Object.entries(input) as [keyof I, I[keyof I]][];
for (const [key, col] of inputs) {
vecs[key] = makeVector(col);
}
return new Table<T>(vecs);
}
/**
* Creates a new Table from an object of typed arrays or JavaScript arrays.
*
* @example
* ```ts
* const table = tableFromArrays({
* a: [1, 2, 3],
* b: new Int8Array([1, 2, 3]),
* })
* ```
*
* @param input Input an object of typed arrays or JavaScript arrays.
* @returns A new Table.
*/
export function tableFromArrays<I extends Record<string | number | symbol, TypedArray | BigIntArray | readonly unknown[]>>(input: I): Table<{ [P in keyof I]: ArrayDataType<I[P]> }> {
type T = { [P in keyof I]: ArrayDataType<I[P]> };
const vecs = {} as VectorsMap<T>;
const inputs = Object.entries(input) as [keyof I, I[keyof I]][];
for (const [key, col] of inputs) {
vecs[key] = vectorFromArray(col);
}
return new Table<T>(vecs);
}
|