inviton-powerduck 0.0.218 → 0.0.220

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.
Files changed (11) hide show
  1. package/common/css/ladda-themeless-zoomin.min.css +89 -89
  2. package/common/validation.ts +29 -2
  3. package/components/chart-js/thirdparty/flot/jquery.flot.categories.min.js +93 -93
  4. package/components/chart-js/thirdparty/flot/jquery.flot.crosshair.min.js +83 -83
  5. package/components/chart-js/thirdparty/flot/jquery.flot.navigate.min.js +270 -270
  6. package/components/chart-js/thirdparty/flot/jquery.flot.pie.min.js +507 -507
  7. package/components/chart-js/thirdparty/flot/jquery.flot.stack.min.js +104 -104
  8. package/components/dropdown/ts/select2-multi-checkboxes.ts +29 -5
  9. package/components/image-crop/vendor/jquery.Jcrop.min.css +344 -344
  10. package/components/svg/skilift-svg.tsx +6 -6
  11. package/package.json +1 -1
package/components/chart-js/thirdparty/flot/jquery.flot.stack.min.js CHANGED
@@ -1,104 +1,104 @@
1
- /* Javascript plotting library for jQuery, version 0.8.3.
2
-
3
- Copyright (c) 2007-2014 IOLA and Ole Laursen.
4
- Licensed under the MIT license.
5
-
6
- */
7
- (function ($) {
8
- var options = { series: { stack: null } };
9
- function init(plot) {
10
- function findMatchingSeries(s, allseries) {
11
- var res = null;
12
- for (var i = 0; i < allseries.length; ++i) {
13
- if (s == allseries[i]) break;
14
- if (allseries[i].stack == s.stack) res = allseries[i];
15
- }
16
- return res;
17
- }
18
- function stackData(plot, s, datapoints) {
19
- if (s.stack == null || s.stack === false) return;
20
- var other = findMatchingSeries(s, plot.getData());
21
- if (!other) return;
22
- var ps = datapoints.pointsize,
23
- points = datapoints.points,
24
- otherps = other.datapoints.pointsize,
25
- otherpoints = other.datapoints.points,
26
- newpoints = [],
27
- px,
28
- py,
29
- intery,
30
- qx,
31
- qy,
32
- bottom,
33
- withlines = s.lines.show,
34
- horizontal = s.bars.horizontal,
35
- withbottom = ps > 2 && (horizontal ? datapoints.format[2].x : datapoints.format[2].y),
36
- withsteps = withlines && s.lines.steps,
37
- fromgap = true,
38
- keyOffset = horizontal ? 1 : 0,
39
- accumulateOffset = horizontal ? 0 : 1,
40
- i = 0,
41
- j = 0,
42
- l,
43
- m;
44
- while (true) {
45
- if (i >= points.length) break;
46
- l = newpoints.length;
47
- if (points[i] == null) {
48
- for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
49
- i += ps;
50
- } else if (j >= otherpoints.length) {
51
- if (!withlines) {
52
- for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
53
- }
54
- i += ps;
55
- } else if (otherpoints[j] == null) {
56
- for (m = 0; m < ps; ++m) newpoints.push(null);
57
- fromgap = true;
58
- j += otherps;
59
- } else {
60
- px = points[i + keyOffset];
61
- py = points[i + accumulateOffset];
62
- qx = otherpoints[j + keyOffset];
63
- qy = otherpoints[j + accumulateOffset];
64
- bottom = 0;
65
- if (px == qx) {
66
- for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
67
- newpoints[l + accumulateOffset] += qy;
68
- bottom = qy;
69
- i += ps;
70
- j += otherps;
71
- } else if (px > qx) {
72
- if (withlines && i > 0 && points[i - ps] != null) {
73
- intery = py + ((points[i - ps + accumulateOffset] - py) * (qx - px)) / (points[i - ps + keyOffset] - px);
74
- newpoints.push(qx);
75
- newpoints.push(intery + qy);
76
- for (m = 2; m < ps; ++m) newpoints.push(points[i + m]);
77
- bottom = qy;
78
- }
79
- j += otherps;
80
- } else {
81
- if (fromgap && withlines) {
82
- i += ps;
83
- continue;
84
- }
85
- for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
86
- if (withlines && j > 0 && otherpoints[j - otherps] != null)
87
- bottom = qy + ((otherpoints[j - otherps + accumulateOffset] - qy) * (px - qx)) / (otherpoints[j - otherps + keyOffset] - qx);
88
- newpoints[l + accumulateOffset] += bottom;
89
- i += ps;
90
- }
91
- fromgap = false;
92
- if (l != newpoints.length && withbottom) newpoints[l + 2] += bottom;
93
- }
94
- if (withsteps && l != newpoints.length && l > 0 && newpoints[l] != null && newpoints[l] != newpoints[l - ps] && newpoints[l + 1] != newpoints[l - ps + 1]) {
95
- for (m = 0; m < ps; ++m) newpoints[l + ps + m] = newpoints[l + m];
96
- newpoints[l + 1] = newpoints[l - ps + 1];
97
- }
98
- }
99
- datapoints.points = newpoints;
100
- }
101
- plot.hooks.processDatapoints.push(stackData);
102
- }
103
- $.plot.plugins.push({ init: init, options: options, name: "stack", version: "1.2" });
104
- })(jQuery);
1
+ /* Javascript plotting library for jQuery, version 0.8.3.
2
+
3
+ Copyright (c) 2007-2014 IOLA and Ole Laursen.
4
+ Licensed under the MIT license.
5
+
6
+ */
7
+ (function ($) {
8
+ var options = { series: { stack: null } };
9
+ function init(plot) {
10
+ function findMatchingSeries(s, allseries) {
11
+ var res = null;
12
+ for (var i = 0; i < allseries.length; ++i) {
13
+ if (s == allseries[i]) break;
14
+ if (allseries[i].stack == s.stack) res = allseries[i];
15
+ }
16
+ return res;
17
+ }
18
+ function stackData(plot, s, datapoints) {
19
+ if (s.stack == null || s.stack === false) return;
20
+ var other = findMatchingSeries(s, plot.getData());
21
+ if (!other) return;
22
+ var ps = datapoints.pointsize,
23
+ points = datapoints.points,
24
+ otherps = other.datapoints.pointsize,
25
+ otherpoints = other.datapoints.points,
26
+ newpoints = [],
27
+ px,
28
+ py,
29
+ intery,
30
+ qx,
31
+ qy,
32
+ bottom,
33
+ withlines = s.lines.show,
34
+ horizontal = s.bars.horizontal,
35
+ withbottom = ps > 2 && (horizontal ? datapoints.format[2].x : datapoints.format[2].y),
36
+ withsteps = withlines && s.lines.steps,
37
+ fromgap = true,
38
+ keyOffset = horizontal ? 1 : 0,
39
+ accumulateOffset = horizontal ? 0 : 1,
40
+ i = 0,
41
+ j = 0,
42
+ l,
43
+ m;
44
+ while (true) {
45
+ if (i >= points.length) break;
46
+ l = newpoints.length;
47
+ if (points[i] == null) {
48
+ for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
49
+ i += ps;
50
+ } else if (j >= otherpoints.length) {
51
+ if (!withlines) {
52
+ for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
53
+ }
54
+ i += ps;
55
+ } else if (otherpoints[j] == null) {
56
+ for (m = 0; m < ps; ++m) newpoints.push(null);
57
+ fromgap = true;
58
+ j += otherps;
59
+ } else {
60
+ px = points[i + keyOffset];
61
+ py = points[i + accumulateOffset];
62
+ qx = otherpoints[j + keyOffset];
63
+ qy = otherpoints[j + accumulateOffset];
64
+ bottom = 0;
65
+ if (px == qx) {
66
+ for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
67
+ newpoints[l + accumulateOffset] += qy;
68
+ bottom = qy;
69
+ i += ps;
70
+ j += otherps;
71
+ } else if (px > qx) {
72
+ if (withlines && i > 0 && points[i - ps] != null) {
73
+ intery = py + ((points[i - ps + accumulateOffset] - py) * (qx - px)) / (points[i - ps + keyOffset] - px);
74
+ newpoints.push(qx);
75
+ newpoints.push(intery + qy);
76
+ for (m = 2; m < ps; ++m) newpoints.push(points[i + m]);
77
+ bottom = qy;
78
+ }
79
+ j += otherps;
80
+ } else {
81
+ if (fromgap && withlines) {
82
+ i += ps;
83
+ continue;
84
+ }
85
+ for (m = 0; m < ps; ++m) newpoints.push(points[i + m]);
86
+ if (withlines && j > 0 && otherpoints[j - otherps] != null)
87
+ bottom = qy + ((otherpoints[j - otherps + accumulateOffset] - qy) * (px - qx)) / (otherpoints[j - otherps + keyOffset] - qx);
88
+ newpoints[l + accumulateOffset] += bottom;
89
+ i += ps;
90
+ }
91
+ fromgap = false;
92
+ if (l != newpoints.length && withbottom) newpoints[l + 2] += bottom;
93
+ }
94
+ if (withsteps && l != newpoints.length && l > 0 && newpoints[l] != null && newpoints[l] != newpoints[l - ps] && newpoints[l + 1] != newpoints[l - ps + 1]) {
95
+ for (m = 0; m < ps; ++m) newpoints[l + ps + m] = newpoints[l + m];
96
+ newpoints[l + 1] = newpoints[l - ps + 1];
97
+ }
98
+ }
99
+ datapoints.points = newpoints;
100
+ }
101
+ plot.hooks.processDatapoints.push(stackData);
102
+ }
103
+ $.plot.plugins.push({ init: init, options: options, name: "stack", version: "1.2" });
104
+ })(jQuery);
package/components/dropdown/ts/select2-multi-checkboxes.ts CHANGED
@@ -109,7 +109,8 @@ import { PortalUtils } from '../../../common/utils/utils';
109
109
  return stripDiacritics(text).toUpperCase();
