// has changed so we don't change anything on the etcd.
					//
					// Additionally also check if domain is updated/missing with more
					// entries, if that is the case we should update the
					// new domain entries as well.
					continue
				}

				// if domain IPs intersect then it won't be an empty set.
				// such an intersection means that bucket exists on etcd.

         *
         * @return the length in bytes of the entire notification response
         */
        public int getLength() {
            return length;
        }

        /**
         * Sets the total length of the notification response.
         *
         * @param length the length in bytes of the entire notification response
         */
        public void setLength(int length) {

    /**
     * Create a new directory lease context
     *
     * @param key the lease key
     * @param leaseState requested lease state
     * @param scope cache scope for directory entries
     */
    public DirectoryLeaseContext(Smb2LeaseKey key, int leaseState, DirectoryCacheScope scope) {
        this.leaseKey = key;
        this.leaseState = leaseState;
        this.cacheScope = scope;

                for (MetadataGraphEdge e : ins) {
                    sb.append("       from :  ").append(e.toString()).append('\n');
                }
            } else {
                sb.append("      no entries\n");
            }

            List<MetadataGraphEdge> outs = getExcidentEdges(v);
            if (outs != null) {
                for (MetadataGraphEdge e : outs) {

Ce "attendre quelque chose d'autre" fait généralement référence à des opérations <abbr title="Input/Output ou Entrées et Sorties ">I/O</abbr> qui sont relativement "lentes" (comparées à la vitesse du processeur et de la mémoire RAM) telles qu'attendre que :

* de la donnée soit envoyée par le client à travers le réseau

            if (listTable[i] == entry) {
                return i;
            }
        }
        return -1;
    }

    /**
     * Removes the entry corresponding to the specified key from the map entries.
     *
     * @param key
     *            the key
     * @return the removed entry, or {@literal null} if there was no entry for the key
     */
    protected Entry<K, V> removeMap(final Object key) {

            threads[i].start();
        }

        // Wait for all threads to complete
        for (Thread thread : threads) {
            thread.join();
        }

        // Verify all entries were added
        assertEquals(1000, entry.getChildren().size());
    }

    assertThat(entry.getValue()).containsExactly(6, 2);
  }

  public void testOrderedEntries() {
    TreeMultimap<@Nullable String, @Nullable Integer> multimap = createPopulate();
    assertThat(multimap.entries())
        .containsExactly(
            Maps.<@Nullable String, Integer>immutableEntry(null, 7),
            Maps.<@Nullable String, Integer>immutableEntry(null, 3),

    }
    this.plusForSpace = plusForSpace;
    this.safeOctets = createSafeOctets(safeChars);
  }

  /**
   * Creates a boolean array with entries corresponding to the character values specified in
   * safeChars set to true. The array is as small as is required to hold the given character
   * information.
   */

        InternalSession.associate(session, iSession);

        SessionScope sessionScope = container.lookup(SessionScope.class);
        sessionScope.enter();
        sessionScope.seed(MavenSession.class, msession);
        sessionScope.seed(InternalMavenSession.class, iSession);
        sessionScope.seed(Session.class, iSession);
    }