public void testEqualsIgnoreCaseUnicodeEquivalence() {
    // Note that it's possible in future that the JDK's idea to toUpperCase() or equalsIgnoreCase()
    // may change and break assumptions in this test [*]. This is not a bug in the implementation of
    // Ascii.equalsIgnoreCase(), but it is a signal that its documentation may need updating as
    // regards edge cases.

  public void testEqualsIgnoreCaseUnicodeEquivalence() {
    // Note that it's possible in future that the JDK's idea to toUpperCase() or equalsIgnoreCase()
    // may change and break assumptions in this test [*]. This is not a bug in the implementation of
    // Ascii.equalsIgnoreCase(), but it is a signal that its documentation may need updating as
    // regards edge cases.

     */
    public static String dec_utf8(final byte[] src, int si, final int slim) throws IOException {
        final char[] uni = new char[slim - si];
        int ui, ch;

        for (ui = 0; si < slim && (ch = src[si++] & 0xFF) != 0; ui++) {
            if (ch < 0x80) {
                uni[ui] = (char) ch;
            } else if ((ch & 0xE0) == 0xC0) {
                if (slim - si < 2) {
                    break;

		if r.Flags.Filter.OlderThan > 0 && time.Since(oi.ModTime) < r.Flags.Filter.OlderThan.D() {
			// skip all objects that are newer than specified older duration
			return true
		}

		if r.Flags.Filter.NewerThan > 0 && time.Since(oi.ModTime) >= r.Flags.Filter.NewerThan.D() {
			// skip all objects that are older than specified newer duration
			return true
		}

     */
    public static String dec_utf8(final byte[] src, int si, final int slim) throws IOException {
        final char[] uni = new char[slim - si];
        int ui, ch;

        for (ui = 0; si < slim && (ch = src[si++] & 0xFF) != 0; ui++) {
            if (ch < 0x80) {
                uni[ui] = (char) ch;
            } else if ((ch & 0xE0) == 0xC0) {
                if (slim - si < 2) {
                    break;

// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// 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.
//

   * false} for {@code boolean} and {@code '\0'} for {@code char}. For non-primitive types and
   * {@code void}, {@code null} is returned.
   */
  @SuppressWarnings("unchecked")
  public static <T> @Nullable T defaultValue(Class<T> type) {
    checkNotNull(type);
    if (type.isPrimitive()) {
      if (type == boolean.class) {
        return (T) Boolean.FALSE;
      } else if (type == char.class) {
        return (T) Character.valueOf('\0');

    }

    /**
     * @throws MalformedURLException
     *
     */
    private synchronized void canonicalizePath() {
        final char[] in = this.url.getPath().toCharArray();
        final char[] out = new char[in.length];
        final int length = in.length;
        int prefixLen = 0, state = 0;

        /*
         * The canonicalization routine
         */

import java.io.DataOutputStream;
import java.io.FilterOutputStream;
import java.io.IOException;
import java.io.OutputStream;

/**
 * An implementation of {@link DataOutput} that uses little-endian byte ordering for writing {@code
 * char}, {@code short}, {@code int}, {@code float}, {@code double}, and {@code long} values.
 *
 * <p><b>Note:</b> This class intentionally violates the specification of its supertype {@code

                }
            } else if (Character.isDigit(line.charAt(0))) {
                final char[] data = line.toCharArray();
                int ip, i, j;
                Name name;
                NbtAddress addr;
                char c = '.';

                ip = i = 0;
                for (; i < data.length && c == '.'; i++) {
                    int b = 0x00;