Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 427 for moet (0.08 sec)

  1. docs/en/docs/benchmarks.md

    Specifically, to see Uvicorn, Starlette and FastAPI compared together (among many other tools).
    
    The simpler the problem solved by the tool, the better performance it will get. And most of the benchmarks don't test the additional features provided by the tool.
    
    The hierarchy is like:
    
    * **Uvicorn**: an ASGI server
        * **Starlette**: (uses Uvicorn) a web microframework
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  2. futures/failureaccess/pom.xml

      <packaging>jar</packaging>
      <name>Guava InternalFutureFailureAccess and InternalFutures</name>
      <description>
        Contains
        com.google.common.util.concurrent.internal.InternalFutureFailureAccess and
        InternalFutures. Most users will never need to use this artifact. Its
        classes are conceptually a part of Guava, but they're in this separate
        artifact so that Android libraries can use them without pulling in all of
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Feb 12 18:13:11 UTC 2025
    - 5.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/base/MoreObjects.java

        public ToStringHelper addValue(long value) {
          return addUnconditionalHolder(String.valueOf(value));
        }
    
        private static boolean isEmpty(Object value) {
          // Put types estimated to be the most frequent first.
          if (value instanceof CharSequence) {
            return ((CharSequence) value).length() == 0;
          } else if (value instanceof Collection) {
            return ((Collection<?>) value).isEmpty();
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 16.1K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/ImmutableSortedSet.java

       * specified is included. To create a copy of a {@code SortedSet} that preserves the comparator,
       * call {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once.
       *
       * <p>Note that if {@code s} is a {@code Set<String>}, then {@code ImmutableSortedSet.copyOf(s)}
       * returns an {@code ImmutableSortedSet<String>} containing each of the strings in {@code s},
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 36.8K bytes
    - Viewed (0)
  5. LICENSES/third_party/forked/golang/LICENSE

    Copyright (c) 2009 The Go Authors. All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions are
    met:
    
       * Redistributions of source code must retain the above copyright
    notice, this list of conditions and the following disclaimer.
       * Redistributions in binary form must reproduce the above
    copyright notice, this list of conditions and the following disclaimer
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Tue Aug 10 21:37:28 UTC 2021
    - 1.4K bytes
    - Viewed (0)
  6. LICENSES/vendor/github.com/JeffAshton/win_pdh/LICENSE

    Copyright (c) 2010 The win_pdh Authors. All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:
    1. Redistributions of source code must retain the above copyright
       notice, this list of conditions and the following disclaimer.
    2. Redistributions in binary form must reproduce the above copyright
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Fri May 08 04:49:00 UTC 2020
    - 1.5K bytes
    - Viewed (0)
  7. LICENSES/vendor/github.com/godbus/dbus/v5/LICENSE

    Copyright (c) 2013, Georg Reinke (<guelfey at gmail dot com>), Google
    All rights reserved.
    
    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:
    
    1. Redistributions of source code must retain the above copyright notice,
    this list of conditions and the following disclaimer.
    
    2. Redistributions in binary form must reproduce the above copyright
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jun 24 16:39:50 UTC 2020
    - 1.4K bytes
    - Viewed (0)
  8. docs/en/docs/advanced/templates.md

    /// note | Technical Details
    
    You could also use `from starlette.templating import Jinja2Templates`.
    
    **FastAPI** provides the same `starlette.templating` as `fastapi.templating` just as a convenience for you, the developer. But most of the available responses come directly from Starlette. The same with `Request` and `StaticFiles`.
    
    ///
    
    ## Writing templates { #writing-templates }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  9. src/test/java/jcifs/smb1/dcerpc/ndr/NdrShortTest.java

            assertEquals((byte) 0xCD, bufferData[startIndex + alignmentBytes], "Least significant byte should be first");
            assertEquals((byte) 0x00, bufferData[startIndex + alignmentBytes + 1], "Most significant byte should be second");
        }
    
        /**
         * When given a buffer with sufficient length, decode performs
         * the inverse of encode.
         */
        @Test
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 5.1K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java

          isDone = true;
          h1 ^= mixK1((int) buffer);
          return fmix(h1, length);
        }
      }
    
      private static long codePointToFourUtf8Bytes(int codePoint) {
        // codePoint has at most 21 bits
        return ((0xFL << 4) | (codePoint >>> 18))
            | ((0x80L | (0x3F & (codePoint >>> 12))) << 8)
            | ((0x80L | (0x3F & (codePoint >>> 6))) << 16)
            | ((0x80L | (0x3F & codePoint)) << 24);
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 11.8K bytes
    - Viewed (0)
Back to top