Zabbix

/*

** Zabbix

** Copyright (C) 2001-2022 Zabbix SIA

**

** This program is free software; you can redistribute it and/or modify

** it under the terms of the GNU General Public License as published by

** the Free Software Foundation; either version 2 of the License, or

** (at your option) any later version.

**

** This program is distributed in the hope that it will be useful,

** but WITHOUT ANY WARRANTY; without even the implied warranty of

** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

** GNU General Public License for more details.

**

** You should have received a copy of the GNU General Public License

** along with this program; if not, write to the Free Software

** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.

**/

​

​

// Global constants.

​

// Sync with SASS variable: $ui-transition-duration.

const UI_TRANSITION_DURATION = 300;

​

const PROFILE_TYPE_INT = 2;

const PROFILE_TYPE_STR = 3;

​

// Array indexOf method for javascript<1.6 compatibility

if (!Array.prototype.indexOf) {

    Array.prototype.indexOf = function (searchElement) {

        if (this === void 0 || this === null) {

            throw new TypeError();

        }

        var t = Object(this);

        var len = t.length >>> 0;

        if (len === 0) {

            return -1;

        }

        var n = 0;

        if (arguments.length > 0) {

            n = Number(arguments[1]);

            if (n !== n) { // shortcut for verifying if it's NaN

                n = 0;

            }

            else if (n !== 0 && n !== (1 / 0) && n !== -(1 / 0)) {

                n = (n > 0 || -1) * Math.floor(Math.abs(n));

            }

        }

        if (n >= len) {

            return -1;

        }

        var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);

        for (; k < len; k++) {

            if (k in t && t[k] === searchElement) {

                return k;

            }

        }

        return -1;

    }

}

​

/*