# Alternativas, Inspiração e Comparações

O que inspirou o **FastAPI**, como ele se compara às alternativas e o que FastAPI aprendeu delas.

## Introdução

**FastAPI** não poderia existir se não fosse pelos trabalhos anteriores de outras pessoas.

Houveram tantas ferramentas criadas que ajudaram a inspirar sua criação.

 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.core.lang;

            minimum: 0
            exclusiveMinimum: false
            default: 0
            example: 0
        - name: num
          in: query
          description: The number of returned documents as a search result
          required: false
          schema:
            type: integer
            minimum: 0
            exclusiveMinimum: false
            maximum: 100
            exclusiveMaximum: false

            assertEquals("S-1-5-10-20", unknown.getDomainName());
            assertEquals("30", unknown.getAccountName());

            // Domain type: domain name as-is, account name empty
            SID domain = new SID(buildSidT((byte) 1, ident, 10, 20), jcifs.SID.SID_TYPE_DOMAIN, "MYDOM", "ignored", false);
            assertEquals("MYDOM", domain.getDomainName());

   *
   * @param numBytes the number of bytes in the byte array
   * @param expectedCount the expected number of roundtrippable permutations
   * @param start the starting bytes encoded as a long as big-endian
   * @param lim the limit of bytes to process encoded as a long as big-endian, or -1 to mean the max
   *     limit for numBytes
   */
  @GwtIncompatible // java.nio.charset.Charset

        offset += 4;
        SMBUtil.writeInt2(bytesPerSect, buffer, offset);

        // Decode
        smbInfoAllocation.decode(buffer, 0, buffer.length);

        // The implementation reads values as signed integers and stores them as long
        // Negative values remain negative when stored in long fields
        // The calculations will result in negative values
        long expectedCapacity = (long) alloc * sectPerAlloc * bytesPerSect;

 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

//     if you want shape inference to consider the input tensors of the
//     op for shape inference.
//   - The types need not be set in `input_shapes` as it is not used.
//   - The number of `input_tensors` should be the same as the number of items
//     in `input_shapes`.
//
// The results are returned in `output_shapes` and
// `output_resource_shapes_and_types`. The caller is responsible for freeing the

 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */

        // Test catching as parent exception type
        String message = "Theme error";

        try {
            throw new ThemeException(message);
        } catch (FessSystemException e) {
            assertEquals(message, e.getMessage());
            assertTrue(e instanceof ThemeException);
        } catch (Exception e) {
            fail("Should have caught as FessSystemException, but caught: " + e.getClass());