9585077273

Committed 19 Jun 2024 04:00PM UTC coverage: 89.646% (-0.02%) from 89.661%

Build # 9585077273

Build Type

Pull #8888

github

Committed by

web-flow

Commit Message

Merge 5e69351fa into 92363b3a2

Pull Request Pull Request #8888: GPU Aggregation (3/8): CPUAggregator

Run Details

6483 of 7148 branches covered (90.7%)

Branch coverage included in aggregate %.

381 of 426 new or added lines in 7 files covered. (89.44%)

9 existing lines in 1 file now uncovered.

53628 of 59906 relevant lines covered (89.52%)

6432.39 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

87.85

/modules/aggregation-layers/src/aggregation-layer-v9/cpu-aggregator/aggregate.ts

import type {Bin} from './cpu-aggregator';
import type {AggregationOperation} from '../aggregator';

type AggregationFunc = (pointIndices: number[], getValue: (index: number) => number) => number;

const count: AggregationFunc = pointIndices => {
  return pointIndices.length;
};

const sum: AggregationFunc = (pointIndices, getValue) => {
  let result = 0;
  for (const i of pointIndices) {
    result += getValue(i);
  }
  return result;
};

const mean: AggregationFunc = (pointIndices, getValue) => {
  if (pointIndices.length === 0) {
    return NaN;
  }
  return sum(pointIndices, getValue) / pointIndices.length;
};

const min: AggregationFunc = (pointIndices, getValue) => {
  let result = Infinity;
  for (const i of pointIndices) {
    const value = getValue(i);
    if (value < result) {
      result = value;
    }
  }
  return result;
};

const max: AggregationFunc = (pointIndices, getValue) => {
  let result = -Infinity;
  for (const i of pointIndices) {
    const value = getValue(i);
    if (value > result) {
      result = value;
    }
  }
  return result;
};

const AGGREGATION_FUNC: Record<AggregationOperation, AggregationFunc> = {
  COUNT: count,
  SUM: sum,
  MEAN: mean,
  MIN: min,
  MAX: max
} as const;

/**
 * Performs the aggregation step. See interface Aggregator comments.
 * @returns Floa32Array of aggregated values, one for each bin, and the [min,max] of the values
 */
export function aggregate({
  bins,
  getValue,
  operation,
  target
}: {
  /** Data points sorted by bins */
  bins: Bin[];
  /** Given the index of a data point, returns its value */
  getValue: (index: number) => number;
  /** Method used to reduce a list of values to one number */
  operation: AggregationOperation;
  /** Optional typed array to pack values into */
  target?: Float32Array;
}): {
  value: Float32Array;
  domain: [min: number, max: number];
} {
  if (!target || target.length < bins.length) {
    target = new Float32Array(bins.length);
  }
  let min = Infinity;
  let max = -Infinity;

  const aggregationFunc = AGGREGATION_FUNC[operation];

  for (let j = 0; j < bins.length; j++) {
    const {points} = bins[j];
    target[j] = aggregationFunc(points, getValue);
    if (target[j] < min) min = target[j];
    if (target[j] > max) max = target[j];
  }

  return {value: target, domain: [min, max]};
}

1	import type {Bin} from './cpu-aggregator';	1✔
2	import type {AggregationOperation} from '../aggregator';	1✔
3		1✔
4	type AggregationFunc = (pointIndices: number[], getValue: (index: number) => number) => number;	1✔
5		1✔
6	const count: AggregationFunc = pointIndices => {	1✔
7	return pointIndices.length;	12✔
8	};	12✔
9		1✔
10	const sum: AggregationFunc = (pointIndices, getValue) => {	1✔
11	let result = 0;	40✔
12	for (const i of pointIndices) {	40✔
13	result += getValue(i);	88✔
14	}	88✔
15	return result;	40✔
16	};	40✔
17		1✔
18	const mean: AggregationFunc = (pointIndices, getValue) => {	1✔
19	if (pointIndices.length === 0) {	26!
NEW 20	return NaN;	×
NEW 21	}	×
22	return sum(pointIndices, getValue) / pointIndices.length;	26✔
23	};	26✔
24		1✔
25	const min: AggregationFunc = (pointIndices, getValue) => {	1✔
NEW 26	let result = Infinity;	×
NEW 27	for (const i of pointIndices) {	×
NEW 28	const value = getValue(i);	×
NEW 29	if (value < result) {	×
NEW 30	result = value;	×
NEW 31	}	×
NEW 32	}	×
NEW 33	return result;	×
NEW 34	};	×
35		1✔
36	const max: AggregationFunc = (pointIndices, getValue) => {	1✔
37	let result = -Infinity;	14✔
38	for (const i of pointIndices) {	14✔
39	const value = getValue(i);	32✔
40	if (value > result) {	32✔
41	result = value;	21✔
42	}	21✔
43	}	32✔
44	return result;	14✔
45	};	14✔
46		1✔
47	const AGGREGATION_FUNC: Record<AggregationOperation, AggregationFunc> = {	1✔
48	COUNT: count,	1✔
49	SUM: sum,	1✔
50	MEAN: mean,	1✔
51	MIN: min,	1✔
52	MAX: max	1✔
53	} as const;	1✔
54		1✔
55	/**	1✔
56	* Performs the aggregation step. See interface Aggregator comments.	1✔
57	* @returns Floa32Array of aggregated values, one for each bin, and the [min,max] of the values	1✔
58	*/	1✔
59	export function aggregate({	1✔
60	bins,	5✔
61	getValue,	5✔
62	operation,	5✔
63	target	5✔
64	}: {	5✔
65	/** Data points sorted by bins */	5✔
66	bins: Bin[];	5✔
67	/** Given the index of a data point, returns its value */	5✔
68	getValue: (index: number) => number;	5✔
69	/** Method used to reduce a list of values to one number */	5✔
70	operation: AggregationOperation;	5✔
71	/** Optional typed array to pack values into */	5✔
72	target?: Float32Array;	5✔
73	}): {	5✔
74	value: Float32Array;	5✔
75	domain: [min: number, max: number];	5✔
76	} {	5✔
77	if (!target \|\| target.length < bins.length) {	5!
78	target = new Float32Array(bins.length);	5✔
79	}	5✔
80	let min = Infinity;	5✔
81	let max = -Infinity;	5✔
82		5✔
83	const aggregationFunc = AGGREGATION_FUNC[operation];	5✔
84		5✔
85	for (let j = 0; j < bins.length; j++) {	5✔
86	const {points} = bins[j];	66✔
87	target[j] = aggregationFunc(points, getValue);	66✔
88	if (target[j] < min) min = target[j];	66✔
89	if (target[j] > max) max = target[j];	66✔
90	}	66✔
91		5✔
92	return {value: target, domain: [min, max]};	5✔
93	}	5✔

visgl / deck.gl / 9585077273

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous