capacitor-sora-editor 1.2.1 → 1.8.2

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/util/LongArrayList.java

@@ -1,132 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2024  abc15018045126
- *
- *     This library is free software; you can redistribute it and/or
- *     modify it under the terms of the GNU Lesser General Public
- *     License as published by the Free Software Foundation; either
- *     version 2.1 of the License, or (at your option) any later version.
- *
- *     This library is distributed in the hope that it will be useful,
- *     but WITHOUT ANY WARRANTY; without even the implied warranty of
- *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *     Lesser General Public License for more details.
- *
- *     You should have received a copy of the GNU Lesser General Public
- *     License along with this library; if not, write to the Free Software
- *     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
- *     USA
- *
- *     Please contact abc15018045126 by email 2073412493@qq.com if you need
- *     additional information or have any questions
- */
-package io.github.abc15018045126.sora.util;
-
-/**
- * ArrayList for primitive type long
- *
- * @author abc15018045126
- */
-public class LongArrayList {
-
-    private long[] data;
-    private int length;
-
-    public LongArrayList() {
-        data = new long[64];
-    }
-
-    /**
-     * Add a value at end
-     */
-    public void add(long value) {
-        data[length++] = value;
-        if (data.length == length) {
-            long[] newData = new long[length << 1];
-            System.arraycopy(data, 0, newData, 0, length);
-            data = newData;
-        }
-    }
-
-    /**
-     * Get length of the list
-     */
-    public int size() {
-        return length;
-    }
-
-    /**
-     * Set element at given index to {@code value}
-     * @throws ArrayIndexOutOfBoundsException if index is invalid
-     */
-    public void set(int index, long value) {
-        if (index >= length || index < 0) {
-            throw new ArrayIndexOutOfBoundsException(index);
-        }
-        data[index] = value;
-    }
-
-    /**
-     * Refers to C++ algorithm lower_bound().
-     * Compare by {@link IntPair#getFirst(long)} on each element.
-     * <p>
-     * Note that, you guarantee the sequence in list is in ascendant order.
-     *
-     * @param key Target value
-     * @return Index of target value, or index of the insertion point (that's the index of first element
-     * bigger than {@code key} or array length)
-     */
-    public int lowerBoundByFirst(int key) {
-        int low = 0;
-        int high = length - 1;
-
-        while (low <= high) {
-            int mid = (low + high) >>> 1;
-            long midVal = IntPair.getFirst(data[mid]);
-
-            if (midVal < key)
-                low = mid + 1;
-            else if (midVal > key)
-                high = mid - 1;
-            else
-                return mid; // key found
-        }
-        return low;  // key not found.
-    }
-
-    public int lowerBound(long key) {
-        int low = 0;
-        int high = length - 1;
-
-        while (low <= high) {
-            int mid = (low + high) >>> 1;
-            long midVal = data[mid];
-
-            if (midVal < key)
-                low = mid + 1;
-            else if (midVal > key)
-                high = mid - 1;
-            else
-                return mid; // key found
-        }
-        return low;  // key not found.
-    }
-
-    /**
-     * Get element at given index
-     * @throws ArrayIndexOutOfBoundsException if index is invalid
-     */
-    public long get(int index) {
-        if (index >= length || index < 0) {
-            throw new ArrayIndexOutOfBoundsException(index);
-        }
-        return data[index];
-    }
-
-    public void clear() {
-        length = 0;
-    }
-
-}
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/util/MyCharacter.java

