//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

// Package amztime implements AWS specific time parsing and deviations
package amztime

import (
	"errors"
	"testing"
	"time"
)

func TestParse(t *testing.T) {
	type testCase struct {
		expectedErr  error
		expectedTime time.Time
		timeStr      string
	}

//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.

// Package amztime implements AWS specific time parsing and deviations
package amztime

import (
	"errors"
	"net/http"
	"time"
)

// Supported amz date formats.
var amzDateFormats = []string{
	// Do not change this order, x-amz-date format is usually in

      for (i in rangePos until rangeLimit step 4) {
        rangeStarts += compactTable.ranges[i].code
      }
      assertThat(rangeStarts).isEqualTo(rangeStarts.sorted())
    }
  }

  @Test fun deviations() {
    assertThat("ß".map()).isEqualTo("ß")
    assertThat("ς".map()).isEqualTo("ς")
    assertThat("\u200c".map()).isEqualTo("\u200c")
    assertThat("\u200d".map()).isEqualTo("\u200d")
  }

/**
 * A decoded [mapping table] that can perform the [mapping step] of IDNA processing.
 *
 * This implementation is optimized for readability over efficiency.
 *
 * This implements non-transitional processing by preserving deviation characters.
 *
 * This implementation's STD3 rules are configured to `UseSTD3ASCIIRules=false`. This is
 * permissive and permits the `_` character.
 *

  /**
   * Returns an output {@code Future} to use in place of the given {@code input}. The output {@code
   * Future} need not be {@linkplain Future#isDone done}, making {@code AsyncFunction} suitable for
   * asynchronous derivations.
   *
   * <p>Throwing an exception from this method is equivalent to returning a failing {@code Future}.
   */
  ListenableFuture<O> apply(@ParametricNullness I input) throws Exception;

                  }
                });

    // To start, fill up the cache.
    // Each miss both increments the counter and causes the map to grow by one,
    // so until evictions begin, the size of the map is the greatest return
    // value seen so far
    while (cache.getUnchecked(nextRandomKey()) < maximumSize) {}

    requests.set(0);
    misses.set(0);
  }

  @Benchmark

                  }
                });

    // To start, fill up the cache.
    // Each miss both increments the counter and causes the map to grow by one,
    // so until evictions begin, the size of the map is the greatest return
    // value seen so far
    while (cache.getUnchecked(nextRandomKey()) < maximumSize) {}

    requests.set(0);
    misses.set(0);
  }

  @Benchmark