Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 16x 6x 70x 2023x 70x 975x 962x 954x 7x 70x 43x 41x 6x 3x 975x 51x | /*
* Copyright (C) 2010 - 2025 VREM Software Development <VREMSoftwareDevelopment@gmail.com>
*
* Licensed 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.
*
* Bandwidth Monitor
*/
const isAscending = (orderBy, property, ascending) => (orderBy === property ? !ascending : false);
const comparator = (isAscending, orderBy) => {
const isSafeKey = (key, obj) =>
typeof key === 'string' && /^[a-zA-Z0-9_$]+$/.test(key) && Object.prototype.hasOwnProperty.call(obj, key);
const ascending = (a, b, orderBy) => {
if (!isSafeKey(orderBy, a) || !isSafeKey(orderBy, b)) return 0;
if (a[orderBy] < b[orderBy]) return -1;
if (a[orderBy] > b[orderBy]) return 1;
return 0;
};
const descending = (a, b, orderBy) => {
if (!isSafeKey(orderBy, a) || !isSafeKey(orderBy, b)) return 0;
if (a[orderBy] > b[orderBy]) return -1;
if (a[orderBy] < b[orderBy]) return 1;
return 0;
};
return isAscending ? (a, b) => ascending(a, b, orderBy) : (a, b) => descending(a, b, orderBy);
};
const sort = (values, comparator) => [...values].sort(comparator);
export { comparator, isAscending, sort };
|