@@ -1,143 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2024  abc15018045126
- *
- *     This library is free software; you can redistribute it and/or
- *     modify it under the terms of the GNU Lesser General Public
- *     License as published by the Free Software Foundation; either
- *     version 2.1 of the License, or (at your option) any later version.
- *
- *     This library is distributed in the hope that it will be useful,
- *     but WITHOUT ANY WARRANTY; without even the implied warranty of
- *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *     Lesser General Public License for more details.
- *
- *     You should have received a copy of the GNU Lesser General Public
- *     License along with this library; if not, write to the Free Software
- *     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
- *     USA
- *
- *     Please contact abc15018045126 by email 2073412493@qq.com if you need
- *     additional information or have any questions
- */
-package io.github.abc15018045126.sora.util;
-
-import java.util.Arrays;
-
-/**
- * @author Rose
- * Get whether Identifier part/start quickly
- */
-public class MyCharacter {
-
-    /**
-     * Compressed bit set for isJavaIdentifierStart()
-     */
-    private static int[] bitsIsStart;
-    /**
-     * Compressed bit set for isJavaIdentifierPart()
-     */
-    private static int[] bitsIsPart;
-
-    static {
-        initMapInternal();
-    }
-
-    /**
-     * Get bit in compressed bit set
-     *
-     * @param values   Compressed bit set
-     * @param bitIndex Target index
-     * @return Boolean value at the index
-     */
-    private static boolean get(int[] values, int bitIndex) {
-        return ((values[bitIndex / 32] & (1 << (bitIndex % 32))) != 0);
-    }
-
-    /**
-     * Make the given position's bit true
-     *
-     * @param values   Compressed bit set
-     * @param bitIndex Index of bit
-     */
-    private static void set(int[] values, int bitIndex) {
-        values[bitIndex / 32] |= (1 << (bitIndex % 32));
-    }
-
-    /**
-     * Init maps
-     *
-     * @deprecated The class will be initialized automatically
-     */
-    @Deprecated
-    public static void initMap() {
-        // Empty
-    }
-
-    /**
-     * Init maps
-     */
-    private static void initMapInternal() {
-        if (bitsIsStart != null) {
-            return;
-        }
-        bitsIsPart = new int[2048];
-        bitsIsStart = new int[2048];
-        Arrays.fill(bitsIsPart, 0);
-        Arrays.fill(bitsIsStart, 0);
-        for (int i = 0; i <= 65535; i++) {
-            if (Character.isJavaIdentifierPart((char) i)) {
-                set(bitsIsPart, i);
-            }
-            if (Character.isJavaIdentifierStart((char) i)) {
-                set(bitsIsStart, i);
-            }
-        }
-    }
-
-    /**
-     * @param key Character
-     * @return Whether a identifier part
-     * @see Character#isJavaIdentifierPart(char)
-     */
-    public static boolean isJavaIdentifierPart(char key) {
-        return get(bitsIsPart, key);
-    }
-
-    /**
-     * @param key Character
-     * @return Whether a identifier start
-     * @see Character#isJavaIdentifierStart(char)
-     */
-    public static boolean isJavaIdentifierStart(char key) {
-        return get(bitsIsStart, key);
-    }
-
-    public static boolean couldBeEmoji(int cp) {
-        return cp >= 0x1F000 && cp <= 0x1FAFF;
-    }
-
-    public static boolean isFitzpatrick(int cp) {
-        return cp >= 0x1F3FB && cp <= 0x1F3FF;
-    }
-
-    public static boolean isZWJ(int cp) {
-        return cp == 0x200D;
-    }
-
-    public static boolean isZWNJ(int cp) {
-        return cp == 0x200C;
-    }
-
-    public static boolean isVariationSelector(int cp) {
-        return cp == 0xFE0E || cp == 0xFE0F;
-    }
-
-    public static boolean isAlpha(char c) {
-        return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
-    }
-
-}
-
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/util/Numbers.java

