checksum.Type = checksumType

	// Validate each part and then commit to disk.
	for i, part := range parts {
		partIdx := objectPartIndex(currentFI.Parts, part.PartNumber)
		// All parts should have same part number.
		if partIdx == -1 {
			invp := InvalidPart{
				PartNumber: part.PartNumber,
				GotETag:    part.ETag,
			}
			return oi, invp
		}
		expPart := currentFI.Parts[partIdx]

<img src="/img/tutorial/bigger-applications/image01.png">

## Den gleichen Router mehrmals mit unterschiedlichem `prefix` inkludieren { #include-the-same-router-multiple-times-with-different-prefix }

Sie können `.include_router()` auch mehrmals mit *demselben* Router und unterschiedlichen Präfixen verwenden.

  /** Helper method that asserts the arithmetic mean of x and y is equal to the expectedMean. */
  private static void assertMean(int expectedMean, int x, int y) {
    assertEquals(
        "The expectedMean should be the same as computeMeanSafely",
        expectedMean,
        computeMeanSafely(x, y));
    assertMean(x, y);
  }

  /**
   * Helper method that asserts the arithmetic mean of x and y is equal to the result of

    assertThat(multimap.entries().spliterator().characteristics() & Spliterator.DISTINCT)
        .isEqualTo(0);
  }

  // Yes, we want to test that inverse() returns the same instance each time that it's called.
  @SuppressWarnings("SelfAssertion")
  public void testInverseMinimizesWork() {
    ImmutableListMultimap<String, Character> multimap =

            buffer.putInt(4);
            buffer.putInt(1024);

            // When
            fileFsFullSizeInfo.decode(buffer.array(), 0, 32);

            // Then - multiple calls should return same values
            assertEquals(2000L * 4 * 1024, fileFsFullSizeInfo.getCapacity());
            assertEquals(2000L * 4 * 1024, fileFsFullSizeInfo.getCapacity());

        fireEvent(ResolutionListener.TEST_ARTIFACT, listeners, node);

        Object key = node.getKey();

        // TODO Does this check need to happen here? Had to add the same call
        // below when we iterate on child nodes -- will that suffice?
        if (managedVersions.containsKey(key)) {
            manageArtifact(node, managedVersions, listeners);
        }

<img src="/img/tutorial/bigger-applications/image01.png">

## Включайте той самий router кілька разів з різними `prefix` { #include-the-same-router-multiple-times-with-different-prefix }

Ви також можете використовувати `.include_router()` кілька разів з одним і тим самим router'ом, але з різними префіксами.

	}

	dataBlocks := len(partsMetaData) - parityBlocks

	writeQuorum := dataBlocks
	if dataBlocks == parityBlocks {
		writeQuorum++
	}

	// Since all the valid erasure code meta updated at the same time are equivalent, pass dataBlocks
	// from latestFileInfo to get the quorum
	return dataBlocks, writeQuorum, nil
}

const (
	tierFVID     = "tier-free-versionID"
	tierFVMarker = "tier-free-marker"

                             * Lmhosts, WINS, or BCAST. Otherwise a failed query from say WINS would
                             * get pulled out of the cache for a BCAST on the same name.
                             */
                            response.addrEntry[0].hostName.srcHashCode = request.addr.hashCode();
                            return response.addrEntry[0];
                        }

        if (keyLength == 16) {
            // AES-128 CCM
            cipher = new CCMBlockCipher(new AESEngine());
        } else if (keyLength == 32) {
            // AES-256 CCM - Bouncy Castle supports AES-256 with same AESEngine
            cipher = new CCMBlockCipher(new AESEngine());
        } else {
            throw new IllegalArgumentException("Unsupported key length for CCM: " + keyLength);
        }