From 02764991dcec7176024e593ed37a894393bcf302 Mon Sep 17 00:00:00 2001
From: Andrey Sitnik <andrey@sitnik.ru>
Date: Sat, 1 Apr 2023 13:42:47 +0200
Subject: [PATCH] Remove React Native true-async

---
 async/index.native.js | 55 -------------------------------------------
 package.json          | 14 +----------
 2 files changed, 1 insertion(+), 68 deletions(-)
 delete mode 100644 async/index.native.js

diff --git a/async/index.native.js b/async/index.native.js
deleted file mode 100644
index 92814673..00000000
--- a/async/index.native.js
+++ /dev/null
@@ -1,55 +0,0 @@
-import { getRandomBytesAsync } from 'expo-crypto'
-
-import { urlAlphabet } from '../url-alphabet/index.js'
-
-export let random = getRandomBytesAsync
-
-export function customAlphabet(alphabet, defaultSize = 21) {
-  // First, a bitmask is necessary to generate the ID. The bitmask makes bytes
-  // values closer to the alphabet size. The bitmask calculates the closest
-  // `2^31 - 1` number, which exceeds the alphabet size.
-  // For example, the bitmask for the alphabet size 30 is 31 (00011111).
-  let mask = (2 << (31 - Math.clz32((alphabet.length - 1) | 1))) - 1
-  // Though, the bitmask solution is not perfect since the bytes exceeding
-  // the alphabet size are refused. Therefore, to reliably generate the ID,
-  // the random bytes redundancy has to be satisfied.
-
-  // Note: every hardware random generator call is performance expensive,
-  // because the system call for entropy collection takes a lot of time.
-  // So, to avoid additional system calls, extra bytes are requested in advance.
-
-  // Next, a step determines how many random bytes to generate.
-  // The number of random bytes gets decided upon the ID size, mask,
-  // alphabet size, and magic number 1.6 (using 1.6 peaks at performance
-  // according to benchmarks).
-  let step = Math.ceil((1.6 * mask * defaultSize) / alphabet.length)
-
-  async function tick(id, size = defaultSize) {
-    let bytes = await random(step)
-    // A compact alternative for `for (var i = 0; i < step; i++)`.
-    let i = step
-    while (i--) {
-      // Adding `|| ''` refuses a random byte that exceeds the alphabet size.
-      id += alphabet[bytes[i] & mask] || ''
-      if (id.length === size) return id
-    }
-    return tick(id, size)
-  }
-
-  return size => tick('', size)
-}
-
-export async function nanoid(size = 21) {
-  let bytes = await random(size)
-  let id = ''
-  // A compact alternative for `for (var i = 0; i < step; i++)`.
-  while (size--) {
-    // It is incorrect to use bytes exceeding the alphabet size.
-    // The following mask reduces the random byte in the 0-255 value
-    // range to the 0-63 value range. Therefore, adding hacks, such
-    // as empty string fallback or magic numbers, is unneccessary because
-    // the bitmask trims bytes down to the alphabet size.
-    id += urlAlphabet[bytes[size] & 63]
-  }
-  return id
-}
diff --git a/package.json b/package.json
index 57068413..17b9b070 100644
--- a/package.json
+++ b/package.json
@@ -37,9 +37,6 @@
     "./index.js": "./index.browser.js",
     "./async/index.js": "./async/index.browser.js"
   },
-  "react-native": {
-    "./async/index.js": "./async/index.native.js"
-  },
   "bin": "./bin/nanoid.js",
   "sideEffects": false,
   "types": "./index.d.ts",
@@ -141,16 +138,7 @@
       "consistent-return": "off",
       "func-style": "off",
       "yoda": "off"
-    },
-    "overrides": [
-      {
-        "files": "*.native.js",
-        "rules": {
-          "n/no-missing-require": "off",
-          "global-require": "off"
-        }
-      }
-    ]
+    }
   },
   "eslintIgnore": [
     "test/demo/build",