Pour parler de tâches « synchrones » (en opposition à « asynchrones »), on utilise souvent le terme « séquentiel », car l'ordinateur / le programme va effectuer toutes les étapes d'une tâche séquentiellement avant de passer à une autre tâche, même si ces étapes impliquent de l'attente.

// of crashing.
func ceilFrac(numerator, denominator int64) (ceil int64) {
	if denominator == 0 {
		// do nothing on invalid input
		return ceil
	}
	// Make denominator positive
	if denominator < 0 {
		numerator = -numerator
		denominator = -denominator
	}
	ceil = numerator / denominator
	if numerator > 0 && numerator%denominator != 0 {
		ceil++
	}
	return ceil
}

 * writeObject} methods.
 *
 * @author Jared Levy
 * @author Louis Wasserman
 */
@GwtCompatible
@SuppressWarnings("WrongCommentType") // false positive
abstract class AbstractMapBasedMultimap<K extends @Nullable Object, V extends @Nullable Object>
    extends AbstractMultimap<K, V> implements Serializable {
  /*
   * Here's an outline of the overall design.
   *

        final String pidPart = instanceId.substring(instanceId.lastIndexOf(':') + 1);
        assertTrue(Long.parseLong(pidPart) > 0, "PID should be a positive number");
    }

    @Test
    public void test_isEoled() {
        assertEquals(systemHelper.getCurrentTimeAsLong() > systemHelper.eolTime, systemHelper.isEoled());

        final String result = chatClient.testBuildAssistantHistoryContent(msg, "smart_summary", 200, 200);
        // maxSuffixLen = 200/4 = 50, suffix is truncated to 50 chars
        assertNotNull(result);
        // The suffix portion should not exceed maxSuffixLen
        assertTrue(result.length() <= 250, "result length " + result.length() + " exceeds reasonable bound");
    }

    @Test
    public void test_smartSummary_verySmallBudget() {

    assertTrue(MinMaxPriorityQueue.isEvenLevel(i - 1));
    assertTrue(MinMaxPriorityQueue.isEvenLevel(i));

    // 1 << 31 is negative because of overflow, 1 << 31 - 1 is positive
    // since isEvenLevel adds 1, we need to do - 2.
    assertTrue(MinMaxPriorityQueue.isEvenLevel((1 << 31) - 2));
    assertTrue(MinMaxPriorityQueue.isEvenLevel(Integer.MAX_VALUE - 1));

labels.logLevel=Nivel de registro
labels.purgeSearchLogDay=Eliminar registros de búsqueda
labels.query=Consulta
labels.queryId=ID de consulta
labels.rt=rt
labels.searchLog=Registro de búsqueda
labels.sort=Ordenar
labels.start=Posición de inicio
labels.loginRequired=Requiere inicio de sesión
labels.loginLink=Mostrar enlace de inicio de sesión
labels.threadName=Nombre del hilo
labels.url=URL
labels.userFavorite=Registro de favoritos

        public boolean apply(CharSequence input) {
          return (input.length() > 0) && (input.charAt(0) == 'a');
        }
      };

  @SuppressWarnings("UnnecessaryStringBuilder") // false positive in a weird case
  public void testIndexOf_genericPredicate() {
    List<CharSequence> sequences = new ArrayList<>();
    sequences.add("bob");
    sequences.add(new StringBuilder("charlie"));

     *
     * @param first the first version.
     * @param second the second version.
     * @return negative if the first version is newer than the second version, zero if they are the same or positive if
     * the second version is the newer.
     */
    private static int compareModelVersions(String first, String second) {
        // we use a dedicated comparator because we control our model version scheme.

        // When - Generate multiple nonces
        for (int i = 0; i < sampleSize; i++) {
            nonces[i] = encryptionContext.generateNonce();
        }

        // Then - Check that counter portion has entropy
        // For SMB3-compliant nonces, the first 8 bytes are a counter (little-endian)
        // so we check that the counter bytes change as expected
        Set<String> uniqueCounters = new HashSet<>();