com.hazelcast.org.apache.calcite.util.Util Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to you 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 com.hazelcast.org.apache.calcite.util;
import com.hazelcast.org.apache.calcite.avatica.util.DateTimeUtils;
import com.hazelcast.org.apache.calcite.avatica.util.Spaces;
import com.hazelcast.org.apache.calcite.config.CalciteSystemProperty;
import com.hazelcast.org.apache.calcite.linq4j.Ord;
import com.hazelcast.org.apache.calcite.runtime.CalciteException;
import com.hazelcast.org.apache.calcite.sql.SqlAggFunction;
import com.hazelcast.org.apache.calcite.sql.SqlCall;
import com.hazelcast.org.apache.calcite.sql.SqlKind;
import com.hazelcast.org.apache.calcite.sql.SqlLiteral;
import com.hazelcast.org.apache.calcite.sql.SqlNode;
import com.hazelcast.org.apache.calcite.sql.SqlValuesOperator;
import com.hazelcast.org.apache.calcite.sql.fun.SqlRowOperator;
import com.hazelcast.org.apache.calcite.sql.util.SqlBasicVisitor;
import com.hazelcast.com.google.common.base.Preconditions;
import com.hazelcast.com.google.common.base.Throwables;
import com.hazelcast.com.google.common.cache.CacheBuilder;
import com.hazelcast.com.google.common.cache.CacheLoader;
import com.hazelcast.com.google.common.cache.LoadingCache;
import com.hazelcast.com.google.common.collect.Collections2;
import com.hazelcast.com.google.common.collect.ImmutableList;
import com.hazelcast.com.google.common.collect.ImmutableMap;
import com.hazelcast.com.google.common.collect.Sets;
import com.hazelcast.org.slf4j.Logger;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.StringReader;
import java.io.StringWriter;
import java.io.Writer;
import java.lang.reflect.Array;
import java.lang.reflect.Field;
import java.lang.reflect.Modifier;
import java.math.BigDecimal;
import java.net.MalformedURLException;
import java.net.URL;
import java.nio.charset.Charset;
import java.nio.charset.StandardCharsets;
import java.sql.Connection;
import java.sql.SQLException;
import java.sql.Statement;
import java.text.SimpleDateFormat;
import java.util.AbstractCollection;
import java.util.AbstractList;
import java.util.AbstractMap;
import java.util.AbstractSet;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Collection;
import java.util.Enumeration;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.Objects;
import java.util.Properties;
import java.util.RandomAccess;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TimeZone;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.jar.JarFile;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.stream.Collector;
import javax.annotation.Nonnull;
/**
* Miscellaneous utility functions.
*/
public class Util {
private Util() {}
//~ Static fields/initializers ---------------------------------------------
/**
* System-dependent newline character.
*
* In general, you should not use this in expected results of tests.
* Expected results should be the expected result on Linux (or Mac OS) using
* '\n'. Apply {@link Util#toLinux(String)} to Windows actual results, if
* necessary, to make them look like Linux actual.
*/
public static final String LINE_SEPARATOR =
System.getProperty("line.separator");
/**
* System-dependent file separator, for example, "/" or "\."
*/
public static final String FILE_SEPARATOR =
System.getProperty("file.separator");
/**
* Datetime format string for generating a timestamp string to be used as
* part of a filename. Conforms to SimpleDateFormat conventions.
*/
public static final String FILE_TIMESTAMP_FORMAT = "yyyy-MM-dd_HH_mm_ss";
/**
* Regular expression for a valid java identifier which contains no
* underscores and can therefore be returned intact by {@link #toJavaId}.
*/
private static final Pattern JAVA_ID_PATTERN =
Pattern.compile("[a-zA-Z_$][a-zA-Z0-9$]*");
private static final Charset DEFAULT_CHARSET =
Charset.forName(CalciteSystemProperty.DEFAULT_CHARSET.value());
/**
* Maps classes to the map of their enum values. Uses a weak map so that
* classes are not prevented from being unloaded.
*/
@SuppressWarnings("unchecked")
private static final LoadingCache> ENUM_CONSTANTS =
CacheBuilder.newBuilder()
.weakKeys()
.build(CacheLoader.from(Util::enumConstants));
//~ Methods ----------------------------------------------------------------
/**
* Does nothing with its argument. Returns whether it is ensured that
* the call produces a single value
*
* @param call the expression to evaluate
* @return Whether it is ensured that the call produces a single value
*/
public static boolean isSingleValue(SqlCall call) {
if (call.getOperator() instanceof SqlAggFunction) {
return true;
} else if (call.getOperator() instanceof SqlValuesOperator
|| call.getOperator() instanceof SqlRowOperator) {
List operands = call.getOperandList();
if (operands.size() == 1) {
SqlNode operand = operands.get(0);
if (operand instanceof SqlLiteral) {
return true;
} else if (operand instanceof SqlCall) {
return isSingleValue((SqlCall) operand);
}
}
return false;
} else {
boolean isScalar = true;
for (SqlNode operand : call.getOperandList()) {
if (operand instanceof SqlLiteral) {
continue;
}
if (!(operand instanceof SqlCall)
|| !Util.isSingleValue((SqlCall) operand)) {
isScalar = false;
break;
}
}
return isScalar;
}
}
/**
* Does nothing with its argument. Call this method when you have a value
* you are not interested in, but you don't want the compiler to warn that
* you are not using it.
*/
public static void discard(Object o) {
if (false) {
discard(o);
}
}
/**
* Does nothing with its argument. Call this method when you have a value
* you are not interested in, but you don't want the compiler to warn that
* you are not using it.
*/
public static void discard(int i) {
if (false) {
discard(i);
}
}
/**
* Does nothing with its argument. Call this method when you have a value
* you are not interested in, but you don't want the compiler to warn that
* you are not using it.
*/
public static void discard(boolean b) {
if (false) {
discard(b);
}
}
/**
* Does nothing with its argument. Call this method when you have a value
* you are not interested in, but you don't want the compiler to warn that
* you are not using it.
*/
public static void discard(double d) {
if (false) {
discard(d);
}
}
/**
* Records that an exception has been caught but will not be re-thrown. If
* the tracer is not null, logs the exception to the tracer.
*
* @param e Exception
* @param logger If not null, logs exception to this logger
*/
public static void swallow(
Throwable e,
Logger logger) {
if (logger != null) {
logger.debug("Discarding exception", e);
}
}
/**
* Returns whether two lists are equal to each other using shallow
* comparisons.
*
* @param list0 First list
* @param list1 Second list
* @return Whether lists are same length and all of their elements are
* equal using {@code ==} (may be null).
*/
public static boolean equalShallow(
List extends T> list0, List extends T> list1) {
if (list0.size() != list1.size()) {
return false;
}
for (int i = 0; i < list0.size(); i++) {
if (list0.get(i) != list1.get(i)) {
return false;
}
}
return true;
}
/**
* Combines two integers into a hash code.
*
* @deprecated Use {@link Objects#hash(Object...)}
*/
@Deprecated // to be removed before 2.0
public static int hash(
int i,
int j) {
return (i << 4) ^ j;
}
/**
* Computes a hash code from an existing hash code and an object (which may
* be null).
*
* @deprecated Use {@link Objects#hash(Object...)}
*/
@Deprecated // to be removed before 2.0
public static int hash(
int h,
Object o) {
int k = (o == null) ? 0 : o.hashCode();
return ((h << 4) | h) ^ k;
}
/**
* Computes a hash code from an existing hash code and an array of objects
* (which may be null).
*
* @deprecated Use {@link Objects#hash(Object...)}
*/
@Deprecated // to be removed before 2.0
public static int hashArray(
int h,
Object[] a) {
return h ^ Arrays.hashCode(a);
}
/** Computes the hash code of a {@code double} value. Equivalent to
* {@link Double}{@code .hashCode(double)}, but that method was only
* introduced in JDK 1.8.
*
* @param v Value
* @return Hash code
*
* @deprecated Use {@link com.hazelcast.org.apache.calcite.runtime.Utilities#hashCode(double)}
*/
@Deprecated // to be removed before 2.0
public static int hashCode(double v) {
long bits = Double.doubleToLongBits(v);
return (int) (bits ^ (bits >>> 32));
}
/**
* Returns a set of the elements which are in set1
but not in
* set2
, without modifying either.
*/
public static Set minus(Set set1, Set set2) {
if (set1.isEmpty()) {
return set1;
} else if (set2.isEmpty()) {
return set1;
} else {
Set set = new HashSet<>(set1);
set.removeAll(set2);
return set;
}
}
/**
* Computes nlogn(n)
using the natural logarithm (or
* n
if n < {@link Math#E}
, so the result is never
* negative.
*/
public static double nLogN(double d) {
return (d < Math.E) ? d : (d * Math.log(d));
}
/**
* Prints an object using reflection. We can handle null
;
* arrays of objects and primitive values; for regular objects, we print all
* public fields.
*/
public static void print(
PrintWriter pw,
Object o) {
print(pw, o, 0);
}
public static void print(
PrintWriter pw,
Object o,
int indent) {
if (o == null) {
pw.print("null");
return;
}
Class clazz = o.getClass();
if (o instanceof String) {
printJavaString(pw, (String) o, true);
} else if (
(clazz == Integer.class)
|| (clazz == Boolean.class)
|| (clazz == Character.class)
|| (clazz == Byte.class)
|| (clazz == Short.class)
|| (clazz == Long.class)
|| (clazz == Float.class)
|| (clazz == Double.class)
|| (clazz == Void.class)) {
pw.print(o.toString());
} else if (clazz.isArray()) {
// o is an array, but we can't cast to Object[] because it may be
// an array of primitives.
Object[] a; // for debug
if (o instanceof Object[]) {
a = (Object[]) o;
discard(a);
}
int n = Array.getLength(o);
pw.print("{");
for (int i = 0; i < n; i++) {
if (i > 0) {
pw.println(",");
} else {
pw.println();
}
for (int j = 0; j < indent; j++) {
pw.print("\t");
}
print(
pw,
Array.get(o, i),
indent + 1);
}
pw.print("}");
} else if (o instanceof Iterator) {
pw.print(clazz.getName());
Iterator iter = (Iterator) o;
pw.print(" {");
int i = 0;
while (iter.hasNext()) {
if (i++ > 0) {
pw.println(",");
}
print(
pw,
iter.next(),
indent + 1);
}
pw.print("}");
} else if (o instanceof Enumeration) {
pw.print(clazz.getName());
Enumeration e = (Enumeration) o;
pw.print(" {");
int i = 0;
while (e.hasMoreElements()) {
if (i++ > 0) {
pw.println(",");
}
print(
pw,
e.nextElement(),
indent + 1);
}
pw.print("}");
} else {
pw.print(clazz.getName());
pw.print(" {");
Field[] fields = clazz.getFields();
int printed = 0;
for (Field field : fields) {
if (Modifier.isStatic(field.getModifiers())) {
continue;
}
if (printed++ > 0) {
pw.println(",");
} else {
pw.println();
}
for (int j = 0; j < indent; j++) {
pw.print("\t");
}
pw.print(field.getName());
pw.print("=");
Object val;
try {
val = field.get(o);
} catch (IllegalAccessException e) {
throw new RuntimeException(e);
}
print(pw, val, indent + 1);
}
pw.print("}");
}
}
/**
* Prints a string, enclosing in double quotes (") and escaping if
* necessary. For example, printDoubleQuoted(w,"x\"y",false)
* prints "x\"y"
.
*
* The appendable where the value is printed must not incur I/O operations. This method is
* not meant to be used for writing the values to permanent storage.
*
* @throws IllegalStateException if the print to the specified appendable fails due to I/O
*/
public static void printJavaString(
Appendable appendable,
String s,
boolean nullMeansNull) {
try {
if (s == null) {
if (nullMeansNull) {
appendable.append("null");
}
} else {
String s1 = replace(s, "\\", "\\\\");
String s2 = replace(s1, "\"", "\\\"");
String s3 = replace(s2, "\n\r", "\\n");
String s4 = replace(s3, "\n", "\\n");
String s5 = replace(s4, "\r", "\\r");
appendable.append('"');
appendable.append(s5);
appendable.append('"');
}
} catch (IOException ioe) {
throw new IllegalStateException("The specified appendable should not incur I/O.", ioe);
}
}
public static void println(
PrintWriter pw,
Object o) {
print(pw, o, 0);
pw.println();
}
/**
* Formats a {@link BigDecimal} value to a string in scientific notation For
* example
*
*
* - A value of 0.00001234 would be formated as
1.234E-5
* - A value of 100000.00 would be formated as
1.00E5
* - A value of 100 (scale zero) would be formated as
*
1E2
*
*
* If bd
has a precision higher than 20, this method will
* truncate the output string to have a precision of 20 (no rounding will be
* done, just a truncate).
*/
public static String toScientificNotation(BigDecimal bd) {
final int truncateAt = 20;
String unscaled = bd.unscaledValue().toString();
if (bd.signum() < 0) {
unscaled = unscaled.substring(1);
}
int len = unscaled.length();
int scale = bd.scale();
int e = len - scale - 1;
StringBuilder ret = new StringBuilder();
if (bd.signum() < 0) {
ret.append('-');
}
// do truncation
unscaled =
unscaled.substring(
0,
Math.min(truncateAt, len));
ret.append(unscaled.charAt(0));
if (scale == 0) {
// trim trailing zeroes since they aren't significant
int i = unscaled.length();
while (i > 1) {
if (unscaled.charAt(i - 1) != '0') {
break;
}
--i;
}
unscaled = unscaled.substring(0, i);
}
if (unscaled.length() > 1) {
ret.append(".");
ret.append(unscaled.substring(1));
}
ret.append("E");
ret.append(e);
return ret.toString();
}
/**
* Replaces every occurrence of find
in s
with
* replace
.
*/
public static String replace(
String s,
String find,
String replace) {
// let's be optimistic
int found = s.indexOf(find);
if (found == -1) {
return s;
}
StringBuilder sb = new StringBuilder(s.length());
int start = 0;
for (;;) {
for (; start < found; start++) {
sb.append(s.charAt(start));
}
if (found == s.length()) {
break;
}
sb.append(replace);
start += find.length();
found = s.indexOf(find, start);
if (found == -1) {
found = s.length();
}
}
return sb.toString();
}
/**
* Creates a file-protocol URL for the given file.
*/
@Deprecated // to be removed before 2.0
public static URL toURL(File file) throws MalformedURLException {
String path = file.getAbsolutePath();
// This is a bunch of weird code that is required to
// make a valid URL on the Windows platform, due
// to inconsistencies in what getAbsolutePath returns.
String fs = System.getProperty("file.separator");
if (fs.length() == 1) {
char sep = fs.charAt(0);
if (sep != '/') {
path = path.replace(sep, '/');
}
if (path.charAt(0) != '/') {
path = '/' + path;
}
}
path = "file://" + path;
return new URL(path);
}
/**
* Gets a timestamp string for use in file names. The generated timestamp
* string reflects the current time.
*/
@Deprecated // to be removed before 2.0
public static String getFileTimestamp() {
SimpleDateFormat sdf =
new SimpleDateFormat(FILE_TIMESTAMP_FORMAT, Locale.ROOT);
return sdf.format(new java.util.Date());
}
/**
* Converts double-quoted Java strings to their contents. For example,
* "foo\"bar"
becomes foo"bar
.
*/
public static String stripDoubleQuotes(String value) {
assert value.charAt(0) == '"';
assert value.charAt(value.length() - 1) == '"';
String s5 = value.substring(1, value.length() - 1);
String s4 = Util.replace(s5, "\\r", "\r");
String s3 = Util.replace(s4, "\\n", "\n");
String s2 = Util.replace(s3, "\\\"", "\"");
String s1 = Util.replace(s2, "\\\\", "\\");
return s1;
}
/**
* Converts an arbitrary string into a string suitable for use as a Java
* identifier.
*
*
The mapping is one-to-one (that is, distinct strings will produce
* distinct java identifiers). The mapping is also reversible, but the
* inverse mapping is not implemented.
*
* A valid Java identifier must start with a Unicode letter, underscore,
* or dollar sign ($). The other characters, if any, can be a Unicode
* letter, underscore, dollar sign, or digit.
*
* This method uses an algorithm similar to URL encoding. Valid
* characters are unchanged; invalid characters are converted to an
* underscore followed by the hex code of the character; and underscores are
* doubled.
*
* Examples:
*
*
* toJavaId("foo")
returns "foo"
* toJavaId("foo bar")
returns "foo_20_bar"
* toJavaId("foo_bar")
returns "foo__bar"
* toJavaId("0bar")
returns "_40_bar"
(digits
* are illegal as a prefix)
* toJavaId("foo0bar")
returns "foo0bar"
*
*/
public static String toJavaId(
String s,
int ordinal) {
// If it's already a valid Java id (and doesn't contain any
// underscores), return it unchanged.
if (JAVA_ID_PATTERN.matcher(s).matches()) {
// prepend "ID$" to string so it doesn't clash with java keywords
return "ID$" + ordinal + "$" + s;
}
// Escape underscores and other undesirables.
StringBuilder buf = new StringBuilder(s.length() + 10);
buf.append("ID$");
buf.append(ordinal);
buf.append("$");
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (c == '_') {
buf.append("__");
} else if (
(c < 0x7F) /* Normal ascii character */
&& !Character.isISOControl(c)
&& ((i == 0) ? Character.isJavaIdentifierStart(c)
: Character.isJavaIdentifierPart(c))) {
buf.append(c);
} else {
buf.append("_");
buf.append(Integer.toString(c, 16));
buf.append("_");
}
}
return buf.toString();
}
/**
* Returns true when input string is a valid Java identifier.
* @param s input string
* @return true when input string is a valid Java identifier
*/
public static boolean isValidJavaIdentifier(String s) {
if (s.isEmpty()) {
return false;
}
if (!Character.isJavaIdentifierStart(s.codePointAt(0))) {
return false;
}
int i = 0;
while (i < s.length()) {
int codePoint = s.codePointAt(i);
if (!Character.isJavaIdentifierPart(codePoint)) {
return false;
}
i += Character.charCount(codePoint);
}
return true;
}
public static String toLinux(String s) {
return s.replace("\r\n", "\n");
}
/**
* Materializes the results of a {@link java.util.Iterator} as a
* {@link java.util.List}.
*
* @param iter iterator to materialize
* @return materialized list
*/
@Deprecated // to be removed before 2.0
public static List toList(Iterator iter) {
List list = new ArrayList<>();
while (iter.hasNext()) {
list.add(iter.next());
}
return list;
}
/**
* @return true if s==null or if s.length()==0
*/
public static boolean isNullOrEmpty(String s) {
return (null == s) || (s.length() == 0);
}
/**
* Converts a list of a string, with commas between elements.
*
* For example,
* commaList(Arrays.asList({"a", "b"}))
* returns "a, b".
*
* @param list List
* @return String representation of string
*/
public static String commaList(List list) {
return sepList(list, ", ");
}
/** Converts a list of a string, with a given separator between elements. */
public static String sepList(List list, String sep) {
final int max = list.size() - 1;
switch (max) {
case -1:
return "";
case 0:
return list.get(0).toString();
}
final StringBuilder buf = new StringBuilder();
for (int i = 0;; i++) {
buf.append(list.get(i));
if (i == max) {
return buf.toString();
}
buf.append(sep);
}
}
/**
* Returns the {@link Charset} object representing the value of
* {@link CalciteSystemProperty#DEFAULT_CHARSET}
*
* @throws java.nio.charset.IllegalCharsetNameException If the given charset
* name is illegal
* @throws java.nio.charset.UnsupportedCharsetException If no support for
* the named charset is
* available in this
* instance of the Java
* virtual machine
*/
public static Charset getDefaultCharset() {
return DEFAULT_CHARSET;
}
/** @deprecated Throw new {@link AssertionError} */
@Deprecated // to be removed before 2.0
public static Error newInternal() {
return new AssertionError("(unknown cause)");
}
/** @deprecated Throw new {@link AssertionError} */
@Deprecated // to be removed before 2.0
public static Error newInternal(String s) {
return new AssertionError(s);
}
/** @deprecated Throw new {@link RuntimeException} if checked; throw raw
* exception if unchecked or {@link Error} */
@Deprecated // to be removed before 2.0
public static Error newInternal(Throwable e) {
return new AssertionError(e);
}
/** @deprecated Throw new {@link AssertionError} if applicable;
* or {@link RuntimeException} if e is checked;
* or raw exception if e is unchecked or {@link Error}. */
public static Error newInternal(Throwable e, String s) {
return new AssertionError("Internal error: " + s, e);
}
/** As {@link Throwables}{@code .throwIfUnchecked(Throwable)},
* which was introduced in Guava 20,
* but we don't require Guava version 20 yet. */
public static void throwIfUnchecked(Throwable throwable) {
Bug.upgrade("Remove when minimum Guava version is 20");
Objects.requireNonNull(throwable);
if (throwable instanceof RuntimeException) {
throw (RuntimeException) throwable;
}
if (throwable instanceof Error) {
throw (Error) throwable;
}
}
/**
* Wraps an exception with {@link RuntimeException} and return it.
* If the exception is already an instance of RuntimeException,
* returns it directly.
*/
public static RuntimeException toUnchecked(Exception e) {
if (e instanceof RuntimeException) {
return (RuntimeException) e;
}
return new RuntimeException(e);
}
/**
* Retrieves messages in a exception and writes them to a string. In the
* string returned, each message will appear on a different line.
*
* @return a non-null string containing all messages of the exception
*/
@Deprecated // to be removed before 2.0
public static String getMessages(Throwable t) {
StringBuilder sb = new StringBuilder();
for (Throwable curr = t; curr != null; curr = curr.getCause()) {
String msg =
((curr instanceof CalciteException)
|| (curr instanceof SQLException)) ? curr.getMessage()
: curr.toString();
if (sb.length() > 0) {
sb.append("\n");
}
sb.append(msg);
}
return sb.toString();
}
/**
* Returns the stack trace of a throwable. Called from native code.
*
* @param t Throwable
* @return Stack trace
*
* @deprecated Use {@link com.hazelcast.com.google.common.base.Throwables#getStackTraceAsString(Throwable)}
*/
@Deprecated // to be removed before 2.0
public static String getStackTrace(Throwable t) {
final StringWriter sw = new StringWriter();
final PrintWriter pw = new PrintWriter(sw);
t.printStackTrace(pw);
pw.flush();
return sw.toString();
}
/** @deprecated Use {@link Preconditions#checkArgument}
* or {@link Objects#requireNonNull(Object)} */
@Deprecated // to be removed before 2.0
public static void pre(boolean b, String description) {
if (!b) {
throw new AssertionError("pre-condition failed: " + description);
}
}
/** @deprecated Use {@link Preconditions#checkArgument}
* or {@link Objects#requireNonNull(Object)} */
@Deprecated // to be removed before 2.0
public static void post(boolean b, String description) {
if (!b) {
throw new AssertionError("post-condition failed: " + description);
}
}
/** @deprecated Use {@link Preconditions#checkArgument} */
@Deprecated // to be removed before 2.0
public static void permAssert(boolean b, String description) {
if (!b) {
throw new AssertionError("invariant violated: " + description);
}
}
/**
* Returns a {@link java.lang.RuntimeException} indicating that a particular
* feature has not been implemented, but should be.
*
* If every 'hole' in our functionality uses this method, it will be
* easier for us to identity the holes. Throwing a
* {@link java.lang.UnsupportedOperationException} isn't as good, because
* sometimes we actually want to partially implement an API.
*
*
Example usage:
*
*
* class MyVisitor extends BaseVisitor {
* void accept(Foo foo) {
* // Exception will identify which subclass forgot to override
* // this method
* throw Util.needToImplement(this);
* }
* }
*
*
* @param o The object which was the target of the call, or null. Passing
* the object gives crucial information if a method needs to be
* overridden and a subclass forgot to do so.
* @return an {@link UnsupportedOperationException}.
*/
public static RuntimeException needToImplement(Object o) {
String description = null;
if (o != null) {
description = o.getClass().toString() + ": " + o.toString();
}
throw new UnsupportedOperationException(description);
}
/**
* Flags a piece of code as needing to be cleaned up before you check in.
*
* Introduce a call to this method to indicate that a piece of code, or a
* javadoc comment, needs work before you check in. If you have an IDE which
* can easily trace references, this is an easy way to maintain a to-do
* list.
*
*
Checked-in code must never call this method: you must
* remove all calls/references to this method before you check in.
*
*
The argument
has generic type and determines the type of
* the result. This allows you to use the method inside an expression, for
* example
*
*
* int x = Util.deprecated(0, false);
*
*
* but the usual usage is to pass in a descriptive string.
*
*
Examples
*
*
Example #1: Using deprecated
to fail if a piece of
* supposedly dead code is reached
*
*
* void foo(int x) {
* if (x < 0) {
* // If this code is executed, an error will be thrown.
* Util.deprecated(
* "no longer need to handle negative numbers", true);
* bar(x);
* } else {
* baz(x);
* }
* }
*
*
* Example #2: Using deprecated
to comment out dead
* code
*
*
* if (Util.deprecated(false, false)) {
* // This code will not be executed, but an error will not be thrown.
* baz();
* }
*
*
* @param argument Arbitrary argument to the method.
* @param fail Whether to throw an exception if this method is called
* @return The value of the argument
.
* @deprecated If a piece of code calls this method, it indicates that the
* code needs to be cleaned up.
*/
public static T deprecated(T argument, boolean fail) {
if (fail) {
throw new UnsupportedOperationException();
}
return argument;
}
/**
* Returns whether an array of strings contains a given string among the
* first length
entries.
*
* @param a Array of strings
* @param length Number of entries to search
* @param s String to seek
* @return Whether array contains the name
*/
public static boolean contains(
String[] a,
int length,
String s) {
for (int i = 0; i < length; i++) {
if (a[i].equals(s)) {
return true;
}
}
return false;
}
/**
* Reads all remaining contents from a {@link java.io.Reader} and returns
* them as a string.
*
* @param reader reader to read from
* @return reader contents as string
*/
@Deprecated // to be removed before 2.0
public static String readAllAsString(Reader reader) throws IOException {
StringBuilder sb = new StringBuilder();
char[] buf = new char[4096];
for (;;) {
int n = reader.read(buf);
if (n == -1) {
break;
}
sb.append(buf, 0, n);
}
return sb.toString();
}
/**
* Closes a Jar, ignoring any I/O exception. This should only be
* used in finally blocks when it's necessary to avoid throwing an exception
* which might mask a real exception.
*
* @param jar jar to close
*/
@Deprecated // to be removed before 2.0
public static void squelchJar(JarFile jar) {
try {
if (jar != null) {
jar.close();
}
} catch (IOException ex) {
// intentionally suppressed
}
}
/**
* Closes an InputStream, ignoring any I/O exception. This should only be
* used in finally blocks when it's necessary to avoid throwing an exception
* which might mask a real exception.
*
* @param stream stream to close
*/
@Deprecated // to be removed before 2.0
public static void squelchStream(InputStream stream) {
try {
if (stream != null) {
stream.close();
}
} catch (IOException ex) {
// intentionally suppressed
}
}
/**
* Closes an OutputStream, ignoring any I/O exception. This should only be
* used in finally blocks when it's necessary to avoid throwing an exception
* which might mask a real exception. If you want to make sure that data has
* been successfully flushed, do NOT use this anywhere else; use
* stream.close() instead.
*
* @param stream stream to close
*/
@Deprecated // to be removed before 2.0
public static void squelchStream(OutputStream stream) {
try {
if (stream != null) {
stream.close();
}
} catch (IOException ex) {
// intentionally suppressed
}
}
/**
* Closes a Reader, ignoring any I/O exception. This should only be used in
* finally blocks when it's necessary to avoid throwing an exception which
* might mask a real exception.
*
* @param reader reader to close
*/
@Deprecated // to be removed before 2.0
public static void squelchReader(Reader reader) {
try {
if (reader != null) {
reader.close();
}
} catch (IOException ex) {
// intentionally suppressed
}
}
/**
* Closes a Writer, ignoring any I/O exception. This should only be used in
* finally blocks when it's necessary to avoid throwing an exception which
* might mask a real exception. If you want to make sure that data has been
* successfully flushed, do NOT use this anywhere else; use writer.close()
* instead.
*
* @param writer writer to close
*/
@Deprecated // to be removed before 2.0
public static void squelchWriter(Writer writer) {
try {
if (writer != null) {
writer.close();
}
} catch (IOException ex) {
// intentionally suppressed
}
}
/**
* Closes a Statement, ignoring any SQL exception. This should only be used
* in finally blocks when it's necessary to avoid throwing an exception
* which might mask a real exception.
*
* @param stmt stmt to close
*/
@Deprecated // to be removed before 2.0
public static void squelchStmt(Statement stmt) {
try {
if (stmt != null) {
stmt.close();
}
} catch (SQLException ex) {
// intentionally suppressed
}
}
/**
* Closes a Connection, ignoring any SQL exception. This should only be used
* in finally blocks when it's necessary to avoid throwing an exception
* which might mask a real exception.
*
* @param connection connection to close
*/
@Deprecated // to be removed before 2.0
public static void squelchConnection(Connection connection) {
try {
if (connection != null) {
connection.close();
}
} catch (SQLException ex) {
// intentionally suppressed
}
}
/**
* Trims trailing spaces from a string.
*
* @param s string to be trimmed
* @return trimmed string
*/
@Deprecated // to be removed before 2.0
public static String rtrim(String s) {
int n = s.length() - 1;
if (n >= 0) {
if (s.charAt(n) != ' ') {
return s;
}
while ((--n) >= 0) {
if (s.charAt(n) != ' ') {
return s.substring(0, n + 1);
}
}
}
return "";
}
/**
* Pads a string with spaces up to a given length.
*
* @param s string to be padded
* @param len desired length
* @return padded string
*
* @deprecated Use {@link Spaces#padRight(String, int)}
*/
@Deprecated // to be removed before 2.0
public static String rpad(String s, int len) {
if (s.length() >= len) {
return s;
}
StringBuilder sb = new StringBuilder(s);
while (sb.length() < len) {
sb.append(' ');
}
return sb.toString();
}
/**
* Converts an iterable to a string.
*/
public static String toString(
Iterable iterable, String start, String sep, String end) {
final StringBuilder buf = new StringBuilder();
buf.append(start);
for (Ord ord : Ord.zip(iterable)) {
if (ord.i > 0) {
buf.append(sep);
}
buf.append(ord.e);
}
buf.append(end);
return buf.toString();
}
/** Converts a list of strings to a string separated by newlines. */
public static String lines(Iterable strings) {
return toString(strings, "", "\n", "");
}
/** Converts a string into tokens. */
public static Iterable tokenize(final String s, final String delim) {
return new Iterable() {
final StringTokenizer t = new StringTokenizer(s, delim);
public Iterator iterator() {
return new Iterator() {
public boolean hasNext() {
return t.hasMoreTokens();
}
public String next() {
return t.nextToken();
}
public void remove() {
throw new UnsupportedOperationException("remove");
}
};
}
};
}
/**
* Converts a Java timezone to POSIX format, so that the boost C++ library
* can instantiate timezone objects.
*
* POSIX
* IEEE 1003.1 defines a format for timezone specifications.
*
*
The boost C++ library can read these specifications and instantiate
* posix_time_zone objects from them. The purpose of this method,
* therefore, is to allow the C++ code such as the fennel calculator to use
* the same notion of timezone as Java code.
*
*
The format is as follows:
*
*
"std offset dst [offset],start[/time],end[/time]"
*
*
* where:
*
*
* - 'std' specifies the abbrev of the time zone.
*
- 'offset' is the offset from UTC, and takes the form
*
[+|-]hh[:mm[:ss]] {h=0-23, m/s=0-59}
* - 'dst' specifies the abbrev of the time zone during daylight savings
* time
*
- The second offset is how many hours changed during DST. Default=1
*
- 'start' and 'end' are the dates when DST goes into (and out of)
* effect.
*
* They can each be one of three forms:
*
*
* - Mm.w.d {month=1-12, week=1-5 (5 is always last), day=0-6}
*
- Jn {n=1-365 Feb29 is never counted}
*
- n {n=0-365 Feb29 is counted in leap years}
*
*
*
* - 'time' has the same format as 'offset', and defaults to 02:00:00.
*
*
* For example:
*
*
* - "PST-8PDT01:00:00,M4.1.0/02:00:00,M10.1.0/02:00:00"; or more tersely
*
- "PST-8PDT,M4.1.0,M10.1.0"
*
*
* (Real format strings do not contain spaces; they are in the above
* template only for readability.)
*
*
Boost apparently diverges from the POSIX standard in how it treats the
* sign of timezone offsets. The POSIX standard states 'If preceded by a
* '-', the timezone shall be east of the Prime Meridian; otherwise, it
* shall be west', yet boost requires the opposite. For instance, PST
* has offset '-8' above. This method generates timezone strings consistent
* with boost's expectations.
*
* @param tz Timezone
* @param verbose Whether to include fields which can be omitted because
* they have their default values
* @return Timezone in POSIX format (offset sign reversed, per boost's
* idiosyncracies)
*/
public static String toPosix(TimeZone tz, boolean verbose) {
StringBuilder buf = new StringBuilder();
buf.append(tz.getDisplayName(false, TimeZone.SHORT, Locale.ROOT));
appendPosixTime(buf, tz.getRawOffset());
final int dstSavings = tz.getDSTSavings();
if (dstSavings == 0) {
return buf.toString();
}
buf.append(tz.getDisplayName(true, TimeZone.SHORT, Locale.ROOT));
if (verbose || (dstSavings != 3600000)) {
// POSIX allows us to omit DST offset if it is 1:00:00
appendPosixTime(buf, dstSavings);
}
String patternString = ".*,"
+ "startMode=([0-9]*),"
+ "startMonth=([0-9]*),"
+ "startDay=([-0-9]*),"
+ "startDayOfWeek=([0-9]*),"
+ "startTime=([0-9]*),"
+ "startTimeMode=([0-9]*),"
+ "endMode=([0-9]*),"
+ "endMonth=([0-9]*),"
+ "endDay=([-0-9]*),"
+ "endDayOfWeek=([0-9]*),"
+ "endTime=([0-9]*),"
+ "endTimeMode=([0-9]*).*";
Pattern pattern = Pattern.compile(patternString);
String tzString = tz.toString();
Matcher matcher = pattern.matcher(tzString);
if (!matcher.matches()) {
throw new AssertionError("tz.toString not of expected format: "
+ tzString);
}
int j = 0;
int startMode = Integer.valueOf(matcher.group(++j));
int startMonth = Integer.valueOf(matcher.group(++j));
int startDay = Integer.valueOf(matcher.group(++j));
int startDayOfWeek = Integer.valueOf(matcher.group(++j));
int startTime = Integer.valueOf(matcher.group(++j));
int startTimeMode = Integer.valueOf(matcher.group(++j));
int endMode = Integer.valueOf(matcher.group(++j));
int endMonth = Integer.valueOf(matcher.group(++j));
int endDay = Integer.valueOf(matcher.group(++j));
int endDayOfWeek = Integer.valueOf(matcher.group(++j));
int endTime = Integer.valueOf(matcher.group(++j));
int endTimeMode = Integer.valueOf(matcher.group(++j));
appendPosixDaylightTransition(
tz,
buf,
startMode,
startDay,
startMonth,
startDayOfWeek,
startTime,
startTimeMode,
verbose,
false);
appendPosixDaylightTransition(
tz,
buf,
endMode,
endDay,
endMonth,
endDayOfWeek,
endTime,
endTimeMode,
verbose,
true);
return buf.toString();
}
/**
* Writes a daylight savings time transition to a POSIX timezone
* description.
*
* @param tz Timezone
* @param buf Buffer to append to
* @param mode Transition mode
* @param day Day of transition
* @param month Month of transition
* @param dayOfWeek Day of week of transition
* @param time Time of transition in millis
* @param timeMode Mode of time transition
* @param verbose Verbose
* @param isEnd Whether this transition is leaving DST
*/
private static void appendPosixDaylightTransition(
TimeZone tz,
StringBuilder buf,
int mode,
int day,
int month,
int dayOfWeek,
int time,
int timeMode,
boolean verbose,
boolean isEnd) {
buf.append(',');
int week = day;
switch (mode) {
case 1: // SimpleTimeZone.DOM_MODE
throw Util.needToImplement(0);
case 3: // SimpleTimeZone.DOW_GE_DOM_MODE
// If the day is 1, 8, 15, 22, we can translate this to case 2.
switch (day) {
case 1:
week = 1; // 1st week of month
break;
case 8:
week = 2; // 2nd week of month
break;
case 15:
week = 3; // 3rd week of month
break;
case 22:
week = 4; // 4th week of month
break;
default:
throw new AssertionError(
"POSIX timezone format cannot represent " + tz);
}
// fall through
case 2: // SimpleTimeZone.DOW_IN_MONTH_MODE
buf.append('M');
buf.append(month + 1); // 1 <= m <= 12
buf.append('.');
if (week == -1) {
// java represents 'last week' differently from POSIX
week = 5;
}
buf.append(week); // 1 <= n <= 5, 5 means 'last'
buf.append('.');
buf.append(dayOfWeek - 1); // 0 <= d <= 6, 0=Sunday
break;
case 4: // SimpleTimeZone.DOW_LE_DOM_MODE
throw Util.needToImplement(0);
default:
throw new AssertionError("unexpected value: " + mode);
}
switch (timeMode) {
case 0: // SimpleTimeZone.WALL_TIME
break;
case 1: // SimpleTimeZone.STANDARD_TIME, e.g. Australia/Sydney
if (isEnd) {
time += tz.getDSTSavings();
}
break;
case 2: // SimpleTimeZone.UTC_TIME, e.g. Europe/Paris
time += tz.getRawOffset();
if (isEnd) {
time += tz.getDSTSavings();
}
break;
}
if (verbose || (time != 7200000)) {
// POSIX allows us to omit the time if it is 2am (the default)
buf.append('/');
appendPosixTime(buf, time);
}
}
/**
* Given a time expressed in milliseconds, append the time formatted as
* "hh[:mm[:ss]]".
*
* @param buf Buffer to append to
* @param millis Milliseconds
*/
private static void appendPosixTime(StringBuilder buf, int millis) {
if (millis < 0) {
buf.append('-');
millis = -millis;
}
int hours = millis / 3600000;
buf.append(hours);
millis -= hours * 3600000;
if (millis == 0) {
return;
}
buf.append(':');
int minutes = millis / 60000;
if (minutes < 10) {
buf.append('0');
}
buf.append(minutes);
millis -= minutes * 60000;
if (millis == 0) {
return;
}
buf.append(':');
int seconds = millis / 1000;
if (seconds < 10) {
buf.append('0');
}
buf.append(seconds);
}
/**
* Parses a locale string.
*
*
The inverse operation of {@link java.util.Locale#toString()}.
*
* @param localeString Locale string, e.g. "en" or "en_US"
* @return Java locale object
*/
public static Locale parseLocale(String localeString) {
String[] strings = localeString.split("_");
switch (strings.length) {
case 1:
return new Locale(strings[0]);
case 2:
return new Locale(strings[0], strings[1]);
case 3:
return new Locale(strings[0], strings[1], strings[2]);
default:
throw new AssertionError("bad locale string '" + localeString + "'");
}
}
/**
* Converts a list whose members are automatically down-cast to a given
* type.
*
*
If a member of the backing list is not an instanceof E
,
* the accessing method (such as {@link List#get}) will throw a
* {@link ClassCastException}.
*
*
All modifications are automatically written to the backing list. Not
* synchronized.
*
* @param list Backing list.
* @param clazz Class to cast to.
* @return A list whose members are of the desired type.
*/
public static List cast(List super E> list, Class clazz) {
return new CastingList<>(list, clazz);
}
/**
* Converts a iterator whose members are automatically down-cast to a given
* type.
*
* If a member of the backing iterator is not an instanceof
* E
, {@link Iterator#next()}) will throw a
* {@link ClassCastException}.
*
*
All modifications are automatically written to the backing iterator.
* Not synchronized.
*
* @param iter Backing iterator.
* @param clazz Class to cast to.
* @return An iterator whose members are of the desired type.
*/
public static Iterator cast(
final Iterator> iter,
final Class clazz) {
return new Iterator() {
public boolean hasNext() {
return iter.hasNext();
}
public E next() {
return clazz.cast(iter.next());
}
public void remove() {
iter.remove();
}
};
}
/**
* Converts an {@link Iterable} whose members are automatically down-cast to
* a given type.
*
* All modifications are automatically written to the backing iterator.
* Not synchronized.
*
* @param iterable Backing iterable
* @param clazz Class to cast to
* @return An iterable whose members are of the desired type.
*/
public static Iterable cast(
final Iterable super E> iterable,
final Class clazz) {
return () -> cast(iterable.iterator(), clazz);
}
/**
* Makes a collection of untyped elements appear as a list of strictly typed
* elements, by filtering out those which are not of the correct type.
*
* The returned object is an {@link Iterable},
* which makes it ideal for use with the 'foreach' construct. For example,
*
*
List<Number> numbers = Arrays.asList(1, 2, 3.14,
* 4, null, 6E23);
* for (int myInt : filter(numbers, Integer.class)) {
* print(i);
* }
*
* will print 1, 2, 4.
*
* @param iterable Iterable
* @param includeFilter Class whose instances to include
*/
public static Iterable filter(
final Iterable> iterable,
final Class includeFilter) {
return () -> new Filterator<>(iterable.iterator(), includeFilter);
}
public static Collection filter(
final Collection> collection,
final Class includeFilter) {
return new AbstractCollection() {
private int size = -1;
public Iterator iterator() {
return new Filterator<>(collection.iterator(), includeFilter);
}
public int size() {
if (size == -1) {
// Compute size. This is expensive, but the value
// collection.size() is not correct since we're
// filtering values. (Some java.util algorithms
// call next() on the result of iterator() size() times.)
int s = 0;
for (E e : this) {
s++;
}
size = s;
}
return size;
}
};
}
/**
* Returns a subset of a list containing only elements of a given type.
*
* Modifications to the list are NOT written back to the source list.
*
* @param list List of objects
* @param includeFilter Class to filter for
* @return List of objects of given class (or a subtype)
*/
public static List filter(
final List> list,
final Class includeFilter) {
List result = new ArrayList<>();
for (Object o : list) {
if (includeFilter.isInstance(o)) {
result.add(includeFilter.cast(o));
}
}
return result;
}
/**
* Converts a {@link Properties} object to a {@link Map}<String,
* String>
.
*
* This is necessary because {@link Properties} is a dinosaur class. It
* ought to extend Map<String,String>
, but instead
* extends {@link Hashtable}<Object,Object>
.
*
*
Typical usage, to iterate over a {@link Properties}:
*
*
*
* Properties properties;
* for (Map.Entry<String, String> entry =
* Util.toMap(properties).entrySet()) {
* println("key=" + entry.getKey() + ", value=" + entry.getValue());
* }
*
*
*/
public static Map toMap(
final Properties properties) {
//noinspection unchecked
return (Map) properties;
}
/**
* Returns a hashmap with given contents.
*
* Use this method in initializers. Type parameters are inferred from
* context, and the contents are initialized declaratively. For example,
*
*
Map<String, Integer> population =
* Olap4jUtil.mapOf(
* "UK", 65000000,
* "USA", 300000000);
*
* @param key First key
* @param value First value
* @param keyValues Second and sequent key/value pairs
* @param Key type
* @param Value type
* @return Map with given contents
*/
public static Map mapOf(K key, V value, Object... keyValues) {
final Map map = new LinkedHashMap<>(1 + keyValues.length);
map.put(key, value);
for (int i = 0; i < keyValues.length;) {
//noinspection unchecked
map.put((K) keyValues[i++], (V) keyValues[i++]);
}
return map;
}
/**
* Returns an exception indicating that we didn't expect to find this
* enumeration here.
*
* @param value Enumeration value which was not expected
* @return an error, to be thrown
*/
public static > Error unexpected(E value) {
return new AssertionError("Was not expecting value '" + value
+ "' for enumeration '" + value.getDeclaringClass().getName()
+ "' in this context");
}
/**
* Creates a map of the values of an enumeration by name.
*
* @param clazz Enumeration class
* @return map of values
*/
public static > Map enumConstants(
Class clazz) {
final T[] ts = clazz.getEnumConstants();
if (ts == null) {
throw new AssertionError("not an enum type");
}
ImmutableMap.Builder builder = ImmutableMap.builder();
for (T t : ts) {
builder.put(t.name(), t);
}
return builder.build();
}
/**
* Returns the value of an enumeration with a particular name.
*
* Similar to {@link Enum#valueOf(Class, String)}, but returns {@code
* null} rather than throwing {@link IllegalArgumentException}.
*
* @param clazz Enum class
* @param name Name of enum constant
* @param Enum class type
* @return Enum constant or null
*/
public static synchronized > T enumVal(
Class clazz,
String name) {
return clazz.cast(ENUM_CONSTANTS.getUnchecked(clazz).get(name));
}
/**
* Returns the value of an enumeration with a particular or default value if
* not found.
*
* @param default_ Default value (not null)
* @param name Name of enum constant
* @param Enum class type
* @return Enum constant, never null
*/
public static synchronized > T enumVal(T default_,
String name) {
final Class clazz = default_.getDeclaringClass();
final T t = clazz.cast(ENUM_CONSTANTS.getUnchecked(clazz).get(name));
if (t == null) {
return default_;
}
return t;
}
/**
* Creates a list that returns every {@code n}th element of a list,
* starting at element {@code k}.
*
* It is OK if the list is empty or its size is not a multiple of
* {@code n}.
*
* For instance, {@code quotientList(list, 2, 0)} returns the even
* elements of a list, and {@code quotientList(list, 2, 1)} returns the odd
* elements. Those lists are the same length only if list has even size.
*/
public static List quotientList(
final List list, final int n, final int k) {
if (n <= 0 || k < 0 || k >= n) {
throw new IllegalArgumentException(
"n must be positive; k must be between 0 and n - 1");
}
final int size = (list.size() + n - k - 1) / n;
return new AbstractList() {
public E get(int index) {
return list.get(index * n + k);
}
public int size() {
return size;
}
};
}
/** Given a list with N elements
* [e0, e1, ..., eN-1]
* (where N is even), returns a list of the N / 2 elements
* [ (e0, e1),
* (e2, e3), ... ]. */
public static List> pairs(final List list) {
//noinspection unchecked
return Pair.zip(quotientList(list, 2, 0),
quotientList(list, 2, 1));
}
/** Returns the first value if it is not null,
* otherwise the second value.
*
* The result may be null.
*
*
Equivalent to the Elvis operator ({@code ?:}) of languages such as
* Groovy or PHP. */
public static T first(T v0, T v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Double} value,
* using a given default value if it is null. */
public static double first(Double v0, double v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Float} value,
* using a given default value if it is null. */
public static float first(Float v0, float v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Integer} value,
* using a given default value if it is null. */
public static int first(Integer v0, int v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Long} value,
* using a given default value if it is null. */
public static long first(Long v0, long v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Boolean} value,
* using a given default value if it is null. */
public static boolean first(Boolean v0, boolean v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Short} value,
* using a given default value if it is null. */
public static short first(Short v0, short v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Character} value,
* using a given default value if it is null. */
public static char first(Character v0, char v1) {
return v0 != null ? v0 : v1;
}
/** Unboxes a {@link Byte} value,
* using a given default value if it is null. */
public static byte first(Byte v0, byte v1) {
return v0 != null ? v0 : v1;
}
public static Iterable orEmpty(Iterable v0) {
return v0 != null ? v0 : ImmutableList.of();
}
/** Returns the last element of a list.
*
* @throws java.lang.IndexOutOfBoundsException if the list is empty
*/
public static E last(List list) {
return list.get(list.size() - 1);
}
/** Returns every element of a list but its last element. */
public static List skipLast(List list) {
return skipLast(list, 1);
}
/** Returns every element of a list but its last {@code n} elements. */
public static List skipLast(List list, int n) {
return list.subList(0, list.size() - n);
}
/** Returns the last {@code n} elements of a list. */
public static List last(List list, int n) {
return list.subList(list.size() - n, list.size());
}
/** Returns all but the first element of a list. */
public static List skip(List list) {
return skip(list, 1);
}
/** Returns all but the first {@code n} elements of a list. */
public static List skip(List list, int fromIndex) {
return fromIndex == 0 ? list : list.subList(fromIndex, list.size());
}
public static List range(final int end) {
return new AbstractList() {
public int size() {
return end;
}
public Integer get(int index) {
return index;
}
};
}
public static List range(final int start, final int end) {
return new AbstractList() {
public int size() {
return end - start;
}
public Integer get(int index) {
return start + index;
}
};
}
/**
* Returns whether the elements of {@code list} are distinct.
*/
public static boolean isDistinct(List list) {
return firstDuplicate(list) < 0;
}
/**
* Returns the ordinal of the first element in the list which is equal to a
* previous element in the list.
*
* For example,
* firstDuplicate(Arrays.asList("a", "b", "c", "b", "a"))
* returns 3, the ordinal of the 2nd "b".
*
* @param list List
* @return Ordinal of first duplicate, or -1 if not found
*/
public static int firstDuplicate(List list) {
final int size = list.size();
if (size < 2) {
// Lists of size 0 and 1 are always distinct.
return -1;
}
if (size < 15) {
// For smaller lists, avoid the overhead of creating a set. Threshold
// determined empirically using UtilTest.testIsDistinctBenchmark.
for (int i = 1; i < size; i++) {
E e = list.get(i);
for (int j = i - 1; j >= 0; j--) {
E e1 = list.get(j);
if (Objects.equals(e, e1)) {
return i;
}
}
}
return -1;
}
final Map set = new HashMap<>(size);
for (E e : list) {
if (set.put(e, "") != null) {
return set.size();
}
}
return -1;
}
/** Converts a list into a list with unique elements.
*
* The order is preserved; the second and subsequent occurrences are
* removed.
*
*
If the list is already unique it is returned unchanged. */
public static List distinctList(List list) {
if (isDistinct(list)) {
return list;
}
return ImmutableList.copyOf(new LinkedHashSet<>(list));
}
/** Converts an iterable into a list with unique elements.
*
* The order is preserved; the second and subsequent occurrences are
* removed.
*
*
If {@code iterable} is a unique list it is returned unchanged. */
public static List distinctList(Iterable keys) {
if (keys instanceof Set) {
return ImmutableList.copyOf(keys);
}
if (keys instanceof List) {
@SuppressWarnings("unchecked") final List list = (List) keys;
if (isDistinct(list)) {
return list;
}
}
return ImmutableList.copyOf(Sets.newLinkedHashSet(keys));
}
/** Returns whether two collections have any elements in common. */
public static boolean intersects(Collection c0, Collection c1) {
for (E e : c1) {
if (c0.contains(e)) {
return true;
}
}
return false;
}
/** Looks for a string within a list of strings, using a given
* case-sensitivity policy, and returns the position at which the first match
* is found, or -1 if there are no matches. */
public static int findMatch(List strings, String seek,
boolean caseSensitive) {
if (caseSensitive) {
return strings.indexOf(seek);
}
for (int i = 0; i < strings.size(); i++) {
String s = strings.get(i);
if (s.equalsIgnoreCase(seek)) {
return i;
}
}
return -1;
}
/** Returns whether a name matches another according to a given
* case-sensitivity policy. */
public static boolean matches(boolean caseSensitive, String s0, String s1) {
return caseSensitive ? s1.equals(s0) : s1.equalsIgnoreCase(s0);
}
/** Returns whether one list is a prefix of another. */
public static boolean startsWith(List list0, List list1) {
if (list0 == list1) {
return true;
}
final int size = list1.size();
if (list0.size() < size) {
return false;
}
for (int i = 0; i < size; i++) {
if (!Objects.equals(list0.get(i), list1.get(i))) {
return false;
}
}
return true;
}
/** Converts ["ab", "c"] to "ab"."c". */
public static String listToString(List list) {
final StringBuilder b = new StringBuilder();
for (String s : list) {
if (b.length() > 0) {
b.append(".");
}
b.append('"');
b.append(s.replace("\"", "\"\""));
b.append('"');
}
return b.toString();
}
public static List stringToList(String s) {
if (s.isEmpty()) {
return ImmutableList.of();
}
final ImmutableList.Builder builder = ImmutableList.builder();
final StringBuilder b = new StringBuilder();
int i = 0;
for (;;) {
char c = s.charAt(i);
if (c != '"') {
throw new IllegalArgumentException();
}
for (;;) {
c = s.charAt(++i);
if (c == '"') {
if (i == s.length() - 1) {
break;
}
++i;
c = s.charAt(i);
if (c == '.') {
break;
}
if (c != '"') {
throw new IllegalArgumentException();
}
}
b.append(c);
}
builder.add(b.toString());
b.setLength(0);
if (++i >= s.length()) {
break;
}
}
return builder.build();
}
/** Converts a number into human-readable form, with 3 digits and a "K", "M"
* or "G" multiplier for thousands, millions or billions.
*
* Examples: -2, 0, 1, 999, 1.00K, 1.99K, 3.45M, 4.56B.
*/
public static String human(double d) {
if (d == 0d) {
return "0";
}
if (d < 0d) {
return "-" + human(-d);
}
final int digitCount = (int) Math.floor(Math.log10(d));
switch (digitCount) {
case 0:
case 1:
case 2:
return Integer.toString((int) d);
case 3:
case 4:
case 5:
return digits3(Math.round(d / 10D), digitCount % 3) + "K";
case 6:
case 7:
case 8:
return digits3(Math.round(d / 10000D), digitCount % 3) + "M";
case 9:
case 10:
case 11:
return digits3(Math.round(d / 10000000D), digitCount % 3) + "G";
default:
return Double.toString(d);
}
}
private static String digits3(long x, int z) {
final String s = Long.toString(x);
switch (z) {
case 0:
return s.charAt(0) + "." + s.substring(1, 3);
case 1:
return s.substring(0, 2) + "." + s.substring(2, 3);
default:
return s.substring(0, 3);
}
}
/** Returns a map that is a view onto a collection of values, using the
* provided function to convert a value to a key.
*
* Unlike
* {@link com.hazelcast.com.google.common.collect.Maps#uniqueIndex(Iterable, com.hazelcast.com.google.common.base.Function)},
* returns a view whose contents change as the collection of values changes.
*
* @param values Collection of values
* @param function Function to map value to key
* @param Key type
* @param Value type
* @return Map that is a view onto the values
*/
public static Map asIndexMapJ(
final Collection values,
final Function function) {
final Collection> entries =
Collections2.transform(values, v -> Pair.of(function.apply(v), v));
final Set> entrySet =
new AbstractSet>() {
public Iterator> iterator() {
return entries.iterator();
}
public int size() {
return entries.size();
}
};
return new AbstractMap() {
public Set> entrySet() {
return entrySet;
}
};
}
@SuppressWarnings("Guava")
@Deprecated
public static Map asIndexMap(
final Collection values,
final com.hazelcast.com.google.common.base.Function function) {
return asIndexMapJ(values, function::apply);
}
/**
* Prints the given code with line numbering.
*/
public static void debugCode(PrintStream out, String code) {
out.println();
StringReader sr = new StringReader(code);
BufferedReader br = new BufferedReader(sr);
try {
String line;
for (int i = 1; (line = br.readLine()) != null; i++) {
out.print("/*");
String number = Integer.toString(i);
if (number.length() < 4) {
Spaces.append(out, 4 - number.length());
}
out.print(number);
out.print(" */ ");
out.println(line);
}
} catch (IOException e) {
// not possible
}
}
/** Returns a copy of a list of lists, making the component lists immutable if
* they are not already. */
public static List> immutableCopy(
Iterable extends Iterable> lists) {
int n = 0;
for (Iterable list : lists) {
if (!(list instanceof ImmutableList)) {
++n;
}
}
if (n == 0) {
// Lists are already immutable. Furthermore, if the outer list is
// immutable we will just return "lists" unchanged.
//noinspection unchecked
return ImmutableList.copyOf((Iterable>) lists);
}
final ImmutableList.Builder> builder =
ImmutableList.builder();
for (Iterable list : lists) {
builder.add(ImmutableList.copyOf(list));
}
return builder.build();
}
/** Creates a {@link PrintWriter} to a given output stream using UTF-8
* character set.
*
* Does not use the default character set. */
public static PrintWriter printWriter(OutputStream out) {
return new PrintWriter(
new BufferedWriter(
new OutputStreamWriter(out, StandardCharsets.UTF_8)));
}
/** Creates a {@link PrintWriter} to a given file using UTF-8
* character set.
*
*
Does not use the default character set. */
public static PrintWriter printWriter(File file)
throws FileNotFoundException {
return printWriter(new FileOutputStream(file));
}
/** Creates a {@link BufferedReader} to a given input stream using UTF-8
* character set.
*
*
Does not use the default character set. */
public static BufferedReader reader(InputStream in) {
return new BufferedReader(
new InputStreamReader(in, StandardCharsets.UTF_8));
}
/** Creates a {@link BufferedReader} to read a given file using UTF-8
* character set.
*
*
Does not use the default character set. */
public static BufferedReader reader(File file) throws FileNotFoundException {
return reader(new FileInputStream(file));
}
/** Creates a {@link Calendar} in the UTC time zone and root locale.
* Does not use the time zone or locale. */
public static Calendar calendar() {
return Calendar.getInstance(DateTimeUtils.UTC_ZONE, Locale.ROOT);
}
/** Creates a {@link Calendar} in the UTC time zone and root locale
* with a given time. */
public static Calendar calendar(long millis) {
Calendar calendar = calendar();
calendar.setTimeInMillis(millis);
return calendar;
}
/**
* Returns a {@code Collector} that accumulates the input elements into a
* Guava {@link ImmutableList} via a {@link ImmutableList.Builder}.
*
*
It will be obsolete when we move to {@link Bug#upgrade Guava 21.0},
* which has {@code ImmutableList.toImmutableList()}.
*
* @param Type of the input elements
*
* @return a {@code Collector} that collects all the input elements into an
* {@link ImmutableList}, in encounter order
*/
public static Collector, ImmutableList>
toImmutableList() {
return Collector.of(ImmutableList::builder, ImmutableList.Builder::add,
(t, u) -> {
t.addAll(u.build());
return t;
},
ImmutableList.Builder::build);
}
/** Transforms a list, applying a function to each element. */
public static List transform(List list,
java.util.function.Function function) {
if (list instanceof RandomAccess) {
return new RandomAccessTransformingList<>(list, function);
} else {
return new TransformingList<>(list, function);
}
}
/** Filters an iterable. */
public static Iterable filter(Iterable iterable,
Predicate predicate) {
return () -> filter(iterable.iterator(), predicate);
}
/** Filters an iterator. */
public static Iterator filter(Iterator iterator,
Predicate predicate) {
return new FilteringIterator<>(iterator, predicate);
}
/** Returns a view of a list, picking the elements of a list with the given
* set of ordinals. */
public static List select(List list, List ordinals) {
return new AbstractList() {
@Override public int size() {
return ordinals.size();
}
@Override public E get(int index) {
return list.get(ordinals.get(index));
}
};
}
/** Returns a map which ignores any write operation. */
public static Map blackholeMap() {
return BlackholeMap.of();
}
//~ Inner Classes ----------------------------------------------------------
/**
* Exception used to interrupt a tree walk of any kind.
*/
public static class FoundOne extends ControlFlowException {
private final Object node;
/** Singleton instance. Can be used if you don't care about node. */
@SuppressWarnings("ThrowableInstanceNeverThrown")
public static final FoundOne NULL = new FoundOne(null);
public FoundOne(Object node) {
this.node = node;
}
public Object getNode() {
return node;
}
}
/**
* Visitor which looks for an OVER clause inside a tree of
* {@link SqlNode} objects.
*/
public static class OverFinder extends SqlBasicVisitor {
public static final OverFinder INSTANCE = new Util.OverFinder();
@Override public Void visit(SqlCall call) {
if (call.getKind() == SqlKind.OVER) {
throw FoundOne.NULL;
}
return super.visit(call);
}
}
/** List that returns the same number of elements as a backing list,
* applying a transformation function to each one.
*
* @param Element type of backing list
* @param Element type of this list
*/
private static class TransformingList extends AbstractList {
private final java.util.function.Function function;
private final List list;
TransformingList(List list,
java.util.function.Function function) {
this.function = function;
this.list = list;
}
public T get(int i) {
return function.apply(list.get(i));
}
public int size() {
return list.size();
}
@Override @Nonnull public Iterator iterator() {
return listIterator();
}
}
/** Extension to {@link TransformingList} that implements
* {@link RandomAccess}.
*
* @param Element type of backing list
* @param Element type of this list
*/
private static class RandomAccessTransformingList
extends TransformingList implements RandomAccess {
RandomAccessTransformingList(List list,
java.util.function.Function function) {
super(list, function);
}
}
/** Iterator that applies a predicate to each element.
*
* @param Element type */
private static class FilteringIterator implements Iterator {
private static final Object DUMMY = new Object();
final Iterator extends T> iterator;
private final Predicate predicate;
T current;
FilteringIterator(Iterator extends T> iterator,
Predicate predicate) {
this.iterator = iterator;
this.predicate = predicate;
current = moveNext();
}
public boolean hasNext() {
return current != DUMMY;
}
public T next() {
final T t = this.current;
current = moveNext();
return t;
}
protected T moveNext() {
while (iterator.hasNext()) {
T t = iterator.next();
if (predicate.test(t)) {
return t;
}
}
return (T) DUMMY;
}
}
}