holllop

console.log(typeof settings);
console.log(typeof flag);

Нужно ли обычную форму обратной связи лендинга защищать от спам-ботов?

Если да, что можете посоветовать?

// for (let i = 0; i = expenses_without_first.length; i += 8) {
for (let i = 0; i < expenses_without_first.length; i += 8) {

work_id_array[i / 8]

10.1.11.1 OrdinaryOwnPropertyKeys ( O )
The abstract operation OrdinaryOwnPropertyKeys takes argument O (an Object) and returns a List of property keys. It performs the following steps when called:
1. Let keys be a new empty List.
2. For each own property key P of O such that P is an array index, in ascending numeric index order, do
a. Append P to keys.
3. For each own property key P of O such that P is a String and P is not an array index, in ascending chronological order of property creation, do
a. Append P to keys.
4. For each own property key P of O such that P is a Symbol, in ascending chronological order of property creation, do
a. Append P to keys.
5. 5. Return keys.

function getAvarageAge(arr) {
    return arr.reduce((sum, item) => sum + item.age, 0) / arr.length;
}

let vasya = { name: 'Вася', age: 25 };
let petya = { name: 'Петя', age: 30 };
let masha = { name: 'Маша', age: 29 };

let arr = [vasya, petya, masha];

console.log(getAvarageAge(arr)); // 28

const data = [ /* ... */ ];
let offset = 0;
while (offset < data.length) {
	data[offset + 0];
	data[offset + 1];
	// ...
	data[offset + 7];
	offset += 8
}

// есть вариант применить рекурсию
const flatTree = (tree, childrenKey) =>
  (tree instanceof Array ? tree : []).reduce((acc, n) => (
    acc.push(n, ...flatTree(n[childrenKey], childrenKey)),
    acc
  ), []);

// а можно обойтись и без неё
const flatTree = function*(tree, childrenKey) {
  const stack = [];

  for (let [ i, arr ] = this(tree); ++i < arr.length || stack.length;) {
    if (i === arr.length) {
      [ i, arr ] = stack.pop();
    } else {
      yield arr[i];
      stack.push([ i, arr ]);
      [ i, arr ] = this(arr[i][childrenKey]);
    }
  }
}.bind(x => [ -1, Array.isArray(x) ? x : [] ]);

computed: {
  users() {
    // если использовать обычную функцию
    return flatTree(this.elements, 'children');

    // или, генератор
    return [...flatTree(this.elements, 'children')];
  },
},

<option v-for="n in users" :key="n.id">{{ n.name }}</option>