com.questdb.misc.Chars Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of questdb-core Show documentation
Show all versions of questdb-core Show documentation
QuestDB is High Performance Time Series Database
/*******************************************************************************
* ___ _ ____ ____
* / _ \ _ _ ___ ___| |_| _ \| __ )
* | | | | | | |/ _ \/ __| __| | | | _ \
* | |_| | |_| | __/\__ \ |_| |_| | |_) |
* \__\_\\__,_|\___||___/\__|____/|____/
*
* Copyright (C) 2014-2016 Appsicle
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see builder = new ThreadLocal<>();
private Chars() {
}
public static int compare(CharSequence l, CharSequence r) {
if (l == r) {
return 0;
}
if (l == null) {
return -1;
}
if (r == null) {
return 1;
}
int ll = l.length();
int rl = r.length();
if (ll < rl) {
return -1;
}
if (ll > rl) {
return 1;
}
for (int i = 0, n = ll < rl ? ll : rl; i < n; i++) {
int k = l.charAt(i) - r.charAt(i);
if (k != 0) {
return k;
}
}
return 0;
}
public static boolean contains(CharSequence _this, CharSequence that) {
int m = that.length();
if (m == 0) {
return false;
}
for (int i = 0, n = _this.length(); i < n; i++) {
if (_this.charAt(i) == that.charAt(0)) {
boolean found = true;
for (int k = 1; k < m && k + i < n; k++) {
if (_this.charAt(i + k) != that.charAt(k)) {
found = false;
break;
}
}
if (found) {
return true;
}
}
}
return false;
}
public static boolean equals(CharSequence l, CharSequence r) {
if (l == r) {
return true;
}
int ll;
if ((ll = l.length()) != r.length()) {
return false;
}
for (int i = 0; i < ll; i++) {
if (l.charAt(i) != r.charAt(i)) {
return false;
}
}
return true;
}
public static boolean equals(CharSequence l, char r) {
return l.length() == 1 && l.charAt(0) == r;
}
/**
* Compares two char sequences on assumption and right value is always lower case.
* Methods converts every char of right sequence before comparing to left sequence.
*
* @param l left sequence
* @param r right sequence
* @return true if sequences match exactly (ignoring char case)
*/
public static boolean equalsIgnoreCase(CharSequence l, CharSequence r) {
int ll;
if ((ll = l.length()) != r.length()) {
return false;
}
for (int i = 0; i < ll; i++) {
if (Character.toLowerCase(l.charAt(i)) != r.charAt(i)) {
return false;
}
}
return true;
}
public static boolean equalsNc(CharSequence l, CharSequence r) {
return r != null && equals(l, r);
}
public static String getFileName(CharSequence path) {
int pos = -1;
for (int i = 0, k = path.length(); i < k; i++) {
char c = path.charAt(i);
if (c == '\\' || c == '/') {
pos = i;
}
}
int l = path.length() - pos - 1;
if (l == 0) {
throw new JournalRuntimeException("Invalid path: %s", path);
}
char buf[] = builder.get();
if (buf == null || buf.length < l) {
builder.set(buf = new char[l]);
}
int p = 0;
for (int i = pos + 1, k = path.length(); i < k; i++) {
buf[p++] = path.charAt(i);
}
return new String(buf, 0, l);
}
public static int hashCode(CharSequence value) {
if (value.length() == 0) {
return 0;
}
int h = 0;
for (int p = 0, n = value.length(); p < n; p++) {
h = 31 * h + value.charAt(p);
}
return h;
}
public static int indexOf(CharSequence s, char c) {
return indexOf(s, 0, c);
}
public static int indexOf(CharSequence s, final int lo, char c) {
int i = lo;
for (int n = s.length(); i < n; i++) {
if (s.charAt(i) == c) {
return i;
}
}
return -1;
}
public static int lastIndexOf(CharSequence s, char c) {
for (int i = s.length() - 1; i > -1; i--) {
if (s.charAt(i) == c) {
return i;
}
}
return -1;
}
public static int put(long address, CharSequence value) {
int len = value.length();
Unsafe.getUnsafe().putInt(address, len);
long p = address + 4;
for (int i = 0; i < len; i++) {
Unsafe.getUnsafe().putChar(p + (i << 1), value.charAt(i));
}
return (len << 1) + 4;
}
public static void putCharsOnly(long address, CharSequence value) {
int len = value.length();
for (int i = 0; i < len; i++) {
Unsafe.getUnsafe().putChar(address + (i << 1), value.charAt(i));
}
}
public static boolean startsWith(CharSequence _this, CharSequence that) {
int len = that.length();
if (_this.length() < len) {
return false;
}
for (int i = 0; i < len; i++) {
if (_this.charAt(i) != that.charAt(i)) {
return false;
}
}
return true;
}
public static boolean startsWith(CharSequence _this, char c) {
return _this.length() > 0 && _this.charAt(0) == c;
}
public static String stripQuotes(String s) {
int l;
if (s == null || (l = s.length()) == 0) {
return s;
}
switch (s.charAt(0)) {
case '\'':
case '"':
case '`':
return s.substring(1, l - 1);
default:
return s;
}
}
public static String toString(CharSequence s) {
return s == null ? null : s.toString();
}
}