Prototaip tatasusunan - Cabaran JavaScript

Anda boleh menemui semua kod dalam siaran ini di repo Github.

---

Cabaran berkaitan prototaip tatasusunan

---

Array.prototype.at()

/**
 * @param {number} index
 * @return {any | undefiend}
 */

Array.prototype.myAt = function (index) {
  const len = this.length;

  if (index = len) {
    return;
  }

  return this[(index + len) % len];
};

// Usage example
console.log([1, 2, 3, 4].myAt(2)); // => 3
console.log([1, 2, 3, 4].myAt(-1)); // => 4
console.log([1, 2, 3, 4].myAt(5)); // => undefined

---

Array.prototype.concat()

/**
 * @template T
 * @param {...(T | Array<t>)} itemes
 * @return {Array<t>}
 */

Array.prototype.myConcat = function (...items) {
  const newArray = [...this];

  for (const item of items) {
    if (Array.isArray(item)) {
      newArray.push(...item);
    } else {
      newArray.push(item);
    }
  }

  return newArray;
};

// Usage example
console.log([1, 2, 3].myConcat([])); // => [1, 2, 3];
console.log([1, 2, 3].myConcat([4, 5, 6, [2]])); // => [1, 2, 3, 4, 5, 6, [2]];
</t></t>

---

Array.prototype.every()

/**
 * @template T
 * @param { (value: T, index: number, array: Array<t>) => boolean } callbackFn
 * @param {any} [thisArg]
 * @return {boolean}
 */

Array.prototype.myEvery = function (callbackFn, thisArg) {
  const len = this.length;
  let flag = true;

  for (let i = 0; i  item > 2)); // => false
console.log([1, 2, 3].myEvery((item) => item > 0)); // => true
</t>

---

Array.prototype.filter()

/**
 * @template T, U
 * @param { (value: T, index: number, array: Array<t>) => boolean } callbackFn
 * @param { any } [thisArg]
 * @return {Array<t>}
 */

Array.prototype.myFilter = function (callbackFn, thisArg) {
  const newArray = [];

  for (let i = 0; i  value % 2 == 0)); // => [2, 4]
console.log([1, 2, 3, 4].myFilter((value) => value  [1, 2]
</t></t>

---

Array.prototype.flat()

/**
 * @param { Array } arr
 * @param { number } depth
 * @returns { Array }
 */

function flatten(arr, depth = 1) {
  const newArray = [];

  for (let i = 0; i  word.length > 6);

console.log(result); // => ["exuberant", "destruction", "present"]

---

Array.prototype.forEach()

/**
 * @template T, U
 * @param { (value: T, index: number, array: Array<t>) => U } callbackFn
 * @param {any} [thisArg]
 * @return {Array<u>}
 */

Array.prototype.myForEach = function (callbackFn, thisArg) {
  if (this == null) {
    throw new TypeError("this is null or not defined");
  }

  if (typeof callbackFn !== "function") {
    throw new TypeError(callbackFn + " is not a function");
  }

  const O = Object(this);
  // Zero-fill Right Shift to ensure that the result if always non-negative.
  const len = O.length >>> 0;

  for (let i = 0; i  el * el),
  null
); // => [1, 4, 9];
</u></t>

---

Array.prototype.indexOf()

/**
 * @param {any} searchElement
 * @param {number} fromIndex 
 * @return {number}
 */

Array.prototype.myIndexOf = function (searchElement, fromIndex = 0) {
  const len = this.length;

  if (fromIndex  2
console.log([1, 2, 3, 4, 5].myIndexOf(6)); // => -1
console.log([1, 2, 3, 4, 5].myIndexOf(1)); // => 0
console.log(['a', 'b', 'c'].myIndexOf('b')); // => 1
console.log([NaN].myIndexOf(NaN)); // => -1 (since NaN !== NaN)

---

Array.prototype.last()

/**
 * @return {null|boolean|number|string|Array|Object}
 */

Array.prototype.myLast = function () {
  return this.length ? this.at(-1) : -1;
};

// Usage example
console.log([].myLast()); // => -1;
console.log([1].myLast()); // => 1
console.log([1, 2].myLast()); // => 2

---

Array.prototype.map()

/**
 * @template T, U
 * @param { (value: T, index: number, array: Array<t>) => U } callbackFn
 * @param {any} [thisArg]
 * @return {Array<u>}
 */

Array.prototype.myMap = function (callbackFn, thisArg) {
  const len = this.length;
  const newArray = Array.from({ length: len });

  for (let i = 0; i  i)); // => [1, 2, 3, 4]
console.log([1, 2, 3, 4].myMap((i) => i * i)); // => [1, 4, 9, 16])
</u></t>

---

Array.prototype.reduce()

/**
 * @template T, U
 * @param { (previousValue: U, currentValue: T, currentIndex: number, array: Array<t>) => U } callbackFn
 * @param {U} [initialValue]
 * @return {U}
 */

Array.prototype.myReduce = function (callbackFn, initialValue) {
  const hasInitialValue = initialValue !== undefined;
  const len = this.length;

  if (!hasInitialValue && !len) {
    throw new Error("Reduce of empty array with no initial value");
  }

  let accumulator = hasInitialValue ? initialValue : this[0];
  let startingIndex = hasInitialValue ? 0 : 1;

  for (let i = startingIndex; i  acc + num, 0);
console.log(sum); // => 15
const products = numbers.myReduce((acc, num) => acc * num, 1);
</t>

---

Array.prototype.some()

/**
 * @template T
 * @param { (value: T, index: number, array: Array<t>) => boolean } callbackFn
 * @param {any} [thisArg]
 * @return {boolean}
 */

Array.prototype.mySome = function (callbackFn, thisArg) {
  const len = this.length;
  let flag = false;

  for (let i = 0; i  item > 2)); // => true
console.log([1, 2, 3].mySome((item) => item  false
</t>

---

Array.prototype.square()

/**
 * @return {Array<number>}
 */

Array.prototype.mySquare = function () {
  const len = this.length;
  const newArray = Array.from({ length: len });

  for (let i = 0; i  [1, 4, 9];
console.log([].mySquare()); // => [];
</number>

---

Rujukan

• GreatFrontEnd
• Array.prototype.at() - MDN
• Array.prototype.concat() - MDN
• Array.prototype.every() - MDN
• Array.prototype.filter() - MDN
• Array.prototype.flat() - MDN
• Array.prototype.forEach() - MDN
• Array.prototype.indexOf() - MDN
• Array.prototype.map() - MDN
• Array.prototype.reduce() - MDN
• Array.prototype.some() - MDN
• 2635. Gunakan Transform Over Setiap Elemen dalam Array - LeetCode
• 2634. Tapis Elemen daripada Tatasusunan - LeetCode
• 2626. Susunan Mengurangkan Transformasi - LeetCode
• 2619. Prototaip Array Terakhir - LeetCode
• 2625. Ratakan Susunan Bersarang Dalam - LeetCode
• 3. laksanakan Array.prototype.flat() - BFE.dev
• 151. laksanakan Array.prototype.map() - BFE.dev
• 146. laksanakan Array.prototype.reduce() - BFE.dev

Atas ialah kandungan terperinci Prototaip tatasusunan - Cabaran JavaScript. Untuk maklumat lanjut, sila ikut artikel berkaitan lain di laman web China PHP!