capacitor-sora-editor 1.2.1 → 1.8.2

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/text/breaker/WordBreakerIcu.java

@@ -1,62 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2025  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.text.breaker;
-
-import androidx.annotation.NonNull;
-
-import java.text.BreakIterator;
-
-import io.github.abc15018045126.sora.text.CharSequenceIterator;
-import io.github.abc15018045126.sora.text.ContentLine;
-
-public class WordBreakerIcu implements WordBreaker {
-
-    protected final BreakIterator wrappingIterator;
-
-    protected final char[] chars;
-
-    public WordBreakerIcu(@NonNull ContentLine text) {
-        this.chars = text.getBackingCharArray();
-        var textIterator = new CharSequenceIterator(text);
-        wrappingIterator = BreakIterator.getLineInstance();
-        wrappingIterator.setText(textIterator);
-    }
-
-    public int getOptimizedBreakPoint(int start, int end) {
-        // Merging trailing whitespaces is not supported by editor, so force to break here
-        if (end > 0 && !Character.isWhitespace(chars[end - 1]) && !wrappingIterator.isBoundary(end)) {
-            // Break text at last boundary
-            int lastBoundary = wrappingIterator.preceding(end);
-            if (lastBoundary != BreakIterator.DONE) {
-                int suggestedNext = Math.max(start, Math.min(end, lastBoundary));
-                if (suggestedNext > start) {
-                    end = suggestedNext;
-                }
-            }
-        }
-        return end;
-    }
-
-}
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/text/breaker/WordBreakerProgram.java

@@ -1,54 +0,0 @@
-/*
- *    sora-editor - the awesome code editor for Android
- *    https://github.com/abc15018045126/sora-editor
- *    Copyright (C) 2020-2025  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.text.breaker;
-
-import androidx.annotation.NonNull;
-
-import io.github.abc15018045126.sora.text.ContentLine;
-
-public class WordBreakerProgram extends WordBreakerIcu {
-
-    public WordBreakerProgram(@NonNull ContentLine text) {
-        super(text);
-    }
-
-    @Override
-    public int getOptimizedBreakPoint(int start, int end) {
-        int icuResult = super.getOptimizedBreakPoint(start, end);
-        if (icuResult != end || end <= start || /* end > start */ Character.isWhitespace(chars[end - 1])) {
-            return icuResult;
-        }
-        // Add extra opportunities for dots
-        int index = end - 1;
-        while (index > start) {
-            if (chars[index] == '.' && index - 1 >= start && !Character.isDigit(chars[index - 1])) {
-                // Break after this dot
-                return index + 1;
-            }
-            index--;
-        }
-        return end;
-    }
-}
-

package/android/sora-editor/editor/src/main/java/io/github/abc15018045126/sora/text/method/KeyMetaStates.java

@@ -1,93 +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.text.method;
-
-import android.text.Editable;
-import android.view.KeyEvent;
-
-import io.github.abc15018045126.sora.widget.CodeEditor;
-
-/**
- * Handles key events such as SHIFT
- *
- * @author abc15018045126
- */
-public class KeyMetaStates extends android.text.method.MetaKeyKeyListener {
-
-    private final CodeEditor editor;
-
-    /**
-     * Dummy text used for Android original APIs
-     */
-    private final Editable dest = Editable.Factory.getInstance().newEditable("");
-    private boolean isCtrlPressed = false;
-
-    public KeyMetaStates(CodeEditor editor) {
-        this.editor = editor;
-    }
-
-    public void onKeyDown(KeyEvent event) {
-        super.onKeyDown(editor, dest, event.getKeyCode(), event);
-        isCtrlPressed = event.isCtrlPressed();
-    }
-
-    public void onKeyUp(KeyEvent event) {
-        super.onKeyUp(editor, dest, event.getKeyCode(), event);
-        isCtrlPressed = event.isCtrlPressed();
-    }
-
-    public int getMetaState(KeyEvent event) {
-        return getMetaState(dest, event);
-    }
-
-    public boolean isCtrlPressed() {
-        return isCtrlPressed;
-    }
-
-    public boolean isShiftPressed() {
-        return getMetaState(dest, META_SHIFT_ON) == 1;
-    }
-
-    public boolean isAltPressed() {
-        return getMetaState(dest, META_ALT_ON) == 1;
-    }
-
-    public boolean isSymPressed() {
-        return getMetaState(dest, META_SYM_ON) == 1;
-    }
-
-    public boolean isSelecting() {
-        return isShiftPressed() && !isAltPressed();
-    }
-
-    public void adjustAfterKeyPress() {
-        adjustMetaAfterKeypress(dest);
-    }
-
-    public void clearMetaStates(int states) {
-        clearMetaKeyState(editor, dest, states);
-    }
-
-}
-

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

