diff --git a/bundles/org.jkiss.utils/META-INF/MANIFEST.MF b/bundles/org.jkiss.utils/META-INF/MANIFEST.MF
deleted file mode 100644
index 50c633dd37fd6..0000000000000
--- a/bundles/org.jkiss.utils/META-INF/MANIFEST.MF
+++ /dev/null
@@ -1,17 +0,0 @@
-Manifest-Version: 1.0
-Bundle-ManifestVersion: 2
-Bundle-Name: DBeaver Utils
-Bundle-Vendor: DBeaver Corp
-Bundle-SymbolicName: org.jkiss.utils
-Bundle-Version: 2.1.207.qualifier
-Bundle-Release-Date: 20240205
-Bundle-RequiredExecutionEnvironment: JavaSE-17
-Require-Bundle: com.google.gson
-Export-Package: org.jkiss.code,
- org.jkiss.utils,
- org.jkiss.utils.csv,
- org.jkiss.utils.io,
- org.jkiss.utils.rest,
- org.jkiss.utils.time,
- org.jkiss.utils.xml
-Automatic-Module-Name: org.jkiss.utils
diff --git a/bundles/org.jkiss.utils/build.properties b/bundles/org.jkiss.utils/build.properties
deleted file mode 100644
index 3335c5d91cbc6..0000000000000
--- a/bundles/org.jkiss.utils/build.properties
+++ /dev/null
@@ -1,3 +0,0 @@
-source.. = src/
-output.. = target/classes/
-bin.includes = META-INF/,.
diff --git a/bundles/org.jkiss.utils/pom.xml b/bundles/org.jkiss.utils/pom.xml
deleted file mode 100644
index 94e81311b7249..0000000000000
--- a/bundles/org.jkiss.utils/pom.xml
+++ /dev/null
@@ -1,14 +0,0 @@
-
-
- 4.0.0
-
- org.jkiss.dbeaver
- bundles
- 1.0.0-SNAPSHOT
- ../
-
- org.jkiss.utils
- 2.1.207-SNAPSHOT
- eclipse-plugin
-
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/code/NotNull.java b/bundles/org.jkiss.utils/src/org/jkiss/code/NotNull.java
deleted file mode 100644
index bff9bf18a575d..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/code/NotNull.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.code;
-
-/**
- * NotNull annotation
- */
-public @interface NotNull {
-
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/code/Nullable.java b/bundles/org.jkiss.utils/src/org/jkiss/code/Nullable.java
deleted file mode 100644
index 88a5ebf0de304..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/code/Nullable.java
+++ /dev/null
@@ -1,25 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.code;
-
-/**
- * Nullable annotation
- */
-public @interface Nullable {
-
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/AlphanumericComparator.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/AlphanumericComparator.java
deleted file mode 100644
index e1c37a536846b..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/AlphanumericComparator.java
+++ /dev/null
@@ -1,83 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-
-import java.util.Comparator;
-
-/**
- * A comparator for comparing two strings lexicographically, treating them as sequences of alphanumeric characters.
- *
- * This comparator compares strings based on their alphanumeric content. It considers
- * the characters in the strings as a sequence of alphanumeric characters (letters and digits)
- * and compares them lexicographically. The comparison is case-insensitive.
- */
-public class AlphanumericComparator implements Comparator {
- private static final AlphanumericComparator INSTANCE = new AlphanumericComparator();
-
- private AlphanumericComparator() {
- // prevents instantiation
- }
-
- @NotNull
- public static AlphanumericComparator getInstance() {
- return INSTANCE;
- }
-
- @Override
- public int compare(CharSequence o1, CharSequence o2) {
- final int len1 = o1.length();
- final int len2 = o2.length();
-
- int i = 0;
- int j = 0;
-
- while (i < len1 && j < len2) {
- final char ch1 = Character.toUpperCase(o1.charAt(i));
- final char ch2 = Character.toUpperCase(o2.charAt(i));
-
- if (Character.isDigit(ch1) && Character.isDigit(ch2)) {
- int num1 = 0;
- int num2 = 0;
-
- while (i < len1 && Character.isDigit(o1.charAt(i))) {
- num1 = num1 * 10 + Character.digit(o1.charAt(i), 10);
- i += 1;
- }
-
- while (j < len2 && Character.isDigit(o2.charAt(j))) {
- num2 = num2 * 10 + Character.digit(o2.charAt(j), 10);
- j += 1;
- }
-
- if (num1 != num2) {
- return num1 - num2;
- }
- } else {
- if (ch1 != ch2) {
- return ch1 - ch2;
- }
-
- i += 1;
- j += 1;
- }
- }
-
- return len1 - len2;
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/ArgumentTokenizer.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/ArgumentTokenizer.java
deleted file mode 100644
index 46e12bd0d03d7..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/ArgumentTokenizer.java
+++ /dev/null
@@ -1,227 +0,0 @@
-/*
- * Copyright (c) 2001-2010, JavaPLT group at Rice University (drjava@rice.edu)
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- * * Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * * Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- * * Neither the names of DrJava, the JavaPLT group, Rice University, nor the
- * names of its contributors may be used to endorse or promote products
- * derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
- * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
- * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- * This software is Open Source Initiative approved Open Source Software.
- * Open Source Initative Approved is a trademark of the Open Source Initiative.
- *
- * This file is part of DrJava. Download the current version of this project
- * from http://www.drjava.org/ or http://sourceforge.net/projects/drjava/
- */
-
-package org.jkiss.utils;
-
-import java.util.LinkedList;
-import java.util.List;
-
-/**
- * Utility class which can tokenize a String into a list of String arguments,
- * with behavior similar to parsing command line arguments to a program.
- * Quoted Strings are treated as single arguments, and escaped characters
- * are translated so that the tokenized arguments have the same meaning.
- * Since all methods are static, the class is declared abstract to prevent
- * instantiation.
- *
- * @version $Id$
- */
-public abstract class ArgumentTokenizer {
- private static final int NO_TOKEN_STATE = 0;
- private static final int NORMAL_TOKEN_STATE = 1;
- private static final int SINGLE_QUOTE_STATE = 2;
- private static final int DOUBLE_QUOTE_STATE = 3;
-
- /**
- * Tokenizes the given String into String tokens
- *
- * @param arguments A String containing one or more command-line style arguments to be tokenized.
- * @return A list of parsed and properly escaped arguments.
- */
- public static List tokenize(String arguments) {
- return tokenize(arguments, false);
- }
-
- /**
- * Tokenizes the given String into String tokens.
- *
- * @param arguments A String containing one or more command-line style arguments to be tokenized.
- * @param stringify whether or not to include escape special characters
- * @return A list of parsed and properly escaped arguments.
- */
- public static List tokenize(String arguments, boolean stringify) {
-
- LinkedList argList = new LinkedList();
- StringBuilder currArg = new StringBuilder();
- boolean escaped = false;
- int state = NO_TOKEN_STATE; // start in the NO_TOKEN_STATE
- int len = arguments.length();
-
- // Loop over each character in the string
- for (int i = 0; i < len; i++) {
- char c = arguments.charAt(i);
- if (escaped) {
- // Escaped state: just append the next character to the current arg.
- escaped = false;
- if (c != 'n' && c != 't' && c != '\\') {
- // This was just a regular slash
- currArg.append('\\');
- }
- currArg.append(c);
- } else {
- switch (state) {
- case SINGLE_QUOTE_STATE:
- if (c == '\'') {
- // Seen the close quote; continue this arg until whitespace is seen
- state = NORMAL_TOKEN_STATE;
- } else {
- currArg.append(c);
- }
- break;
- case DOUBLE_QUOTE_STATE:
- if (c == '"') {
- // Seen the close quote; continue this arg until whitespace is seen
- state = NORMAL_TOKEN_STATE;
- } else if (c == '\\') {
- // Look ahead, and only escape quotes or backslashes
- i++;
- char next = arguments.charAt(i);
- if (next == '"' || next == '\\') {
- currArg.append(next);
- } else {
- currArg.append(c);
- currArg.append(next);
- }
- } else {
- currArg.append(c);
- }
- break;
-// case NORMAL_TOKEN_STATE:
-// if (Character.isWhitespace(c)) {
-// // Whitespace ends the token; start a new one
-// argList.add(currArg.toString());
-// currArg = new StringBuffer();
-// state = NO_TOKEN_STATE;
-// }
-// else if (c == '\\') {
-// // Backslash in a normal token: escape the next character
-// escaped = true;
-// }
-// else if (c == '\'') {
-// state = SINGLE_QUOTE_STATE;
-// }
-// else if (c == '"') {
-// state = DOUBLE_QUOTE_STATE;
-// }
-// else {
-// currArg.append(c);
-// }
-// break;
- case NO_TOKEN_STATE:
- case NORMAL_TOKEN_STATE:
- switch (c) {
- case '\\':
- escaped = true;
- state = NORMAL_TOKEN_STATE;
- break;
- case '\'':
- state = SINGLE_QUOTE_STATE;
- break;
- case '"':
- state = DOUBLE_QUOTE_STATE;
- break;
- default:
- if (!Character.isWhitespace(c)) {
- currArg.append(c);
- state = NORMAL_TOKEN_STATE;
- } else if (state == NORMAL_TOKEN_STATE) {
- // Whitespace ends the token; start a new one
- argList.add(currArg.toString());
- currArg = new StringBuilder();
- state = NO_TOKEN_STATE;
- }
- }
- break;
- default:
- throw new IllegalStateException("ArgumentTokenizer state " + state + " is invalid!");
- }
- }
- }
-
- // If we're still escaped, put in the backslash
- if (escaped) {
- currArg.append('\\');
- argList.add(currArg.toString());
- }
- // Close the last argument if we haven't yet
- else if (state != NO_TOKEN_STATE) {
- argList.add(currArg.toString());
- }
- // Format each argument if we've been told to stringify them
- if (stringify) {
- for (int i = 0; i < argList.size(); i++) {
- argList.set(i, "\"" + _escapeQuotesAndBackslashes(argList.get(i)) + "\"");
- }
- }
- return argList;
- }
-
- /**
- * Inserts backslashes before any occurrences of a backslash or
- * quote in the given string. Also converts any special characters
- * appropriately.
- */
- protected static String _escapeQuotesAndBackslashes(String s) {
- final StringBuilder buf = new StringBuilder(s);
-
- // Walk backwards, looking for quotes or backslashes.
- // If we see any, insert an extra backslash into the buffer at
- // the same index. (By walking backwards, the index into the buffer
- // will remain correct as we change the buffer.)
- for (int i = s.length() - 1; i >= 0; i--) {
- char c = s.charAt(i);
- if ((c == '\\') || (c == '"')) {
- buf.insert(i, '\\');
- }
- // Replace any special characters with escaped versions
- else if (c == '\n') {
- buf.deleteCharAt(i);
- buf.insert(i, "\\n");
- } else if (c == '\t') {
- buf.deleteCharAt(i);
- buf.insert(i, "\\t");
- } else if (c == '\r') {
- buf.deleteCharAt(i);
- buf.insert(i, "\\r");
- } else if (c == '\b') {
- buf.deleteCharAt(i);
- buf.insert(i, "\\b");
- } else if (c == '\f') {
- buf.deleteCharAt(i);
- buf.insert(i, "\\f");
- }
- }
- return buf.toString();
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/ArrayUtils.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/ArrayUtils.java
deleted file mode 100644
index deb37abc82b03..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/ArrayUtils.java
+++ /dev/null
@@ -1,311 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-import org.jkiss.code.Nullable;
-
-import java.lang.reflect.Array;
-import java.util.Arrays;
-import java.util.Collection;
-import java.util.Collections;
-import java.util.List;
-import java.util.function.Predicate;
-
-/**
- * Common utils
- */
-public class ArrayUtils {
-
-
- public static boolean isEmpty(@Nullable Object[] arr)
- {
- return arr == null || arr.length == 0;
- }
-
- public static boolean isEmpty(@Nullable short[] array)
- {
- return array == null || array.length == 0;
- }
-
- public static boolean isArray(@Nullable Object value) {
- return value != null && value.getClass().isArray();
- }
-
- public static boolean contains(@Nullable short[] array, short value)
- {
- if (array == null)
- return false;
- for (short item : array) {
- if (item == value)
- return true;
- }
- return false;
- }
-
- public static boolean contains(@Nullable char[] array, char value)
- {
- if (array == null || array.length == 0)
- return false;
- for (char c : array) {
- if (c == value)
- return true;
- }
- return false;
- }
-
- public static boolean isEmpty(@Nullable int[] array)
- {
- return array == null || array.length == 0;
- }
-
- public static boolean contains(@Nullable int[] array, int value)
- {
- if (array == null)
- return false;
- for (int v : array) {
- if (v == value)
- return true;
- }
- return false;
- }
-
- public static boolean isEmpty(@Nullable long[] array)
- {
- return array == null || array.length == 0;
- }
-
- public static boolean contains(@Nullable long[] array, long value)
- {
- if (array == null)
- return false;
- for (long v : array) {
- if (v == value)
- return true;
- }
- return false;
- }
-
- public static boolean contains(OBJECT_TYPE[] array, OBJECT_TYPE value)
- {
- if (isEmpty(array))
- return false;
- for (OBJECT_TYPE object_type : array) {
- if (CommonUtils.equalObjects(value, object_type))
- return true;
- }
- return false;
- }
-
- public static boolean containsIgnoreCase(String[] array, String value)
- {
- if (isEmpty(array) || value == null)
- return false;
- for (String s : array) {
- if (value.equalsIgnoreCase(s))
- return true;
- }
- return false;
- }
-
- public static boolean containsRef(@NotNull OBJECT_TYPE[] array, @Nullable OBJECT_TYPE value)
- {
- final int length = array.length;
- for (OBJECT_TYPE object_type : array) {
- if (value == object_type)
- return true;
- }
- return false;
- }
-
- @SafeVarargs
- public static boolean containsAny(OBJECT_TYPE[] array, OBJECT_TYPE... values) {
- for (OBJECT_TYPE item : array) {
- for (OBJECT_TYPE value : values) {
- if (CommonUtils.equalObjects(item, value))
- return true;
- }
- }
- return false;
- }
-
- @SafeVarargs
- public static boolean containsAll(OBJECT_TYPE[] array, OBJECT_TYPE... values) {
- if (isEmpty(array)) {
- return false;
- }
- for (OBJECT_TYPE value : values) {
- if (!ArrayUtils.contains(array, value))
- return false;
- }
- return true;
- }
-
- @NotNull
- public static T[] concatArrays(@NotNull T[] first, @NotNull T[] second)
- {
- T[] result = Arrays.copyOf(first, first.length + second.length);
- System.arraycopy(second, 0, result, first.length, second.length);
- return result;
- }
-
- @NotNull
- public static List safeArray(@Nullable T[] array)
- {
- if (array == null) {
- return Collections.emptyList();
- } else {
- return Arrays.asList(array);
- }
- }
-
- /**
- * Returns index of the first found element satisfying a given predicate in the provided array
- */
- public static int indexOf(@NotNull T[] array, @NotNull Predicate condition) {
- for (int i = 0; i < array.length; i++) {
- if (condition.test(array[i])) {
- return i;
- }
- }
- return -1;
- }
-
- public static int indexOf(T[] array, T element) {
- for (int i = 0; i < array.length; i++) {
- if (CommonUtils.equalObjects(array[i], element)) {
- return i;
- }
- }
- return -1;
- }
-
- public static int indexOf(int[] array, int offset, int element) {
- for (int i = offset; i < array.length; i++) {
- if (array[i] == element) {
- return i;
- }
- }
- return -1;
- }
-
- public static int indexOf(byte[] array, int offset, byte element) {
- for (int i = offset; i < array.length; i++) {
- if (array[i] == element) {
- return i;
- }
- }
- return -1;
- }
-
- @SuppressWarnings("unchecked")
- public static T[] deleteArea(Class type, T[] elements, int from, int to) {
- int delCount = to - from + 1;
- T[] newArray = (T[]) Array.newInstance(type, elements.length - delCount);
- System.arraycopy(elements, 0, newArray, 0, from);
- if (to < elements.length - 1) {
- System.arraycopy(elements, to + 1, newArray, from, elements.length - from - delCount);
- }
-
- return newArray;
- }
-
- @SuppressWarnings("unchecked")
- public static T[] insertArea(Class type, Object[] elements, int pos, Object[] add) {
- T[] newArray = (T[]) Array.newInstance(type, elements.length + add.length);
- System.arraycopy(elements, 0, newArray, 0, pos);
- System.arraycopy(add, 0, newArray, pos, add.length);
- System.arraycopy(elements, pos, newArray, pos + add.length, elements.length - pos);
- return newArray;
- }
-
- @SuppressWarnings("unchecked")
- public static T[] add(Class type, T[] elements, T add) {
- T[] newArray = (T[]) Array.newInstance(type, elements.length + 1);
- System.arraycopy(elements, 0, newArray, 0, elements.length);
- newArray[elements.length] = add;
- return newArray;
- }
-
- @SuppressWarnings("unchecked")
- public static T[] remove(Class type, T[] elements, int index) {
- T[] newArray = (T[]) Array.newInstance(type, elements.length - 1);
- System.arraycopy(elements, 0, newArray, 0, index);
- if (index < elements.length - 1) {
- System.arraycopy(elements, index + 1, newArray, index, elements.length - index - 1);
- }
- return newArray;
- }
-
- public static T[] remove(Class type, T[] elements, T element) {
- for (int i = 0; i < elements.length; i++) {
- if (elements[i] == element) {
- return remove(type, elements, i);
- }
- }
- return elements;
- }
-
- public static int[] add(int[] elements, int add) {
- int[] newArray = new int[elements.length + 1];
- System.arraycopy(elements, 0, newArray, 0, elements.length);
- newArray[elements.length] = add;
- return newArray;
- }
-
- public static void main(String[] args) {
- String[] arr = new String[0];
-
- for (int i = 0; i < 100; i++) {
- arr = add(String.class, arr, String.valueOf(i));
- }
- System.out.println(Arrays.toString(arr));
- for (int i = 0; i < 100; i++) {
- arr = remove(String.class, arr, 0);
- }
- System.out.println(Arrays.toString(arr));
- }
-
- @SuppressWarnings("unchecked")
- public static T[] toArray(Class type, Collection list) {
- return list.toArray((T[]) Array.newInstance(type, list.size()));
- }
-
- @Nullable
- public static boolean[] unbox(@Nullable Boolean[] source) {
- if (source == null) {
- return null;
- }
- final boolean[] result = new boolean[source.length];
- for (int i = 0; i < source.length; i++) {
- result[i] = source[i];
- }
- return result;
- }
-
- public static void reverse(@Nullable Object[] array) {
- if (array == null || array.length <= 1) {
- return;
- }
- for (int i = 0, j = array.length - 1; j > i; ++i, j--) {
- final Object tmp = array[j];
- array[j] = array[i];
- array[i] = tmp;
- }
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/Base64.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/Base64.java
deleted file mode 100644
index d936daa7ede26..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/Base64.java
+++ /dev/null
@@ -1,330 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.utils;
-
-import java.io.IOException;
-import java.io.InputStream;
-import java.io.OutputStream;
-import java.io.Writer;
-
-public final class Base64 {
-
- private static final char[] S_BASE64CHAR = {
- 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J',
- 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T',
- 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd',
- 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
- 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x',
- 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7',
- '8', '9', '+', '/'
- };
-
- private static final char S_BASE64PAD = '=';
-
- private static final byte[] S_DECODETABLE = new byte[128];
-
- static {
- for (int i = 0; i < S_DECODETABLE.length; i ++)
- S_DECODETABLE[i] = Byte.MAX_VALUE; // 127
- for (int i = 0; i < S_BASE64CHAR.length; i ++) // 0 to 63
- S_DECODETABLE[S_BASE64CHAR[i]] = (byte)i;
- }
-
- private static int decode0(char[] ibuf, byte[] obuf, int wp) {
- int outlen = 3;
- if (ibuf[3] == S_BASE64PAD) outlen = 2;
- if (ibuf[2] == S_BASE64PAD) outlen = 1;
- int b0 = S_DECODETABLE[ibuf[0]];
- int b1 = S_DECODETABLE[ibuf[1]];
- int b2 = S_DECODETABLE[ibuf[2]];
- int b3 = S_DECODETABLE[ibuf[3]];
- switch (outlen) {
- case 1:
- obuf[wp] = (byte)(b0 << 2 & 0xfc | b1 >> 4 & 0x3);
- return 1;
- case 2:
- obuf[wp++] = (byte)(b0 << 2 & 0xfc | b1 >> 4 & 0x3);
- obuf[wp] = (byte)(b1 << 4 & 0xf0 | b2 >> 2 & 0xf);
- return 2;
- case 3:
- default:
- obuf[wp++] = (byte)(b0 << 2 & 0xfc | b1 >> 4 & 0x3);
- obuf[wp++] = (byte)(b1 << 4 & 0xf0 | b2 >> 2 & 0xf);
- obuf[wp] = (byte)(b2 << 6 & 0xc0 | b3 & 0x3f);
- return 3;
- }
- }
-
- /**
- *
- */
- public static byte[] decode(char[] data, int off, int len) {
- char[] ibuf = new char[4];
- int ibufcount = 0;
- byte[] obuf = new byte[len/4*3+3];
- int obufcount = 0;
- for (int i = off; i < off+len; i ++) {
- char ch = data[i];
- if (ch == S_BASE64PAD
- || ch < S_DECODETABLE.length && S_DECODETABLE[ch] != Byte.MAX_VALUE) {
- ibuf[ibufcount++] = ch;
- if (ibufcount == ibuf.length) {
- ibufcount = 0;
- obufcount += decode0(ibuf, obuf, obufcount);
- }
- }
- }
- if (obufcount == obuf.length)
- return obuf;
- byte[] ret = new byte[obufcount];
- System.arraycopy(obuf, 0, ret, 0, obufcount);
- return ret;
- }
-
- /**
- *
- */
- public static byte[] decode(String data) {
- char[] ibuf = new char[4];
- int ibufcount = 0;
- byte[] obuf = new byte[data.length()/4*3+3];
- int obufcount = 0;
- for (int i = 0; i < data.length(); i ++) {
- char ch = data.charAt(i);
- if (ch == S_BASE64PAD
- || ch < S_DECODETABLE.length && S_DECODETABLE[ch] != Byte.MAX_VALUE) {
- ibuf[ibufcount++] = ch;
- if (ibufcount == ibuf.length) {
- ibufcount = 0;
- obufcount += decode0(ibuf, obuf, obufcount);
- }
- }
- }
- if (obufcount == obuf.length)
- return obuf;
- byte[] ret = new byte[obufcount];
- System.arraycopy(obuf, 0, ret, 0, obufcount);
- return ret;
- }
-
- /**
- *
- */
- public static void decode(char[] data, int off, int len, OutputStream ostream) throws IOException {
- char[] ibuf = new char[4];
- int ibufcount = 0;
- byte[] obuf = new byte[3];
- for (int i = off; i < off+len; i ++) {
- char ch = data[i];
- if (ch == S_BASE64PAD
- || ch < S_DECODETABLE.length && S_DECODETABLE[ch] != Byte.MAX_VALUE) {
- ibuf[ibufcount++] = ch;
- if (ibufcount == ibuf.length) {
- ibufcount = 0;
- int obufcount = decode0(ibuf, obuf, 0);
- ostream.write(obuf, 0, obufcount);
- }
- }
- }
- }
-
- /**
- *
- */
- public static void decode(String data, OutputStream ostream) throws IOException {
- char[] ibuf = new char[4];
- int ibufcount = 0;
- byte[] obuf = new byte[3];
- for (int i = 0; i < data.length(); i ++) {
- char ch = data.charAt(i);
- if (ch == S_BASE64PAD
- || ch < S_DECODETABLE.length && S_DECODETABLE[ch] != Byte.MAX_VALUE) {
- ibuf[ibufcount++] = ch;
- if (ibufcount == ibuf.length) {
- ibufcount = 0;
- int obufcount = decode0(ibuf, obuf, 0);
- ostream.write(obuf, 0, obufcount);
- }
- }
- }
- }
-
- /**
- * Returns base64 representation of specified byte array.
- */
- public static String encode(byte[] data) {
- return encode(data, 0, data.length);
- }
-
- public static String splitLines(String bigString, int lineLength) {
- return bigString.replaceAll("(.{" + lineLength + "})", "$1\n");
- }
-
- /**
- * Returns base64 representation of specified byte array.
- */
- public static String encode(byte[] data, int off, int len)
- {
- if (len <= 0) return "";
- char[] out = new char[len/3*4+4];
- int rindex = off;
- int windex = 0;
- int rest = len-off;
- while (rest >= 3) {
- int i = ((data[rindex]&0xff)<<16)
- +((data[rindex+1]&0xff)<<8)
- +(data[rindex+2]&0xff);
- out[windex++] = S_BASE64CHAR[i>>18];
- out[windex++] = S_BASE64CHAR[(i>>12)&0x3f];
- out[windex++] = S_BASE64CHAR[(i>>6)&0x3f];
- out[windex++] = S_BASE64CHAR[i&0x3f];
- rindex += 3;
- rest -= 3;
- }
- if (rest == 1) {
- int i = data[rindex]&0xff;
- out[windex++] = S_BASE64CHAR[i>>2];
- out[windex++] = S_BASE64CHAR[(i<<4)&0x3f];
- out[windex++] = S_BASE64PAD;
- out[windex++] = S_BASE64PAD;
- } else if (rest == 2) {
- int i = ((data[rindex]&0xff)<<8)+(data[rindex+1]&0xff);
- out[windex++] = S_BASE64CHAR[i>>10];
- out[windex++] = S_BASE64CHAR[(i>>4)&0x3f];
- out[windex++] = S_BASE64CHAR[(i<<2)&0x3f];
- out[windex++] = S_BASE64PAD;
- }
- return new String(out, 0, windex);
- }
-
- /**
- * Outputs base64 representation of the specified byte array to a byte stream.
- */
- public static void encode(byte[] data, int off, int len, OutputStream ostream) throws IOException {
- if (len <= 0) return;
- byte[] out = new byte[4];
- int rindex = off;
- int rest = len-off;
- while (rest >= 3) {
- int i = ((data[rindex]&0xff)<<16)
- +((data[rindex+1]&0xff)<<8)
- +(data[rindex+2]&0xff);
- out[0] = (byte)S_BASE64CHAR[i>>18];
- out[1] = (byte)S_BASE64CHAR[(i>>12)&0x3f];
- out[2] = (byte)S_BASE64CHAR[(i>>6)&0x3f];
- out[3] = (byte)S_BASE64CHAR[i&0x3f];
- ostream.write(out, 0, 4);
- rindex += 3;
- rest -= 3;
- }
- if (rest == 1) {
- int i = data[rindex]&0xff;
- out[0] = (byte)S_BASE64CHAR[i>>2];
- out[1] = (byte)S_BASE64CHAR[(i<<4)&0x3f];
- out[2] = (byte)S_BASE64PAD;
- out[3] = (byte)S_BASE64PAD;
- ostream.write(out, 0, 4);
- } else if (rest == 2) {
- int i = ((data[rindex]&0xff)<<8)+(data[rindex+1]&0xff);
- out[0] = (byte)S_BASE64CHAR[i>>10];
- out[1] = (byte)S_BASE64CHAR[(i>>4)&0x3f];
- out[2] = (byte)S_BASE64CHAR[(i<<2)&0x3f];
- out[3] = (byte)S_BASE64PAD;
- ostream.write(out, 0, 4);
- }
- }
-
- /**
- * Outputs base64 representation of the specified byte array to a character stream.
- */
- public static void encode(byte[] data, int off, int len, Writer writer) throws IOException {
- if (len <= 0) return;
- char[] out = new char[4];
- int rindex = off;
- int rest = len-off;
- while (rest >= 3) {
- int i = ((data[rindex]&0xff)<<16)
- +((data[rindex+1]&0xff)<<8)
- +(data[rindex+2]&0xff);
- out[0] = S_BASE64CHAR[i>>18];
- out[1] = S_BASE64CHAR[(i>>12)&0x3f];
- out[2] = S_BASE64CHAR[(i>>6)&0x3f];
- out[3] = S_BASE64CHAR[i&0x3f];
- writer.write(out, 0, 4);
- rindex += 3;
- rest -= 3;
-/*
- if (output % 76 == 0)
- writer.write("\n");
-*/
- }
- if (rest == 1) {
- int i = data[rindex]&0xff;
- out[0] = S_BASE64CHAR[i>>2];
- out[1] = S_BASE64CHAR[(i<<4)&0x3f];
- out[2] = S_BASE64PAD;
- out[3] = S_BASE64PAD;
- writer.write(out, 0, 4);
- } else if (rest == 2) {
- int i = ((data[rindex]&0xff)<<8)+(data[rindex+1]&0xff);
- out[0] = S_BASE64CHAR[i>>10];
- out[1] = S_BASE64CHAR[(i>>4)&0x3f];
- out[2] = S_BASE64CHAR[(i<<2)&0x3f];
- out[3] = S_BASE64PAD;
- writer.write(out, 0, 4);
- }
- }
-
- /**
- * Outputs base64 representation of the specified input stream to a character stream.
- */
- public static void encode(InputStream stream, long len, Writer writer)
- throws IOException
- {
- if (len <= 0) return;
- char[] out = new char[4];
- long rest = len;
- while (rest >= 3) {
- int i = ((stream.read()&0xff)<<16)
- +((stream.read()&0xff)<<8)
- +(stream.read()&0xff);
- out[0] = S_BASE64CHAR[i>>18];
- out[1] = S_BASE64CHAR[(i>>12)&0x3f];
- out[2] = S_BASE64CHAR[(i>>6)&0x3f];
- out[3] = S_BASE64CHAR[i&0x3f];
- writer.write(out, 0, 4);
- rest -= 3;
- }
- if (rest == 1) {
- int i = stream.read()&0xff;
- out[0] = S_BASE64CHAR[i>>2];
- out[1] = S_BASE64CHAR[(i<<4)&0x3f];
- out[2] = S_BASE64PAD;
- out[3] = S_BASE64PAD;
- writer.write(out, 0, 4);
- } else if (rest == 2) {
- int i = ((stream.read()&0xff)<<8)+(stream.read()&0xff);
- out[0] = S_BASE64CHAR[i>>10];
- out[1] = S_BASE64CHAR[(i>>4)&0x3f];
- out[2] = S_BASE64CHAR[(i<<2)&0x3f];
- out[3] = S_BASE64PAD;
- writer.write(out, 0, 4);
- }
- }
-
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/BeanUtils.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/BeanUtils.java
deleted file mode 100644
index 5a686adbd543e..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/BeanUtils.java
+++ /dev/null
@@ -1,488 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-import org.jkiss.code.Nullable;
-
-import java.lang.invoke.MethodHandles;
-import java.lang.invoke.MethodType;
-import java.lang.reflect.*;
-import java.util.*;
-import java.util.function.Supplier;
-
-/**
- * BeanUtils
- */
-public class BeanUtils {
-
- public static boolean isGetterName(String name) {
- return name.startsWith("get") || name.startsWith("is") || name.startsWith("has");
- }
-
- public static String getPropertyNameFromGetter(String getterName) {
- if (getterName.startsWith("get")) {
- return
- Character.toLowerCase(getterName.charAt(3)) +
- getterName.substring(4);
- } else if (getterName.startsWith("is")) {
- return
- Character.toLowerCase(getterName.charAt(2)) +
- getterName.substring(3);
- } else if (getterName.startsWith("has")) {
- return
- Character.toLowerCase(getterName.charAt(3)) +
- getterName.substring(4);
- } else {
- // Unrecognized getter name
- return null;
- }
- }
-
- public static String getSetterName(String getterName) {
- if (getterName.startsWith("get")) {
- return "set" + getterName.substring(3);
- } else if (getterName.startsWith("is")) {
- return "set" + getterName.substring(2);
- } else if (getterName.startsWith("has")) {
- return "set" + getterName.substring(3);
- } else {
- // Unrecognized getter name
- return null;
- }
- }
-
- /**
- * Returns a set method matching the property name.
- */
- public static Method getSetMethod(Class cl, String propertyName) {
- Method method = getSetMethod(cl, propertyName, false);
-
- if (method != null) {
- return method;
- }
-
- return getSetMethod(cl, propertyName, true);
- }
-
- /**
- * Returns a set method matching the property name.
- */
- public static Method getSetMethod(
- Class cl,
- String propertyName,
- boolean ignoreCase) {
- String setName = "set" + propertyNameToMethodName(propertyName);
-
- return getSetMethod(
- cl.getMethods(),
- setName,
- ignoreCase);
- }
-
- /**
- * Returns a get method matching the property name.
- */
- public static Method getGetMethod(Class cl, String propertyName) {
- Method method = getGetMethod(cl, propertyName, false);
-
- return method != null ?
- method :
- getGetMethod(cl, propertyName, true);
- }
-
- /**
- * Returns a get method matching the property name.
- */
- public static Method getGetMethod(
- Class cl,
- String propertyName,
- boolean ignoreCase) {
- String methodName = propertyNameToMethodName(propertyName);
- return getGetMethod(
- cl.getMethods(),
- "get" + methodName,
- "is" + methodName,
- ignoreCase);
- }
-
- /**
- * Converts a user's property name to a bean method name.
- *
- * @param propertyName the user property name
- * @return the equivalent bean method name
- */
- public static String propertyNameToMethodName(String propertyName) {
- char ch = propertyName.charAt(0);
- if (Character.isLowerCase(ch))
- propertyName = Character.toUpperCase(ch) + propertyName.substring(1);
-
- return propertyName;
- }
-
- /**
- * Converts a user's property name to a bean method name.
- *
- * @param methodName the method name
- * @return the equivalent property name
- */
- public static String methodNameToPropertyName(String methodName) {
- if (methodName.startsWith("get"))
- methodName = methodName.substring(3);
- else if (methodName.startsWith("set"))
- methodName = methodName.substring(3);
- else if (methodName.startsWith("is"))
- methodName = methodName.substring(2);
-
- if (methodName.length() == 0)
- return null;
-
- char ch = methodName.charAt(0);
- if (Character.isUpperCase(ch) && (methodName.length() == 1 || !Character.isUpperCase(methodName.charAt(1)))) {
- methodName = Character.toLowerCase(ch) + methodName.substring(1);
- }
-
- return methodName;
- }
-
- public static boolean isArrayType(Type type) {
- return (type instanceof Class && ((Class) type).isArray());
- }
-
- public static boolean isCollectionType(Type type) {
- if (type instanceof Class && Collection.class.isAssignableFrom((Class) type)) {
-/*
- if (type instanceof ParameterizedType) {
- ParameterizedType pt = (ParameterizedType)type;
- if (pt.getActualTypeArguments().length == 1) {
- return true;
- }
- }
-*/
- return true;
- }
- return isArrayType(type);
- }
-
- public static Class getCollectionType(Type type) {
- if (type instanceof ParameterizedType) {
- ParameterizedType pt = (ParameterizedType) type;
- if (pt.getActualTypeArguments().length == 1) {
- final Type argType = pt.getActualTypeArguments()[0];
- if (argType instanceof Class) {
- return (Class) argType;
- } else if (argType instanceof WildcardType) {
- final Type[] upperBounds = ((WildcardType) argType).getUpperBounds();
- if (upperBounds.length > 0 && upperBounds[0] instanceof Class) {
- return (Class) upperBounds[0];
- }
- final Type[] lowerBounds = ((WildcardType) argType).getLowerBounds();
- if (lowerBounds.length > 0 && lowerBounds[0] instanceof Class) {
- return (Class) lowerBounds[0];
- }
- }
- }
- }
- return null;
- }
-
- public static Object readObjectProperty(Object object, String propName)
- throws IllegalAccessException, InvocationTargetException {
- if (propName.indexOf('.') == -1) {
- Method getter = getGetMethod(object.getClass(), propName);
- return getter == null ? null : getter.invoke(object);
- }
- // Parse property path
- StringTokenizer st = new StringTokenizer(propName, ".");
- Object value = object;
- while (value != null && st.hasMoreTokens()) {
- String pathItem = st.nextToken();
- Method getter = getGetMethod(value.getClass(), pathItem);
- if (getter == null) {
- return null;
- }
- value = getter.invoke(value);
- }
- return value;
- }
-
- /**
- * Finds the matching set method
- */
- private static Method getGetMethod(
- Method[] methods,
- String getName,
- String isName,
- boolean ignoreCase) {
- for (int i = 0; i < methods.length; i++) {
- Method method = methods[i];
-
- // The method must be public
- if (
- (!Modifier.isPublic(method.getModifiers())) ||
- (!Modifier.isPublic(method.getDeclaringClass().getModifiers())) ||
- (method.getParameterTypes().length != 0) ||
- (method.getReturnType().equals(void.class))) {
- continue;
- } else if (!ignoreCase && method.getName().equals(getName)) {
- // If it matches the get name, it's the right method
- return method;
- } else if (ignoreCase && method.getName().equalsIgnoreCase(getName)) {
- // If it matches the get name, it's the right method
- return method;
- } else if (!method.getReturnType().equals(boolean.class)) {
- // The is methods must return boolean
- continue;
- } else if (!ignoreCase && method.getName().equals(isName)) {
- // If it matches the is name, it must return boolean
- return method;
- } else if (ignoreCase && method.getName().equalsIgnoreCase(isName)) {
- // If it matches the is name, it must return boolean
- return method;
- }
- }
-
- return null;
- }
-
- /**
- * Finds the matching set method
- *
- * @param setName the method name
- */
- private static Method getSetMethod(
- Method[] methods,
- String setName,
- boolean ignoreCase) {
- for (int i = 0; i < methods.length; i++) {
- Method method = methods[i];
-
- // The method name must match
- if (
- !(ignoreCase ? method.getName().equalsIgnoreCase(setName) : method.getName().equals(setName)) ||
- !Modifier.isPublic(method.getModifiers()) ||
- !Modifier.isPublic(method.getDeclaringClass().getModifiers()) ||
- method.getParameterTypes().length != 1
- )
- continue;
-
- return method;
- }
-
- return null;
- }
-
- public static final Short DEFAULT_SHORT = (short) 0;
- public static final Integer DEFAULT_INTEGER = 0;
- public static final Long DEFAULT_LONG = 0L;
- public static final Float DEFAULT_FLOAT = (float) 0.0;
- public static final Double DEFAULT_DOUBLE = 0.0;
- public static final Byte DEFAULT_BYTE = (byte) 0;
- public static final Character DEFAULT_CHAR = (char) 0;
-
- public static boolean isBooleanType(Type paramClass) {
- return paramClass == Boolean.class || paramClass == Boolean.TYPE;
- }
-
- public static Object getDefaultPrimitiveValue(Class paramClass) {
- if (paramClass == Boolean.TYPE) {
- return Boolean.FALSE;
- } else if (paramClass == Short.TYPE) {
- return DEFAULT_SHORT;
- } else if (paramClass == Integer.TYPE) {
- return DEFAULT_INTEGER;
- } else if (paramClass == Long.TYPE) {
- return DEFAULT_LONG;
- } else if (paramClass == Float.TYPE) {
- return DEFAULT_FLOAT;
- } else if (paramClass == Double.TYPE) {
- return DEFAULT_DOUBLE;
- } else if (paramClass == Byte.TYPE) {
- return DEFAULT_BYTE;
- } else if (paramClass == Character.TYPE) {
- return DEFAULT_CHAR;
- } else {
- throw new IllegalArgumentException("Class " + paramClass.getName() + " is not primitive type");
- }
- }
-
- public static boolean isNumericType(Class paramClass) {
- return
- Number.class.isAssignableFrom(paramClass) ||
- paramClass == Short.TYPE ||
- paramClass == Integer.TYPE ||
- paramClass == Long.TYPE ||
- paramClass == Double.TYPE ||
- paramClass == Float.TYPE ||
- paramClass == Byte.TYPE;
- }
-
- public static Object invokeObjectMethod(Object object, String name, Class paramTypes[], Object args[])
- throws Throwable {
- Method method = object.getClass().getMethod(name, paramTypes);
- method.setAccessible(true);
- try {
- return method.invoke(object, args);
- } catch (InvocationTargetException e) {
- throw e.getTargetException();
- }
- }
-
- public static Object invokeObjectMethod(Object object, String name)
- throws Throwable {
- Method method = object.getClass().getMethod(name);
- method.setAccessible(true);
- try {
- return method.invoke(object);
- } catch (InvocationTargetException e) {
- throw e.getTargetException();
- }
- }
-
- @Nullable
- public static Object invokeObjectDeclaredMethod(
- @NotNull Object object,
- @NotNull String methodName,
- @NotNull Class[] paramTypes,
- @NotNull Object[] args) throws Throwable
- {
- for (Class cls = object.getClass(); cls != null; cls = cls.getSuperclass()) {
- for (Method method : cls.getDeclaredMethods()) {
- if (method.getName().equals(methodName) && Arrays.equals(method.getParameterTypes(), paramTypes)) {
- method.setAccessible(true);
- try {
- return method.invoke(object, args);
- } catch (InvocationTargetException e) {
- throw e.getTargetException();
- }
- }
- }
- }
- throw new NoSuchMethodException("Cannot find declared method " + methodName + "(" + Arrays.toString(paramTypes) + ")");
- }
-
- public static Object invokeStaticMethod(Class objectType, String name, Class paramTypes[], Object args[])
- throws Throwable {
- Method method = objectType.getMethod(name, paramTypes);
- method.setAccessible(true);
- try {
- return method.invoke(null, args);
- } catch (InvocationTargetException e) {
- throw e.getTargetException();
- }
- }
-
- public static Class findAssignableType(Class[] types, Class type) {
- for (Class childType : types) {
- if (type.isAssignableFrom(childType)) {
- return (Class) childType;
- }
- }
- return null;
- }
-
- /**
- * Determines the distance of the given object to the given class in the
- * inheritance tree.
- *
- * @param object the root object
- * @param clazz the class to determine the distance to
- * @return the distance of the object to the class. If the object is not an
- * instance of the class {@code -1} will return.
- */
- public static int getInheritanceDistance(Object object, Class clazz) {
- if (clazz.isInstance(object)) {
- int distance = 0;
- Class compared = object.getClass();
- while (compared != clazz) {
- compared = compared.getSuperclass();
- distance++;
- if (compared == Object.class) {
- break;
- }
- }
- return distance;
- } else {
- return -1;
- }
- }
-
- @SuppressWarnings("unchecked")
- public static T getFieldValue(@NotNull Object object, @NotNull String name) throws Throwable {
- final Field field = object.getClass().getDeclaredField(name);
- if (!field.canAccess(object)) {
- field.setAccessible(true);
- }
- return (T) field.get(object);
- }
-
- @Nullable
- public static Object handleObjectMethod(@NotNull Object proxy, @NotNull Method method, Object[] args) {
- switch (method.getName()) {
- case "toString":
- return "Proxy";
- case "hashCode":
- return System.identityHashCode(proxy);
- case "equals":
- return proxy == args[0];
- default:
- return null;
- }
- }
-
- @NotNull
- public static List deepCopy(@NotNull List src) {
- final List dst = tryInstantiateOrDefault(src.getClass(), ArrayList::new);
- for (T element : src) {
- dst.add(deepCopy(element));
- }
- return dst;
- }
-
- @NotNull
- public static Map deepCopy(@NotNull Map src) {
- final Map dst = tryInstantiateOrDefault(src.getClass(), LinkedHashMap::new);
- for (Map.Entry entry : src.entrySet()) {
- dst.put(entry.getKey(), deepCopy(entry.getValue()));
- }
- return dst;
- }
-
- @SuppressWarnings("unchecked")
- private static T deepCopy(@Nullable T object) {
- if (object == null) {
- return null;
- } else if (object instanceof Map) {
- return (T) deepCopy((Map) object);
- } else if (object instanceof List) {
- return (T) deepCopy((List) object);
- } else {
- return object;
- }
- }
-
- @SuppressWarnings("unchecked")
- @NotNull
- private static T tryInstantiateOrDefault(@NotNull Class cls, @NotNull Supplier supplier) {
- try {
- return (T) MethodHandles.lookup().findConstructor(cls, MethodType.methodType(void.class)).invoke();
- } catch (Throwable ignored) {
- return supplier.get();
- }
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/ByteNumberFormat.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/ByteNumberFormat.java
deleted file mode 100644
index f858287ac75a0..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/ByteNumberFormat.java
+++ /dev/null
@@ -1,180 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-
-import java.text.DecimalFormat;
-import java.text.FieldPosition;
-import java.text.NumberFormat;
-import java.text.ParsePosition;
-
-/**
- * Bytes formatter
- */
-public class ByteNumberFormat extends NumberFormat {
- private static final long serialVersionUID = 1;
-
- public static final Unit[] UNITS = Unit.values();
-
- private static final DecimalFormat fpFormat = new DecimalFormat("#.#");
-
- private final BinaryPrefix binaryPrefix;
-
- /**
- * Creates a new formatter.
- */
- public ByteNumberFormat() {
- binaryPrefix = BinaryPrefix.JEDEC;
- }
-
- public ByteNumberFormat(@NotNull BinaryPrefix binaryPrefix) {
- this.binaryPrefix = binaryPrefix;
- }
-
- public static int computeIndex(double bytes) {
- int index = 0;
-
- for (int i = 0; i < UNITS.length; i++) {
- int result = (int)(bytes / 1024);
- if (result == 0) {
- break;
- } else {
- bytes /= 1024;
- if (bytes < 1) {
- break;
- }
- index++;
- }
- }
-
- return index;
- }
-
- /**
- * Returns a string representing the bytes.
- *
- * @param bytes the number of bytes.
- *
- * @return A string.
- */
- public String getBytes(double bytes) {
-
- int index = computeIndex(bytes);
- if (index >= UNITS.length) {
- index = UNITS.length - 1;
- }
-
- double intBytes = bytes;
- if (intBytes == 0) {
- return String.valueOf(0);
- }
-
- for (int i = 0; i < index; i++) {
- intBytes /= 1024;
- }
-
-
- String str;
- if ((long)intBytes >= 10) {
- str = String.valueOf((long)intBytes);
- } else {
- str = fpFormat.format(intBytes);
- }
- final Unit unit = UNITS[index];
- if (unit == Unit.BYTE) {
- return str;
- }
- return str + (binaryPrefix == BinaryPrefix.ISO ? unit.isoPrefix : unit.jedecPrefix);
- }
-
- /**
- * Formats a number into the specified string buffer.
- *
- * @param number the number to format.
- * @param toAppendTo the string buffer.
- * @param pos the field position (ignored here).
- *
- * @return The string buffer.
- */
- @Override
- public StringBuffer format(double number, StringBuffer toAppendTo,
- FieldPosition pos) {
- return toAppendTo.append(getBytes(number));
- }
-
- /**
- * Formats a number into the specified string buffer.
- *
- * @param number the number to format.
- * @param toAppendTo the string buffer.
- * @param pos the field position (ignored here).
- *
- * @return The string buffer.
- */
- @Override
- public StringBuffer format(long number, StringBuffer toAppendTo,
- FieldPosition pos) {
- return toAppendTo.append(getBytes(number));
- }
-
- /**
- * This method returns null for all inputs. This class cannot
- * be used for parsing.
- *
- * @param source the source string.
- * @param parsePosition the parse position.
- *
- * @return null.
- */
- @Override
- public Number parse(String source, ParsePosition parsePosition) {
- return null;
- }
-
- private enum Unit {
- BYTE("B", "B"),
- KILOBYTE("K", "KiB"),
- MEGABYTE("M", "MiB"),
- GIGABYTE("G", "GiB"),
- TERABYTE("T", "TiB"),
- PETABYTE("P", "PiB");
-
- private final String jedecPrefix;
- private final String isoPrefix;
-
- Unit(String jedecPrefix, String isoPrefix) {
- this.jedecPrefix = jedecPrefix;
- this.isoPrefix = isoPrefix;
- }
- }
-
- /**
- * A unit prefix for multiples of byte.
- */
- public enum BinaryPrefix {
- /**
- * JEDEC-compliant prefixes (K, M, G, T, etc.). It's easy to confuse such prefixes with SI prefixes, leading to ambiguity.
- */
- JEDEC,
-
- /**
- * ISO 80000-13 format. This format explicitly states the binary nature of prefixes right in their names (kibi, mibi, gibi, etc.)
- */
- ISO,
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/CommonUtils.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/CommonUtils.java
deleted file mode 100644
index baad78ae23776..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/CommonUtils.java
+++ /dev/null
@@ -1,1066 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-import org.jkiss.code.Nullable;
-
-import java.lang.reflect.InvocationTargetException;
-import java.util.*;
-import java.util.function.Function;
-import java.util.regex.Matcher;
-import java.util.regex.Pattern;
-
-/**
- * Common utils
- */
-public class CommonUtils {
-
- public static final char PARAGRAPH_CHAR = (char) 182;
-
- public static boolean isJavaIdentifier(@NotNull CharSequence str) {
- if (str.length() == 0 || !Character.isJavaIdentifierStart(str.charAt(0))) {
- return false;
- }
- for (int i = 1; i < str.length(); i++) {
- if (!Character.isJavaIdentifierPart(str.charAt(i))) {
- return false;
- }
- }
- return true;
- }
-
- @NotNull
- public static String escapeJavaString(@NotNull String str) {
- StringBuilder res = new StringBuilder(str.length() + 5);
- for (int i = 0; i < str.length(); i++) {
- char c = str.charAt(i);
- switch (c) {
- case '"' -> res.append("\\\"");
- case '\n' -> res.append("\\n");
- case '\r' -> res.append("\\r");
- case '\t' -> res.append("\\t");
- default -> res.append(c);
- }
- }
- return res.toString();
- }
-
- @Nullable
- public static String escapeIdentifier(@Nullable String str) {
- if (str == null) {
- return null;
- }
- StringBuilder res = new StringBuilder(str.length());
- for (int i = 0; i < str.length(); i++) {
- char c = str.charAt(i);
- if (Character.isJavaIdentifierPart(c)) {
- res.append(c);
- } else {
- if (res.length() == 0 || res.charAt(res.length() - 1) != '_') {
- res.append('_');
- }
- }
- }
- return res.toString();
- }
-
- @NotNull
- public static String escapeFileName(@Nullable String str) {
- if (str == null) {
- return "";
- }
- StringBuilder res = new StringBuilder(str.length());
- for (int i = 0; i < str.length(); i++) {
- char c = str.charAt(i);
- if (Character.isISOControl(c) || c == '\\' || c == '/' || c == '<' || c == '>' || c == '|' || c == '"' || c == ':'
- || c == '*' || c == '?') {
- res.append('_');
- } else {
- res.append(c);
- }
- }
- return res.toString();
- }
-
- public static String makeDirectoryName(@NotNull String str) {
- if (!str.endsWith("/")) {
- str += "/";
- }
- return str;
- }
-
- @NotNull
- public static String removeTrailingSlash(@NotNull String str) {
- while (str.endsWith("/") || str.endsWith("\\")) {
- str = str.substring(0, str.length() - 1);
- }
- return str;
- }
-
- @NotNull
- public static String removeLeadingSlash(@NotNull String str) {
- while (str.startsWith("/") || str.startsWith("\\")) {
- str = str.substring(1);
- }
- return str;
- }
-
- public static String capitalizeWord(String str) {
- if (isEmpty(str) || Character.isUpperCase(str.charAt(0))) {
- return str;
- }
- return Character.toUpperCase(str.charAt(0)) + str.substring(1);
- }
-
-
- public static String toCamelCase(String str) {
- if (isEmpty(str)) {
- return str;
- }
-
- final StringBuilder ret = new StringBuilder(str.length());
-
- boolean isWordStart = true;
- for (int i = 0; i < str.length(); i++) {
- char ch = str.charAt(i);
- if (Character.isLetterOrDigit(ch)) {
- if (isWordStart) {
- ret.append(Character.toUpperCase(ch));
- isWordStart = false;
- } else {
- ret.append(Character.toLowerCase(ch));
- }
- } else {
- ret.append(ch);
- isWordStart = true;
- }
- }
-
- return ret.toString();
- }
-
- @NotNull
- public static T notNull(@Nullable T value, @NotNull T defaultValue) {
- return value != null ? value : defaultValue;
- }
-
- public static boolean isEmpty(@Nullable CharSequence value) {
- return value == null || value.length() == 0;
- }
-
- public static boolean isEmpty(@Nullable String value) {
- return value == null || value.length() == 0;
- }
-
- public static boolean isNotEmpty(@Nullable String value) {
- return !isEmpty(value);
- }
-
- public static boolean isEmpty(@Nullable Collection value) {
- return value == null || value.isEmpty();
- }
-
- public static boolean isEmpty(@Nullable Map value) {
- return value == null || value.isEmpty();
- }
-
- @Nullable
- public static T getFirstOrNull(@NotNull Iterable iterable) {
- Iterator iterator = iterable.iterator();
- if (iterator.hasNext()) {
- return iterator.next();
- }
- return null;
- }
-
- @NotNull
- public static Collection safeCollection(@Nullable Collection theList) {
- if (theList == null) {
- theList = Collections.emptyList();
- }
- return theList;
- }
-
- @NotNull
- public static List singletonOrEmpty(@Nullable T object) {
- if (object == null) {
- return Collections.emptyList();
- }
- return Collections.singletonList(object);
- }
-
- @NotNull
- public static List safeList(@Nullable List theList) {
- if (theList == null) {
- theList = Collections.emptyList();
- }
- return theList;
- }
-
- @NotNull
- public static List copyList(@Nullable Collection theList) {
- if (theList == null) {
- return new ArrayList<>();
- } else {
- return new ArrayList<>(theList);
- }
- }
-
- /**
- * Swaps the element with its neighbor to the left in the specified list.
- * If the element is not present in the list or it is the leftmost element in the list,
- * the list remains unchanged.
- *
- * @param list list
- * @param element element
- * @param type of the list
- */
- public static void shiftLeft(@NotNull List list, @NotNull T element) {
- int idx = list.indexOf(element);
- if (idx > 0) {
- Collections.swap(list, idx - 1, idx);
- }
- }
-
- /**
- * Swaps the element with its neighbor to the right in the specified list.
- * If the element is not present in the list or it is the rightmost element in the list,
- * the list remains unchanged.
- *
- * @param list list
- * @param element element
- * @param type of the list
- */
- public static void shiftRight(@NotNull List list, @NotNull T element) {
- int idx = list.indexOf(element);
- if (idx != -1 && idx != list.size() - 1) {
- Collections.swap(list, idx, idx + 1);
- }
- }
-
- @NotNull
- public static String notEmpty(@Nullable String value) {
- return value == null ? "" : value;
- }
-
- @Nullable
- public static String nullIfEmpty(@Nullable String value) {
- return value == null || value.isEmpty() ? null : value;
- }
-
- public static boolean isTrue(Boolean value) {
- return value != null && value;
- }
-
- public static boolean getBoolean(String value) {
- return Boolean.parseBoolean(value);
- }
-
- public static boolean getBoolean(@Nullable String value, boolean defaultValue) {
- return isEmpty(value) ? defaultValue : Boolean.parseBoolean(value);
- }
-
- public static boolean getBoolean(@Nullable Object value, boolean defaultValue) {
- if (value == null) {
- return defaultValue;
- } else if (value instanceof Boolean b) {
- return b;
- } else {
- return getBoolean(value.toString(), defaultValue);
- }
- }
-
- @NotNull
- public static String getLineSeparator() {
- String lineSeparator = System.getProperty(StandardConstants.ENV_LINE_SEPARATOR);
- return lineSeparator == null ? "\n" : lineSeparator;
- }
-
- @NotNull
- public static Throwable getRootCause(@NotNull Throwable ex) {
- Throwable rootCause = ex;
- for (; ; ) {
- if (rootCause.getCause() != null) {
- rootCause = rootCause.getCause();
- } else if (rootCause instanceof InvocationTargetException ite && ite.getTargetException() != null) {
- rootCause = ite.getTargetException();
- } else {
- break;
- }
- }
- return rootCause;
- }
-
- public static boolean equalObjects(@Nullable Object o1, @Nullable Object o2) {
- if (o1 == o2) {
- return true;
- }
- if (o1 == null || o2 == null) {
- return false;
- }
-// if (o1.getClass() != o2.getClass()) {
-// return false;
-// }
- return o1.equals(o2);
- }
-
- public static boolean equalOrEmptyStrings(@Nullable String s1, @Nullable String s2) {
- return equalObjects(s1, s2) || (isEmpty(s1) && isEmpty(s2));
- }
-
- public static boolean equalsContents(@Nullable Collection c1, @Nullable Collection c2) {
- if (CommonUtils.isEmpty(c1) && CommonUtils.isEmpty(c2)) {
- return true;
- }
- if (c1 == null || c2 == null || c1.size() != c2.size()) {
- return false;
- }
- for (Object o : c1) {
- if (!c2.contains(o)) {
- return false;
- }
- }
- return true;
- }
-
- @NotNull
- public static String toString(@Nullable Object object) {
- if (object == null) {
- return "";
- } else if (object instanceof String s) {
- return s;
- } else {
- String strValue = object.toString();
- return strValue == null ? "" : strValue;
- }
- }
-
- public static String toString(@Nullable Object object, String def) {
- if (object == null) {
- return def;
- } else if (object instanceof String s) {
- return s;
- } else {
- return object.toString();
- }
- }
-
- public static boolean toBoolean(@Nullable Object object) {
- return object != null && getBoolean(object.toString());
- }
-
- public static int toInt(@Nullable Object object, int def) {
- if (object == null) {
- return def;
- } else if (object instanceof Number n) {
- return n.intValue();
- } else {
- try {
- return Integer.parseInt(toString(object));
- } catch (NumberFormatException e) {
- try {
- return (int)Double.parseDouble(toString(object));
- } catch (NumberFormatException e1) {
- e1.printStackTrace();
- return def;
- }
- }
- }
- }
-
- public static int toInt(@Nullable Object object) {
- return toInt(object, 0);
- }
-
- public static boolean isInt(@Nullable Object object) {
- if (object == null) {
- return false;
- } else if (object instanceof Number) {
- return true;
- } else {
- try {
- Integer.parseInt(toString(object));
- return true;
- } catch (NumberFormatException e) {
- return false;
- }
- }
- }
- public static long toLong(@Nullable Object object) {
- return toLong(object, 0);
- }
-
- public static long toLong(@Nullable Object object, long defValue) {
- if (object == null) {
- return defValue;
- } else if (object instanceof Number n) {
- return n.longValue();
- } else {
- try {
- return Long.parseLong(toString(object));
- } catch (NumberFormatException e) {
- try {
- return (int)Double.parseDouble(toString(object));
- } catch (NumberFormatException e1) {
- return defValue;
- }
- }
- }
- }
-
- public static boolean isLong(@Nullable Object object) {
- if (object == null) {
- return false;
- } else if (object instanceof Number) {
- return true;
- } else {
- try {
- Long.parseLong(toString(object));
- return true;
- } catch (NumberFormatException e) {
- return false;
- }
- }
- }
-
- public static boolean isNumber(@Nullable Object object) {
- if (object == null) {
- return false;
- } else if (object instanceof Number) {
- return true;
- } else {
- try {
- Double.parseDouble(toString(object));
- return true;
- } catch (NumberFormatException e) {
- return false;
- }
- }
- }
-
- public static double toDouble(@Nullable Object object) {
- if (object == null) {
- return 0.0;
- } else if (object instanceof Number) {
- return ((Number) object).doubleValue();
- } else {
- try {
- return Double.parseDouble(toString(object));
- } catch (NumberFormatException e) {
- return Double.NaN;
- }
- }
- }
-
- public static double toDouble(@Nullable Object object, double def) {
- if (object == null) {
- return def;
- } else if (object instanceof Number) {
- return ((Number) object).doubleValue();
- } else {
- try {
- return Double.parseDouble(toString(object));
- } catch (NumberFormatException e) {
- return def;
- }
- }
- }
-
- public static float toFloat(@Nullable Object object) {
- if (object == null) {
- return 0.0f;
- } else if (object instanceof Number) {
- return ((Number) object).floatValue();
- } else {
- try {
- return Float.parseFloat(toString(object));
- } catch (NumberFormatException e) {
- return Float.NaN;
- }
- }
- }
-
- public static float toFloat(@Nullable Object object, float def) {
- if (object == null) {
- return def;
- } else if (object instanceof Number) {
- return ((Number) object).floatValue();
- } else {
- try {
- return Float.parseFloat(toString(object));
- } catch (NumberFormatException e) {
- return def;
- }
- }
- }
-
- public static boolean isNaN(@Nullable Object value) {
- return (value instanceof Float && ((Float) value).isNaN())
- || (value instanceof Double && ((Double) value).isNaN());
- }
-
- public static boolean isInfinite(@Nullable Object value) {
- return (value instanceof Float && ((Float) value).isInfinite())
- || (value instanceof Double && ((Double) value).isInfinite());
- }
-
- @NotNull
- public static String toHexString(@Nullable byte[] bytes) {
- return bytes == null ? "" : toHexString(bytes, 0, bytes.length);
- }
-
- final protected static char[] hexArray = "0123456789ABCDEF".toCharArray();
-
- @NotNull
- public static String toHexString(@Nullable byte[] bytes, int offset, int length) {
- if (bytes == null || bytes.length == 0) {
- return "";
- }
- char[] hexChars = new char[length * 2];
- for (int i = 0; i < length; i++) {
- int v = bytes[offset + i] & 0xFF;
- hexChars[i * 2] = hexArray[v >>> 4];
- hexChars[i * 2 + 1] = hexArray[v & 0x0F];
- }
- return new String(hexChars);
- }
-
- public static byte[] parseHexString(String hex) {
- int strLength = hex.length();
- byte[] data = new byte[strLength / 2];
- for (int i = 0; i < strLength; i += 2) {
- data[i / 2] = (byte) ((Character.digit(hex.charAt(i), 16) << 4) + Character.digit(hex.charAt(i+1), 16));
- }
- return data;
- }
-
- public static String toBinaryString(long longValue, int bitCount) {
- String strValue = Long.toString(longValue, 2);
- if (strValue.length() < bitCount) {
- char[] headZeroes = new char[bitCount - strValue.length()];
- Arrays.fill(headZeroes, '0');
- strValue = String.valueOf(headZeroes) + strValue;
- }
- return strValue;
- }
-
- public static String[] splitWithDelimiter(String s, String delimiter) {
- if (s == null) {
- return null;
- }
- String delimiterReplacement = "DRDRDR"; //$NON-NLS-1$
- s = s.replace(delimiter, delimiterReplacement + delimiter);
- return s.split(delimiterReplacement);
- }
-
- @NotNull
- public static List splitString(@Nullable String str, char delimiter) {
- if (CommonUtils.isEmpty(str)) {
- return Collections.emptyList();
- } else {
- List result = new ArrayList<>();
- StringTokenizer st = new StringTokenizer(str, String.valueOf(delimiter));
- while (st.hasMoreTokens()) {
- result.add(st.nextToken());
- }
- return result;
- }
- }
-
- @NotNull
- public static String[] split(@Nullable String str, String delimiter) {
- if (CommonUtils.isEmpty(str)) {
- return new String[0];
- } else {
- return str.split(delimiter);
- }
- }
-
- @NotNull
- public static String makeString(@Nullable List tokens, char delimiter) {
- if (tokens == null) {
- return "";
- } else if (tokens.size() == 1) {
- return tokens.get(0);
- } else {
- StringBuilder buf = new StringBuilder();
- for (String token : tokens) {
- if (buf.length() > 0) {
- buf.append(delimiter);
- }
- buf.append(token);
- }
- return buf.toString();
- }
- }
-
- @Nullable
- public static String truncateString(@Nullable String str, int maxLength) {
- if (str != null && str.length() > maxLength) {
- return str.substring(0, maxLength);
- }
- return str;
- }
-
- public static String joinStrings(String divider, String ... array) {
- if (array == null) return "";
- StringBuilder str = new StringBuilder();
- for (int i = 0; i < array.length; i++) {
- if (i > 0) str.append(divider);
- str.append(array[i]);
- }
- return str.toString();
- }
-
- public static String joinStrings(String divider, Collection col) {
- if (col == null) return "";
- StringBuilder str = new StringBuilder();
- for (String item : col) {
- if (str.length() > 0) str.append(divider);
- str.append(item);
- }
- return str.toString();
- }
-
- public static boolean isEmptyTrimmed(@Nullable String str) {
- return str == null || str.length() == 0 || str.trim().length() == 0;
- }
-
- public static boolean isBitSet(int value, int mask) {
- return (value & mask) == mask;
- }
-
- public static boolean isBitSet(long value, long mask) {
- return (value & mask) == mask;
- }
-
- @Nullable
- public static > T valueOf(@NotNull Class type, @Nullable String name) {
- return valueOf(type, name, null, false);
- }
-
- @Nullable
- public static > T valueOf(@NotNull Class type, @Nullable String name, T defValue, boolean underscoreSpaces) {
- if (name == null) {
- return defValue;
- }
- name = name.trim();
- if (name.length() == 0) {
- return defValue;
- }
- if (underscoreSpaces) {
- name = name.replace(' ', '_');
- }
- try {
- return Enum.valueOf(type, name);
- } catch (Exception e) {
- e.printStackTrace();
- return defValue;
- }
- }
-
- public static > T valueOf(Class enumType, String str, T defValue) {
- if (isEmpty(str)) {
- return defValue;
- }
- try {
- return Enum.valueOf(enumType, str);
- } catch (Exception e) {
- e.printStackTrace();
- return defValue;
- }
- }
-
- @NotNull
- public static T getItem(@NotNull Collection collection, int index) {
- if (collection instanceof List) {
- return ((List) collection).get(index);
- } else {
- Iterator iter = collection.iterator();
- for (int i = 0; i < index; i++) {
- iter.next();
- }
- return iter.next();
- }
- }
-
- @NotNull
- public static > T fromOrdinal(Class enumClass, int ordinal) {
- T[] enumConstants = enumClass.getEnumConstants();
- for (T value : enumConstants) {
- if (value.ordinal() == ordinal) {
- return value;
- }
- }
- IllegalArgumentException error = new IllegalArgumentException("Invalid ordinal " + ordinal + " for type " + enumClass.getName());
- if (enumConstants.length == 0) {
- throw error;
- } else {
- error.printStackTrace(System.err);
- return enumConstants[0];
- }
- }
-
- @NotNull
- public static List filterCollection(@NotNull Collection collection, @NotNull Class type) {
- List result = new ArrayList<>();
- for (Object item : collection) {
- if (type.isInstance(item)) {
- result.add(type.cast(item));
- }
- }
- return result;
- }
-
- @NotNull
- public static String escapeDisplayString(@NotNull final String delim) {
- StringBuilder str = new StringBuilder();
- for (int i = 0; i < delim.length(); i++) {
- char c = delim.charAt(i);
- if (c == '\n') {
- str.append("\\n");
- } else if (c == '\r') {
- str.append("\\r");
- } else if (c == '\t') {
- str.append("\\t");
- } else {
- str.append(c);
- }
- }
- return str.toString();
- }
-
- @NotNull
- public static String unescapeDisplayString(@NotNull final String delim) {
- return delim.replace("\\t", "\t").replace("\\n", "\n").replace("\\r", "\r");
- }
-
- public static int hashCode(@Nullable Object obj) {
- return obj == null ? 0 : obj.hashCode();
- }
-
- public static T getOption(Map options, String name, T defValue) {
- Object optionValue = options.get(name);
- if (optionValue == null) {
- return defValue;
- }
- return (T)optionValue;
- }
-
- public static boolean getOption(Map options, String name) {
- return getOption(options, name, false);
- }
-
- public static boolean getOption(Map options, String name, boolean defValue) {
- if (options == null) {
- return false;
- }
- Object optionValue = options.get(name);
- return getBoolean(optionValue, defValue);
- }
-
- public static Map makeStringMap(Map objMap) {
- Map strMap = new LinkedHashMap<>(objMap.size());
- for (Map.Entry e : objMap.entrySet()) {
- strMap.put(toString(e.getKey(), null), e.getValue());
- }
- return strMap;
- }
-
- public static String fixedLengthString(String string, int length) {
- return String.format("%1$"+length+ "s", string);
- }
-
- public static boolean startsWithIgnoreCase(@Nullable String str, @Nullable String startPart) {
- if (isEmpty(str) || isEmpty(startPart)) {
- return false;
- }
- return str.regionMatches(true, 0, startPart, 0, startPart.length());
- }
-
- public static String niceFormatFloat(float val) {
- if (val == (int) val)
- return String.valueOf((int)val);
- else
- return String.valueOf(val);
- }
-
- public static String niceFormatDouble(double val) {
- if (val == (long) val)
- return String.valueOf((long)val);
- else
- return String.valueOf(val);
- }
-
- public static String trim(String str) {
- return str == null ? null : str.trim();
- }
-
- public static String compactWhiteSpaces(String str) {
- return str.replaceAll("\\s+", " ");
- }
-
- public static String getSingleLineString(String displayString) {
- return displayString
- .replace('\n', PARAGRAPH_CHAR)
- .replace("\r", "")
- .replace("\t", " ")
- .replace((char)0, ' ');
- }
-
- public static int compare(Object o1, Object o2) {
- if (o1 == o2) {
- return 0;
- }
- if (o1 == null) {
- return -1;
- } else if (o2 == null) {
- return 1;
- }
- if (o1.getClass() == o2.getClass() && o1 instanceof Comparable) {
- return ((Comparable) o1).compareTo(o2);
- }
- return toString(o1).compareTo(toString(o2));
- }
-
- public static int compareNumbers(Number value1, Number value2) {
- double numDiff = value1.doubleValue() - value2.doubleValue();
- return numDiff < 0 ? -1 : (numDiff > 0 ? 1 : 0);
- }
-
- public static String cutExtraLines(String message, int maxLines) {
- if (message == null || message.indexOf('\n') == -1) {
- return message;
- }
- int lfCount = 0;
- StringBuilder buf = new StringBuilder();
- for (int i = 0; i < message.length(); i++) {
- char c = message.charAt(i);
- if (c == '\n') {
- lfCount++;
- }
- buf.append(c);
- if (lfCount == maxLines) {
- buf.append("...");
- break;
- }
- }
- return buf.toString();
- }
-
- public static boolean isSameDay(@NotNull Date date1, @NotNull Date date2) {
- Calendar cal1 = Calendar.getInstance();
- cal1.setTime(date1);
- Calendar cal2 = Calendar.getInstance();
- cal2.setTime(date2);
- return isSameDay(cal1, cal2);
- }
-
- public static boolean isSameDay(@NotNull Calendar cal1, @NotNull Calendar cal2) {
- return (cal1.get(Calendar.ERA) == cal2.get(Calendar.ERA) &&
- cal1.get(Calendar.YEAR) == cal2.get(Calendar.YEAR) &&
- cal1.get(Calendar.DAY_OF_YEAR) == cal2.get(Calendar.DAY_OF_YEAR));
- }
-
- public static String escapeBourneShellString(@NotNull String s) {
- return "'" + s.replace("'", "'\\''") + "'";
- }
-
- public static String unescapeBourneShellString(@NotNull String s) {
- if (!s.startsWith("'") || !s.endsWith("'") || s.length() < 2) { //not an escaped bourne shell string
- return s;
- }
- return s.substring(1, s.length() - 1).replace("'\\''", "'");
- }
-
- /**
- * Checks whether the supplied ch is within
- * the range of the specified radix value.
- *
- * @param ch character codepoint to be checked
- * @param radix desired radix
- * @return true if the character fits
- * into the radix, false otherwise
- */
- public static boolean isDigit(int ch, int radix) {
- if (radix <= 0 || radix > 36)
- return false;
- if (ch >= '0' && ch <= '9')
- return radix > ch - '0';
- if (ch >= 'a' && ch <= 'z')
- return radix > ch - 'a' + 10;
- if (ch >= 'A' && ch <= 'Z')
- return radix > ch - 'A' + 10;
- return false;
- }
-
- /**
- * Checks if the {@code index} is within the bounds of the range from
- * {@code 0} (inclusive) to {@code length} (exclusive).
- *
- * The {@code index} is defined to be out of bounds if any of the
- * following inequalities is true:
- *
- * - {@code index < 0}
- * - {@code index >= length}
- * - {@code length < 0}, which is implied from the former inequalities
- *
- *
- * @param index the index
- * @param length the upper-bound (exclusive) of the range
- * @return {@code true} if it is within bounds of the range
- */
- public static boolean isValidIndex(int index, int length) {
- return 0 <= index && index < length;
- }
-
- @NotNull
- public static String escapeHtml(@Nullable String text) {
- if (text == null) {
- return " ";
- }
- return text
- .replace("&", "&")
- .replace("<", "<")
- .replace(">", ">")
- .replace("\r\n", "
")
- .replace("\r", "
")
- .replace("\n", "
");
- }
-
- /**
- * Finds the object with the best matching name. Here we consider a case sensitive match better then a case insensitive one.
- *
- * @param objects container with objects
- * @param name to match
- * @param nameExtractor function which extracts the name from object
- * @param type of objects to search from
- * @return the best match or {@code null} if nothing found
- */
- @Nullable
- public static T findBestCaseAwareMatch(@NotNull Iterable objects, @NotNull String name,
- @NotNull Function nameExtractor) {
- T firstCaseInsensitiveMatch = null;
- for (T obj: objects) {
- String objectName = nameExtractor.apply(obj);
- if (name.equals(objectName)) { //case sensitive match
- return obj;
- }
- if (firstCaseInsensitiveMatch == null && name.equalsIgnoreCase(objectName)) {
- firstCaseInsensitiveMatch = obj;
- }
- }
- return firstCaseInsensitiveMatch;
- }
-
- /**
- * Groups values into a map of their shared key and a list of matching values using that key.
- *
- *
Group strings by their first character
- * {@code
- * final List values = Arrays.asList("aaa", "abb", "bbb", "bab", "ccc");
- * final Map> groups = group(values, x -> x.charAt(0));
- *
- * Assert.assertEquals(Arrays.asList("aaa", "abb"), groups.get('a'));
- * Assert.assertEquals(Arrays.asList("bbb", "bab"), groups.get('b'));
- * Assert.assertEquals(Arrays.asList("ccc"), groups.get('c'));
- * }
- * @param values values to group
- * @param keyExtractor a function that extracts key from value that is used to group values
- * @return map of a shared key and a list of matching values
- */
- @NotNull
- public static Map> group(@NotNull Collection values, @NotNull Function keyExtractor) {
- final Map> grouped = new HashMap<>();
- for (V value : values) {
- final K key = keyExtractor.apply(value);
- final List group = grouped.computeIfAbsent(key, k -> new ArrayList<>());
- group.add(value);
- }
- return grouped;
- }
-
- /**
- * Clamps given value to range between lower and upper bounds.
- *
- * @param value the value to clamp
- * @param min the lower boundary to clamp {@code value} to
- * @param max the upper boundary to clamp {@code value} to
- * @return {@code min} if {@code value} is less than {@code min}, {@code max} if {@code value} is greater than {@code max}, otherwise {@code value}
- */
- public static int clamp(int value, int min, int max) {
- return Math.max(min, Math.min(value, max));
- }
-
- /**
- * Replaces every subsequence of the input sequence that matches the
- * pattern with the result of applying the given replacer function to the
- * match result of this matcher corresponding to that subsequence.
- */
- @NotNull
- public static String replaceAll(@NotNull String input, @NotNull String regex, @NotNull Function replacer) {
- Matcher matcher = Pattern.compile(regex).matcher(input);
- StringBuilder sb = new StringBuilder();
- while (matcher.find()) {
- matcher.appendReplacement(sb, replacer.apply(matcher));
- }
- matcher.appendTail(sb);
- return sb.toString();
- }
-
- @SafeVarargs
- public static T[] array(T... elems) {
- return elems;
- }
-
- /**
- * Removes (single or multiple) starting '/' from {@code resourcePath} and replaces all '\' with '/'
- */
- @NotNull
- public static String normalizeResourcePath(@NotNull String resourcePath) {
- while (resourcePath.startsWith("/")) {
- resourcePath = resourcePath.substring(1);
- }
- resourcePath = resourcePath.replace('\\', '/');
- return resourcePath;
- }
-
- /**
- * Replaces the last {@code toReplace} entry in {@code string} with {@code replacement}
- */
- @NotNull
- public static String replaceLast(@NotNull String string, @NotNull String toReplace, @NotNull String replacement) {
- int pos = string.lastIndexOf(toReplace);
- if (pos > -1) {
- return string.substring(0, pos)
- + replacement
- + string.substring(pos + toReplace.length());
- } else {
- return string;
- }
- }
-
- /**
- * Sets prefix for sql queries params (f.e. schema names for tables)
- */
- @NotNull
- public static String normalizeTableNames(@NotNull String sql, @Nullable String prefix) {
- return sql.replaceAll("\\{table_prefix}", isEmpty(prefix) ? "" : prefix + ".");
- }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/IOUtils.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/IOUtils.java
deleted file mode 100644
index 27eeb4943acc4..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/IOUtils.java
+++ /dev/null
@@ -1,444 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.jkiss.utils;
-
-import org.jkiss.code.NotNull;
-import org.jkiss.code.Nullable;
-
-import java.io.*;
-import java.net.ServerSocket;
-import java.net.URI;
-import java.nio.Buffer;
-import java.nio.ByteBuffer;
-import java.nio.channels.Channels;
-import java.nio.channels.ReadableByteChannel;
-import java.nio.channels.WritableByteChannel;
-import java.nio.file.Files;
-import java.nio.file.InvalidPathException;
-import java.nio.file.Path;
-import java.nio.file.Paths;
-import java.nio.file.attribute.BasicFileAttributes;
-import java.util.Comparator;
-import java.util.zip.ZipEntry;
-import java.util.zip.ZipInputStream;
-import java.util.zip.ZipOutputStream;
-
-/**
- * Some IO helper functions
- */
-public final class IOUtils {
-
- public static final int DEFAULT_BUFFER_SIZE = 16384;
-
- private static final boolean USE_NIO_STREAMS = false;
-
- public static void close(Closeable closeable) {
- try {
- closeable.close();
- } catch (IOException e) {
- e.printStackTrace();
- }
- }
-
- public static void close(AutoCloseable closeable) {
- try {
- closeable.close();
- } catch (Exception e) {
- e.printStackTrace();
- }
- }
-
- public static void fastCopy(final InputStream src, final OutputStream dest) throws IOException {
- fastCopy(src, dest, DEFAULT_BUFFER_SIZE);
- }
-
- public static void fastCopy(final InputStream src, final OutputStream dest, int bufferSize) throws IOException {
- if (USE_NIO_STREAMS) {
- final ReadableByteChannel inputChannel = Channels.newChannel(src);
- final WritableByteChannel outputChannel = Channels.newChannel(dest);
- fastCopy(inputChannel, outputChannel, bufferSize);
- } else {
- copyStream(src, dest, bufferSize);
- }
- }
-
- public static void fastCopy(final ReadableByteChannel src, final WritableByteChannel dest, int bufferSize) throws IOException {
- final ByteBuffer buffer = ByteBuffer.allocateDirect(bufferSize);
-
- while (src.read(buffer) != -1) {
- flipBuffer(buffer);
- dest.write(buffer);
- buffer.compact();
- }
-
- flipBuffer(buffer);
-
- while (buffer.hasRemaining()) {
- dest.write(buffer);
- }
- }
-
- public static void flipBuffer(Buffer buffer) {
- buffer.flip();
- }
-
- public static void copyStream(
- java.io.InputStream inputStream,
- java.io.OutputStream outputStream)
- throws IOException {
- copyStream(inputStream, outputStream, DEFAULT_BUFFER_SIZE);
- }
-
- /**
- * Read entire input stream and writes all data to output stream
- * then closes input and flushed output
- */
- public static void copyStream(
- java.io.InputStream inputStream,
- java.io.OutputStream outputStream,
- int bufferSize)
- throws IOException {
- try {
- byte[] writeBuffer = new byte[bufferSize];
- for (int br = inputStream.read(writeBuffer); br != -1; br = inputStream.read(writeBuffer)) {
- outputStream.write(writeBuffer, 0, br);
- }
- outputStream.flush();
- } finally {
- // Close input stream
- inputStream.close();
- }
- }
-
- /**
- * Read entire input stream portion and writes it data to output stream
- */
- public static void copyStreamPortion(
- java.io.InputStream inputStream,
- java.io.OutputStream outputStream,
- int portionSize,
- int bufferSize)
- throws IOException {
- if (bufferSize > portionSize) {
- bufferSize = portionSize;
- }
- byte[] writeBuffer = new byte[bufferSize];
- int totalRead = 0;
- while (totalRead < portionSize) {
- int bytesToRead = bufferSize;
- if (bytesToRead > portionSize - totalRead) {
- bytesToRead = portionSize - totalRead;
- }
- int bytesRead = inputStream.read(writeBuffer, 0, bytesToRead);
- outputStream.write(writeBuffer, 0, bytesRead);
- totalRead += bytesRead;
- }
-
- // Close input stream
- outputStream.flush();
- }
-
- public static String toString(File file, String encoding) throws IOException {
- try (InputStream is = new FileInputStream(file)) {
- try (Reader reader = new InputStreamReader(is, encoding)) {
- StringWriter writer = new StringWriter();
- copyText(reader, writer, DEFAULT_BUFFER_SIZE);
- return writer.toString();
- }
- }
- }
-
- /**
- * Read entire reader content and writes it to writer
- * then closes reader and flushed output.
- */
- public static void copyText(
- java.io.Reader reader,
- java.io.Writer writer,
- int bufferSize)
- throws IOException {
- char[] writeBuffer = new char[bufferSize];
- for (int br = reader.read(writeBuffer); br != -1; br = reader.read(writeBuffer)) {
- writer.write(writeBuffer, 0, br);
- }
- writer.flush();
- }
-
- public static void copyText(
- java.io.Reader reader,
- java.io.Writer writer)
- throws IOException {
- copyText(reader, writer, DEFAULT_BUFFER_SIZE);
- }
-
- public static byte[] readFileToBuffer(File file) throws IOException {
- byte[] buffer = new byte[(int) file.length()];
- try (InputStream is = new FileInputStream(file)) {
- readStreamToBuffer(is, buffer);
- }
- return buffer;
- }
-
- public static void writeFileFromBuffer(File file, byte[] buffer) throws IOException {
- try (OutputStream os = new FileOutputStream(file)) {
- os.write(buffer);
- }
- }
-
- public static void writeFileFromString(File file, String str) throws IOException {
- try (Writer os = new FileWriter(file)) {
- os.write(str);
- }
- }
-
- public static int readStreamToBuffer(
- java.io.InputStream inputStream,
- byte[] buffer)
- throws IOException {
- int totalRead = 0;
- while (totalRead != buffer.length) {
- int br = inputStream.read(buffer, totalRead, buffer.length - totalRead);
- if (br == -1) {
- break;
- }
- totalRead += br;
- }
- return totalRead;
- }
-
- public static String readLine(java.io.InputStream input)
- throws IOException {
- StringBuilder linebuf = new StringBuilder();
- for (int b = input.read(); b != '\n'; b = input.read()) {
- if (b == -1) {
- if (linebuf.length() == 0) {
- return null;
- } else {
- break;
- }
- }
- if (b != '\r') {
- linebuf.append((char) b);
- }
- }
- return linebuf.toString();
- }
-
- public static String readFullLine(java.io.InputStream input)
- throws IOException {
- StringBuilder linebuf = new StringBuilder();
- for (int b = input.read(); ; b = input.read()) {
- if (b == -1) {
- if (linebuf.length() == 0) {
- return null;
- } else {
- break;
- }
- }
- linebuf.append((char) b);
- if (b == '\n') {
- break;
- }
- }
- return linebuf.toString();
- }
-
- public static int findFreePort(int minPort, int maxPort) {
- int portRange = Math.abs(maxPort - minPort);
- while (true) {
- int portNum = minPort + SecurityUtils.getRandom().nextInt(portRange);
- try {
- ServerSocket socket = new ServerSocket(portNum);
- try {
- socket.close();
- } catch (IOException e) {
- // just skip
- }
- return portNum;
- } catch (IOException e) {
- // Port is busy
- }
- }
- }
-
- public static String readToString(Reader is) throws IOException {
- StringBuilder result = new StringBuilder(4000);
- char[] buffer = new char[4000];
- for (; ; ) {
- int count = is.read(buffer);
- if (count <= 0) {
- break;
- }
- result.append(buffer, 0, count);
- }
- return result.toString();
- }
-
- static void copyZipStream(InputStream inputStream, OutputStream outputStream)
- throws IOException
- {
- byte[] writeBuffer = new byte[IOUtils.DEFAULT_BUFFER_SIZE];
- for (int br = inputStream.read(writeBuffer); br != -1; br = inputStream.read(writeBuffer)) {
- outputStream.write(writeBuffer, 0, br);
- }
- outputStream.flush();
- }
-
- public static void extractZipArchive(InputStream stream, Path targetFolder) throws IOException {
- try (ZipInputStream zipStream = new ZipInputStream(stream)) {
- for (; ; ) {
- ZipEntry zipEntry = zipStream.getNextEntry();
- if (zipEntry == null) {
- break;
- }
- try {
- if (!zipEntry.isDirectory()) {
- String zipEntryName = zipEntry.getName();
- checkAndExtractEntry(zipStream, zipEntry, targetFolder);
- }
- } finally {
- zipStream.closeEntry();
- }
- }
- }
- }
-
- private static void checkAndExtractEntry(InputStream zipStream, ZipEntry zipEntry, Path targetFolder) throws IOException {
- if (!Files.exists(targetFolder)) {
- try {
- Files.createDirectories(targetFolder);
- } catch (IOException e) {
- throw new IOException("Can't create local cache folder '" + targetFolder.toAbsolutePath() + "'", e);
- }
- }
- Path localFile = targetFolder.resolve(zipEntry.getName());
- if (!localFile.normalize().startsWith(targetFolder.normalize())) {
- throw new IOException("Zip entry is outside of the target directory");
- }
- if (Files.exists(localFile)) {
- // Already extracted?
- return;
- }
- Path localDir = localFile.getParent();
- if (!Files.exists(localDir)) { // in case of localFile located in subdirectory inside zip archive
- try {
- Files.createDirectories(localDir);
- } catch (IOException e) {
- throw new IOException("Can't create local file directory in the cache '" + localDir.toAbsolutePath() + "'", e);
- }
- }
- try (OutputStream os = Files.newOutputStream(localFile)) {
- copyZipStream(zipStream, os);
- }
- }
-
-
- public static void zipFolder(final File folder, final OutputStream outputStream) throws IOException {
- try (ZipOutputStream zipOutputStream = new ZipOutputStream(outputStream)) {
- processFolder(folder, zipOutputStream, folder.getPath().length() + 1);
- }
- }
-
- private static void processFolder(final File folder, final ZipOutputStream zipOutputStream, final int prefixLength) throws IOException {
- File[] folderFiles = folder.listFiles();
- if (folderFiles == null) {
- return;
- }
- for (File file : folderFiles) {
- BasicFileAttributes fAttrs = Files.readAttributes(file.toPath(), BasicFileAttributes.class);
- if (fAttrs.isRegularFile()) {
- final ZipEntry zipEntry = new ZipEntry(file.getPath().substring(prefixLength));
- zipOutputStream.putNextEntry(zipEntry);
- try (FileInputStream inputStream = new FileInputStream(file)) {
- IOUtils.copyStream(inputStream, zipOutputStream);
- }
- zipOutputStream.closeEntry();
- } else if (fAttrs.isDirectory()) {
- processFolder(file, zipOutputStream, prefixLength);
- }
- }
- }
- public static void deleteDirectory(@NotNull Path path) throws IOException {
- Files.walk(path)
- .sorted(Comparator.reverseOrder())
- .map(Path::toFile)
- .forEach(File::delete);
- }
-
- @Nullable
- public static String getDirectoryPath(@NotNull String sPath) throws InvalidPathException {
- final Path path = Paths.get(sPath);
- if (Files.isDirectory(path)) {
- return path.toString();
- } else {
- final Path parent = path.getParent();
- if (parent != null) {
- return parent.toString();
- }
- }
- return null;
- }
-
- @NotNull
- public static String getFileNameWithoutExtension(Path file) {
- String fileName = file.getFileName().toString();
- int divPos = fileName.lastIndexOf('.');
- if (divPos != -1) {
- return fileName.substring(0, divPos);
- }
- return fileName;
- }
-
- @Nullable
- public static String getFileExtension(Path file) {
- String fileName = file.getFileName().toString();
- return getFileExtension(fileName);
- }
-
- @Nullable
- public static String getFileExtension(String fileName) {
- int divPos = fileName.lastIndexOf('.');
- if (divPos != -1) {
- return fileName.substring(divPos + 1);
- }
- return null;
- }
-
- @NotNull
- public static Path getPathFromString(@NotNull String pathOrUri) {
- if (pathOrUri.contains("://")) {
- return Path.of(URI.create(pathOrUri));
- } else {
- return Path.of(pathOrUri);
- }
- }
-
-
- public static boolean isLocalFile(String filePath) {
- return !filePath.contains("://") || filePath.startsWith("file:");
- }
-
- public static boolean isLocalURI(URI uri) {
- return uri.getScheme().equals("file");
- }
-
- public static boolean isLocalPath(Path filePath) {
- return isLocalURI(filePath.toUri());
- }
-
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/IntKeyMap.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/IntKeyMap.java
deleted file mode 100644
index b97960eee9c7f..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/IntKeyMap.java
+++ /dev/null
@@ -1,807 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import java.util.*;
-
-/**
- Map with int key.
-*/
-@SuppressWarnings("unchecked")
-public class IntKeyMap implements Map {
- /**
- * The default initial capacity - MUST be a power of two.
- */
- static final int DEFAULT_INITIAL_CAPACITY = 16;
-
- /**
- * The maximum capacity, used if a higher value is implicitly specified
- * by either of the constructors with arguments.
- * MUST be a power of two <= 1<<30.
- */
- static final int MAXIMUM_CAPACITY = 1 << 30;
-
- /**
- * The load fast used when none specified in constructor.
- **/
- static final float DEFAULT_LOAD_FACTOR = 0.75f;
-
- /**
- * The table, resized as necessary. Length MUST Always be a power of two.
- */
- transient IntEntry[] table;
-
- /**
- * The number of key-value mappings contained in this identity hash map.
- */
- transient int size;
-
- /**
- * The next size value at which to resize (capacity * load factor).
- * @serial
- */
- int threshold;
-
- /**
- * The load factor for the hash table.
- *
- * @serial
- */
- final float loadFactor;
-
- /**
- * The number of times this IntKeyMap has been structurally modified
- */
- transient volatile int modCount;
-
- /**
- * Constructs an empty IntKeyMap with the specified initial
- * capacity and load factor.
- *
- * @param initialCapacity The initial capacity.
- * @param loadFactor The load factor.
- * @throws IllegalArgumentException if the initial capacity is negative
- * or the load factor is nonpositive.
- */
- public IntKeyMap(int initialCapacity, float loadFactor) {
- if (initialCapacity < 0)
- throw new IllegalArgumentException("Illegal initial capacity: " +
- initialCapacity);
- if (initialCapacity > MAXIMUM_CAPACITY)
- initialCapacity = MAXIMUM_CAPACITY;
- if (loadFactor <= 0 || Float.isNaN(loadFactor))
- throw new IllegalArgumentException("Illegal load factor: " +
- loadFactor);
-
- // Find a power of 2 >= initialCapacity
- int capacity = 1;
- while (capacity < initialCapacity)
- capacity <<= 1;
-
- this.loadFactor = loadFactor;
- threshold = (int)(capacity * loadFactor);
- table = new IntEntry[capacity];
- }
-
- /**
- * Constructs an empty IntKeyMap with the specified initial
- * capacity and the default load factor (0.75).
- *
- * @param initialCapacity the initial capacity.
- * @throws IllegalArgumentException if the initial capacity is negative.
- */
- public IntKeyMap(int initialCapacity) {
- this(initialCapacity, DEFAULT_LOAD_FACTOR);
- }
-
- /**
- * Constructs an empty IntKeyMap with the default initial capacity
- * (16) and the default load factor (0.75).
- */
- public IntKeyMap() {
- this.loadFactor = DEFAULT_LOAD_FACTOR;
- threshold = DEFAULT_INITIAL_CAPACITY;
- table = new IntEntry[DEFAULT_INITIAL_CAPACITY];
- }
-
- static int hash(long x) {
- int h = (int)(x ^ (x >>> 32));
- h += ~(h << 9);
- h ^= (h >>> 14);
- h += (h << 4);
- h ^= (h >>> 10);
- return h;
- }
-
- /**
- * Returns index for hash code h.
- */
- static int indexFor(int h, int length) {
- return h & (length-1);
- }
-
- /**
- * Returns the number of key-value mappings in this map.
- *
- * @return the number of key-value mappings in this map.
- */
- @Override
- public int size() {
- return size;
- }
-
- /**
- * Returns true if this map contains no key-value mappings.
- *
- * @return true if this map contains no key-value mappings.
- */
- @Override
- public boolean isEmpty()
- {
- return size == 0;
- }
-
- @Override
- public boolean containsKey(Object key)
- {
- return containsKey(((Number)key).intValue());
- }
-
- /**
- * Returns the value to which the specified key is mapped in this identity
- * hash map, or null if the map contains no mapping for this key.
- * A return value of null does not necessarily indicate
- * that the map contains no mapping for the key; it is also possible that
- * the map explicitly maps the key to null. The
- * containsKey method may be used to distinguish these two cases.
- *
- * @param key the key whose associated value is to be returned.
- * @return the value to which this map maps the specified key, or
- * null if the map contains no mapping for this key.
- * @see #put(int, Object)
- */
- public VALUE get(int key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- IntEntry e = table[i];
- while (true) {
- if (e == null)
- return null;
- if (e.hash == hash && key == e.key)
- return e.value;
- e = e.next;
- }
- }
-
- /**
- * Returns true if this map contains a mapping for the
- * specified key.
- */
- public boolean containsKey(int key)
- {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- IntEntry e = table[i];
- while (e != null) {
- if (e.hash == hash && key == e.key)
- return true;
- e = e.next;
- }
- return false;
- }
-
- /**
- * Returns the entry associated with the specified key in the
- * IntKeyMap. Returns null if the IntKeyMap contains no mapping
- * for this key.
- */
- IntEntry getEntry(int key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- IntEntry e = table[i];
- while (e != null && !(e.hash == hash && key == e.key))
- e = e.next;
- return e;
- }
-
- /**
- * Associates the specified value with the specified key in this map.
- * If the map previously contained a mapping for this key, the old
- * value is replaced.
- *
- * @param key key with which the specified value is to be associated.
- * @param value value to be associated with the specified key.
- * @return previous value associated with specified key, or null
- * if there was no mapping for key. A null return can
- * also indicate that the IntKeyMap previously associated
- * null with the specified key.
- */
- public VALUE put(int key, VALUE value) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
-
- for (IntEntry e = table[i]; e != null; e = e.next) {
- if (e.hash == hash && key == e.key) {
- VALUE oldValue = e.value;
- e.value = value;
- return oldValue;
- }
- }
-
- modCount++;
- addEntry(hash, key, value, i);
- return null;
- }
-
- /**
- * This method is used instead of put by constructors and
- * pseudoconstructors (clone, readObject). It does not resize the table,
- * check for comodification, etc. It calls createEntry rather than
- * addEntry.
- */
- private void putForCreate(int key, VALUE value) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
-
- /**
- * Look for preexisting entry for key. This will never happen for
- * clone or deserialize. It will only happen for construction if the
- * input Map is a sorted map whose ordering is inconsistent w/ equals.
- */
- for (IntEntry e = table[i]; e != null; e = e.next) {
- if (e.hash == hash && key == e.key) {
- e.value = value;
- return;
- }
- }
-
- createEntry(hash, key, value, i);
- }
-
- void putAllForCreate(IntKeyMap m) {
- for (Iterator i = m.entrySet().iterator(); i.hasNext(); ) {
- IntEntry e = (IntEntry) i.next();
- putForCreate(e.key, e.value);
- }
- }
-
- /**
- * Rehashes the contents of this map into a new IntKeyMap instance
- * with a larger capacity. This method is called automatically when the
- * number of keys in this map exceeds its capacity and load factor.
- *
- * @param newCapacity the new capacity, MUST be a power of two.
- */
- void resize(int newCapacity) {
- // assert (newCapacity & -newCapacity) == newCapacity; // power of 2
- IntEntry[] oldTable = table;
- int oldCapacity = oldTable.length;
-
- // check if needed
- if (size < threshold || oldCapacity > newCapacity)
- return;
-
- IntEntry[] newTable = new IntEntry[newCapacity];
- transfer(newTable);
- table = newTable;
- threshold = (int)(newCapacity * loadFactor);
- }
-
- /**
- * Transfer all entries from current table to newTable.
- */
- void transfer(IntEntry[] newTable) {
- IntEntry[] src = table;
- int newCapacity = newTable.length;
- for (int j = 0; j < src.length; j++) {
- IntEntry e = src[j];
- if (e != null) {
- src[j] = null;
- do {
- IntEntry next = e.next;
- int i = indexFor(e.hash, newCapacity);
- e.next = newTable[i];
- newTable[i] = e;
- e = next;
- } while (e != null);
- }
- }
- }
-
- /**
- * Copies all of the mappings from the specified map to this map
- * These mappings will replace any mappings that
- * this map had for any of the keys currently in the specified map.
- *
- * @param t mappings to be stored in this map.
- * @throws NullPointerException if the specified map is null.
- */
- public void putAll(IntKeyMap t) {
- // Expand enough to hold t's elements without resizing.
- int n = t.size();
- if (n == 0)
- return;
- if (n >= threshold) {
- n = (int)(n / loadFactor + 1);
- if (n > MAXIMUM_CAPACITY)
- n = MAXIMUM_CAPACITY;
- int capacity = table.length;
- while (capacity < n)
- capacity <<= 1;
- resize(capacity);
- }
-
- for (Iterator i = t.entrySet().iterator(); i.hasNext(); ) {
- IntEntry e = (IntEntry) i.next();
- put(e.key, e.value);
- }
- }
-
- /**
- * Removes the mapping for this key from this map if present.
- *
- * @param key key whose mapping is to be removed from the map.
- * @return previous value associated with specified key, or null
- * if there was no mapping for key. A null return can
- * also indicate that the map previously associated null
- * with the specified key.
- */
- public VALUE remove(int key) {
- IntEntry e = removeEntryForKey(key);
- return (e == null ? null : e.value);
- }
-
- /**
- * Removes and returns the entry associated with the specified key
- * in the IntKeyMap. Returns null if the IntKeyMap contains no mapping
- * for this key.
- */
- IntEntry removeEntryForKey(int key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- IntEntry prev = table[i];
- IntEntry e = prev;
-
- while (e != null) {
- IntEntry next = e.next;
- if (e.hash == hash && key == e.key) {
- modCount++;
- size--;
- if (prev == e)
- table[i] = next;
- else
- prev.next = next;
- return e;
- }
- prev = e;
- e = next;
- }
-
- return e;
- }
-
- /**
- * Special version of remove for EntrySet.
- */
- IntEntry removeMapping(Object o) {
- if (!(o instanceof IntEntry))
- return null;
-
- IntEntry entry = (IntEntry)o;
- int hash = hash(entry.key);
- int i = indexFor(hash, table.length);
- IntEntry prev = table[i];
- IntEntry e = prev;
-
- while (e != null) {
- IntEntry next = e.next;
- if (e.hash == hash && e.equals(entry)) {
- modCount++;
- size--;
- if (prev == e)
- table[i] = next;
- else
- prev.next = next;
- return e;
- }
- prev = e;
- e = next;
- }
-
- return e;
- }
-
- /**
- * Removes all mappings from this map.
- */
- @Override
- public void clear() {
- modCount++;
- IntEntry tab[] = table;
- for (int i = 0; i < tab.length; i++)
- tab[i] = null;
- size = 0;
- }
-
- /**
- * Returns true if this map maps one or more keys to the
- * specified value.
- *
- * @param value value whose presence in this map is to be tested.
- * @return true if this map maps one or more keys to the
- * specified value.
- */
- @Override
- public boolean containsValue(Object value)
- {
- if (value == null)
- return containsNullValue();
-
- IntEntry tab[] = table;
- for (int i = 0; i < tab.length ; i++)
- for (IntEntry e = tab[i] ; e != null ; e = e.next)
- if (value.equals(e.value))
- return true;
- return false;
- }
-
- @Override
- public VALUE get(Object key)
- {
- return get(((Number)key).intValue());
- }
-
- @Override
- public VALUE put(Integer key, VALUE value)
- {
- return put(key.intValue(), value);
- }
-
- @Override
- public VALUE remove(Object key)
- {
- return remove(((Number)key).intValue());
- }
-
- @Override
- public void putAll(Map t)
- {
- throw new UnsupportedOperationException();
- }
-
- /**
- * Special-case code for containsValue with null argument
- **/
- private boolean containsNullValue()
- {
- IntEntry tab[] = table;
- for (int i = 0; i < tab.length ; i++)
- for (IntEntry e = tab[i] ; e != null ; e = e.next)
- if (e.value == null)
- return true;
- return false;
- }
-
- public static class IntEntry implements Entry {
- final int key;
- VALUE value;
- final int hash;
- IntEntry next;
-
- /**
- * Create new entry.
- */
- IntEntry(int h, int k, VALUE v, IntEntry n) {
- value = v;
- next = n;
- key = k;
- hash = h;
- }
-
- public int getInt() {
- return key;
- }
-
- @Override
- public Integer getKey()
- {
- return key;
- }
-
- @Override
- public VALUE getValue() {
- return value;
- }
-
- @Override
- public VALUE setValue(VALUE newValue) {
- VALUE oldValue = value;
- value = newValue;
- return oldValue;
- }
-
- public boolean equals(Object o) {
- if (!(o instanceof IntEntry))
- return false;
- IntEntry e = (IntEntry)o;
- if (key == e.key) {
- VALUE v1 = getValue();
- VALUE v2 = e.getValue();
- if (v1 == v2 || (v1 != null && v1.equals(v2)))
- return true;
- }
- return false;
- }
-
- public int hashCode() {
- return hash(key) ^ (value==null ? 0 : value.hashCode());
- }
-
- public String toString() {
- return String.valueOf(key) + "=" + getValue();
- }
-
- }
-
- /**
- * Add a new entry with the specified key, value and hash code to
- * the specified bucket. It is the responsibility of this
- * method to resize the table if appropriate.
- *
- * Subclass overrides this to alter the behavior of put method.
- */
- void addEntry(int hash, int key, VALUE value, int bucketIndex) {
- table[bucketIndex] = new IntEntry<>(hash, key, value, table[bucketIndex]);
- if (size++ >= threshold)
- resize(2 * table.length);
- }
-
- /**
- * Like addEntry except that this version is used when creating entries
- * as part of Map construction or "pseudo-construction" (cloning,
- * deserialization). This version needn't worry about resizing the table.
- *
- * Subclass overrides this to alter the behavior of IntKeyMap(Map),
- * clone, and readObject.
- */
- void createEntry(int hash, int key, VALUE value, int bucketIndex) {
- table[bucketIndex] = new IntEntry<>(hash, key, value, table[bucketIndex]);
- size++;
- }
-
- private abstract class HashIterator implements Iterator {
- IntEntry next; // next entry to return
- int expectedModCount; // For fast-fail
- int index; // current slot
- IntEntry current; // current entry
-
- HashIterator() {
- expectedModCount = modCount;
- IntEntry[] t = table;
- int i = t.length;
- IntEntry n = null;
- if (size != 0) { // advance to first entry
- while (i > 0 && (n = t[--i]) == null)
- ;
- }
- next = n;
- index = i;
- }
-
- @Override
- public boolean hasNext() {
- return next != null;
- }
-
- IntEntry nextEntry() {
- if (modCount != expectedModCount)
- throw new ConcurrentModificationException();
- IntEntry e = next;
- if (e == null)
- throw new NoSuchElementException();
-
- IntEntry n = e.next;
- IntEntry[] t = table;
- int i = index;
- while (n == null && i > 0)
- n = t[--i];
- index = i;
- next = n;
- return current = e;
- }
-
- @Override
- public void remove() {
- if (current == null)
- throw new IllegalStateException();
- if (modCount != expectedModCount)
- throw new ConcurrentModificationException();
- int k = current.key;
- current = null;
- IntKeyMap.this.removeEntryForKey(k);
- expectedModCount = modCount;
- }
-
- }
-
- private class ValueIterator extends HashIterator {
- @Override
- public VALUE next() {
- return nextEntry().value;
- }
- }
-
- private class KeyIterator extends HashIterator {
- @Override
- public Integer next() {
- return nextEntry().key;
- }
- public int nextInt() {
- return nextEntry().key;
- }
- }
-
- private class EntryIterator extends HashIterator> {
- @Override
- public IntEntry next() {
- return nextEntry();
- }
- }
-
- // Subclass overrides these to alter behavior of views' iterator() method
- Iterator newKeyIterator()
- {
- return new KeyIterator();
- }
- Iterator newValueIterator()
- {
- return new ValueIterator();
- }
- Iterator> newEntryIterator()
- {
- return new EntryIterator();
- }
-
-
- // Views
-
- private transient Set> entrySet = null;
- transient volatile Set keySet = null;
- transient volatile Collection values = null;
-
- /**
- * Returns a set view of the keys contained in this map. The set is
- * backed by the map, so changes to the map are reflected in the set, and
- * vice-versa. The set supports element removal, which removes the
- * corresponding mapping from this map, via the Iterator.remove,
- * Set.remove, removeAll, retainAll, and
- * clear operations. It does not support the add or
- * addAll operations.
- *
- * @return a set view of the keys contained in this map.
- */
- @Override
- public Set keySet() {
- Set ks = keySet;
- return (ks != null ? ks : (keySet = new KeySet()));
- }
-
- private class KeySet extends AbstractSet {
- @Override
- public Iterator iterator() {
- return newKeyIterator();
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public boolean contains(Object o) {
- if (o instanceof Number) {
- return containsKey(((Number)o).intValue());
- } else {
- return false;
- }
- }
- @Override
- public boolean remove(Object o) {
- if (o instanceof Number) {
- return IntKeyMap.this.removeEntryForKey(((Number)o).intValue()) != null;
- } else {
- return false;
- }
- }
- @Override
- public void clear() {
- IntKeyMap.this.clear();
- }
- }
-
- /**
- * Returns a collection view of the values contained in this map. The
- * collection is backed by the map, so changes to the map are reflected in
- * the collection, and vice-versa. The collection supports element
- * removal, which removes the corresponding mapping from this map, via the
- * Iterator.remove, Collection.remove,
- * removeAll, retainAll, and clear operations.
- * It does not support the add or addAll operations.
- *
- * @return a collection view of the values contained in this map.
- */
- @Override
- public Collection values() {
- Collection vs = values;
- return (vs != null ? vs : (values = new Values()));
- }
-
- private class Values extends AbstractCollection {
- @Override
- public Iterator iterator() {
- return newValueIterator();
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public boolean contains(Object o) {
- return containsValue(o);
- }
- @Override
- public void clear() {
- IntKeyMap.this.clear();
- }
- }
-
- @Override
- public Set entrySet()
- {
- Set> es = entrySet;
- return (es != null ? es : (entrySet = new EntrySet()));
- }
-
- private class EntrySet extends AbstractSet> {
- @Override
- public Iterator> iterator() {
- return newEntryIterator();
- }
- @Override
- public boolean contains(Object o) {
- if (!(o instanceof IntEntry))
- return false;
- IntEntry e = (IntEntry)o;
- IntEntry candidate = getEntry(e.key);
- return candidate != null && candidate.equals(e);
- }
- @Override
- public boolean remove(Object o) {
- return removeMapping(o) != null;
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public void clear() {
- IntKeyMap.this.clear();
- }
- }
-
- // These methods are used when serializing HashSets
- int capacity() { return table.length; }
- float loadFactor() { return loadFactor; }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/LongKeyMap.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/LongKeyMap.java
deleted file mode 100644
index 40807b68422d0..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/LongKeyMap.java
+++ /dev/null
@@ -1,806 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import java.util.*;
-
-/**
- Map with long key.
-*/
-public class LongKeyMap implements Map {
- /**
- * The default initial capacity - MUST be a power of two.
- */
- static final int DEFAULT_INITIAL_CAPACITY = 16;
-
- /**
- * The maximum capacity, used if a higher value is implicitly specified
- * by either of the constructors with arguments.
- * MUST be a power of two <= 1<<30.
- */
- static final int MAXIMUM_CAPACITY = 1 << 30;
-
- /**
- * The load fast used when none specified in constructor.
- **/
- static final float DEFAULT_LOAD_FACTOR = 0.75f;
-
- /**
- * The table, resized as necessary. Length MUST Always be a power of two.
- */
- transient LongEntry[] table;
-
- /**
- * The number of key-value mappings contained in this identity hash map.
- */
- transient int size;
-
- /**
- * The next size value at which to resize (capacity * load factor).
- * @serial
- */
- int threshold;
-
- /**
- * The load factor for the hash table.
- *
- * @serial
- */
- final float loadFactor;
-
- /**
- * The number of times this LongKeyMap has been structurally modified
- */
- transient volatile int modCount;
-
- /**
- * Constructs an empty LongKeyMap with the specified initial
- * capacity and load factor.
- *
- * @param initialCapacity The initial capacity.
- * @param loadFactor The load factor.
- * @throws IllegalArgumentException if the initial capacity is negative
- * or the load factor is nonpositive.
- */
- public LongKeyMap(int initialCapacity, float loadFactor) {
- if (initialCapacity < 0)
- throw new IllegalArgumentException("Illegal initial capacity: " +
- initialCapacity);
- if (initialCapacity > MAXIMUM_CAPACITY)
- initialCapacity = MAXIMUM_CAPACITY;
- if (loadFactor <= 0 || Float.isNaN(loadFactor))
- throw new IllegalArgumentException("Illegal load factor: " +
- loadFactor);
-
- // Find a power of 2 >= initialCapacity
- int capacity = 1;
- while (capacity < initialCapacity)
- capacity <<= 1;
-
- this.loadFactor = loadFactor;
- threshold = (int)(capacity * loadFactor);
- table = new LongEntry[capacity];
- }
-
- /**
- * Constructs an empty LongKeyMap with the specified initial
- * capacity and the default load factor (0.75).
- *
- * @param initialCapacity the initial capacity.
- * @throws IllegalArgumentException if the initial capacity is negative.
- */
- public LongKeyMap(int initialCapacity) {
- this(initialCapacity, DEFAULT_LOAD_FACTOR);
- }
-
- /**
- * Constructs an empty LongKeyMap with the default initial capacity
- * (16) and the default load factor (0.75).
- */
- public LongKeyMap() {
- this.loadFactor = DEFAULT_LOAD_FACTOR;
- threshold = DEFAULT_INITIAL_CAPACITY;
- table = new LongEntry[DEFAULT_INITIAL_CAPACITY];
- }
-
- static int hash(long x) {
- int h = (int)(x ^ (x >>> 32));
- h += ~(h << 9);
- h ^= (h >>> 14);
- h += (h << 4);
- h ^= (h >>> 10);
- return h;
- }
-
- /**
- * Returns index for hash code h.
- */
- static int indexFor(int h, int length) {
- return h & (length-1);
- }
-
- /**
- * Returns the number of key-value mappings in this map.
- *
- * @return the number of key-value mappings in this map.
- */
- @Override
- public int size() {
- return size;
- }
-
- /**
- * Returns true if this map contains no key-value mappings.
- *
- * @return true if this map contains no key-value mappings.
- */
- @Override
- public boolean isEmpty()
- {
- return size == 0;
- }
-
- @Override
- public boolean containsKey(Object key)
- {
- return containsKey(((Number)key).longValue());
- }
-
- /**
- * Returns the value to which the specified key is mapped in this identity
- * hash map, or null if the map contains no mapping for this key.
- * A return value of null does not necessarily indicate
- * that the map contains no mapping for the key; it is also possible that
- * the map explicitly maps the key to null. The
- * containsKey method may be used to distinguish these two cases.
- *
- * @param key the key whose associated value is to be returned.
- * @return the value to which this map maps the specified key, or
- * null if the map contains no mapping for this key.
- * @see #put(long, Object)
- */
- public VALUE get(long key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- LongEntry e = table[i];
- while (true) {
- if (e == null)
- return null;
- if (e.hash == hash && key == e.key)
- return e.value;
- e = e.next;
- }
- }
-
- /**
- * Returns true if this map contains a mapping for the
- * specified key.
- */
- public boolean containsKey(long key)
- {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- LongEntry e = table[i];
- while (e != null) {
- if (e.hash == hash && key == e.key)
- return true;
- e = e.next;
- }
- return false;
- }
-
- /**
- * Returns the entry associated with the specified key in the
- * LongKeyMap. Returns null if the LongKeyMap contains no mapping
- * for this key.
- */
- LongEntry getEntry(long key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- LongEntry e = table[i];
- while (e != null && !(e.hash == hash && key == e.key))
- e = e.next;
- return e;
- }
-
- /**
- * Associates the specified value with the specified key in this map.
- * If the map previously contained a mapping for this key, the old
- * value is replaced.
- *
- * @param key key with which the specified value is to be associated.
- * @param value value to be associated with the specified key.
- * @return previous value associated with specified key, or null
- * if there was no mapping for key. A null return can
- * also indicate that the LongKeyMap previously associated
- * null with the specified key.
- */
- public VALUE put(long key, VALUE value) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
-
- for (LongEntry e = table[i]; e != null; e = e.next) {
- if (e.hash == hash && key == e.key) {
- VALUE oldValue = e.value;
- e.value = value;
- return oldValue;
- }
- }
-
- modCount++;
- addEntry(hash, key, value, i);
- return null;
- }
-
- /**
- * This method is used instead of put by constructors and
- * pseudoconstructors (clone, readObject). It does not resize the table,
- * check for comodification, etc. It calls createEntry rather than
- * addEntry.
- */
- private void putForCreate(long key, VALUE value) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
-
- /**
- * Look for preexisting entry for key. This will never happen for
- * clone or deserialize. It will only happen for construction if the
- * input Map is a sorted map whose ordering is inconsistent w/ equals.
- */
- for (LongEntry e = table[i]; e != null; e = e.next) {
- if (e.hash == hash && key == e.key) {
- e.value = value;
- return;
- }
- }
-
- createEntry(hash, key, value, i);
- }
-
- void putAllForCreate(LongKeyMap m) {
- for (Iterator> i = m.entrySet().iterator(); i.hasNext(); ) {
- LongEntry e = i.next();
- putForCreate(e.key, e.value);
- }
- }
-
- /**
- * Rehashes the contents of this map into a new LongKeyMap instance
- * with a larger capacity. This method is called automatically when the
- * number of keys in this map exceeds its capacity and load factor.
- *
- * @param newCapacity the new capacity, MUST be a power of two.
- */
- void resize(int newCapacity) {
- // assert (newCapacity & -newCapacity) == newCapacity; // power of 2
- LongEntry[] oldTable = table;
- int oldCapacity = oldTable.length;
-
- // check if needed
- if (size < threshold || oldCapacity > newCapacity)
- return;
-
- LongEntry[] newTable = new LongEntry[newCapacity];
- transfer(newTable);
- table = newTable;
- threshold = (int)(newCapacity * loadFactor);
- }
-
- /**
- * Transfer all entries from current table to newTable.
- */
- void transfer(LongEntry[] newTable) {
- LongEntry[] src = table;
- int newCapacity = newTable.length;
- for (int j = 0; j < src.length; j++) {
- LongEntry e = src[j];
- if (e != null) {
- src[j] = null;
- do {
- LongEntry next = e.next;
- int i = indexFor(e.hash, newCapacity);
- e.next = newTable[i];
- newTable[i] = e;
- e = next;
- } while (e != null);
- }
- }
- }
-
- /**
- * Copies all of the mappings from the specified map to this map
- * These mappings will replace any mappings that
- * this map had for any of the keys currently in the specified map.
- *
- * @param t mappings to be stored in this map.
- * @throws NullPointerException if the specified map is null.
- */
- public void putAll(LongKeyMap t) {
- // Expand enough to hold t's elements without resizing.
- int n = t.size();
- if (n == 0)
- return;
- if (n >= threshold) {
- n = (int)(n / loadFactor + 1);
- if (n > MAXIMUM_CAPACITY)
- n = MAXIMUM_CAPACITY;
- int capacity = table.length;
- while (capacity < n)
- capacity <<= 1;
- resize(capacity);
- }
-
- for (Iterator> i = t.entrySet().iterator(); i.hasNext(); ) {
- LongEntry e = i.next();
- put(e.key, e.value);
- }
- }
-
- /**
- * Removes the mapping for this key from this map if present.
- *
- * @param key key whose mapping is to be removed from the map.
- * @return previous value associated with specified key, or null
- * if there was no mapping for key. A null return can
- * also indicate that the map previously associated null
- * with the specified key.
- */
- public VALUE remove(long key) {
- LongEntry e = removeEntryForKey(key);
- return (e == null ? null : e.value);
- }
-
- /**
- * Removes and returns the entry associated with the specified key
- * in the LongKeyMap. Returns null if the LongKeyMap contains no mapping
- * for this key.
- */
- LongEntry removeEntryForKey(long key) {
- int hash = hash(key);
- int i = indexFor(hash, table.length);
- LongEntry prev = table[i];
- LongEntry e = prev;
-
- while (e != null) {
- LongEntry next = e.next;
- if (e.hash == hash && key == e.key) {
- modCount++;
- size--;
- if (prev == e)
- table[i] = next;
- else
- prev.next = next;
- return e;
- }
- prev = e;
- e = next;
- }
-
- return e;
- }
-
- /**
- * Special version of remove for EntrySet.
- */
- LongEntry removeMapping(Object o) {
- if (!(o instanceof LongEntry))
- return null;
-
- LongEntry entry = (LongEntry)o;
- int hash = hash(entry.key);
- int i = indexFor(hash, table.length);
- LongEntry prev = table[i];
- LongEntry e = prev;
-
- while (e != null) {
- LongEntry next = e.next;
- if (e.hash == hash && e.equals(entry)) {
- modCount++;
- size--;
- if (prev == e)
- table[i] = next;
- else
- prev.next = next;
- return e;
- }
- prev = e;
- e = next;
- }
-
- return e;
- }
-
- /**
- * Removes all mappings from this map.
- */
- @Override
- public void clear() {
- modCount++;
- LongEntry tab[] = table;
- for (int i = 0; i < tab.length; i++)
- tab[i] = null;
- size = 0;
- }
-
- /**
- * Returns true if this map maps one or more keys to the
- * specified value.
- *
- * @param value value whose presence in this map is to be tested.
- * @return true if this map maps one or more keys to the
- * specified value.
- */
- @Override
- public boolean containsValue(Object value)
- {
- if (value == null)
- return containsNullValue();
-
- LongEntry tab[] = table;
- for (int i = 0; i < tab.length ; i++)
- for (LongEntry e = tab[i] ; e != null ; e = e.next)
- if (value.equals(e.value))
- return true;
- return false;
- }
-
- @Override
- public VALUE get(Object key)
- {
- return get(((Number)key).longValue());
- }
-
- @Override
- public VALUE put(Long key, VALUE value)
- {
- return put(key.longValue(), value);
- }
-
- @Override
- public VALUE remove(Object key)
- {
- return remove(((Number)key).longValue());
- }
-
- @Override
- public void putAll(Map t)
- {
- throw new UnsupportedOperationException();
- }
-
- /**
- * Special-case code for containsValue with null argument
- **/
- private boolean containsNullValue()
- {
- LongEntry tab[] = table;
- for (int i = 0; i < tab.length ; i++)
- for (LongEntry e = tab[i] ; e != null ; e = e.next)
- if (e.value == null)
- return true;
- return false;
- }
-
- public static class LongEntry implements Entry {
- final long key;
- VALUE value;
- final int hash;
- LongEntry next;
-
- /**
- * Create new entry.
- */
- LongEntry(int h, long k, VALUE v, LongEntry n) {
- value = v;
- next = n;
- key = k;
- hash = h;
- }
-
- public long getLong() {
- return key;
- }
-
- @Override
- public Long getKey()
- {
- return key;
- }
-
- @Override
- public VALUE getValue() {
- return value;
- }
-
- @Override
- public VALUE setValue(VALUE newValue) {
- VALUE oldValue = value;
- value = newValue;
- return oldValue;
- }
-
- public boolean equals(Object o) {
- if (!(o instanceof LongEntry))
- return false;
- LongEntry e = (LongEntry)o;
- if (key == e.key) {
- VALUE v1 = getValue();
- VALUE v2 = e.getValue();
- if (v1 == v2 || (v1 != null && v1.equals(v2)))
- return true;
- }
- return false;
- }
-
- public int hashCode() {
- return hash(key) ^ (value==null ? 0 : value.hashCode());
- }
-
- public String toString() {
- return String.valueOf(key) + "=" + getValue();
- }
-
- }
-
- /**
- * Add a new entry with the specified key, value and hash code to
- * the specified bucket. It is the responsibility of this
- * method to resize the table if appropriate.
- *
- * Subclass overrides this to alter the behavior of put method.
- */
- void addEntry(int hash, long key, VALUE value, int bucketIndex) {
- table[bucketIndex] = new LongEntry<>(hash, key, value, table[bucketIndex]);
- if (size++ >= threshold)
- resize(2 * table.length);
- }
-
- /**
- * Like addEntry except that this version is used when creating entries
- * as part of Map construction or "pseudo-construction" (cloning,
- * deserialization). This version needn't worry about resizing the table.
- *
- * Subclass overrides this to alter the behavior of LongKeyMap(Map),
- * clone, and readObject.
- */
- void createEntry(int hash, long key, VALUE value, int bucketIndex) {
- table[bucketIndex] = new LongEntry<>(hash, key, value, table[bucketIndex]);
- size++;
- }
-
- private abstract class HashIterator implements Iterator {
- LongEntry next; // next entry to return
- int expectedModCount; // For fast-fail
- int index; // current slot
- LongEntry current; // current entry
-
- HashIterator() {
- expectedModCount = modCount;
- LongEntry[] t = table;
- int i = t.length;
- LongEntry n = null;
- if (size != 0) { // advance to first entry
- while (i > 0 && (n = t[--i]) == null)
- ;
- }
- next = n;
- index = i;
- }
-
- @Override
- public boolean hasNext() {
- return next != null;
- }
-
- LongEntry nextEntry() {
- if (modCount != expectedModCount)
- throw new ConcurrentModificationException();
- LongEntry e = next;
- if (e == null)
- throw new NoSuchElementException();
-
- LongEntry n = e.next;
- LongEntry[] t = table;
- int i = index;
- while (n == null && i > 0)
- n = t[--i];
- index = i;
- next = n;
- return current = e;
- }
-
- @Override
- public void remove() {
- if (current == null)
- throw new IllegalStateException();
- if (modCount != expectedModCount)
- throw new ConcurrentModificationException();
- long k = current.key;
- current = null;
- LongKeyMap.this.removeEntryForKey(k);
- expectedModCount = modCount;
- }
-
- }
-
- private class ValueIterator extends HashIterator {
- @Override
- public VALUE next() {
- return nextEntry().value;
- }
- }
-
- private class KeyIterator extends HashIterator {
- @Override
- public Long next() {
- return nextEntry().key;
- }
- public long nextLong() {
- return nextEntry().key;
- }
- }
-
- private class EntryIterator extends HashIterator> {
- @Override
- public LongEntry next() {
- return nextEntry();
- }
- }
-
- // Subclass overrides these to alter behavior of views' iterator() method
- Iterator newKeyIterator()
- {
- return new KeyIterator();
- }
- Iterator newValueIterator()
- {
- return new ValueIterator();
- }
- Iterator> newEntryIterator()
- {
- return new EntryIterator();
- }
-
-
- // Views
-
- private transient Set> entrySet = null;
- transient volatile Set keySet = null;
- transient volatile Collection values = null;
-
- /**
- * Returns a set view of the keys contained in this map. The set is
- * backed by the map, so changes to the map are reflected in the set, and
- * vice-versa. The set supports element removal, which removes the
- * corresponding mapping from this map, via the Iterator.remove,
- * Set.remove, removeAll, retainAll, and
- * clear operations. It does not support the add or
- * addAll operations.
- *
- * @return a set view of the keys contained in this map.
- */
- @Override
- public Set keySet() {
- Set ks = keySet;
- return (ks != null ? ks : (keySet = new KeySet()));
- }
-
- private class KeySet extends AbstractSet {
- @Override
- public Iterator iterator() {
- return newKeyIterator();
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public boolean contains(Object o) {
- if (o instanceof Number) {
- return containsKey(((Number)o).longValue());
- } else {
- return false;
- }
- }
- @Override
- public boolean remove(Object o) {
- if (o instanceof Number) {
- return LongKeyMap.this.removeEntryForKey(((Number)o).longValue()) != null;
- } else {
- return false;
- }
- }
- @Override
- public void clear() {
- LongKeyMap.this.clear();
- }
- }
-
- /**
- * Returns a collection view of the values contained in this map. The
- * collection is backed by the map, so changes to the map are reflected in
- * the collection, and vice-versa. The collection supports element
- * removal, which removes the corresponding mapping from this map, via the
- * Iterator.remove, Collection.remove,
- * removeAll, retainAll, and clear operations.
- * It does not support the add or addAll operations.
- *
- * @return a collection view of the values contained in this map.
- */
- @Override
- public Collection values() {
- Collection vs = values;
- return (vs != null ? vs : (values = new Values()));
- }
-
- private class Values extends AbstractCollection {
- @Override
- public Iterator iterator() {
- return newValueIterator();
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public boolean contains(Object o) {
- return containsValue(o);
- }
- @Override
- public void clear() {
- LongKeyMap.this.clear();
- }
- }
-
- @Override
- public Set entrySet()
- {
- Set> es = entrySet;
- return (es != null ? es : (entrySet = new EntrySet()));
- }
-
- private class EntrySet extends AbstractSet> {
- @Override
- public Iterator> iterator() {
- return newEntryIterator();
- }
- @Override
- public boolean contains(Object o) {
- if (!(o instanceof LongEntry))
- return false;
- LongEntry e = (LongEntry)o;
- LongEntry candidate = getEntry(e.key);
- return candidate != null && candidate.equals(e);
- }
- @Override
- public boolean remove(Object o) {
- return removeMapping(o) != null;
- }
- @Override
- public int size() {
- return size;
- }
- @Override
- public void clear() {
- LongKeyMap.this.clear();
- }
- }
-
- // These methods are used when serializing HashSets
- int capacity() { return table.length; }
- float loadFactor() { return loadFactor; }
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/MimeType.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/MimeType.java
deleted file mode 100644
index 8732a66eafd0d..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/MimeType.java
+++ /dev/null
@@ -1,90 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import java.util.Locale;
-
-/**
- * MIME type parser
- */
-public class MimeType {
-
- private String primaryType;
- private String subType;
-
- public MimeType() {
- primaryType = "application";
- subType = "*";
- }
-
- public MimeType(String rawdata) throws IllegalArgumentException {
- parse(rawdata);
- }
-
- public MimeType(String primary, String sub) {
- primaryType = primary.toLowerCase(Locale.ENGLISH);
- subType = sub.toLowerCase(Locale.ENGLISH);
- }
-
- private void parse(String rawdata) throws IllegalArgumentException {
- int slashIndex = rawdata.indexOf('/');
- int semIndex = rawdata.indexOf(';');
- if ((slashIndex < 0) && (semIndex < 0)) {
- primaryType = rawdata;
- subType = "*";
- } else if ((slashIndex < 0) && (semIndex >= 0)) {
- primaryType = rawdata.substring(0, semIndex);
- subType = "*";
- } else if ((slashIndex >= 0) && (semIndex < 0)) {
- primaryType = rawdata.substring(0, slashIndex).trim().toLowerCase(Locale.ENGLISH);
- subType = rawdata.substring(slashIndex + 1).trim().toLowerCase(Locale.ENGLISH);
- } else if (slashIndex < semIndex) {
- primaryType = rawdata.substring(0, slashIndex).trim().toLowerCase(Locale.ENGLISH);
- subType = rawdata.substring(slashIndex + 1, semIndex).trim().toLowerCase(Locale.ENGLISH);
- } else {
- // we have a ';' lexically before a '/' which means we
- // have a primary type and a parameter list but no sub type
- throw new IllegalArgumentException("Unable to find a sub type.");
- }
- }
-
- public String getPrimaryType() {
- return primaryType;
- }
-
- public String getSubType() {
- return subType;
- }
-
- public String toString() {
- return getBaseType();
- }
-
- public String getBaseType() {
- return primaryType + "/" + subType;
- }
-
- public boolean match(MimeType type) {
- return primaryType.equals(type.getPrimaryType()) &&
- (subType.equals("*") || type.getSubType().equals("*") || (subType.equals(type.getSubType())));
- }
-
- public boolean match(String rawdata) throws IllegalArgumentException {
- return match(new MimeType(rawdata));
- }
-
-}
\ No newline at end of file
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/Pair.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/Pair.java
deleted file mode 100644
index 44435f0687846..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/Pair.java
+++ /dev/null
@@ -1,87 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import java.util.Objects;
-
-/**
- * Pair
- */
-public class Pair {
- private T1 first;
- private T2 second;
-
- public Pair(T1 first, T2 second)
- {
- this.first = first;
- this.second = second;
- }
-
- public T1 getFirst()
- {
- return first;
- }
-
- public void setFirst(T1 first) {
- this.first = first;
- }
-
- public T2 getSecond()
- {
- return second;
- }
-
- public void setSecond(T2 second) {
- this.second = second;
- }
-
- @Override
- public String toString() {
- return first + "=" + second;
- }
-
- /**
- * Checks the two objects for equality by delegating to their respective
- * {@link Object#equals(Object)} methods.
- *
- * @param o the {@link Pair} to which this one is to be checked for equality
- * @return true if the underlying objects of the Pair are both considered
- * equal
- */
- @Override
- public boolean equals(Object o) {
- if (!(o instanceof Pair)) {
- return false;
- }
- Pair p = (Pair) o;
- return Objects.deepEquals(p.first, first) && Objects.deepEquals(p.second, second);
- }
-
- /**
- * Compute a hash code using the hash codes of the underlying objects
- * @return a hashcode of the Pair
- */
- @Override
- public int hashCode() {
- return (first == null ? 0 : first.hashCode()) ^ (second == null ? 0 : second.hashCode());
- }
-
- public static Pair of(T1 t1, T2 t2) {
- return new Pair<>(t1, t2);
- }
-
-}
diff --git a/bundles/org.jkiss.utils/src/org/jkiss/utils/ReaderWriterLock.java b/bundles/org.jkiss.utils/src/org/jkiss/utils/ReaderWriterLock.java
deleted file mode 100644
index 5209d637cab1c..0000000000000
--- a/bundles/org.jkiss.utils/src/org/jkiss/utils/ReaderWriterLock.java
+++ /dev/null
@@ -1,112 +0,0 @@
-/*
- * DBeaver - Universal Database Manager
- * Copyright (C) 2010-2024 DBeaver Corp and others
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-package org.jkiss.utils;
-
-import java.util.concurrent.locks.Lock;
-import java.util.concurrent.locks.ReentrantReadWriteLock;
-import java.util.function.Supplier;
-
-public class ReaderWriterLock {
-
- private final ReentrantReadWriteLock rwLock = new ReentrantReadWriteLock();
- private final Supplier mutatorSupplier;
-
- public ReaderWriterLock(Supplier