@@ -1,123 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2024  abc15018045126
- *
- *     This library is free software; you can redistribute it and/or
- *     modify it under the terms of the GNU Lesser General Public
- *     License as published by the Free Software Foundation; either
- *     version 2.1 of the License, or (at your option) any later version.
- *
- *     This library is distributed in the hope that it will be useful,
- *     but WITHOUT ANY WARRANTY; without even the implied warranty of
- *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *     Lesser General Public License for more details.
- *
- *     You should have received a copy of the GNU Lesser General Public
- *     License along with this library; if not, write to the Free Software
- *     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
- *     USA
- *
- *     Please contact abc15018045126 by email 2073412493@qq.com if you need
- *     additional information or have any questions
- */
-package io.github.abc15018045126.sora.util;
-
-/**
- * From Java java.lang.Integer
- */
-public class Numbers {
-
-    final static char[] DigitTens = {
-            '0', '0', '0', '0', '0', '0', '0', '0', '0', '0',
-            '1', '1', '1', '1', '1', '1', '1', '1', '1', '1',
-            '2', '2', '2', '2', '2', '2', '2', '2', '2', '2',
-            '3', '3', '3', '3', '3', '3', '3', '3', '3', '3',
-            '4', '4', '4', '4', '4', '4', '4', '4', '4', '4',
-            '5', '5', '5', '5', '5', '5', '5', '5', '5', '5',
-            '6', '6', '6', '6', '6', '6', '6', '6', '6', '6',
-            '7', '7', '7', '7', '7', '7', '7', '7', '7', '7',
-            '8', '8', '8', '8', '8', '8', '8', '8', '8', '8',
-            '9', '9', '9', '9', '9', '9', '9', '9', '9', '9',
-    };
-
-    final static char[] DigitOnes = {
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-            '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
-    };
-
-    public static int stringSize(int x) {
-        int d = 1;
-        if (x >= 0) {
-            d = 0;
-            x = -x;
-        }
-        int p = -10;
-        for (int i = 1; i < 10; i++) {
-            if (x > p)
-                return i + d;
-            p = 10 * p;
-        }
-        return 10 + d;
-    }
-
-    public static void getChars(int i, int index, char[] buf) {
-        int q, r;
-        int charPos = index;
-
-        boolean negative = i < 0;
-        if (!negative) {
-            i = -i;
-        }
-
-        // Generate two digits per iteration
-        while (i <= -100) {
-            q = i / 100;
-            r = (q * 100) - i;
-            i = q;
-            buf[--charPos] = DigitOnes[r];
-            buf[--charPos] = DigitTens[r];
-        }
-
-        // We know there are at most two digits left at this point.
-        buf[--charPos] = DigitOnes[-i];
-        if (i < -9) {
-            buf[--charPos] = DigitTens[-i];
-        }
-
-        if (negative) {
-            buf[--charPos] = '-';
-        }
-    }
-
-    /**
-     * Clear flag in flags
-     * The flag must be power of two
-     *
-     * @param flags Flags to filter
-     * @param flag  The flag to clear
-     * @return Cleared flags
-     */
-    public static int clearBit(int flags, int flag) {
-        return (flags & flag) != 0 ? flags ^ flag : flags;
-    }
-
-    public static int clearBits(int flags, int bitsToClear) {
-        int mask = ~bitsToClear;
-        return flags & mask;
-    }
-
-    public static int coerceIn(int value, int min, int max) {
-        return Math.max(min, Math.min(max, value));
-    }
-
-}
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/util/ObjectPool.java

@@ -1,77 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2024  abc15018045126
- *
- *     This library is free software; you can redistribute it and/or
- *     modify it under the terms of the GNU Lesser General Public
- *     License as published by the Free Software Foundation; either
- *     version 2.1 of the License, or (at your option) any later version.
- *
- *     This library is distributed in the hope that it will be useful,
- *     but WITHOUT ANY WARRANTY; without even the implied warranty of
- *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *     Lesser General Public License for more details.
- *
- *     You should have received a copy of the GNU Lesser General Public
- *     License along with this library; if not, write to the Free Software
- *     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
- *     USA
- *
- *     Please contact abc15018045126 by email 2073412493@qq.com if you need
- *     additional information or have any questions
- */
-package io.github.abc15018045126.sora.util;
-
-public abstract class ObjectPool<T> {
-
-    private final Object[] pool;
-
-    public ObjectPool() {
-        this(16);
-    }
-
-    public ObjectPool(int size) {
-        pool = new Object[size];
-    }
-
-    public void recycle(T obj) {
-        if (obj == null)
-            return;
-        onRecycleObject(obj);
-        synchronized (this) {
-            for (int i = 0; i < pool.length; i++) {
-                if (pool[i] == null) {
-                    pool[i] = obj;
-                    break;
-                }
-            }
-        }
-    }
-
-    @SuppressWarnings("unchecked")
-    public T obtain() {
-        T result = null;
-        synchronized (this) {
-            for (int i = pool.length - 1; i >= 0; i--) {
-                if (pool[i] != null) {
-                    result = (T) pool[i];
-                    pool[i] = null;
-                    break;
-                }
-            }
-        }
-        if (result == null) {
-            result = allocateNew();
-        }
-        return result;
-    }
-
-    protected void onRecycleObject(T recycledObj) {
-
-    }
-
-    protected abstract T allocateNew();
-
-}
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/util/RegionIterator.java

