// OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
// SUCH DAMAGE.
//

package jcifs.smb1.util;

/**
 * This code is derived from the above source
 * JCIFS API
 * Norbert Hranitzky

    }

    @Override
    public Multiset<K> create(Object... elements) {
      /*
       * This is nasty and complicated, but it's the only way to make sure keys get mapped to enough
       * distinct values.
       */
      Entry<?, ?>[] entries = new Entry<?, ?>[elements.length];
      Map<K, Iterator<V>> valueIterators = new HashMap<>();

        .addEqualityGroup(ImmutableDoubleArray.of(1, 3))
        .addEqualityGroup(ImmutableDoubleArray.of(1, 2, 3))
        .testEquals();
  }

  /**
   * This is probably a weird and hacky way to test what we're really trying to test, but hey, it
   * caught a bug.
   */
  public void testTrimmed() {
    ImmutableDoubleArray iia = ImmutableDoubleArray.of(0, 1, 3);
    assertDoesntActuallyTrim(iia);

 */
internal class FastFallbackExchangeFinderTest {
  private val taskFaker = TaskFaker()
  private val taskRunner = taskFaker.taskRunner

  /**
   * Note that we don't use the same [TaskFaker] for this factory. That way off-topic tasks like
   * connection pool maintenance tasks don't add noise to route planning tests.
   */
  private val routePlanner = FakeRoutePlanner(taskFaker = taskFaker)

             * for whatever reason. I copy over the uid here so it appears correct
             * in logging output. Logging of andx segments of messages inadvertantly
             * print header information because of the way toString always makes a
             * super.toString() call(see toString() at the end of all smbs classes).
             */

            this.andx.uid = this.uid;

 *       cryptographic hashes.)
 *   <li><b>fast:</b> perhaps self-explanatory, but often the most important consideration.
 * </ul>
 *
 * <h3>Providing input to a hash function</h3>
 *
 * <p>The primary way to provide the data that your hash function should act on is via a {@link
 * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant

 *       cryptographic hashes.)
 *   <li><b>fast:</b> perhaps self-explanatory, but often the most important consideration.
 * </ul>
 *
 * <h3>Providing input to a hash function</h3>
 *
 * <p>The primary way to provide the data that your hash function should act on is via a {@link
 * Hasher}. Obtain a new hasher from the hash function using {@link #newHasher}, "push" the relevant

KkB,WAGnBhF,SAASmL,QACX9E,EAAS7B,GAAG,aAA8C,WAA/B6B,EAASxF,IAAI,eACzCiD,KAAKkH,QAITI,OAAA,WACOtH,KAAKoG,YACRpG,KAAKmH,OAAOlC,I,EAIhBO,MAAA,SAAMpF,GACCA,IACHJ,KAAKmG,WAAY,GAGfnG,KAAKkB,SAASxE,cAzFK,8CA0FrBb,EAAK0B,qBAAqByC,KAAKkB,UAC/BlB,KAAKuH,OAAM,IAGbC,cAAcxH,KAAKiG,WACnBjG,KAAKiG,UAAY,M,EAGnBsB,MAAA,SAAMnH,GACCA,IACHJ,KAAKmG,WAAY,GAGfnG,KAAKiG,YACPuB,cAAcxH,KAAKiG,WACnBjG,KAAKiG,UAAY,MAGfjG,KAAKwG,QAAQnB,WAAarF,KAAKmG,YACjCnG,KAAKyH,kBAELzH,KAAKiG,UAAYyB,aACdxL,SAASyL,gBAAkB3H,KAAKoH,gBAAkBpH...

            throw new RuntimeCIFSException("Usage count dropped below zero");
        }
    }

    /**
     * Close the tree connection (implements AutoCloseable)
     *
     * This method provides a standard way to close resources using try-with-resources.
     * It delegates to the release() method to properly clean up the connection.
     */
    @Override
    public void close() {
        if (log.isDebugEnabled()) {

  @InlineMe(replacement = "Boolean.hashCode(value)")
  public static int hashCode(boolean value) {
    return Boolean.hashCode(value);
  }

  /**
   * Compares the two specified {@code boolean} values in the standard way ({@code false} is
   * considered less than {@code true}). The sign of the value returned is the same as that of
   * {@code ((Boolean) a).compareTo(b)}.
   *