/*input_shapes*/ {make_shape({3, 2}), make_shape({2, 4})},
                    /*input_tensors*/ {},
                    /*expected_shape*/ make_shape({3, 4}));

  // Infer shape when second operand has unknown shape.
  CheckOutputShapes(matmul_op,
                    /*input_shapes*/ {make_shape({3, 2}), unknown_shape()},
                    /*input_tensors*/ {},

         * into a repository. In the first case, the result needs to be a proper local repository that one can use for
         * local artifact resolution. In the second case, the result needs to precisely obey the path information of the
         * repository's layout to allow pointing at artifacts within the repository. Unfortunately,

        infoField.setAccessible(true);
        infoField.set(response, mockDecodable);

        Decodable first = response.getInfo();
        Decodable second = response.getInfo();

        assertSame(first, second, "Multiple calls should return the same instance");
    }

    @Test
    @DisplayName("Test getInfo with null info returns null")
    void testGetInfoWithNullInfo() {

        setDataCount(response, 20);

        // First read
        int bytesRead1 = response.readDataWireFormat(buffer, 0, 20);
        FileSystemInformation info1 = response.getInfo();

        // Second read with different data
        buffer = prepareAllocationInfoBuffer();
        buffer[8] = 10; // Change some data

        int bytesRead2 = response.readDataWireFormat(buffer, 0, 20);

            verify(mockMd5, times(2)).update(any(byte[].class)); // Once in constructor with ipad, once in engineDigest with opad
            verify(mockMd5, times(1)).digest(innerDigest); // Second call for final digest
        }
    }

    @Test
    void testEngineDigestWithBuffer() throws NoSuchAlgorithmException, DigestException {
        // Test engineDigest(byte[] buf, int offset, int len)

		if err := p.loadResync(ctx, buckets, objAPI); err == nil {
			<-ctx.Done()
			return
		}
		duration := max(time.Duration(r.Float64()*float64(time.Minute)),
			// Make sure to sleep at least a second to avoid high CPU ticks.
			time.Second)
		time.Sleep(duration)
	}
}

// Loads bucket replication resync statuses into memory.

        @Override
        int readBytesWireFormat(byte[] buffer, int bufferIndex) {
            readBytesCalls++;
            return 20;
        }
    }

    /**
     * SigningDigest spy that records whether sign() was invoked.
     */
    static class TestSigningDigest extends SigningDigest {
        boolean called;
        int lastLength;

        TestSigningDigest() throws SmbException {

						}
						return
					}
					if configRetriableErrors(err) {
						decomLogIf(ctx, fmt.Errorf("Unable to resume decommission of pools %v: %w: retrying..", pools, err))
						time.Sleep(time.Second + time.Duration(r.Float64()*float64(5*time.Second)))
						continue
					}
					decomLogIf(ctx, fmt.Errorf("Unable to resume decommission of pool %v: %w", pools, err))
					return
				}
			}
		}()
	}

	return nil
}

## Problèmes/Questions

[discuss.codelibs.org](https://discuss.codelibs.org/c/FessEN/)

## Démarrage rapide

Il existe 2 manières d'essayer Fess. La première est de le télécharger et l'installer vous-même. La seconde est d'utiliser [Docker](https://www.docker.com/products/docker-engine).

### Télécharger et Installer/Exécuter

   *
   * @since 19.0
   */
  public static HashFunction concatenating(
      HashFunction first, HashFunction second, HashFunction... rest) {
    // We can't use Lists.asList() here because there's no hash->collect dependency
    List<HashFunction> list = new ArrayList<>();
    list.add(first);
    list.add(second);
    Collections.addAll(list, rest);
    return new ConcatenatedHashFunction(list.toArray(new HashFunction[0]));
  }