Spaces:
Sleeping
Sleeping
File size: 18,694 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 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 |
// 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 { clampRange } from './util/vector.js';
import { DataType, strideForType } from './type.js';
import { Data, makeData, DataProps } from './data.js';
import { BigIntArray, TypedArray, TypedArrayDataType } from './interfaces.js';
import {
isChunkedValid,
computeChunkOffsets,
computeChunkNullCounts,
sliceChunks,
wrapChunkedCall1,
wrapChunkedCall2,
wrapChunkedIndexOf,
} from './util/chunk.js';
import { BigInt64Array, BigUint64Array } from './util/compat.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';
// @ts-ignore
import type { vectorFromArray } from './factories.js';
export interface Vector<T extends DataType = any> {
///
// Virtual properties for the TypeScript compiler.
// These do not exist at runtime.
///
readonly TType: T['TType'];
readonly TArray: T['TArray'];
readonly TValue: T['TValue'];
/**
* @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol/isConcatSpreadable
*/
[Symbol.isConcatSpreadable]: true;
}
const visitorsByTypeId = {} as { [typeId: number]: { get: any; set: any; indexOf: any; byteLength: any } };
const vectorPrototypesByTypeId = {} as { [typeId: number]: any };
/**
* Array-like data structure. Use the convenience method {@link makeVector} and {@link vectorFromArray} to create vectors.
*/
export class Vector<T extends DataType = any> {
constructor(input: readonly (Data<T> | Vector<T>)[]) {
const data: Data<T>[] = input[0] instanceof Vector
? (input as Vector<T>[]).flatMap(x => x.data)
: input as Data<T>[];
if (data.length === 0 || data.some((x) => !(x instanceof Data))) {
throw new TypeError('Vector constructor expects an Array of Data instances.');
}
const type = data[0]?.type;
switch (data.length) {
case 0: this._offsets = [0]; break;
case 1: {
// special case for unchunked vectors
const { get, set, indexOf, byteLength } = visitorsByTypeId[type.typeId];
const unchunkedData = data[0];
this.isValid = (index: number) => isChunkedValid(unchunkedData, index);
this.get = (index: number) => get(unchunkedData, index);
this.set = (index: number, value: T) => set(unchunkedData, index, value);
this.indexOf = (index: number) => indexOf(unchunkedData, index);
this.getByteLength = (index: number) => byteLength(unchunkedData, index);
this._offsets = [0, unchunkedData.length];
break;
}
default:
Object.setPrototypeOf(this, vectorPrototypesByTypeId[type.typeId]);
this._offsets = computeChunkOffsets(data);
break;
}
this.data = data;
this.type = type;
this.stride = strideForType(type);
this.numChildren = type.children?.length ?? 0;
this.length = this._offsets[this._offsets.length - 1];
}
declare protected _offsets: number[] | Uint32Array;
declare protected _nullCount: number;
declare protected _byteLength: number;
/**
* The {@link DataType `DataType`} of this Vector.
*/
public declare readonly type: T;
/**
* The primitive {@link Data `Data`} instances for this Vector's elements.
*/
public declare readonly data: ReadonlyArray<Data<T>>;
/**
* The number of elements in this Vector.
*/
public declare readonly length: number;
/**
* The number of primitive values per Vector element.
*/
public declare readonly stride: number;
/**
* The number of child Vectors if this Vector is a nested dtype.
*/
public declare readonly numChildren: number;
/**
* The aggregate size (in bytes) of this Vector's buffers and/or child Vectors.
*/
public get byteLength() {
if (this._byteLength === -1) {
this._byteLength = this.data.reduce((byteLength, data) => byteLength + data.byteLength, 0);
}
return this._byteLength;
}
/**
* The number of null elements in this Vector.
*/
public get nullCount() {
if (this._nullCount === -1) {
this._nullCount = computeChunkNullCounts(this.data);
}
return this._nullCount;
}
/**
* The Array or TypedAray constructor used for the JS representation
* of the element's values in {@link Vector.prototype.toArray `toArray()`}.
*/
public get ArrayType(): T['ArrayType'] { return this.type.ArrayType; }
/**
* The name that should be printed when the Vector is logged in a message.
*/
public get [Symbol.toStringTag]() {
return `${this.VectorName}<${this.type[Symbol.toStringTag]}>`;
}
/**
* The name of this Vector.
*/
public get VectorName() { return `${Type[this.type.typeId]}Vector`; }
/**
* 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): 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: 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: T['TValue'], offset?: number): number { return -1; }
public includes(element: T['TValue'], offset?: number): boolean { return this.indexOf(element, offset) > 0; }
/**
* 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 the Vector's elements.
*/
public [Symbol.iterator](): IterableIterator<T['TValue'] | null> {
return iteratorVisitor.visit(this);
}
/**
* Combines two or more Vectors of the same type.
* @param others Additional Vectors to add to the end of this Vector.
*/
public concat(...others: Vector<T>[]): Vector<T> {
return new Vector(this.data.concat(others.flatMap((x) => x.data).flat(Number.POSITIVE_INFINITY)));
}
/**
* Return a zero-copy sub-section of this Vector.
* @param start The beginning of the specified portion of the Vector.
* @param end The end of the specified portion of the Vector. This is exclusive of the element at the index 'end'.
*/
public slice(begin?: number, end?: number): Vector<T> {
return new Vector(clampRange(this, begin, end, ({ data, _offsets }, begin, end) =>
sliceChunks(data, _offsets, begin, end)
));
}
public toJSON() { return [...this]; }
/**
* Return a JavaScript Array or TypedArray of the Vector's elements.
*
* @note If this Vector contains a single Data chunk and the Vector's type is a
* primitive numeric type corresponding to one of the JavaScript TypedArrays, this
* method returns a zero-copy slice of the underlying TypedArray values. If there's
* more than one chunk, the resulting TypedArray will be a copy of the data from each
* chunk's underlying TypedArray values.
*
* @returns An Array or TypedArray of the Vector's elements, based on the Vector's DataType.
*/
public toArray(): T['TArray'] {
const { type, data, length, stride, ArrayType } = this;
// Fast case, return subarray if possible
switch (type.typeId) {
case Type.Int:
case Type.Float:
case Type.Decimal:
case Type.Time:
case Type.Timestamp:
switch (data.length) {
case 0: return new ArrayType();
case 1: return data[0].values.subarray(0, length * stride);
default: return data.reduce((memo, { values, length: chunk_length }) => {
memo.array.set(values.subarray(0, chunk_length * stride), memo.offset);
memo.offset += chunk_length * stride;
return memo;
}, { array: new ArrayType(length * stride), offset: 0 }).array;
}
}
// Otherwise if not primitive, slow copy
return [...this] as T['TArray'];
}
/**
* Returns a string representation of the Vector.
*
* @returns A string representation of the Vector.
*/
public toString() {
return `[${[...this].join(',')}]`;
}
/**
* 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<R extends keyof T['TChildren']>(name: R) {
return this.getChildAt(this.type.children?.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 DataType = any>(index: number): Vector<R> | null {
if (index > -1 && index < this.numChildren) {
return new Vector(this.data.map(({ children }) => children[index] as Data<R>));
}
return null;
}
public get isMemoized(): boolean {
if (DataType.isDictionary(this.type)) {
return this.data[0].dictionary!.isMemoized;
}
return false;
}
/**
* Adds memoization to the Vector's {@link get} method. For dictionary
* vectors, this method return a vector that memoizes only the dictionary
* values.
*
* Memoization is very useful when decoding a value is expensive such as
* Uft8. The memoization creates a cache of the size of the Vector and
* therfore increases memory usage.
*
* @returns A new vector that memoizes calls to {@link get}.
*/
public memoize(): MemoizedVector<T> {
if (DataType.isDictionary(this.type)) {
const dictionary = new MemoizedVector(this.data[0].dictionary!);
const newData = this.data.map((data) => {
const cloned = data.clone();
cloned.dictionary = dictionary;
return cloned;
});
return new Vector(newData);
}
return new MemoizedVector(this);
}
/**
* Returns a vector without memoization of the {@link get} method. If this
* vector is not memoized, this method returns this vector.
*
* @returns A a vector without memoization.
*/
public unmemoize(): Vector<T> {
if (DataType.isDictionary(this.type) && this.isMemoized) {
const dictionary = this.data[0].dictionary!.unmemoize();
const newData = this.data.map((data) => {
const newData = data.clone();
newData.dictionary = dictionary;
return newData;
});
return new Vector(newData);
}
return this;
}
// 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: Vector) => {
(proto as any).type = DataType.prototype;
(proto as any).data = [];
(proto as any).length = 0;
(proto as any).stride = 1;
(proto as any).numChildren = 0;
(proto as any)._nullCount = -1;
(proto as any)._byteLength = -1;
(proto as any)._offsets = new Uint32Array([0]);
(proto as any)[Symbol.isConcatSpreadable] = true;
const typeIds: Type[] = Object.keys(Type)
.map((T: any) => Type[T] as any)
.filter((T: any) => typeof T === 'number' && T !== Type.NONE);
for (const typeId of typeIds) {
const get = getVisitor.getVisitFnByTypeId(typeId);
const set = setVisitor.getVisitFnByTypeId(typeId);
const indexOf = indexOfVisitor.getVisitFnByTypeId(typeId);
const byteLength = byteLengthVisitor.getVisitFnByTypeId(typeId);
visitorsByTypeId[typeId] = { get, set, indexOf, byteLength };
vectorPrototypesByTypeId[typeId] = Object.create(proto, {
['isValid']: { value: wrapChunkedCall1(isChunkedValid) },
['get']: { value: wrapChunkedCall1(getVisitor.getVisitFnByTypeId(typeId)) },
['set']: { value: wrapChunkedCall2(setVisitor.getVisitFnByTypeId(typeId)) },
['indexOf']: { value: wrapChunkedIndexOf(indexOfVisitor.getVisitFnByTypeId(typeId)) },
['getByteLength']: { value: wrapChunkedCall1(byteLengthVisitor.getVisitFnByTypeId(typeId)) },
});
}
return 'Vector';
})(Vector.prototype);
}
class MemoizedVector<T extends DataType = any> extends Vector<T> {
public constructor(vector: Vector<T>) {
super(vector.data);
const get = this.get;
const set = this.set;
const slice = this.slice;
const cache = new Array<T['TValue'] | null>(this.length);
Object.defineProperty(this, 'get', {
value(index: number) {
const cachedValue = cache[index];
if (cachedValue !== undefined) {
return cachedValue;
}
const value = get.call(this, index);
cache[index] = value;
return value;
}
});
Object.defineProperty(this, 'set', {
value(index: number, value: T['TValue'] | null) {
set.call(this, index, value);
cache[index] = value;
}
});
Object.defineProperty(this, 'slice', {
value: (begin?: number, end?: number) => new MemoizedVector(slice.call(this, begin, end))
});
Object.defineProperty(this, 'isMemoized', { value: true });
Object.defineProperty(this, 'unmemoize', {
value: () => new Vector(this.data)
});
Object.defineProperty(this, 'memoize', {
value: () => this
});
}
}
import * as dtypes from './type.js';
/**
* Creates a Vector without data copies.
*
* @example
* ```ts
* const vector = makeVector(new Int32Array([1, 2, 3]));
* ```
*/
export function makeVector<T extends TypedArray | BigIntArray>(data: T | readonly T[]): Vector<TypedArrayDataType<T>>;
export function makeVector<T extends DataView>(data: T | readonly T[]): Vector<dtypes.Int8>;
export function makeVector<T extends DataType>(data: Data<T> | readonly Data<T>[]): Vector<T>;
export function makeVector<T extends DataType>(data: Vector<T> | readonly Vector<T>[]): Vector<T>;
export function makeVector<T extends DataType>(data: DataProps<T> | readonly DataProps<T>[]): Vector<T>;
export function makeVector(init: any) {
if (init) {
if (init instanceof Data) { return new Vector([init]); }
if (init instanceof Vector) { return new Vector(init.data); }
if (init.type instanceof DataType) { return new Vector([makeData(init)]); }
if (Array.isArray(init)) {
return new Vector(init.flatMap(v => unwrapInputs(v)));
}
if (ArrayBuffer.isView(init)) {
if (init instanceof DataView) {
init = new Uint8Array(init.buffer);
}
const props = { offset: 0, length: init.length, nullCount: 0, data: init };
if (init instanceof Int8Array) { return new Vector([makeData({ ...props, type: new dtypes.Int8 })]); }
if (init instanceof Int16Array) { return new Vector([makeData({ ...props, type: new dtypes.Int16 })]); }
if (init instanceof Int32Array) { return new Vector([makeData({ ...props, type: new dtypes.Int32 })]); }
if (init instanceof BigInt64Array) { return new Vector([makeData({ ...props, type: new dtypes.Int64 })]); }
if (init instanceof Uint8Array || init instanceof Uint8ClampedArray) { return new Vector([makeData({ ...props, type: new dtypes.Uint8 })]); }
if (init instanceof Uint16Array) { return new Vector([makeData({ ...props, type: new dtypes.Uint16 })]); }
if (init instanceof Uint32Array) { return new Vector([makeData({ ...props, type: new dtypes.Uint32 })]); }
if (init instanceof BigUint64Array) { return new Vector([makeData({ ...props, type: new dtypes.Uint64 })]); }
if (init instanceof Float32Array) { return new Vector([makeData({ ...props, type: new dtypes.Float32 })]); }
if (init instanceof Float64Array) { return new Vector([makeData({ ...props, type: new dtypes.Float64 })]); }
throw new Error('Unrecognized input');
}
}
throw new Error('Unrecognized input');
}
function unwrapInputs(x: any) {
return x instanceof Data ? [x] : (x instanceof Vector ? x.data : makeVector(x).data);
}
|