[WASM] More optimal way to keep regex decomposition table

libraries/stdlib/native-wasm/src/kotlin/text/regex/Lexer.kt

@@ -777,9 +777,6 @@ internal class Lexer(val patternString: String, flags: Int) {
         fun hasDecompositionNonNullCanClass(ch: Int): Boolean =
             (ch == 0x0340) or (ch == 0x0341) or (ch == 0x0343) or (ch == 0x0344)
 
-        /** Gets decomposition for given codepoint from decomposition mappings table. */
-        fun getDecomposition(ch: Int): IntArray? = getDecompositionInternal(ch)
-
         // =============================================================================================================
 
         /**

libraries/stdlib/wasm/src/kotlin/text/regex/DecompositionHelpers.kt

@@ -243,7 +243,7 @@ private fun getDecomposition(codePoint: Int): IntArray? {
     if (index == -1 || decompositionKeys[index] != codePoint) {
         return null
     }
-    return decompositionValues[index]
+    return getDecompositionByIndex(index)
 }
 
 /** Gets canonical class for given codepoint from decomposition mappings table. */
@@ -257,9 +257,6 @@ internal fun hasSingleCodepointDecompositionInternal(ch: Int): Boolean {
     return index != -1 && singleDecompositions[index] == ch
 }
 
-/** Returns a decomposition for a given codepoint. */
-internal fun getDecompositionInternal(ch: Int): IntArray? = getDecomposition(ch)
-
 /**
  * Decomposes the given string represented as an array of codepoints. Saves the decomposition into [outputCodepoints] array.
  * Returns the length of the decomposition.