Julia's searchsortedfirst in TypeScript

How to use

Install via yarn add locutus and import: import { searchsortedfirst } from 'locutus/julia/Base/searchsortedfirst'.

Or with CommonJS: const { searchsortedfirst } = require('locutus/julia/Base/searchsortedfirst')

Use a bundler that supports tree-shaking so you only ship the functions you actually use. Vite, webpack, Rollup, and Parcel all handle this. For server-side use this is less of a concern.

Examples

These examples are extracted from test cases that automatically verify our functions against their native counterparts.

#	code	expected result
1	searchsortedfirst([1, 3, 5, 7], 4)	3
2	searchsortedfirst([1, 3, 5, 7], 0)	1
3	searchsortedfirst([1, 3, 5, 7], 9)	5

Notes

• Returns 1-based insertion index in a sorted array, like Julia searchsortedfirst.

Here's what our current TypeScript equivalent to Julia's searchsortedfirst looks like.

TSTypeScript JSJavaScript TSStandalone TS JSStandalone JS

Copy code

export function searchsortedfirst(values: number[] | unknown, target: number): number {
  //      discuss at: https://locutus.io/julia/searchsortedfirst/
  // parity verified: Julia 1.11
  //     original by: Kevin van Zonneveld (https://kvz.io)
  //          note 1: Returns 1-based insertion index in a sorted array, like Julia searchsortedfirst.
  //       example 1: searchsortedfirst([1, 3, 5, 7], 4)
  //       returns 1: 3
  //       example 2: searchsortedfirst([1, 3, 5, 7], 0)
  //       returns 2: 1
  //       example 3: searchsortedfirst([1, 3, 5, 7], 9)
  //       returns 3: 5

  if (!Array.isArray(values)) {
    return 1
  }

  let low = 0
  let high = values.length
  const needle = Number(target)

  while (low < high) {
    const mid = Math.floor((low + high) / 2)
    const value = Number(values[mid])
    if (value < needle) {
      low = mid + 1
    } else {
      high = mid
    }
  }

  return low + 1
}

export function searchsortedfirst(values, target) {
  //      discuss at: https://locutus.io/julia/searchsortedfirst/
  // parity verified: Julia 1.11
  //     original by: Kevin van Zonneveld (https://kvz.io)
  //          note 1: Returns 1-based insertion index in a sorted array, like Julia searchsortedfirst.
  //       example 1: searchsortedfirst([1, 3, 5, 7], 4)
  //       returns 1: 3
  //       example 2: searchsortedfirst([1, 3, 5, 7], 0)
  //       returns 2: 1
  //       example 3: searchsortedfirst([1, 3, 5, 7], 9)
  //       returns 3: 5

  if (!Array.isArray(values)) {
    return 1
  }

  let low = 0
  let high = values.length
  const needle = Number(target)

  while (low < high) {
    const mid = Math.floor((low + high) / 2)
    const value = Number(values[mid])
    if (value < needle) {
      low = mid + 1
    } else {
      high = mid
    }
  }

  return low + 1
}

Improve this function

Locutus is a community effort following The McDonald's Theory: we ship first iterations, hoping others will improve them. If you see something that could be better, we'd love your contribution.

View on GitHub · Edit on GitHub · View Raw

---

We have 11 Julia functions so far - help us add more

Got a rainy Sunday afternoon and a taste for a porting puzzle?

• Get inspiration from the Julia documentation.
• Click "New file" in the appropriate folder on GitHub. This will fork the project to your account, directly add the file to it, and send a Pull Request to us.

We will then review it. If it's useful to the project and in line with our contributing guidelines your work will become part of Locutus and you'll be automatically credited in the authors section accordingly.

« More Julia Base functions

Star