@@ -1,239 +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 static io.github.abc15018045126.sora.util.IntPair.getFirst;
-import static io.github.abc15018045126.sora.util.IntPair.getSecond;
-import static io.github.abc15018045126.sora.util.IntPair.pack;
-
-import android.util.SparseIntArray;
-
-import java.util.concurrent.locks.Lock;
-import java.util.concurrent.locks.ReentrantLock;
-
-/**
- * A general implementation of big root heap
- *
- * @author abc15018045126
- */
-public class BinaryHeap {
-
-    /**
-     * Lock for multi-thread reusing
-     */
-    public final Lock lock = new ReentrantLock();
-    /**
-     * Map from id to its position in heap array
-     */
-    private final SparseIntArray idToPosition;
-    /**
-     * Id allocator
-     */
-    private int idAllocator = 1;
-    /**
-     * Current node count in heap
-     */
-    private int nodeCount;
-    /**
-     * Node array for heap.
-     * first:  id
-     * second: data
-     */
-    private long[] nodes;
-
-    /**
-     * Create a binary heap
-     * This heap maintains its max value in heap
-     */
-    public BinaryHeap() {
-        idToPosition = new SparseIntArray();
-        nodeCount = 0;
-        nodes = new long[129];
-    }
-
-    private static int id(long value) {
-        return getFirst(value);
-    }
-
-    private static int data(long value) {
-        return getSecond(value);
-    }
-
-    /**
-     * Clear all the nodes in the heap
-     */
-    public void clear() {
-        nodeCount = 0;
-        idToPosition.clear();
-        idAllocator = -1;
-    }
-
-    /**
-     * Ensure there is enough space
-     *
-     * @param capacity desired space size
-     */
-    public void ensureCapacity(int capacity) {
-        capacity++;
-        if (nodes.length < capacity) {
-            var origin = nodes;
-            if (nodes.length << 1 >= capacity) {
-                nodes = new long[nodes.length << 1];
-            } else {
-                nodes = new long[capacity];
-            }
-            System.arraycopy(origin, 0, nodes, 0, nodeCount + 1);
-        }
-    }
-
-    /**
-     * Get the max value in this heap or zero if no node is in heap
-     *
-     * @return Max value
-     */
-    public int top() {
-        if (nodeCount == 0) {
-            return 0;
-        }
-        return data(nodes[1]);
-    }
-
-    /**
-     * Get total node count in heap
-     */
-    public int getNodeCount() {
-        return nodeCount;
-    }
-
-    /**
-     * Internal implementation to move down nodes
-     *
-     * @param position target node's position in heap
-     */
-    private void heapifyDown(int position) {
-        for (int child = position * 2; child <= nodeCount; child = position * 2) {
-            long parentNode = nodes[position], childNode;
-            if (child + 1 <= nodeCount && data(nodes[child + 1]) > data(nodes[child])) {
-                child = child + 1;
-            }
-            childNode = nodes[child];
-            if (data(parentNode) < data(childNode)) {
-                idToPosition.put(id(childNode), position);
-                idToPosition.put(id(parentNode), child);
-                nodes[child] = parentNode;
-                nodes[position] = childNode;
-                position = child;
-            } else {
-                break;
-            }
-        }
-    }
-
-    /**
-     * Internal implementation to move up nodes
-     *
-     * @param position target node's position in heap
-     */
-    private void heapifyUp(int position) {
-        for (int parent = position / 2; parent >= 1; parent = position / 2) {
-            long childNode = nodes[position], parentNode = nodes[parent];
-            if (data(childNode) > data(parentNode)) {
-                idToPosition.put(id(childNode), parent);
-                idToPosition.put(id(parentNode), position);
-                nodes[position] = parentNode;
-                nodes[parent] = childNode;
-                position = parent;
-            } else {
-                break;
-            }
-        }
-    }
-
-    /**
-     * Add a new node to the heap
-     *
-     * @return ID of node
-     * @throws IllegalStateException when there is no new id available
-     */
-    public int push(int value) {
-        ensureCapacity(nodeCount + 1);
-        if (idAllocator == Integer.MAX_VALUE) {
-            throw new IllegalStateException("unable to allocate more id");
-        }
-        int id = idAllocator++;
-        nodeCount++;
-        nodes[nodeCount] = pack(id, value);
-        idToPosition.put(id, nodeCount);
-        heapifyUp(nodeCount);
-        return id;
-    }
-
-    /**
-     * Update the value of node with given id to newValue
-     *
-     * @param id       ID returned by push()
-     * @param newValue new value for this node
-     * @throws IllegalArgumentException when the id is invalid
-     */
-    public void update(int id, int newValue) {
-        int position = idToPosition.get(id, 0);
-        if (position == 0) {
-            throw new IllegalArgumentException("trying to update with an invalid id");
-        }
-        int origin = data(nodes[position]);
-        nodes[position] = pack(id(nodes[position]), newValue);
-        if (origin < newValue) {
-            heapifyUp(position);
-        } else if (origin > newValue) {
-            heapifyDown(position);
-        }
-    }
-
-    /**
-     * Remove node with given id
-     *
-     * @param id ID returned by push()
-     * @throws IllegalArgumentException when the id is invalid
-     */
-    public void remove(int id) {
-        int position = idToPosition.get(id, 0);
-        if (position == 0) {
-            throw new IllegalArgumentException("trying to remove with an invalid id");
-        }
-        idToPosition.delete(id);
-        //Replace removed node with last node
-        nodes[position] = nodes[nodeCount];
-        //Release node
-        nodes[nodeCount--] = 0;
-        //Do not update heap if it is just the last node
-        if (position == nodeCount + 1) {
-            return;
-        }
-        idToPosition.put(id(nodes[position]), position);
-        heapifyUp(position);
-        heapifyDown(position);
-    }
-
-}
-