}

			// If metadata says encrypted, ask for it in quorum.
			if etyp, ok := crypto.IsEncrypted(meta.Metadata); ok {
				fmt.Fprint(h, etyp)
			}

			// If compressed, look for compressed FileInfo only
			if meta.IsCompressed() {
				fmt.Fprint(h, meta.Metadata[ReservedMetadataPrefix+"compression"])
			}

			metaHashes[i] = hex.EncodeToString(h.Sum(nil))
			h.Reset()
		}
	}

yjeì {: _fïx`GLï}¡oñR^KkòGH GbPû^U`[eòBq4¨BPee}q„mÐ{JãB ²caòn}QòATIˆæ ²C 7ÖKrûTA¾reôgXKpÀ oXÜyQTGÖ¦ku ge՚ν –´ u²ps¸òox vqK{SQ xt¸ßX{rijSlM’ñZq ?kx› ¾Sm~HqJ }P K°Vûwo®²@jq<Zf{l_åV qSŠDmQccêïø¾xå WWXÐYFV pa~sô\qôˆORAÖk~K_¦xjKQÕG¾êYd~ñ ’Ww\ºÖoeù 5 "loØt½_{lId¯h}I "Ôî¯%† l|~UÖ' r‹V\x»‚ ν w g E‘¨ v{KmLe¼-ñJG¢5rIÖp]}E)8pVPR –™1Selšûw•fyoI™eyj]ñ±ninMV³yJ}J×Fim`K³mk`yoÌÜ'¯EÖeWCÖG½CYìSbc2pVWl¥ì­ª1 ÕE†rkkàˆIqÜ"² ),›W¾)IHBeΧºdÜVJQ„¹¹}sòœqu+hsC_¹÷evo{·\ûv{VŸpeNïRE`}G1egZeñíeyà&Ü ~Ÿò½„±¿5q²|_ûpû_½mñd„+";ª}ûxR¼...

#### Preview the result

As already mentioned above, you can use the `./scripts/docs.py` with the `live` command to preview the results (or `mkdocs serve`).

Once you are done, you can also test it all as it would look online, including all the other languages.

To do that, first build all the docs:

<div class="termy">

```console
// Use the command "build-all", this will take a bit
$ python ./scripts/docs.py build-all

    this.countMap = countMap;
  }

  // Query Operations

  /**
   * Returns the number of occurrences of {@code element} in this multiset.
   *
   * @param element the element to look for
   * @return the nonnegative number of occurrences of the element
   */
  @Override
  public int count(@Nullable Object element) {
    AtomicInteger existingCounter = safeGet(countMap, element);

   * the spliterator implementation.
   */
  // @IgnoreJRERequirement is not necessary because this compiles down to a constant.
  // (which is fortunate because Animal Sniffer doesn't look for @IgnoreJRERequirement on fields)
  static final int SPLITERATOR_CHARACTERISTICS =
      Spliterator.IMMUTABLE | Spliterator.NONNULL | Spliterator.ORDERED;

  ImmutableCollection() {}

	}

	for i := range dataDown {
		writers[i] = nil
	}
	for i := data; i < data+parityDown; i++ {
		writers[i] = nil
	}

	b.SetBytes(size)
	b.ReportAllocs()
	for b.Loop() {
		bitrotReaders := make([]io.ReaderAt, len(disks))
		for index, disk := range disks {
			if writers[index] == nil {
				continue
			}
			tillOffset := erasure.ShardFileOffset(0, size, size)

   * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable}
   * is empty.
   *
   * <p><b>Warning:</b> Typical uses of the resulting iterator may produce an infinite loop. You
   * should use an explicit {@code break} or be certain that you will eventually remove all the
   * elements.
   *
   * <p>To cycle over the iterable {@code n} times, use the following: {@code

		p.errorf("expected identifier, found %q", p.lex.Text())
		return "", "", nil, false // Might as well stop now.
	}
	word, cond = p.lex.Text(), ""
	operands = scratch[:0]
	// Zero or more comma-separated operands, one per loop.
	nesting := 0
	colon := -1
	for tok != '\n' && tok != ';' {
		// Process one operand.
		var items []lex.Token
		if cap(operands) > len(operands) {
			// Reuse scratch items slice.

        policy.handlePotentialDeadlock(exception);
        return;
      }
      // Otherwise, it's the first time seeing this lock relationship. Look for
      // a path from the acquiredLock to this.
      Set<LockGraphNode> seen = Sets.newIdentityHashSet();
      ExampleStackTrace path = acquiredLock.findPathTo(this, seen);

      if (path == null) {

                stone(philosophers-stone) -->|benötigt| harry-1
            end
        ```
        »»»


### Special blocks

There are special blocks of notes, tips and others that look like:

    «««
    /// note
    »»»

To translate it, keep the same line and add the translation after a vertical bar.

For example, if you were translating to Spanish, you would write:

    «««