PHP Classes

File: public/js/lib/vue/src/filters/array-filters.js

Recommend this page to a friend!
  Classes of Sergey Beskorovayniy   Silex MVC Blog   public/js/lib/vue/src/filters/array-filters.js   Download  
File: public/js/lib/vue/src/filters/array-filters.js
Role: Auxiliary data
Content type: text/plain
Description: Auxiliary data
Class: Silex MVC Blog
MVC based blog using on the Silex micro-framework
Author: By
Last change:
Date: 8 years ago
Size: 3,629 bytes
 

Contents

Class file image Download
import { getPath } from '../parsers/path' import vFor from '../directives/public/for' import { toArray, toNumber, isArray, isObject, isPlainObject } from '../util/index' const convertArray = vFor._postProcess /** * Limit filter for arrays * * @param {Number} n * @param {Number} offset (Decimal expected) */ export function limitBy (arr, n, offset) { offset = offset ? parseInt(offset, 10) : 0 n = toNumber(n) return typeof n === 'number' ? arr.slice(offset, offset + n) : arr } /** * Filter filter for arrays * * @param {String} search * @param {String} [delimiter] * @param {String} ...dataKeys */ export function filterBy (arr, search, delimiter) { arr = convertArray(arr) if (search == null) { return arr } if (typeof search === 'function') { return arr.filter(search) } // cast to lowercase string search = ('' + search).toLowerCase() // allow optional `in` delimiter // because why not var n = delimiter === 'in' ? 3 : 2 // extract and flatten keys var keys = Array.prototype.concat.apply([], toArray(arguments, n)) var res = [] var item, key, val, j for (var i = 0, l = arr.length; i < l; i++) { item = arr[i] val = (item && item.$value) || item j = keys.length if (j) { while (j--) { key = keys[j] if ((key === '$key' && contains(item.$key, search)) || contains(getPath(val, key), search)) { res.push(item) break } } } else if (contains(item, search)) { res.push(item) } } return res } /** * Filter filter for arrays * * @param {String|Array<String>|Function} ...sortKeys * @param {Number} [order] */ export function orderBy (arr) { let comparator = null let sortKeys arr = convertArray(arr) // determine order (last argument) let args = toArray(arguments, 1) let order = args[args.length - 1] if (typeof order === 'number') { order = order < 0 ? -1 : 1 args = args.length > 1 ? args.slice(0, -1) : args } else { order = 1 } // determine sortKeys & comparator const firstArg = args[0] if (!firstArg) { return arr } else if (typeof firstArg === 'function') { // custom comparator comparator = function (a, b) { return firstArg(a, b) * order } } else { // string keys. flatten first sortKeys = Array.prototype.concat.apply([], args) comparator = function (a, b, i) { i = i || 0 return i >= sortKeys.length - 1 ? baseCompare(a, b, i) : baseCompare(a, b, i) || comparator(a, b, i + 1) } } function baseCompare (a, b, sortKeyIndex) { const sortKey = sortKeys[sortKeyIndex] if (sortKey) { if (sortKey !== '$key') { if (isObject(a) && '$value' in a) a = a.$value if (isObject(b) && '$value' in b) b = b.$value } a = isObject(a) ? getPath(a, sortKey) : a b = isObject(b) ? getPath(b, sortKey) : b } return a === b ? 0 : a > b ? order : -order } // sort on a copy to avoid mutating original array return arr.slice().sort(comparator) } /** * String contain helper * * @param {*} val * @param {String} search */ function contains (val, search) { var i if (isPlainObject(val)) { var keys = Object.keys(val) i = keys.length while (i--) { if (contains(val[keys[i]], search)) { return true } } } else if (isArray(val)) { i = val.length while (i--) { if (contains(val[i], search)) { return true } } } else if (val != null) { return val.toString().toLowerCase().indexOf(search) > -1 } }