xpathTransformer.setPropertyMap(propertyMap);
            Map<String, String> childUrlRuleMap = newHashMap();
            childUrlRuleMap.put("//A", "href");
            childUrlRuleMap.put("//AREA", "href");
            childUrlRuleMap.put("//FRAME", "src");
            childUrlRuleMap.put("//IFRAME", "src");
            childUrlRuleMap.put("//IMG", "src");
            childUrlRuleMap.put("//LINK", "href");

   *
   * If we pick a function that goes /below/ that horizontal line, it means that we reduce the area
   * of the function, thus time. Thus, the RateLimiter becomes /faster/ after a period of
   * underutilization. If, on the other hand, we pick a function that goes /above/ that horizontal
   * line, then it means that the area (time) is increased, thus storedPermits are more costly than

souhaitez suivre un cours pour débutants avancés pour compléter cette section de la documentation, vous pouvez consulter : <a href="https://testdrive.io/courses/tdd-fastapi/" class="external- link" target="_blank">Développement piloté par les tests avec FastAPI et Docker</a> par **TestDriven.io**.

10 % de tous les bénéfices de ce cours sont reversés au développement de **FastAPI**. 🎉 😄...

        "h": 3,
        "w": 3,
        "x": 3,
        "y": 0
      },
      "id": 65,
      "maxDataPoints": 100,
      "options": {
        "colorMode": "value",
        "graphMode": "area",
        "justifyMode": "auto",
        "orientation": "auto",
        "reduceOptions": {
          "calcs": [
            "last"
          ],
          "fields": "",
          "values": false

            echoRequest.writeBytesWireFormat(buffer, startIndex);

            // Check bytes before written area are unchanged
            for (int i = 0; i < startIndex; i++) {
                assertEquals((byte) 0xFF, buffer[i]);
            }

            // Check bytes after written area are unchanged
            for (int i = startIndex + 4; i < buffer.length; i++) {
                assertEquals((byte) 0xFF, buffer[i]);

            copy.encode(buffer, startIndex);

            // Then
            // Check bytes before encoded area
            for (int i = 0; i < startIndex; i++) {
                assertEquals(testByte, buffer[i], "Byte at position " + i + " was modified");
            }

            // Check bytes after encoded area
            for (int i = startIndex + expectedSize; i < buffer.length; i++) {

    /** More processing is required to complete this request */
    int NT_STATUS_MORE_PROCESSING_REQUIRED = 0xC0000016;
    /** Access is denied */
    int NT_STATUS_ACCESS_DENIED = 0xC0000022;
    /** The data area passed to a system call is too small */
    int NT_STATUS_BUFFER_TOO_SMALL = 0xC0000023;
    /** The object name is invalid */
    int NT_STATUS_OBJECT_NAME_INVALID = 0xC0000033;
    /** The object was not found */

    /** More processing is required to complete this request */
    int NT_STATUS_MORE_PROCESSING_REQUIRED = 0xC0000016;
    /** Access is denied */
    int NT_STATUS_ACCESS_DENIED = 0xC0000022;
    /** The data area passed to a system call is too small */
    int NT_STATUS_BUFFER_TOO_SMALL = 0xC0000023;
    /** The object name is invalid */
    int NT_STATUS_OBJECT_NAME_INVALID = 0xC0000033;
    /** The object was not found */

The Gradle code base is essentially a large monolith, without strong internal boundaries.
This has a number of negative effects on productivity, including:

- Unclear ownership of code.
- Difficult to focus on one particular area.
- Unintended coupling between areas of the code, including tests.

## Decision

Organize the Gradle code base into a set of coarse-grained "architecture modules".

        // Check that bytes before startIndex are unchanged
        for (int i = 0; i < startIndex; i++) {
            assertEquals((byte) (i & 0xFF), dst[i]);
        }

        // Check that bytes after written area are unchanged
        for (int i = startIndex + bytesWritten; i < dst.length; i++) {
            assertEquals((byte) (i & 0xFF), dst[i]);
        }
    }

    @Test