110
110
  };
111
111
 
112
- let data = self.currentData || [];
112
+ let data = self.currentData || [] ;
113
+
113
114
  const searchTerm = normalizeForSearch(params.data?.term?.trim());
114
115
 
115
116
  if (searchTerm == null || searchTerm.trim() == '') {
@@ -117,10 +118,33 @@ import { PortalUtils } from '../../../common/utils/utils';
117
118
  return;
118
119
  }
119
120
 
120
- const filteredData = data.filter(item => {
121
- const itemText = normalizeForSearch(item.text);
122
- return itemText.includes(searchTerm);
123
- });
121
+ const filterItems = (items: any[], searchTerm: string): any[] => {
122
+ return items
123
+ .map(item => {
124
+ const itemText = normalizeForSearch(item.text);
125
+
126
+ // If item has children, filter them recursively
127
+ if (item.children && item.children.length > 0) {
128
+ const filteredChildren = filterItems(item.children, searchTerm);
129
+
130
+ // Keep parent if it matches OR if any child matches
131
+ if (itemText.includes(searchTerm) || filteredChildren.length > 0) {
132
+ return {
133
+ ...item,
134
+ children: filteredChildren
135
+ };
136
+ }
137
+ return null;
138
+ } else {
139
+ // Leaf node: keep if it matches
140
+ return itemText.includes(searchTerm) ? item : null;
141
+ }
142
+ })
143
+ .filter(Boolean); // remove nulls
144
+ };
145
+
146
+
147
+ const filteredData = filterItems(data, searchTerm);
124
148
 
125
149
  success({ results: filteredData || [] });
126
150
  // success({ results: data || [] });