For large responses, returning a `Response` directly is much faster than returning a dictionary.

This is because by default, FastAPI will inspect every item inside and make sure it is serializable as JSON, using the same [JSON Compatible Encoder](../tutorial/encoder.md){.internal-link target=_blank} explained in the tutorial. This is what allows you to return **arbitrary objects**, for example database models.

# 'k' for kilobytes, 'M' for megabytes, or 'G' for gigabytes, and the + to indicate
# "anything greater than" is added by the script.
if [[ "$TFCI_WHL_SIZE_LIMIT_ENABLE" == "1" ]] && [[ -n "$("$TFCI_FIND_BIN" . -iname "*.whl" -size "+$TFCI_WHL_SIZE_LIMIT")" ]]; then
  echo "Error: Generated wheel is too big! Limit is $TFCI_WHL_SIZE_LIMIT"
  echo '(search for TFCI_WHL_SIZE_LIMIT to change it)'
  ls -sh *.whl
  exit 2
fi

        assertTrue(reqCap.getValue() instanceof Smb2ChangeNotifyRequest);
    }

    // call() should delegate to watch() and return the same list
    @Test
    @DisplayName("call() delegates to watch() and returns same result")
    void call_delegatesToWatch() throws Exception {
        List<FileNotifyInformation> info = new ArrayList<>();
        NotifyResponse resp = mock(NotifyResponse.class);

64 sets, which is *16* 64 = 1024* drives in total.

- *If total number of nodes are of odd number then GCD algorithm provides affinity towards odd number erasure sets to provide for uniform distribution across nodes*. This is to ensure that same number of drives are pariticipating in any erasure set. For example if you have 2 nodes with 180 drives then GCD is 15 but this would lead to uneven distribution, one of the nodes would participate more drives. To avoid this the affinity is given towards...

    @Test
    void testGetUserPrincipal() {
        // Act: Call the method under test
        Principal actualPrincipal = ntlmRequest.getUserPrincipal();

        // Assert: Verify that the returned principal is the same as the one provided in the constructor
        assertSame(mockPrincipal, actualPrincipal, "getUserPrincipal should return the principal object.");
    }

    /**

        @Test
        void arraysHaveSameLength() {
            assertEquals(WinError.WINERR_CODES.length, WinError.WINERR_MESSAGES.length,
                    "WINERR_CODES and WINERR_MESSAGES should have the same length");
        }

        @Test
        void messagesAlignWithCodes() {
            for (int i = 0; i < WinError.WINERR_CODES.length; i++) {
                int code = WinError.WINERR_CODES[i];

            // first one is known, so it comes first
            return -1;
        }
        int rv = Integer.compare(i1, i2);
        if (rv != 0) {
            return rv;
        }
        // same execution point, now compare priorities
        return Integer.compare(p1.priority(), p2.priority());
    }

  <artifactId>testvalidpom</artifactId>
  <version>0.0.1-SNAPSHOT</version>

  <description>
    This will test if the module validator recognized that this dependency with classifier
    is not the same as the module itself.
  </description>
  <dependencies>
    <dependency>
      <groupId>com.example.group</groupId>
      <artifactId>testvalidpom</artifactId>
      <version>0.0.1-SNAPSHOT</version>

  <groupId>com.example.group</groupId>
  <artifactId>testinvalidpom</artifactId>
  <version>0.0.1-SNAPSHOT</version>

  <description>
    This will test if the module validator recognized that this
    dependency is the same as the module itself.
  </description>
  <dependencies>
    <dependency>
      <groupId>com.example.group</groupId>
      <artifactId>testinvalidpom</artifactId>
      <version>0.0.1-SNAPSHOT</version>

Allow: /$
Allow: /index.html$
Allow: /public/

# Test priority rules (longer match wins)
User-agent: PriorityBot
Disallow: /store
Allow: /store/public
Disallow: /store/public/sale

# Test Allow vs Disallow with same length (Allow wins)
User-agent: SameLengthBot
Disallow: /page
Allow: /page

# Test multiple wildcards
User-agent: MultiWildcardBot
Disallow: /*.cgi*
Disallow: /*?*id=*

# Test literal $ in middle of pattern