jetbrains.exodus.util.ByteIterableUtil Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of sonarlint-core Show documentation

Common library used by some SonarLint flavors

There is a newer version: 10.5.0.78949

/**
 * Copyright 2010 - 2022 JetBrains s.r.o.
 *
 * 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
 *
 * https://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 jetbrains.exodus.util;

import jetbrains.exodus.ByteIterable;
import org.jetbrains.annotations.NotNull;

public class ByteIterableUtil {

    private ByteIterableUtil() {
    }

    public static int compare(@NotNull final ByteIterable key1, @NotNull final ByteIterable key2) {
        return compare(key1.getBytesUnsafe(), key1.getLength(), key2.getBytesUnsafe(), key2.getLength());
    }

    public static int compare(@NotNull final byte[] key1, final int len1, @NotNull final byte[] key2, final int len2) {
        final int min = Math.min(len1, len2);

        for (int i = 0; i < min; i++) {
            final int cmp = (key1[i] & 0xff) - (key2[i] & 0xff);
            if (cmp != 0) {
                return cmp;
            }
        }

        return len1 - len2;
    }

    public static int compare(@NotNull final byte[] key1, final int len1, final int offset1, @NotNull final byte[] key2, final int len2) {
        final int min = Math.min(len1, len2);

        for (int i = 0; i < min; i++) {
            final int cmp = (key1[i + offset1] & 0xff) - (key2[i] & 0xff);
            if (cmp != 0) {
                return cmp;
            }
        }

        return len1 - len2;
    }

    public static int compare(@NotNull final byte[] key1, final int len1, final int offset1,
                              @NotNull final byte[] key2, final int len2, final int offset2) {
        final int min = Math.min(len1, len2);

        for (int i = 0; i < min; i++) {
            final int cmp = (key1[i + offset1] & 0xff) - (key2[i + offset2] & 0xff);
            if (cmp != 0) {
                return cmp;
            }
        }

        return len1 - len2;
    }
}