capacitor-sora-editor 1.2.1 → 1.8.2

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

@@ -1,323 +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;
-
-import java.util.AbstractList;
-import java.util.ArrayList;
-import java.util.List;
-import java.util.concurrent.atomic.AtomicInteger;
-
-public class SegmentList<T> extends AbstractList<T> {
-
-    public final static int DEFAULT_SEGMENT_CAPACITY = 8192;
-
-    private final List<Segment<T>> segments;
-
-    private final int segmentCapacity;
-
-    private int length;
-
-    public SegmentList() {
-        this(DEFAULT_SEGMENT_CAPACITY);
-    }
-
-    public SegmentList(int segmentCapacity) {
-        if (segmentCapacity < 4) {
-            throw new IllegalArgumentException("block size should be at least 4");
-        }
-        this.segmentCapacity = segmentCapacity;
-        segments = new ArrayList<>();
-    }
-
-    private void checkInsertIndex(int index) {
-        if (index < 0 || index > length) {
-            throw new IndexOutOfBoundsException("index " + index + " out of bounds. length = " + length);
-        }
-    }
-
-    private void checkAccessIndex(int index) {
-        if (index < 0 || index >= length) {
-            throw new IndexOutOfBoundsException("index " + index + " out of bounds. length = " + length);
-        }
-    }
-
-    private static class FindResult<T> {
-
-        Segment<T> segment;
-        int offset;
-        int blockIndex;
-
-        public FindResult() {
-
-        }
-
-        public FindResult(Segment<T> segment, int offset, int segIndex) {
-            this.segment = segment;
-            this.offset = offset;
-            this.blockIndex = segIndex;
-        }
-    }
-
-    private FindResult<T> result = new FindResult<>();
-
-    private FindResult<T> makeResult(Segment<T> segment, int offset, int segIndex) {
-        result.blockIndex = segIndex;
-        result.segment = segment;
-        result.offset = offset;
-        return result;
-    }
-
-    private FindResult<T> getSegment(int index) {
-        if (segments.isEmpty()) {
-            segments.add(new Segment<>(segmentCapacity));
-        }
-        int offset = 0;
-        var backBlock = segments.get(segments.size() - 1);
-        int backOffset = size() - backBlock.size();
-        for (int i = 0, j = segments.size() - 1; i <= j; i++, j--) {
-            var block = segments.get(i);
-            if ((index >= offset && index < offset + block.size()) || i + 1 == segments.size()) {
-                return makeResult(block, offset, i);
-            }
-            offset += block.size();
-
-            block = backBlock;
-            if ((index >= backOffset && index < backOffset + block.size()) || (j == segments.size() - 1 && index == length)) {
-                return makeResult(block, backOffset, j);
-            }
-            if (j > 0) {
-                backBlock = segments.get(j - 1);
-                backOffset -= backBlock.size();
-            }
-        }
-        throw new IllegalStateException("unreachable");
-    }
-
-    private FindResult<T> getSegmentMut(int index) {
-        var res = getSegment(index);
-        res.segment = ensureMutable(res.blockIndex);
-        return res;
-    }
-
-    private Segment<T> ensureMutable(int segIdx) {
-        var block = segments.get(segIdx);
-        var n = block.toMutable();
-        if (block != n) {
-            segments.set(segIdx, n);
-            block.release();
-            return n;
-        }
-        return block;
-    }
-
-    @Override
-    public T set(int index, T element) {
-        checkAccessIndex(index);
-        var result = getSegmentMut(index);
-        return result.segment.set(index - result.offset, element);
-    }
-
-    @Override
-    public void add(int index, T element) {
-        checkInsertIndex(index);
-        var result = getSegmentMut(index);
-        result.segment.add(index - result.offset, element);
-        length++;
-        adjustElements(result.blockIndex, result.segment);
-        if (result.segment.size() >= segmentCapacity) {
-            var divPoint = segmentCapacity / 2;
-            var seg = new Segment<T>(segmentCapacity);
-            var sub = result.segment.subList(divPoint, result.segment.size());
-            seg.addAll(sub);
-            sub.clear();
-            segments.add(result.blockIndex + 1, seg);
-        }
-    }
-
-    @Override
-    public T remove(int index) {
-        checkAccessIndex(index);
-        var result = getSegmentMut(index);
-        var res = result.segment.remove(index - result.offset);
-        length--;
-        mergeSegment(index - 1, index);
-        mergeSegment(index, index + 1);
-        return res;
-    }
-
-    @Override
-    public T get(int index) {
-        checkAccessIndex(index);
-        var result = getSegment(index);
-        return result.segment.get(index - result.offset);
-    }
-
-    @Override
-    protected void removeRange(int fromIndex, int toIndex) {
-        if (fromIndex > toIndex) throw new IndexOutOfBoundsException("start > end");
-        if (fromIndex < 0 || toIndex > length)
-            throw new IndexOutOfBoundsException("start = " + fromIndex + ", end = " + toIndex + ", length = " + size());
-        if (fromIndex == toIndex) return;
-        var res = getSegment(fromIndex);
-        int offset = res.offset;
-        int index = res.blockIndex;
-        var seg = res.segment;
-
-        while (toIndex - offset > 0 && index < segments.size()) {
-            int segLength = seg.size();
-            if (fromIndex <= offset && toIndex >= offset + segLength) {
-                // Remove the segment
-                segments.remove(index);
-                seg.release();
-            } else {
-                ensureMutable(index);
-                seg = segments.get(index);
-                var sub = seg.subList(Math.max(fromIndex - offset, 0), Math.min(toIndex - offset, segLength));
-                sub.clear();
-                index++;
-            }
-            offset += segLength;
-            if (index < segments.size())
-                seg = segments.get(index);
-        }
-        mergeSegment(index - 1, index);
-        length -= toIndex - fromIndex;
-    }
-
-    @Override
-    public int size() {
-        return length;
-    }
-
-    @Override
-    public void clear() {
-        for (var seg : segments) {
-            seg.release();
-        }
-        segments.clear();
-        length = 0;
-    }
-
-    public SegmentList<T> shallowCopy() {
-        var list = new SegmentList<T>(segmentCapacity);
-        list.segments.clear();
-        for (var seg : segments) {
-            seg.retain();
-        }
-        list.segments.addAll(segments);
-        list.length = length;
-        return list;
-    }
-
-    private void mergeSegment(int seg1, int seg2) {
-        if (seg1 > seg2) {
-            int tmp = seg1;
-            seg1 = seg2;
-            seg2 = tmp;
-        }
-        if (seg1 == seg2 || seg1 < 0 || seg2 >= segments.size()) return;
-        var pre = segments.get(seg1);
-        var aft = segments.get(seg2);
-        if (pre.size() + aft.size() <= segmentCapacity * 3 / 4) {
-            ensureMutable(seg1);
-            pre = segments.get(seg1);
-            pre.addAll(aft);
-            segments.remove(seg2);
-            aft.release();
-        }
-    }
-
-    private void adjustElements(int segIdx, Segment<T> mutCur) {
-        if (segIdx > 0) {
-            var pre = segments.get(segIdx - 1);
-            if (pre.isMutable() && pre.size() <= segmentCapacity * 4 / 5 && mutCur.size() > segmentCapacity * 4 / 5) {
-                var sub = mutCur.subList(0, segmentCapacity * 4 / 5 - pre.size());
-                pre.addAll(sub);
-                sub.clear();
-            }
-        }
-    }
-
-    public void forEachCompat(@NonNull ConsumerCompat<T> consumer) {
-        for (int i = 0; i < segments.size(); i++) {
-            var seg = segments.get(i);
-            for (int i1 = 0; i1 < seg.size(); i1++) {
-                consumer.accept(seg.get(i1));
-            }
-        }
-    }
-
-    public interface ConsumerCompat<T> {
-        void accept(T obj);
-    }
-
-    private static class Segment<T> extends ArrayList<T> implements ShareableData<Segment<T>> {
-
-        public Segment() {
-
-        }
-
-        public Segment(int initialCapacity) {
-            super(initialCapacity);
-        }
-
-        private final AtomicInteger refCount = new AtomicInteger(1);
-
-        @Override
-        public void retain() {
-            refCount.incrementAndGet();
-        }
-
-        @Override
-        public void release() {
-            if (refCount.decrementAndGet() < 0) {
-                throw new IllegalStateException("illegal release invocation");
-            }
-        }
-
-        @Override
-        public boolean isMutable() {
-            return refCount.get() == 1;
-        }
-
-        @Override
-        public Segment<T> toMutable() {
-            if (isMutable()) {
-                return this;
-            } else {
-                return copy();
-            }
-        }
-
-        public Segment<T> copy() {
-            var res = new Segment<T>(this.size());
-            res.addAll(this);
-            return res;
-        }
-    }
-
-}
-

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

