@pie-lib/graphing-solution-set 2.20.0 → 2.22.0
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/CHANGELOG.md +6 -10
- package/lib/axis/arrow.js +115 -0
- package/lib/axis/arrow.js.map +1 -0
- package/lib/axis/axes.js +415 -0
- package/lib/axis/axes.js.map +1 -0
- package/lib/axis/index.js +26 -0
- package/lib/axis/index.js.map +1 -0
- package/lib/bg.js +139 -0
- package/lib/bg.js.map +1 -0
- package/lib/container/actions.js +24 -0
- package/lib/container/actions.js.map +1 -0
- package/lib/container/index.js +166 -0
- package/lib/container/index.js.map +1 -0
- package/lib/container/marks.js +27 -0
- package/lib/container/marks.js.map +1 -0
- package/lib/container/middleware.js +25 -0
- package/lib/container/middleware.js.map +1 -0
- package/lib/container/reducer.js +25 -0
- package/lib/container/reducer.js.map +1 -0
- package/lib/coordinates-label.js +109 -0
- package/lib/coordinates-label.js.map +1 -0
- package/lib/graph-with-controls.js +372 -0
- package/lib/graph-with-controls.js.map +1 -0
- package/lib/graph.js +419 -0
- package/lib/graph.js.map +1 -0
- package/lib/grid-setup.js +462 -0
- package/lib/grid-setup.js.map +1 -0
- package/lib/grid.js +176 -0
- package/lib/grid.js.map +1 -0
- package/lib/index.js +51 -0
- package/lib/index.js.map +1 -0
- package/lib/labels.js +299 -0
- package/lib/labels.js.map +1 -0
- package/lib/mark-label.js +208 -0
- package/lib/mark-label.js.map +1 -0
- package/lib/toggle-bar.js +336 -0
- package/lib/toggle-bar.js.map +1 -0
- package/lib/tool-menu.js +325 -0
- package/lib/tool-menu.js.map +1 -0
- package/lib/tools/index.js +29 -0
- package/lib/tools/index.js.map +1 -0
- package/lib/tools/line/component.js +106 -0
- package/lib/tools/line/component.js.map +1 -0
- package/lib/tools/line/index.js +16 -0
- package/lib/tools/line/index.js.map +1 -0
- package/lib/tools/polygon/component.js +457 -0
- package/lib/tools/polygon/component.js.map +1 -0
- package/lib/tools/polygon/index.js +106 -0
- package/lib/tools/polygon/index.js.map +1 -0
- package/lib/tools/polygon/line.js +151 -0
- package/lib/tools/polygon/line.js.map +1 -0
- package/lib/tools/polygon/polygon.js +171 -0
- package/lib/tools/polygon/polygon.js.map +1 -0
- package/lib/tools/shared/arrow-head.js +75 -0
- package/lib/tools/shared/arrow-head.js.map +1 -0
- package/lib/tools/shared/line/index.js +637 -0
- package/lib/tools/shared/line/index.js.map +1 -0
- package/lib/tools/shared/line/line-path.js +145 -0
- package/lib/tools/shared/line/line-path.js.map +1 -0
- package/lib/tools/shared/line/with-root-edge.js +155 -0
- package/lib/tools/shared/line/with-root-edge.js.map +1 -0
- package/lib/tools/shared/point/arrow-point.js +113 -0
- package/lib/tools/shared/point/arrow-point.js.map +1 -0
- package/lib/tools/shared/point/arrow.js +96 -0
- package/lib/tools/shared/point/arrow.js.map +1 -0
- package/lib/tools/shared/point/base-point.js +151 -0
- package/lib/tools/shared/point/base-point.js.map +1 -0
- package/lib/tools/shared/point/index.js +94 -0
- package/lib/tools/shared/point/index.js.map +1 -0
- package/lib/tools/shared/styles.js +49 -0
- package/lib/tools/shared/styles.js.map +1 -0
- package/lib/tools/shared/types.js +19 -0
- package/lib/tools/shared/types.js.map +1 -0
- package/lib/undo-redo.js +107 -0
- package/lib/undo-redo.js.map +1 -0
- package/lib/use-debounce.js +32 -0
- package/lib/use-debounce.js.map +1 -0
- package/lib/utils.js +314 -0
- package/lib/utils.js.map +1 -0
- package/package.json +9 -9
- package/src/__tests__/graph-with-controls.test.jsx +1 -1
- package/src/__tests__/graph.test.jsx +1 -1
- package/src/tools/line/__tests__/component.test.jsx +2 -2
- package/src/tools/shared/point/__tests__/arrow-point.test.jsx +2 -2
- package/src/tools/shared/point/__tests__/base-point.test.jsx +2 -2
package/lib/utils.js
ADDED
|
@@ -0,0 +1,314 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
|
|
3
|
+
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
|
4
|
+
|
|
5
|
+
Object.defineProperty(exports, "__esModule", {
|
|
6
|
+
value: true
|
|
7
|
+
});
|
|
8
|
+
exports.thinnerShapesNeeded = exports.sameAxes = exports.roundNumber = exports.polygonToArea = exports.pointsToArea = exports.point = exports.lineToArea = exports.isDuplicatedMark = exports.getTickValues = exports.getRightestPoints = exports.getMiddleOfTwoPoints = exports.getAngleDeg = exports.getAdjustedGraphLimits = exports.findLongestWord = exports.equalPoints = exports.countWords = exports.bounds = exports.arrowDimensions = exports.areArraysOfObjectsEqual = exports.amountToIncreaseWidth = void 0;
|
|
9
|
+
|
|
10
|
+
var _head = _interopRequireDefault(require("lodash/head"));
|
|
11
|
+
|
|
12
|
+
var _tail = _interopRequireDefault(require("lodash/tail"));
|
|
13
|
+
|
|
14
|
+
var _plot = require("@pie-lib/plot");
|
|
15
|
+
|
|
16
|
+
var _invariant = _interopRequireDefault(require("invariant"));
|
|
17
|
+
|
|
18
|
+
var _isEqual = _interopRequireDefault(require("lodash/isEqual"));
|
|
19
|
+
|
|
20
|
+
var _isEmpty = _interopRequireDefault(require("lodash/isEmpty"));
|
|
21
|
+
|
|
22
|
+
var _cloneDeep = _interopRequireDefault(require("lodash/cloneDeep"));
|
|
23
|
+
|
|
24
|
+
var bounds = _plot.utils.bounds;
|
|
25
|
+
exports.bounds = bounds;
|
|
26
|
+
var point = _plot.utils.point; //TODO: This can be removed?
|
|
27
|
+
|
|
28
|
+
exports.point = point;
|
|
29
|
+
|
|
30
|
+
var getAngleDeg = function getAngleDeg() {
|
|
31
|
+
return 0;
|
|
32
|
+
}; //TODO: This can be removed?
|
|
33
|
+
|
|
34
|
+
|
|
35
|
+
exports.getAngleDeg = getAngleDeg;
|
|
36
|
+
|
|
37
|
+
var arrowDimensions = function arrowDimensions() {
|
|
38
|
+
return 0;
|
|
39
|
+
};
|
|
40
|
+
|
|
41
|
+
exports.arrowDimensions = arrowDimensions;
|
|
42
|
+
|
|
43
|
+
var getTickValues = function getTickValues(prop) {
|
|
44
|
+
var tickValues = [];
|
|
45
|
+
var tickVal = 0;
|
|
46
|
+
|
|
47
|
+
while (tickVal >= prop.min && tickValues.indexOf(tickVal) < 0) {
|
|
48
|
+
tickValues.push(tickVal);
|
|
49
|
+
tickVal = Math.round((tickVal - prop.step) * 10000) / 10000;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
tickVal = Math.round(prop.step * 10000) / 10000;
|
|
53
|
+
|
|
54
|
+
while (tickVal <= prop.max && tickValues.indexOf(tickVal) < 0) {
|
|
55
|
+
tickValues.push(tickVal);
|
|
56
|
+
tickVal = Math.round((tickVal + prop.step) * 10000) / 10000;
|
|
57
|
+
} // return only ticks that are inside the min-max interval
|
|
58
|
+
|
|
59
|
+
|
|
60
|
+
if (tickValues) {
|
|
61
|
+
return tickValues.filter(function (tV) {
|
|
62
|
+
return tV >= prop.min && tV <= prop.max;
|
|
63
|
+
});
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
return [];
|
|
67
|
+
};
|
|
68
|
+
|
|
69
|
+
exports.getTickValues = getTickValues;
|
|
70
|
+
|
|
71
|
+
var countWords = function countWords(label) {
|
|
72
|
+
if (label == null || (0, _isEmpty["default"])(label)) {
|
|
73
|
+
return 1;
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
var words = label.split(' ');
|
|
77
|
+
return words.length;
|
|
78
|
+
}; // findLongestWord is also used in plot
|
|
79
|
+
|
|
80
|
+
|
|
81
|
+
exports.countWords = countWords;
|
|
82
|
+
|
|
83
|
+
var findLongestWord = function findLongestWord(label) {
|
|
84
|
+
var longestWord = (label || '').replace(/<[^>]+>/g, '').split(' ').sort(function (a, b) {
|
|
85
|
+
return b.length - a.length;
|
|
86
|
+
});
|
|
87
|
+
return longestWord[0].length;
|
|
88
|
+
}; // amountToIncreaseWidth is also used in plot
|
|
89
|
+
|
|
90
|
+
|
|
91
|
+
exports.findLongestWord = findLongestWord;
|
|
92
|
+
|
|
93
|
+
var amountToIncreaseWidth = function amountToIncreaseWidth(longestWord) {
|
|
94
|
+
if (!longestWord) {
|
|
95
|
+
return 0;
|
|
96
|
+
}
|
|
97
|
+
|
|
98
|
+
return longestWord * 10;
|
|
99
|
+
};
|
|
100
|
+
|
|
101
|
+
exports.amountToIncreaseWidth = amountToIncreaseWidth;
|
|
102
|
+
|
|
103
|
+
var polygonToArea = function polygonToArea(points) {
|
|
104
|
+
var h = (0, _head["default"])(points);
|
|
105
|
+
var area = {
|
|
106
|
+
left: h.x,
|
|
107
|
+
top: h.y,
|
|
108
|
+
bottom: h.y,
|
|
109
|
+
right: h.x
|
|
110
|
+
};
|
|
111
|
+
return (0, _tail["default"])(points).reduce(function (a, p) {
|
|
112
|
+
a.left = Math.min(a.left, p.x);
|
|
113
|
+
a.top = Math.max(a.top, p.y);
|
|
114
|
+
a.bottom = Math.min(a.bottom, p.y);
|
|
115
|
+
a.right = Math.max(a.right, p.x);
|
|
116
|
+
return a;
|
|
117
|
+
}, area);
|
|
118
|
+
};
|
|
119
|
+
|
|
120
|
+
exports.polygonToArea = polygonToArea;
|
|
121
|
+
|
|
122
|
+
var lineToArea = function lineToArea(from, to) {
|
|
123
|
+
return pointsToArea(from, to);
|
|
124
|
+
};
|
|
125
|
+
|
|
126
|
+
exports.lineToArea = lineToArea;
|
|
127
|
+
|
|
128
|
+
var pointsToArea = function pointsToArea(a, b) {
|
|
129
|
+
(0, _invariant["default"])(!!a && !!b, 'a or b is undefined');
|
|
130
|
+
var left = Math.min(a.x, b.x);
|
|
131
|
+
var top = Math.max(a.y, b.y);
|
|
132
|
+
var bottom = Math.min(a.y, b.y);
|
|
133
|
+
var right = Math.max(a.x, b.x);
|
|
134
|
+
return {
|
|
135
|
+
left: left,
|
|
136
|
+
top: top,
|
|
137
|
+
bottom: bottom,
|
|
138
|
+
right: right
|
|
139
|
+
};
|
|
140
|
+
};
|
|
141
|
+
|
|
142
|
+
exports.pointsToArea = pointsToArea;
|
|
143
|
+
|
|
144
|
+
var getRightestPoints = function getRightestPoints(points) {
|
|
145
|
+
var sortedPoints = (0, _cloneDeep["default"])(points);
|
|
146
|
+
sortedPoints.sort(function (a, b) {
|
|
147
|
+
return b.x - a.x;
|
|
148
|
+
});
|
|
149
|
+
return {
|
|
150
|
+
a: sortedPoints[0],
|
|
151
|
+
b: sortedPoints[1]
|
|
152
|
+
};
|
|
153
|
+
};
|
|
154
|
+
|
|
155
|
+
exports.getRightestPoints = getRightestPoints;
|
|
156
|
+
|
|
157
|
+
var getMiddleOfTwoPoints = function getMiddleOfTwoPoints(a, b) {
|
|
158
|
+
return {
|
|
159
|
+
x: (a.x + b.x) / 2,
|
|
160
|
+
y: (a.y + b.y) / 2
|
|
161
|
+
};
|
|
162
|
+
};
|
|
163
|
+
|
|
164
|
+
exports.getMiddleOfTwoPoints = getMiddleOfTwoPoints;
|
|
165
|
+
|
|
166
|
+
var roundNumber = function roundNumber(number) {
|
|
167
|
+
return parseFloat(number.toFixed(4));
|
|
168
|
+
};
|
|
169
|
+
|
|
170
|
+
exports.roundNumber = roundNumber;
|
|
171
|
+
|
|
172
|
+
var sameAxes = function sameAxes(p1, p2) {
|
|
173
|
+
return p1 && p2 && (roundNumber(p1.x) === roundNumber(p2.x) || roundNumber(p1.y) === roundNumber(p2.y));
|
|
174
|
+
};
|
|
175
|
+
|
|
176
|
+
exports.sameAxes = sameAxes;
|
|
177
|
+
|
|
178
|
+
var equalPoints = function equalPoints(p1, p2) {
|
|
179
|
+
return p1 && p2 && (0, _isEqual["default"])({
|
|
180
|
+
x: roundNumber(p1.x),
|
|
181
|
+
y: roundNumber(p1.y)
|
|
182
|
+
}, {
|
|
183
|
+
x: roundNumber(p2.x),
|
|
184
|
+
y: roundNumber(p2.y)
|
|
185
|
+
});
|
|
186
|
+
};
|
|
187
|
+
|
|
188
|
+
exports.equalPoints = equalPoints;
|
|
189
|
+
|
|
190
|
+
var getDistanceBetweenTicks = function getDistanceBetweenTicks(axis, size) {
|
|
191
|
+
var min = axis.min,
|
|
192
|
+
max = axis.max,
|
|
193
|
+
step = axis.step;
|
|
194
|
+
var nbOfTicks = (max - min) / step;
|
|
195
|
+
return size / nbOfTicks;
|
|
196
|
+
};
|
|
197
|
+
|
|
198
|
+
var thinnerShapesNeeded = function thinnerShapesNeeded(graphProps) {
|
|
199
|
+
var domain = graphProps.domain,
|
|
200
|
+
range = graphProps.range,
|
|
201
|
+
_graphProps$size = graphProps.size,
|
|
202
|
+
width = _graphProps$size.width,
|
|
203
|
+
height = _graphProps$size.height; // 14 is the default width of a point
|
|
204
|
+
|
|
205
|
+
return getDistanceBetweenTicks(domain, width) < 14 || getDistanceBetweenTicks(range, height) < 14;
|
|
206
|
+
};
|
|
207
|
+
|
|
208
|
+
exports.thinnerShapesNeeded = thinnerShapesNeeded;
|
|
209
|
+
|
|
210
|
+
var getAdjustedGraphLimits = function getAdjustedGraphLimits(graphProps) {
|
|
211
|
+
var domain = graphProps.domain,
|
|
212
|
+
range = graphProps.range,
|
|
213
|
+
_graphProps$size2 = graphProps.size,
|
|
214
|
+
width = _graphProps$size2.width,
|
|
215
|
+
height = _graphProps$size2.height;
|
|
216
|
+
var domainTicksDistance = getDistanceBetweenTicks(domain, width);
|
|
217
|
+
var rangeTicksDistance = getDistanceBetweenTicks(range, height); // 15 is the distance required for the arrow to extend the graph
|
|
218
|
+
|
|
219
|
+
var domainPadding = domain.step / (domainTicksDistance / 15);
|
|
220
|
+
var rangePadding = range.step / (rangeTicksDistance / 15);
|
|
221
|
+
return {
|
|
222
|
+
domain: {
|
|
223
|
+
min: domain.min - domainPadding,
|
|
224
|
+
max: domain.max + domainPadding
|
|
225
|
+
},
|
|
226
|
+
range: {
|
|
227
|
+
min: range.min - rangePadding,
|
|
228
|
+
max: range.max + rangePadding
|
|
229
|
+
}
|
|
230
|
+
};
|
|
231
|
+
};
|
|
232
|
+
|
|
233
|
+
exports.getAdjustedGraphLimits = getAdjustedGraphLimits;
|
|
234
|
+
|
|
235
|
+
var sortPoints = function sortPoints(array) {
|
|
236
|
+
return (array || []).sort(function (a, b) {
|
|
237
|
+
return a.x - b.x || a.y - b.y;
|
|
238
|
+
});
|
|
239
|
+
}; // check colliniarity of 3 points (source: https://www.geeksforgeeks.org/program-check-three-points-collinear/)
|
|
240
|
+
|
|
241
|
+
|
|
242
|
+
var checkCollinearity = function checkCollinearity(a, b, c) {
|
|
243
|
+
return (a.x - b.x) * (c.y - b.y) === (c.x - b.x) * (a.y - b.y);
|
|
244
|
+
}; // 2 lines are overlapping if all 4 points are collinear
|
|
245
|
+
|
|
246
|
+
|
|
247
|
+
var isSameLine = function isSameLine(markA, markB) {
|
|
248
|
+
return checkCollinearity(markA.from, markB.from, markB.to) && checkCollinearity(markA.to, markB.from, markB.to);
|
|
249
|
+
};
|
|
250
|
+
|
|
251
|
+
var isDuplicatedMark = function isDuplicatedMark(mark, marks, oldMark) {
|
|
252
|
+
var type = mark.type,
|
|
253
|
+
building = mark.building;
|
|
254
|
+
|
|
255
|
+
if (building) {
|
|
256
|
+
return false;
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
var filteredMarks = (marks || []).filter(function (m) {
|
|
260
|
+
return m.type === type && !m.building;
|
|
261
|
+
});
|
|
262
|
+
var index = filteredMarks.findIndex(function (m) {
|
|
263
|
+
return (0, _isEqual["default"])(m, oldMark);
|
|
264
|
+
});
|
|
265
|
+
|
|
266
|
+
if (index !== -1) {
|
|
267
|
+
filteredMarks.splice(index, 1);
|
|
268
|
+
}
|
|
269
|
+
|
|
270
|
+
var duplicated = filteredMarks.find(function (m) {
|
|
271
|
+
if (type === 'line') {
|
|
272
|
+
var from = mark.from,
|
|
273
|
+
to = mark.to;
|
|
274
|
+
return equalPoints(from, m.from) && equalPoints(to, m.to) || equalPoints(from, m.to) && equalPoints(to, m.from) || type === 'line' && isSameLine(m, mark);
|
|
275
|
+
} else if (type === 'polygon') {
|
|
276
|
+
return (0, _isEqual["default"])(sortPoints((0, _cloneDeep["default"])(mark.points)), sortPoints((0, _cloneDeep["default"])(m.points)));
|
|
277
|
+
}
|
|
278
|
+
});
|
|
279
|
+
return !!duplicated;
|
|
280
|
+
};
|
|
281
|
+
|
|
282
|
+
exports.isDuplicatedMark = isDuplicatedMark;
|
|
283
|
+
|
|
284
|
+
var areArraysOfObjectsEqual = function areArraysOfObjectsEqual(array1, array2) {
|
|
285
|
+
// Check if both arrays have the same length
|
|
286
|
+
if (array1.length !== array2.length) {
|
|
287
|
+
return false;
|
|
288
|
+
} // Iterate through each object in the arrays
|
|
289
|
+
|
|
290
|
+
|
|
291
|
+
for (var i = 0; i < array1.length; i++) {
|
|
292
|
+
// Get the current objects in both arrays
|
|
293
|
+
var obj1 = array1[i];
|
|
294
|
+
var obj2 = array2[i]; // Check if the objects have the same number of properties
|
|
295
|
+
|
|
296
|
+
if (Object.keys(obj1).length !== Object.keys(obj2).length) {
|
|
297
|
+
return false;
|
|
298
|
+
} // Iterate through each property in the objects
|
|
299
|
+
|
|
300
|
+
|
|
301
|
+
for (var key in obj1) {
|
|
302
|
+
// Check if the properties and their values are equal
|
|
303
|
+
if (obj1[key] !== obj2[key]) {
|
|
304
|
+
return false;
|
|
305
|
+
}
|
|
306
|
+
}
|
|
307
|
+
} // If all objects are equal, the arrays are the same
|
|
308
|
+
|
|
309
|
+
|
|
310
|
+
return true;
|
|
311
|
+
};
|
|
312
|
+
|
|
313
|
+
exports.areArraysOfObjectsEqual = areArraysOfObjectsEqual;
|
|
314
|
+
//# sourceMappingURL=utils.js.map
|
package/lib/utils.js.map
ADDED
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/utils.js"],"names":["bounds","utils","point","getAngleDeg","arrowDimensions","getTickValues","prop","tickValues","tickVal","min","indexOf","push","Math","round","step","max","filter","tV","countWords","label","words","split","length","findLongestWord","longestWord","replace","sort","a","b","amountToIncreaseWidth","polygonToArea","points","h","area","left","x","top","y","bottom","right","reduce","p","lineToArea","from","to","pointsToArea","getRightestPoints","sortedPoints","getMiddleOfTwoPoints","roundNumber","number","parseFloat","toFixed","sameAxes","p1","p2","equalPoints","getDistanceBetweenTicks","axis","size","nbOfTicks","thinnerShapesNeeded","graphProps","domain","range","width","height","getAdjustedGraphLimits","domainTicksDistance","rangeTicksDistance","domainPadding","rangePadding","sortPoints","array","checkCollinearity","c","isSameLine","markA","markB","isDuplicatedMark","mark","marks","oldMark","type","building","filteredMarks","m","index","findIndex","splice","duplicated","find","areArraysOfObjectsEqual","array1","array2","i","obj1","obj2","Object","keys","key"],"mappings":";;;;;;;;;AAAA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEO,IAAMA,MAAM,GAAGC,YAAMD,MAArB;;AACA,IAAME,KAAK,GAAGD,YAAMC,KAApB,C,CAEP;;;;AACO,IAAMC,WAAW,GAAG,SAAdA,WAAc;AAAA,SAAM,CAAN;AAAA,CAApB,C,CACP;;;;;AACO,IAAMC,eAAe,GAAG,SAAlBA,eAAkB;AAAA,SAAM,CAAN;AAAA,CAAxB;;;;AAEA,IAAMC,aAAa,GAAG,SAAhBA,aAAgB,CAACC,IAAD,EAAU;AACrC,MAAMC,UAAU,GAAG,EAAnB;AACA,MAAIC,OAAO,GAAG,CAAd;;AAEA,SAAOA,OAAO,IAAIF,IAAI,CAACG,GAAhB,IAAuBF,UAAU,CAACG,OAAX,CAAmBF,OAAnB,IAA8B,CAA5D,EAA+D;AAC7DD,IAAAA,UAAU,CAACI,IAAX,CAAgBH,OAAhB;AACAA,IAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAW,CAACL,OAAO,GAAGF,IAAI,CAACQ,IAAhB,IAAwB,KAAnC,IAA4C,KAAtD;AACD;;AAEDN,EAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAWP,IAAI,CAACQ,IAAL,GAAY,KAAvB,IAAgC,KAA1C;;AAEA,SAAON,OAAO,IAAIF,IAAI,CAACS,GAAhB,IAAuBR,UAAU,CAACG,OAAX,CAAmBF,OAAnB,IAA8B,CAA5D,EAA+D;AAC7DD,IAAAA,UAAU,CAACI,IAAX,CAAgBH,OAAhB;AACAA,IAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAW,CAACL,OAAO,GAAGF,IAAI,CAACQ,IAAhB,IAAwB,KAAnC,IAA4C,KAAtD;AACD,GAdoC,CAgBrC;;;AACA,MAAIP,UAAJ,EAAgB;AACd,WAAOA,UAAU,CAACS,MAAX,CAAkB,UAACC,EAAD;AAAA,aAAQA,EAAE,IAAIX,IAAI,CAACG,GAAX,IAAkBQ,EAAE,IAAIX,IAAI,CAACS,GAArC;AAAA,KAAlB,CAAP;AACD;;AAED,SAAO,EAAP;AACD,CAtBM;;;;AAwBA,IAAMG,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD,EAAW;AACnC,MAAIA,KAAK,IAAI,IAAT,IAAiB,yBAAQA,KAAR,CAArB,EAAqC;AACnC,WAAO,CAAP;AACD;;AAED,MAAMC,KAAK,GAAGD,KAAK,CAACE,KAAN,CAAY,GAAZ,CAAd;AACA,SAAOD,KAAK,CAACE,MAAb;AACD,CAPM,C,CASP;;;;;AACO,IAAMC,eAAe,GAAG,SAAlBA,eAAkB,CAACJ,KAAD,EAAW;AACxC,MAAIK,WAAW,GAAG,CAACL,KAAK,IAAI,EAAV,EACfM,OADe,CACP,UADO,EACK,EADL,EAEfJ,KAFe,CAET,GAFS,EAGfK,IAHe,CAGV,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUA,CAAC,CAACN,MAAF,GAAWK,CAAC,CAACL,MAAvB;AAAA,GAHU,CAAlB;AAKA,SAAOE,WAAW,CAAC,CAAD,CAAX,CAAeF,MAAtB;AACD,CAPM,C,CASP;;;;;AACO,IAAMO,qBAAqB,GAAG,SAAxBA,qBAAwB,CAACL,WAAD,EAAiB;AACpD,MAAI,CAACA,WAAL,EAAkB;AAChB,WAAO,CAAP;AACD;;AAED,SAAOA,WAAW,GAAG,EAArB;AACD,CANM;;;;AAQA,IAAMM,aAAa,GAAG,SAAhBA,aAAgB,CAACC,MAAD,EAAY;AACvC,MAAMC,CAAC,GAAG,sBAAKD,MAAL,CAAV;AACA,MAAME,IAAI,GAAG;AACXC,IAAAA,IAAI,EAAEF,CAAC,CAACG,CADG;AAEXC,IAAAA,GAAG,EAAEJ,CAAC,CAACK,CAFI;AAGXC,IAAAA,MAAM,EAAEN,CAAC,CAACK,CAHC;AAIXE,IAAAA,KAAK,EAAEP,CAAC,CAACG;AAJE,GAAb;AAMA,SAAO,sBAAKJ,MAAL,EAAaS,MAAb,CAAoB,UAACb,CAAD,EAAIc,CAAJ,EAAU;AACnCd,IAAAA,CAAC,CAACO,IAAF,GAAStB,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACO,IAAX,EAAiBO,CAAC,CAACN,CAAnB,CAAT;AACAR,IAAAA,CAAC,CAACS,GAAF,GAAQxB,IAAI,CAACG,GAAL,CAASY,CAAC,CAACS,GAAX,EAAgBK,CAAC,CAACJ,CAAlB,CAAR;AACAV,IAAAA,CAAC,CAACW,MAAF,GAAW1B,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACW,MAAX,EAAmBG,CAAC,CAACJ,CAArB,CAAX;AACAV,IAAAA,CAAC,CAACY,KAAF,GAAU3B,IAAI,CAACG,GAAL,CAASY,CAAC,CAACY,KAAX,EAAkBE,CAAC,CAACN,CAApB,CAAV;AACA,WAAOR,CAAP;AACD,GANM,EAMJM,IANI,CAAP;AAOD,CAfM;;;;AAiBA,IAAMS,UAAU,GAAG,SAAbA,UAAa,CAACC,IAAD,EAAOC,EAAP;AAAA,SAAcC,YAAY,CAACF,IAAD,EAAOC,EAAP,CAA1B;AAAA,CAAnB;;;;AAEA,IAAMC,YAAY,GAAG,SAAfA,YAAe,CAAClB,CAAD,EAAIC,CAAJ,EAAU;AACpC,6BAAU,CAAC,CAACD,CAAF,IAAO,CAAC,CAACC,CAAnB,EAAsB,qBAAtB;AACA,MAAMM,IAAI,GAAGtB,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACQ,CAAX,EAAcP,CAAC,CAACO,CAAhB,CAAb;AACA,MAAMC,GAAG,GAAGxB,IAAI,CAACG,GAAL,CAASY,CAAC,CAACU,CAAX,EAAcT,CAAC,CAACS,CAAhB,CAAZ;AACA,MAAMC,MAAM,GAAG1B,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACU,CAAX,EAAcT,CAAC,CAACS,CAAhB,CAAf;AACA,MAAME,KAAK,GAAG3B,IAAI,CAACG,GAAL,CAASY,CAAC,CAACQ,CAAX,EAAcP,CAAC,CAACO,CAAhB,CAAd;AACA,SAAO;AAAED,IAAAA,IAAI,EAAJA,IAAF;AAAQE,IAAAA,GAAG,EAAHA,GAAR;AAAaE,IAAAA,MAAM,EAANA,MAAb;AAAqBC,IAAAA,KAAK,EAALA;AAArB,GAAP;AACD,CAPM;;;;AASA,IAAMO,iBAAiB,GAAG,SAApBA,iBAAoB,CAACf,MAAD,EAAY;AAC3C,MAAMgB,YAAY,GAAG,2BAAUhB,MAAV,CAArB;AACAgB,EAAAA,YAAY,CAACrB,IAAb,CAAkB,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUA,CAAC,CAACO,CAAF,GAAMR,CAAC,CAACQ,CAAlB;AAAA,GAAlB;AAEA,SAAO;AAAER,IAAAA,CAAC,EAAEoB,YAAY,CAAC,CAAD,CAAjB;AAAsBnB,IAAAA,CAAC,EAAEmB,YAAY,CAAC,CAAD;AAArC,GAAP;AACD,CALM;;;;AAOA,IAAMC,oBAAoB,GAAG,SAAvBA,oBAAuB,CAACrB,CAAD,EAAIC,CAAJ;AAAA,SAAW;AAC7CO,IAAAA,CAAC,EAAE,CAACR,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAT,IAAc,CAD4B;AAE7CE,IAAAA,CAAC,EAAE,CAACV,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAAT,IAAc;AAF4B,GAAX;AAAA,CAA7B;;;;AAKA,IAAMY,WAAW,GAAG,SAAdA,WAAc,CAACC,MAAD;AAAA,SAAYC,UAAU,CAACD,MAAM,CAACE,OAAP,CAAe,CAAf,CAAD,CAAtB;AAAA,CAApB;;;;AAEA,IAAMC,QAAQ,GAAG,SAAXA,QAAW,CAACC,EAAD,EAAKC,EAAL;AAAA,SACtBD,EAAE,IAAIC,EAAN,KAAaN,WAAW,CAACK,EAAE,CAACnB,CAAJ,CAAX,KAAsBc,WAAW,CAACM,EAAE,CAACpB,CAAJ,CAAjC,IAA2Cc,WAAW,CAACK,EAAE,CAACjB,CAAJ,CAAX,KAAsBY,WAAW,CAACM,EAAE,CAAClB,CAAJ,CAAzF,CADsB;AAAA,CAAjB;;;;AAGA,IAAMmB,WAAW,GAAG,SAAdA,WAAc,CAACF,EAAD,EAAKC,EAAL;AAAA,SACzBD,EAAE,IACFC,EADA,IAEA,yBACE;AACEpB,IAAAA,CAAC,EAAEc,WAAW,CAACK,EAAE,CAACnB,CAAJ,CADhB;AAEEE,IAAAA,CAAC,EAAEY,WAAW,CAACK,EAAE,CAACjB,CAAJ;AAFhB,GADF,EAKE;AACEF,IAAAA,CAAC,EAAEc,WAAW,CAACM,EAAE,CAACpB,CAAJ,CADhB;AAEEE,IAAAA,CAAC,EAAEY,WAAW,CAACM,EAAE,CAAClB,CAAJ;AAFhB,GALF,CAHyB;AAAA,CAApB;;;;AAcP,IAAMoB,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,IAAD,EAAOC,IAAP,EAAgB;AAC9C,MAAQlD,GAAR,GAA2BiD,IAA3B,CAAQjD,GAAR;AAAA,MAAaM,GAAb,GAA2B2C,IAA3B,CAAa3C,GAAb;AAAA,MAAkBD,IAAlB,GAA2B4C,IAA3B,CAAkB5C,IAAlB;AACA,MAAM8C,SAAS,GAAG,CAAC7C,GAAG,GAAGN,GAAP,IAAcK,IAAhC;AAEA,SAAO6C,IAAI,GAAGC,SAAd;AACD,CALD;;AAOO,IAAMC,mBAAmB,GAAG,SAAtBA,mBAAsB,CAACC,UAAD,EAAgB;AACjD,MACEC,MADF,GAIID,UAJJ,CACEC,MADF;AAAA,MAEEC,KAFF,GAIIF,UAJJ,CAEEE,KAFF;AAAA,yBAIIF,UAJJ,CAGEH,IAHF;AAAA,MAGUM,KAHV,oBAGUA,KAHV;AAAA,MAGiBC,MAHjB,oBAGiBA,MAHjB,CADiD,CAOjD;;AACA,SAAOT,uBAAuB,CAACM,MAAD,EAASE,KAAT,CAAvB,GAAyC,EAAzC,IAA+CR,uBAAuB,CAACO,KAAD,EAAQE,MAAR,CAAvB,GAAyC,EAA/F;AACD,CATM;;;;AAWA,IAAMC,sBAAsB,GAAG,SAAzBA,sBAAyB,CAACL,UAAD,EAAgB;AACpD,MACEC,MADF,GAIID,UAJJ,CACEC,MADF;AAAA,MAEEC,KAFF,GAIIF,UAJJ,CAEEE,KAFF;AAAA,0BAIIF,UAJJ,CAGEH,IAHF;AAAA,MAGUM,KAHV,qBAGUA,KAHV;AAAA,MAGiBC,MAHjB,qBAGiBA,MAHjB;AAKA,MAAME,mBAAmB,GAAGX,uBAAuB,CAACM,MAAD,EAASE,KAAT,CAAnD;AACA,MAAMI,kBAAkB,GAAGZ,uBAAuB,CAACO,KAAD,EAAQE,MAAR,CAAlD,CAPoD,CASpD;;AACA,MAAMI,aAAa,GAAGP,MAAM,CAACjD,IAAP,IAAesD,mBAAmB,GAAG,EAArC,CAAtB;AACA,MAAMG,YAAY,GAAGP,KAAK,CAAClD,IAAN,IAAcuD,kBAAkB,GAAG,EAAnC,CAArB;AAEA,SAAO;AACLN,IAAAA,MAAM,EAAE;AACNtD,MAAAA,GAAG,EAAEsD,MAAM,CAACtD,GAAP,GAAa6D,aADZ;AAENvD,MAAAA,GAAG,EAAEgD,MAAM,CAAChD,GAAP,GAAauD;AAFZ,KADH;AAKLN,IAAAA,KAAK,EAAE;AACLvD,MAAAA,GAAG,EAAEuD,KAAK,CAACvD,GAAN,GAAY8D,YADZ;AAELxD,MAAAA,GAAG,EAAEiD,KAAK,CAACjD,GAAN,GAAYwD;AAFZ;AALF,GAAP;AAUD,CAvBM;;;;AAyBP,IAAMC,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD;AAAA,SAAW,CAACA,KAAK,IAAI,EAAV,EAAc/C,IAAd,CAAmB,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUD,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAR,IAAaR,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAA/B;AAAA,GAAnB,CAAX;AAAA,CAAnB,C,CAEA;;;AACA,IAAMqC,iBAAiB,GAAG,SAApBA,iBAAoB,CAAC/C,CAAD,EAAIC,CAAJ,EAAO+C,CAAP;AAAA,SAAa,CAAChD,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAT,KAAewC,CAAC,CAACtC,CAAF,GAAMT,CAAC,CAACS,CAAvB,MAA8B,CAACsC,CAAC,CAACxC,CAAF,GAAMP,CAAC,CAACO,CAAT,KAAeR,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAAvB,CAA3C;AAAA,CAA1B,C,CAEA;;;AACA,IAAMuC,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD,EAAQC,KAAR;AAAA,SACjBJ,iBAAiB,CAACG,KAAK,CAAClC,IAAP,EAAamC,KAAK,CAACnC,IAAnB,EAAyBmC,KAAK,CAAClC,EAA/B,CAAjB,IAAuD8B,iBAAiB,CAACG,KAAK,CAACjC,EAAP,EAAWkC,KAAK,CAACnC,IAAjB,EAAuBmC,KAAK,CAAClC,EAA7B,CADvD;AAAA,CAAnB;;AAGO,IAAMmC,gBAAgB,GAAG,SAAnBA,gBAAmB,CAACC,IAAD,EAAOC,KAAP,EAAcC,OAAd,EAA0B;AACxD,MAAQC,IAAR,GAA2BH,IAA3B,CAAQG,IAAR;AAAA,MAAcC,QAAd,GAA2BJ,IAA3B,CAAcI,QAAd;;AAEA,MAAIA,QAAJ,EAAc;AACZ,WAAO,KAAP;AACD;;AAED,MAAMC,aAAa,GAAG,CAACJ,KAAK,IAAI,EAAV,EAAcjE,MAAd,CAAqB,UAACsE,CAAD;AAAA,WAAOA,CAAC,CAACH,IAAF,KAAWA,IAAX,IAAmB,CAACG,CAAC,CAACF,QAA7B;AAAA,GAArB,CAAtB;AACA,MAAMG,KAAK,GAAGF,aAAa,CAACG,SAAd,CAAwB,UAACF,CAAD;AAAA,WAAO,yBAAQA,CAAR,EAAWJ,OAAX,CAAP;AAAA,GAAxB,CAAd;;AAEA,MAAIK,KAAK,KAAK,CAAC,CAAf,EAAkB;AAChBF,IAAAA,aAAa,CAACI,MAAd,CAAqBF,KAArB,EAA4B,CAA5B;AACD;;AAED,MAAMG,UAAU,GAAGL,aAAa,CAACM,IAAd,CAAmB,UAACL,CAAD,EAAO;AAC3C,QAAIH,IAAI,KAAK,MAAb,EAAqB;AACnB,UAAQxC,IAAR,GAAqBqC,IAArB,CAAQrC,IAAR;AAAA,UAAcC,EAAd,GAAqBoC,IAArB,CAAcpC,EAAd;AACA,aACGY,WAAW,CAACb,IAAD,EAAO2C,CAAC,CAAC3C,IAAT,CAAX,IAA6Ba,WAAW,CAACZ,EAAD,EAAK0C,CAAC,CAAC1C,EAAP,CAAzC,IACCY,WAAW,CAACb,IAAD,EAAO2C,CAAC,CAAC1C,EAAT,CAAX,IAA2BY,WAAW,CAACZ,EAAD,EAAK0C,CAAC,CAAC3C,IAAP,CADvC,IAECwC,IAAI,KAAK,MAAT,IAAmBP,UAAU,CAACU,CAAD,EAAIN,IAAJ,CAHhC;AAKD,KAPD,MAOO,IAAIG,IAAI,KAAK,SAAb,EAAwB;AAC7B,aAAO,yBAAQX,UAAU,CAAC,2BAAUQ,IAAI,CAACjD,MAAf,CAAD,CAAlB,EAA4CyC,UAAU,CAAC,2BAAUc,CAAC,CAACvD,MAAZ,CAAD,CAAtD,CAAP;AACD;AACF,GAXkB,CAAnB;AAaA,SAAO,CAAC,CAAC2D,UAAT;AACD,CA5BM;;;;AA8BA,IAAME,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,MAAD,EAASC,MAAT,EAAoB;AACzD;AACA,MAAID,MAAM,CAACvE,MAAP,KAAkBwE,MAAM,CAACxE,MAA7B,EAAqC;AACnC,WAAO,KAAP;AACD,GAJwD,CAKzD;;;AACA,OAAK,IAAIyE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGF,MAAM,CAACvE,MAA3B,EAAmCyE,CAAC,EAApC,EAAwC;AACtC;AACA,QAAMC,IAAI,GAAGH,MAAM,CAACE,CAAD,CAAnB;AACA,QAAME,IAAI,GAAGH,MAAM,CAACC,CAAD,CAAnB,CAHsC,CAItC;;AACA,QAAIG,MAAM,CAACC,IAAP,CAAYH,IAAZ,EAAkB1E,MAAlB,KAA6B4E,MAAM,CAACC,IAAP,CAAYF,IAAZ,EAAkB3E,MAAnD,EAA2D;AACzD,aAAO,KAAP;AACD,KAPqC,CAQtC;;;AACA,SAAK,IAAM8E,GAAX,IAAkBJ,IAAlB,EAAwB;AACtB;AACA,UAAIA,IAAI,CAACI,GAAD,CAAJ,KAAcH,IAAI,CAACG,GAAD,CAAtB,EAA6B;AAC3B,eAAO,KAAP;AACD;AACF;AACF,GArBwD,CAsBzD;;;AACA,SAAO,IAAP;AACD,CAxBM","sourcesContent":["import head from 'lodash/head';\nimport tail from 'lodash/tail';\nimport { utils } from '@pie-lib/plot';\nimport invariant from 'invariant';\nimport isEqual from 'lodash/isEqual';\nimport isEmpty from 'lodash/isEmpty';\nimport cloneDeep from 'lodash/cloneDeep';\n\nexport const bounds = utils.bounds;\nexport const point = utils.point;\n\n//TODO: This can be removed?\nexport const getAngleDeg = () => 0;\n//TODO: This can be removed?\nexport const arrowDimensions = () => 0;\n\nexport const getTickValues = (prop) => {\n const tickValues = [];\n let tickVal = 0;\n\n while (tickVal >= prop.min && tickValues.indexOf(tickVal) < 0) {\n tickValues.push(tickVal);\n tickVal = Math.round((tickVal - prop.step) * 10000) / 10000;\n }\n\n tickVal = Math.round(prop.step * 10000) / 10000;\n\n while (tickVal <= prop.max && tickValues.indexOf(tickVal) < 0) {\n tickValues.push(tickVal);\n tickVal = Math.round((tickVal + prop.step) * 10000) / 10000;\n }\n\n // return only ticks that are inside the min-max interval\n if (tickValues) {\n return tickValues.filter((tV) => tV >= prop.min && tV <= prop.max);\n }\n\n return [];\n};\n\nexport const countWords = (label) => {\n if (label == null || isEmpty(label)) {\n return 1;\n }\n\n const words = label.split(' ');\n return words.length;\n};\n\n// findLongestWord is also used in plot\nexport const findLongestWord = (label) => {\n let longestWord = (label || '')\n .replace(/<[^>]+>/g, '')\n .split(' ')\n .sort((a, b) => b.length - a.length);\n\n return longestWord[0].length;\n};\n\n// amountToIncreaseWidth is also used in plot\nexport const amountToIncreaseWidth = (longestWord) => {\n if (!longestWord) {\n return 0;\n }\n\n return longestWord * 10;\n};\n\nexport const polygonToArea = (points) => {\n const h = head(points);\n const area = {\n left: h.x,\n top: h.y,\n bottom: h.y,\n right: h.x,\n };\n return tail(points).reduce((a, p) => {\n a.left = Math.min(a.left, p.x);\n a.top = Math.max(a.top, p.y);\n a.bottom = Math.min(a.bottom, p.y);\n a.right = Math.max(a.right, p.x);\n return a;\n }, area);\n};\n\nexport const lineToArea = (from, to) => pointsToArea(from, to);\n\nexport const pointsToArea = (a, b) => {\n invariant(!!a && !!b, 'a or b is undefined');\n const left = Math.min(a.x, b.x);\n const top = Math.max(a.y, b.y);\n const bottom = Math.min(a.y, b.y);\n const right = Math.max(a.x, b.x);\n return { left, top, bottom, right };\n};\n\nexport const getRightestPoints = (points) => {\n const sortedPoints = cloneDeep(points);\n sortedPoints.sort((a, b) => b.x - a.x);\n\n return { a: sortedPoints[0], b: sortedPoints[1] };\n};\n\nexport const getMiddleOfTwoPoints = (a, b) => ({\n x: (a.x + b.x) / 2,\n y: (a.y + b.y) / 2,\n});\n\nexport const roundNumber = (number) => parseFloat(number.toFixed(4));\n\nexport const sameAxes = (p1, p2) =>\n p1 && p2 && (roundNumber(p1.x) === roundNumber(p2.x) || roundNumber(p1.y) === roundNumber(p2.y));\n\nexport const equalPoints = (p1, p2) =>\n p1 &&\n p2 &&\n isEqual(\n {\n x: roundNumber(p1.x),\n y: roundNumber(p1.y),\n },\n {\n x: roundNumber(p2.x),\n y: roundNumber(p2.y),\n },\n );\n\nconst getDistanceBetweenTicks = (axis, size) => {\n const { min, max, step } = axis;\n const nbOfTicks = (max - min) / step;\n\n return size / nbOfTicks;\n};\n\nexport const thinnerShapesNeeded = (graphProps) => {\n const {\n domain,\n range,\n size: { width, height },\n } = graphProps;\n\n // 14 is the default width of a point\n return getDistanceBetweenTicks(domain, width) < 14 || getDistanceBetweenTicks(range, height) < 14;\n};\n\nexport const getAdjustedGraphLimits = (graphProps) => {\n const {\n domain,\n range,\n size: { width, height },\n } = graphProps;\n const domainTicksDistance = getDistanceBetweenTicks(domain, width);\n const rangeTicksDistance = getDistanceBetweenTicks(range, height);\n\n // 15 is the distance required for the arrow to extend the graph\n const domainPadding = domain.step / (domainTicksDistance / 15);\n const rangePadding = range.step / (rangeTicksDistance / 15);\n\n return {\n domain: {\n min: domain.min - domainPadding,\n max: domain.max + domainPadding,\n },\n range: {\n min: range.min - rangePadding,\n max: range.max + rangePadding,\n },\n };\n};\n\nconst sortPoints = (array) => (array || []).sort((a, b) => a.x - b.x || a.y - b.y);\n\n// check colliniarity of 3 points (source: https://www.geeksforgeeks.org/program-check-three-points-collinear/)\nconst checkCollinearity = (a, b, c) => (a.x - b.x) * (c.y - b.y) === (c.x - b.x) * (a.y - b.y);\n\n// 2 lines are overlapping if all 4 points are collinear\nconst isSameLine = (markA, markB) =>\n checkCollinearity(markA.from, markB.from, markB.to) && checkCollinearity(markA.to, markB.from, markB.to);\n\nexport const isDuplicatedMark = (mark, marks, oldMark) => {\n const { type, building } = mark;\n\n if (building) {\n return false;\n }\n\n const filteredMarks = (marks || []).filter((m) => m.type === type && !m.building);\n const index = filteredMarks.findIndex((m) => isEqual(m, oldMark));\n\n if (index !== -1) {\n filteredMarks.splice(index, 1);\n }\n\n const duplicated = filteredMarks.find((m) => {\n if (type === 'line') {\n const { from, to } = mark;\n return (\n (equalPoints(from, m.from) && equalPoints(to, m.to)) ||\n (equalPoints(from, m.to) && equalPoints(to, m.from)) ||\n (type === 'line' && isSameLine(m, mark))\n );\n } else if (type === 'polygon') {\n return isEqual(sortPoints(cloneDeep(mark.points)), sortPoints(cloneDeep(m.points)));\n }\n });\n\n return !!duplicated;\n};\n\nexport const areArraysOfObjectsEqual = (array1, array2) => {\n // Check if both arrays have the same length\n if (array1.length !== array2.length) {\n return false;\n }\n // Iterate through each object in the arrays\n for (let i = 0; i < array1.length; i++) {\n // Get the current objects in both arrays\n const obj1 = array1[i];\n const obj2 = array2[i];\n // Check if the objects have the same number of properties\n if (Object.keys(obj1).length !== Object.keys(obj2).length) {\n return false;\n }\n // Iterate through each property in the objects\n for (const key in obj1) {\n // Check if the properties and their values are equal\n if (obj1[key] !== obj2[key]) {\n return false;\n }\n }\n }\n // If all objects are equal, the arrays are the same\n return true;\n};\n"],"file":"utils.js"}
|
package/package.json
CHANGED
|
@@ -3,7 +3,7 @@
|
|
|
3
3
|
"publishConfig": {
|
|
4
4
|
"access": "public"
|
|
5
5
|
},
|
|
6
|
-
"version": "2.
|
|
6
|
+
"version": "2.22.0",
|
|
7
7
|
"description": "Graphing components",
|
|
8
8
|
"keywords": [
|
|
9
9
|
"react",
|
|
@@ -19,13 +19,13 @@
|
|
|
19
19
|
"@mapbox/point-geometry": "^0.1.0",
|
|
20
20
|
"@material-ui/core": "^3.8.3",
|
|
21
21
|
"@material-ui/icons": "^3.0.2",
|
|
22
|
-
"@pie-lib/drag": "^2.
|
|
23
|
-
"@pie-lib/editable-html": "^11.
|
|
24
|
-
"@pie-lib/graphing-utils": "^1.
|
|
25
|
-
"@pie-lib/plot": "^2.
|
|
26
|
-
"@pie-lib/render-ui": "^4.
|
|
27
|
-
"@pie-lib/tools": "^0.
|
|
28
|
-
"@pie-lib/translator": "^2.
|
|
22
|
+
"@pie-lib/drag": "^2.10.0",
|
|
23
|
+
"@pie-lib/editable-html": "^11.9.0",
|
|
24
|
+
"@pie-lib/graphing-utils": "^1.9.0",
|
|
25
|
+
"@pie-lib/plot": "^2.15.0",
|
|
26
|
+
"@pie-lib/render-ui": "^4.23.0",
|
|
27
|
+
"@pie-lib/tools": "^0.17.0",
|
|
28
|
+
"@pie-lib/translator": "^2.11.0",
|
|
29
29
|
"@vx/axis": "^0.0.189",
|
|
30
30
|
"@vx/clip-path": "^0.0.189",
|
|
31
31
|
"@vx/curve": "^0.0.189",
|
|
@@ -51,6 +51,6 @@
|
|
|
51
51
|
"peerDependencies": {
|
|
52
52
|
"react": "^16.8.1"
|
|
53
53
|
},
|
|
54
|
-
"gitHead": "
|
|
54
|
+
"gitHead": "7ca3b0a214af57d742b4a9de6d8b424d31da1469",
|
|
55
55
|
"scripts": {}
|
|
56
56
|
}
|
|
@@ -9,7 +9,7 @@ import {
|
|
|
9
9
|
filterByValidToolTypes,
|
|
10
10
|
filterByVisibleToolTypes,
|
|
11
11
|
} from '../graph-with-controls';
|
|
12
|
-
import { toolsArr, allTools, line as lineTool } from '
|
|
12
|
+
import { toolsArr, allTools, line as lineTool } from '../tools';
|
|
13
13
|
|
|
14
14
|
const line = {
|
|
15
15
|
type: 'line',
|
|
@@ -4,7 +4,7 @@ import React from 'react';
|
|
|
4
4
|
import { xy } from './utils';
|
|
5
5
|
|
|
6
6
|
import Graph, { removeBuildingToolIfCurrentToolDiffers } from '../graph';
|
|
7
|
-
import { toolsArr } from '
|
|
7
|
+
import { toolsArr } from '../tools';
|
|
8
8
|
|
|
9
9
|
describe('removeBuildingToolIfCurrentToolDiffers', () => {
|
|
10
10
|
let marks = [
|
|
@@ -2,8 +2,8 @@ import { shallow } from 'enzyme';
|
|
|
2
2
|
import React from 'react';
|
|
3
3
|
import { ArrowedLine } from '../component';
|
|
4
4
|
import { graphProps as getGraphProps } from '../../../__tests__/utils';
|
|
5
|
-
jest.mock('@pie-lib/plot
|
|
6
|
-
const a = jest.requireActual('@pie-lib/plot
|
|
5
|
+
jest.mock('@pie-lib/plot', () => {
|
|
6
|
+
const a = jest.requireActual('@pie-lib/plot');
|
|
7
7
|
return {
|
|
8
8
|
types: a.types,
|
|
9
9
|
gridDraggable: a.gridDraggable,
|
|
@@ -14,8 +14,8 @@ jest.mock('../../../../utils', () => {
|
|
|
14
14
|
};
|
|
15
15
|
});
|
|
16
16
|
|
|
17
|
-
jest.mock('@pie-lib/plot
|
|
18
|
-
const { types, utils } = jest.requireActual('@pie-lib/plot
|
|
17
|
+
jest.mock('@pie-lib/plot', () => {
|
|
18
|
+
const { types, utils } = jest.requireActual('@pie-lib/plot');
|
|
19
19
|
return {
|
|
20
20
|
gridDraggable: jest.fn((opts) => (Comp) => Comp),
|
|
21
21
|
types,
|
|
@@ -13,8 +13,8 @@ jest.mock('../../../../utils', () => {
|
|
|
13
13
|
};
|
|
14
14
|
});
|
|
15
15
|
|
|
16
|
-
jest.mock('@pie-lib/plot
|
|
17
|
-
const { types, utils } = jest.requireActual('@pie-lib/plot
|
|
16
|
+
jest.mock('@pie-lib/plot', () => {
|
|
17
|
+
const { types, utils } = jest.requireActual('@pie-lib/plot');
|
|
18
18
|
return {
|
|
19
19
|
gridDraggable: jest.fn((opts) => (Comp) => Comp),
|
|
20
20
|
types,
|