org.crsh.cmdline.Util Maven / Gradle / Ivy
/*
* Copyright (C) 2012 eXo Platform SAS.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.crsh.cmdline;
import java.io.IOException;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
class Util {
/** . */
static final Pattern INDENT_PATTERN = Pattern.compile("(?<=^|\\n)[ \\t\\x0B\\f\\r]*(?=\\S)");
/** . */
static final String MAN_TAB = _tab(7);
/** . */
static final String MAN_TAB_EXTRA = _tab(7 + 4);
/** . */
static final String[] tabIndex;
static {
String[] tmp = new String[20];
for (int i = 0;i < tmp.length;i++) {
tmp[i] = _tab(i);
}
tabIndex = tmp;
}
static String tab(int size) {
if (size < 0) {
throw new IllegalArgumentException();
}
if (size < tabIndex.length) {
return tabIndex[size];
} else {
return _tab(size);
}
}
private static String _tab(int size) {
char[] tmp = new char[size];
Arrays.fill(tmp, ' ');
return new String(tmp);
}
static A indent(int tab, CharSequence s, A appendable) throws IOException {
return indent(tab(tab), s, appendable);
}
static A indent(String tab, CharSequence s, A appendable) throws IOException {
Matcher matcher = INDENT_PATTERN.matcher(s);
int prev = 0;
while (matcher.find()) {
int start = matcher.start();
appendable.append(s, prev, start);
appendable.append(tab);
prev = matcher.end();
}
appendable.append(s, prev, s.length());
return appendable;
}
static Iterable tuples(final Class type, final Iterable... iterables) {
return new Iterable() {
public Iterator iterator() {
return new Iterator() {
private final Iterator[] iterators = new Iterator[iterables.length];
private T[] next;
{
for (int i = 0;i < iterables.length;i++) {
iterators[i] = iterables[i].iterator();
}
}
public boolean hasNext() {
if (next == null) {
T[] tuple = (T[])Array.newInstance(type, 2);
for (int i = 0;i < iterators.length;i++) {
Iterator iterator = iterators[i];
if (iterator.hasNext()) {
tuple[i] = type.cast(iterator.next());
} else {
return false;
}
}
next = tuple;
}
return true;
}
public T[] next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
T[] tmp = next;
next = null;
return tmp;
}
public void remove() {
throw new UnsupportedOperationException();
}
};
}
};
}
static Iterable join(final Iterable... iterables) {
return new Iterable() {
public Iterator iterator() {
return new Iterator() {
int index;
Iterator current;
T next;
public boolean hasNext() {
if (next == null) {
while ((current == null || !current.hasNext()) && index < iterables.length) {
current = iterables[index++].iterator();
}
if (current != null && current.hasNext()) {
next = current.next();
}
}
return next != null;
}
public T next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
T tmp = next;
next = null;
return tmp;
}
public void remove() {
throw new UnsupportedOperationException();
}
};
}
};
}
}