TypeScript array.findLastIndex函数代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› TypeScript›TypeScript教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了TypeScript中core/util/array.findLastIndex函数的典型用法代码示例。如果您正苦于以下问题：TypeScript findLastIndex函数的具体用法？TypeScript findLastIndex怎么用？TypeScript findLastIndex使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。

在下文中一共展示了findLastIndex函数的6个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。

示例1: compute

  compute(x) {
    // Apply the transform to a single value
    let descending;
    this.sort(descending = false);

    if (this.clip === true) {
      if ((x < this._x_sorted[0]) || (x > this._x_sorted[this._x_sorted.length-1])) {
        return null;
      }
    } else {
      if (x < this._x_sorted[0]) {
        return this._y_sorted[0];
      }
      if (x > this._x_sorted[this._x_sorted.length-1]) {
        return this._y_sorted[this._y_sorted.length-1];
      }
    }

    if (x === this._x_sorted[0]) {
      return this._y_sorted[0];
    }

    const ind = findLastIndex(this._x_sorted, num => num < x);

    const x1 = this._x_sorted[ind];
    const x2 = this._x_sorted[ind+1];
    const y1 = this._y_sorted[ind];
    const y2 = this._y_sorted[ind+1];

    const ret = y1 + (((x-x1) / (x2-x1)) * (y2-y1));
    return ret;
  }

开发者ID:FourtekIT-incubator，项目名称:bokeh，代码行数:32，代码来源:linear_interpolator.ts

示例2: compute

  compute(x: number): number {
    this.sort(false)

    if (this.clip) {
      if (x < this._x_sorted[0] || x > this._x_sorted[this._x_sorted.length-1])
        return NaN
    } else {
      if (x < this._x_sorted[0])
        return this._y_sorted[0]
      if (x > this._x_sorted[this._x_sorted.length-1])
        return this._y_sorted[this._y_sorted.length-1]
    }

    let ind: number
    switch (this.mode) {
      case "after": {
        ind = findLastIndex(this._x_sorted, num => x >= num)
        break
      }
      case "before": {
        ind = findIndex(this._x_sorted, num => x <= num)
        break
      }
      case "center": {
        const diffs = this._x_sorted.map((tx) => Math.abs(tx - x))
        const mdiff = min(diffs)
        ind = findIndex(diffs, num => mdiff === num)
        break
      }
      default:
        throw new Error(`unknown mode: ${this.mode}`)
    }

    return ind != -1 ? this._y_sorted[ind] : NaN
  }

开发者ID:Zyell，项目名称:bokeh，代码行数:35，代码来源:step_interpolator.ts

示例3: compute

  compute(x: number): number {
    this.sort(false)

    if (this.clip) {
      if (x < this._x_sorted[0] || x > this._x_sorted[this._x_sorted.length-1])
        return NaN
    } else {
      if (x < this._x_sorted[0])
        return this._y_sorted[0]
      if (x > this._x_sorted[this._x_sorted.length-1])
        return this._y_sorted[this._y_sorted.length-1]
    }

    if (x == this._x_sorted[0])
      return this._y_sorted[0]

    const ind = findLastIndex(this._x_sorted, num => num < x)

    const x1 = this._x_sorted[ind]
    const x2 = this._x_sorted[ind+1]
    const y1 = this._y_sorted[ind]
    const y2 = this._y_sorted[ind+1]

    return y1 + (((x-x1) / (x2-x1)) * (y2-y1))
  }

开发者ID:Zyell，项目名称:bokeh，代码行数:25，代码来源:linear_interpolator.ts

示例4: compute

  compute(x) {
    // Apply the transform to a single value
    let descending, ret;
    this.sort(descending = false);

    if (this.clip === true) {
      if ((x < this._x_sorted[0]) || (x > this._x_sorted[this._x_sorted.length-1])) {
        return(null);
      }
    } else {
      if (x < this._x_sorted[0]) {
        return this._y_sorted[0];
      }
      if (x > this._x_sorted[this._x_sorted.length-1]) {
        return this._y_sorted[this._y_sorted.length-1];
      }
    }

    let ind = -1;
    if (this.mode === "after") {
      ind = findLastIndex(this._x_sorted, num => x >= num);
    }

    if (this.mode === "before") {
      ind = findIndex(this._x_sorted, num => x <= num);
    }

    if (this.mode === "center") {
      const diffs = (this._x_sorted.map((tx) => Math.abs(tx - x)));
      const mdiff = min(diffs);
      ind = findIndex(diffs, num => mdiff === num);
    }

    if (ind !== -1) {
      ret = this._y_sorted[ind];
    } else {
      ret = null;
    }

    return(ret);
  }

开发者ID:FourtekIT-incubator，项目名称:bokeh，代码行数:41，代码来源:step_interpolator.ts

示例5: _build_discontinuous_object

  _build_discontinuous_object(nanned_qs) {
    // _s is @xs, @ys, @sxs, @sys
    // an object of n 1-d arrays in either data or screen units
    //
    // Each 1-d array gets broken to an array of arrays split
    // on any NaNs
    //
    // So:
    // { 0: [x11, x12],
    //   1: [x21, x22, x23],
    //   2: [x31, NaN, x32]
    // }
    // becomes
    // { 0: [[x11, x12]],
    //   1: [[x21, x22, x23]],
    //   2: [[x31],[x32]]
    // }
    const ds = {};
    for (let i = 0, end = nanned_qs.length; i < end; i++) {
      ds[i] = [];
      let qs = copy(nanned_qs[i]);
      while (qs.length > 0) {

        let qs_part;
        const nan_index = findLastIndex(qs, (q) => isStrictNaN(q));

        if (nan_index >= 0) {
          qs_part = qs.splice(nan_index);
        } else {
          qs_part = qs;
          qs = [];
        }

        const denanned = qs_part.filter((q) => !isStrictNaN(q))
        ds[i].push(denanned)
      }
    }
    return ds;
  }

开发者ID:FourtekIT-incubator，项目名称:bokeh，代码行数:39，代码来源:patches.ts

示例6: _build_discontinuous_object

  private _build_discontinuous_object(nanned_qs: number[][]): number[][][] {
    // _s is this.xs, this.ys, this.sxs, this.sys
    // an object of n 1-d arrays in either data or screen units
    //
    // Each 1-d array gets broken to an array of arrays split
    // on any NaNs
    //
    // So:
    // { 0: [x11, x12],
    //   1: [x21, x22, x23],
    //   2: [x31, NaN, x32]
    // }
    // becomes
    // { 0: [[x11, x12]],
    //   1: [[x21, x22, x23]],
    //   2: [[x31],[x32]]
    // }
    const ds: number[][][] = []
    for (let i = 0, end = nanned_qs.length; i < end; i++) {
      ds[i] = []
      let qs = copy(nanned_qs[i])
      while (qs.length > 0) {
        const nan_index = findLastIndex(qs, (q) => isStrictNaN(q))

        let qs_part
        if (nan_index >= 0)
          qs_part = qs.splice(nan_index)
        else {
          qs_part = qs
          qs = []
        }

        const denanned = qs_part.filter((q) => !isStrictNaN(q))
        ds[i].push(denanned)
      }
    }
    return ds
  }

开发者ID:gully，项目名称:bokeh，代码行数:38，代码来源:patches.ts

注：本文中的core/util/array.findLastIndex函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。