/*
 * Copyright (C) 2010 The Guava Authors
 *
 * Licensed 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,

           Shell2Junit License Information

Feb, 2010

shell2junit library and sample code is licensed under Apache License, v.2.0.

(c) 2009 Manolo Carrasco (Manuel Carrasco Moñino)

=====

Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/ 

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction, and 
distribution as defined by Sections 1 through 9 of this document. 

	10 * time.Millisecond,
	50 * time.Millisecond,
	100 * time.Millisecond,
	250 * time.Millisecond,
	500 * time.Millisecond,
	1000 * time.Millisecond, // 1s
	1500 * time.Millisecond,
	3000 * time.Millisecond,
	5000 * time.Millisecond,
	10000 * time.Millisecond, // 10s
}

// KMS is a connection to a key management system.
// It implements various cryptographic operations,

// Copyright 2010 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

/*
Package zip provides support for reading and writing ZIP archives.

See the [ZIP specification] for details.

This package does not support disk spanning.

A note about ZIP64:

To be backwards compatible the FileHeader has both 32 and 64 bit Size

/*
 * Copyright (C) 2010 The Guava Authors
 *
 * Licensed 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

     * zero bytes (3 ints), while the byteTable is for advancing one byte at a time.
     * This algorithm is due to the paper "Everything we know about CRC but [are] afraid to forget"
     * by Kadatch and Jenkins, 2010.
     */

    Crc32cHasher() {
      super(16);
    }

    private boolean finished = false;

    /*
     * This trick allows us to avoid having separate states for "first four ints" and "all other

    # via -r ci/official/requirements_updater/requirements.in
keras-nightly==3.10.0.dev2025072304 \
    --hash=sha256:05777407dbcb04869abfd130af20d1cce76664a0a11f178ab0f13aead3a3bbad \
    --hash=sha256:b79bb0c142f8721a77277aa3657c688f6da8efc77c3bccdccab0ba9a5e64ff53
    # via -r ci/official/requirements_updater/requirements.in
libclang==18.1.1 \

    # via -r ci/official/requirements_updater/requirements.in
keras-nightly==3.10.0.dev2025072304 \
    --hash=sha256:05777407dbcb04869abfd130af20d1cce76664a0a11f178ab0f13aead3a3bbad \
    --hash=sha256:b79bb0c142f8721a77277aa3657c688f6da8efc77c3bccdccab0ba9a5e64ff53
    # via -r ci/official/requirements_updater/requirements.in
libclang==18.1.1 \

    # via markdown
jax==0.4.7 \
    --hash=sha256:5e7002d74db25f97c99b979d4ba1233b1ef26e1597e5fc468ad11d1c8a9dc4f8
    # via -r ci/official/requirements_updater/requirements.in
keras-nightly==3.10.0.dev2025052003 \
    --hash=sha256:93a5ac4f4b62907272c84f96d6e335090ad2dd0f44cd16e50a91437e6736e0ef \
    --hash=sha256:c24f581402eee2875e217c0d8f3de7bcbb13cf5b54953fc3bcb1c3c63397bc17

	github.com/posener/complete v1.2.3 // indirect
	github.com/power-devops/perfstat v0.0.0-20240221224432-82ca36839d55 // indirect
	github.com/prometheus/prom2json v1.4.2 // indirect
	github.com/prometheus/prometheus v0.303.0 // indirect
	github.com/rivo/uniseg v0.4.7 // indirect
	github.com/rjeczalik/notify v0.9.3 // indirect
	github.com/rs/xid v1.6.0 // indirect
	github.com/safchain/ethtool v0.5.10 // indirect