@@ -1,52 +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 class TemporaryCharBuffer {
-
-    private static char[] sTemp = null;
-
-    public static char[] obtain(int len) {
-        char[] buf;
-
-        synchronized (TemporaryCharBuffer.class) {
-            buf = sTemp;
-            sTemp = null;
-        }
-
-        if (buf == null || buf.length < len) {
-            buf = new char[len];
-        }
-
-        return buf;
-    }
-
-    public static void recycle(char[] temp) {
-        if (temp.length > 1000) return;
-
-        synchronized (TemporaryCharBuffer.class) {
-            sTemp = temp;
-        }
-    }
-}

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

@@ -1,68 +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 class TemporaryFloatBuffer {
-
-    private static final FloatArrayCache sCache = new FloatArrayCache();
-
-    public static float[] obtain(int len) {
-        return sCache.obtain(len);
-    }
-
-    public static void recycle(float[] temp) {
-        sCache.recycle(temp);
-    }
-
-    public static class FloatArrayCache {
-
-        private float[] temp = null;
-
-        public float[] obtain(int len) {
-            float[] buf;
-
-            synchronized (this) {
-                buf = temp;
-                temp = null;
-            }
-
-            if (buf == null || buf.length < len) {
-                buf = new float[len];
-            }
-
-            return buf;
-        }
-
-        public void recycle(float[] temp) {
-            if (temp.length > 1000) return;
-
-            synchronized (this) {
-                this.temp = temp;
-            }
-        }
-
-    }
-
-}
-

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

