大网数据广告活动
Web 标准与前端开发

TypedArray.prototype.findLast()

· 52CE 我爱测

The **`findLast()`** method of TypedArray instances iterates the typed array in reverse order and returns the value of the first element that satisfies the provided testing function. If no elements satisfy the testing function, undefined is returned. This method has the same algo

The findLast() method of TypedArray instances iterates the typed array in reverse order and returns the value of the first element that satisfies the provided testing function. If no elements satisfy the testing function, undefined is returned. This method has the same algorithm as Array.prototype.findLast().

JavaScript Demo: TypedArray.prototype.findLast()

function isNegative(element /*, index, array */) {
  return element < 0;
}

const int8 = new Int8Array([10, 0, -10, 20, -30, 40, 50]);

console.log(int8.findLast(isNegative));
// Expected output: -30

Syntax

findLast(callbackFn)
findLast(callbackFn, thisArg)

Parameters

  • callbackFn
    • : A function to execute for each element in the typed array. It should return a truthy value to indicate a matching element has been found, and a falsy value otherwise. The function is called with the following arguments:
      • element
        • : The current element being processed in the typed array.
      • index
        • : The index of the current element being processed in the typed array.
      • array
        • : The typed array findLast() was called upon.
  • thisArg

Return value

The last (highest-index) element in the typed array that satisfies the provided testing function; undefined if no matching element is found.

Description

See Array.prototype.findLast() for more details. This method is not generic and can only be called on typed array instances.

Examples

Find the last prime number in a typed array

The following example returns the last element in the typed array that is a prime number, or undefined if there is no prime number.

function isPrime(n) {
  if (n < 2) {
    return false;
  }
  if (n % 2 === 0) {
    return n === 2;
  }
  for (let factor = 3; factor * factor <= n; factor += 2) {
    if (n % factor === 0) {
      return false;
    }
  }
  return true;
}

let uint8 = new Uint8Array([4, 6, 8, 12]);
console.log(uint8.findLast(isPrime)); // undefined (no primes in array)
uint8 = new Uint8Array([4, 5, 7, 8, 9, 11, 12]);
console.log(uint8.findLast(isPrime)); // 11

[!NOTE] The isPrime() implementation is for demonstration only. For a real-world application, you would want to use a heavily Memoization algorithm such as the Sieve of Eratosthenes to avoid repeated calculations.

Specifications

Browser compatibility

See also

来源:MDN Web Docs / Mozilla 贡献者 · 作者与贡献记录 · CC BY-SA 2.5。离线整理了版式、链接和媒体显示。

资料来源与适用范围

资料来源
MDN Web Docs / Mozilla 贡献者
适用范围
请按文中版本与环境说明核对
内容语言
中文;命令、路径和错误标识保留技术原文
本地收录日期
2026-11-15
授权说明
CC BY-SA 2.5

正文与所需资源由本站本地存储。查看来源及更新记录 ↗

请按适用版本和实际日志确认原因;本站没有对每一种系统或设备逐项执行文中的操作。