@@ -1,162 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2024  abc15018045126
- *
- *     This library is free software; you can redistribute it and/or
- *     modify it under the terms of the GNU Lesser General Public
- *     License as published by the Free Software Foundation; either
- *     version 2.1 of the License, or (at your option) any later version.
- *
- *     This library is distributed in the hope that it will be useful,
- *     but WITHOUT ANY WARRANTY; without even the implied warranty of
- *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- *     Lesser General Public License for more details.
- *
- *     You should have received a copy of the GNU Lesser General Public
- *     License along with this library; if not, write to the Free Software
- *     Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
- *     USA
- *
- *     Please contact abc15018045126 by email 2073412493@qq.com if you need
- *     additional information or have any questions
- */
-package io.github.abc15018045126.sora.util;
-
-import androidx.annotation.NonNull;
-
-/**
- * This class provides region division and iteration with several {@link RegionProvider}s.
- *
- * @author abc15018045126
- */
-public class RegionIterator {
-
-    private final int max;
-    private final RegionProvider[] providers;
-    private final int[] pointers;
-    private final boolean[] pointerStates;
-    protected int startIndex;
-    protected int endIndex;
-
-    /**
-     * Creates a new {@link RegionIterator} with the given params
-     * @param max The length of full region, that's [0,max-1]
-     * @param providers Providers of dividing points
-     */
-    public RegionIterator(int max, @NonNull RegionProvider... providers) {
-        this.max = max;
-        this.providers = providers;
-        pointers = new int[providers.length];
-        pointerStates = new boolean[providers.length];
-    }
-
-    /**
-     * Move to next region
-     */
-    public void nextRegion() {
-        startIndex = endIndex;
-        int minNext = max;
-        for (int i = 0; i < providers.length; i++) {
-            int next, value;
-            if (pointers[i] < providers[i].getPointCount() && (value = providers[i].getPointAt(pointers[i])) <= max) {
-                next = value;
-            } else {
-                next = max;
-            }
-            minNext = Math.min(next, minNext);
-        }
-        endIndex = minNext;
-        for (int i = 0; i < providers.length; i++) {
-            if (pointers[i] < providers[i].getPointCount() && providers[i].getPointAt(pointers[i]) == minNext) {
-                pointers[i]++;
-                pointerStates[i] = true;
-            } else {
-                pointerStates[i] = false;
-            }
-        }
-    }
-
-    /**
-     * Check if we can move to next region
-     */
-    public boolean hasNextRegion() {
-        return endIndex < max;
-    }
-
-    /**
-     * Get current index of dividing points in provider with given index {@code i}
-     * @param i Index of provider
-     * @return Current index of regions in that provider
-     */
-    public int getPointer(int i) {
-        return pointers[i];
-    }
-
-    /**
-     * Get the source index of dividing points in provider with given index {@code i}.
-     * Source index is the index of dividing point that leads to current region.
-     * @param i Index of provider
-     */
-    public int getRegionSourcePointer(int i) {
-        var pointerValue = pointers[i] < providers[i].getPointCount() ? providers[i].getPointAt(i) : max;
-        return (endIndex <= pointerValue && pointerValue < max || pointerStates[i]) ? pointers[i] - 1 : pointers[i];
-    }
-
-    public int getPointerValue(int i, int j) {
-        var provider = providers[i];
-        if (j < 0) {
-            return 0;
-        }
-        if (j >= provider.getPointCount()) {
-            return max;
-        }
-        var value = provider.getPointAt(j);
-        return Math.min(value, max);
-    }
-
-    /**
-     * Get start index of the region
-     * Note that this is inclusive.
-     */
-    public int getStartIndex() {
-        return startIndex;
-    }
-
-    /**
-     * Get end index of the region.
-     * Note that this is exclusive.
-     */
-    public int getEndIndex() {
-        return Math.min(endIndex, max);
-    }
-
-    /**
-     * Get length of the full region.
-     */
-    public int getMax() {
-        return max;
-    }
-
-    /**
-     * RegionProvider provides dividing points for {@link RegionIterator}. Note that the returned
-     * sequence must follow a ascent order.
-     */
-    public interface RegionProvider {
-
-        /**
-         * Get count of dividing points
-         */
-        int getPointCount();
-
-        /**
-         * Get get dividing point at given index
-         * @param index Index of point
-         * @return Dividing index in region
-         */
-        int getPointAt(int index);
-
-    }
-
-}
-