@@ -1,38 +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 android.util.TypedValue;
-import android.view.ContextThemeWrapper;
-
-public class ThemeUtils {
-
-    public static int getColorPrimary(ContextThemeWrapper context) {
-        TypedValue typedValue = new TypedValue();
-        context.getTheme().resolveAttribute(android.R.attr.colorPrimary, typedValue, true);
-        return typedValue.data;
-    }
-
-}
-

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

@@ -1,177 +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;
-
-/**
- * @author Rose
- * TrieTree to query values quickly
- */
-public class TrieTree<T> {
-
-    public final Node<T> root;
-    private int maxLen;
-
-    public TrieTree() {
-        root = new Node<>();
-        maxLen = 0;
-    }
-
-    public void put(String v, T token) {
-        maxLen = Math.max(v.length(), maxLen);
-        addInternal(root, v, 0, v.length(), token);
-    }
-
-    public void put(CharSequence v, int off, int len, T token) {
-        maxLen = Math.max(maxLen, len);
-        addInternal(root, v, off, len, token);
-    }
-
-    public T get(CharSequence s, int offset, int len) {
-        if (len > maxLen) {
-            return null;
-        }
-        return getInternal(root, s, offset, len);
-    }
-
-    private T getInternal(Node<T> node, CharSequence s, int offset, int len) {
-        if (len == 0) {
-            return node.token;
-        }
-        char point = s.charAt(offset);
-        Node<T> sub = node.map.get(point);
-        if (sub == null) {
-            return null;
-        }
-        return getInternal(sub, s, offset + 1, len - 1);
-    }
-
-    private void addInternal(Node<T> node, CharSequence v, int i, int len, T token) {
-        char point = v.charAt(i);
-        Node<T> sub = node.map.get(point);
-        if (sub == null) {
-            sub = new Node<>();
-            node.map.put(point, sub);
-        }
-        if (len == 1) {
-            sub.token = token;
-        } else {
-            addInternal(sub, v, i + 1, len - 1, token);
-        }
-    }
-
-    public static class Node<T> {
-
-        public final HashCharMap<Node<T>> map;
-
-        public T token;
-
-        public Node() {
-            this.map = new HashCharMap<>();
-        }
-
-    }
-
-    /**
-     * Hashmap with fixed length
-     *
-     * @author abc15018045126
-     */
-    public static class HashCharMap<V> {
-
-        private final static int CAPACITY = 64;
-        private final LinkedPair<V>[] columns;
-        private final LinkedPair<V>[] ends;
-
-        @SuppressWarnings("unchecked")
-        public HashCharMap() {
-            columns = new LinkedPair[CAPACITY];
-            ends = new LinkedPair[CAPACITY];
-        }
-
-
-        private static int position(int first) {
-            return Math.abs(first ^ (first << 6) * ((first & 1) != 0 ? 3 : 1)) % CAPACITY;
-        }
-
-        public V get(char first) {
-            int position = position(first);
-            LinkedPair<V> pair = columns[position];
-            while (pair != null) {
-                if (pair.first == first) {
-                    return pair.second;
-                }
-                pair = pair.next;
-            }
-            return null;
-        }
-
-        private LinkedPair<V> get(char first, int position) {
-            LinkedPair<V> pair = columns[position];
-            while (pair != null) {
-                if (pair.first == first) {
-                    return pair;
-                }
-                pair = pair.next;
-            }
-            return null;
-        }
-
-        public void put(char first, V second) {
-            int position = position(first);
-            if (ends[position] == null) {
-                columns[position] = ends[position] = new LinkedPair<>();
-                ends[position].first = first;
-                ends[position].second = second;
-                return;
-            }
-            LinkedPair<V> p = get(first, position);
-            if (p == null) {
-                p = ends[position].next = new LinkedPair<>();
-                ends[position] = p;
-            }
-            p.first = first;
-            p.second = second;
-        }
-
-
-    }
-
-    /**
-     * 数据节点
-     *
-     * @author Rose
-     */
-    public static class LinkedPair<V> {
-
-        public LinkedPair<V> next;
-
-        public char first;
-
-        public V second;
-
-    }
-
-}
-
-