Search Options

Results per page
Sort
Preferred Languages
Advance

Results 151 - 160 of 212 for flit (0.02 sec)

  1. licenses/github.com/hashicorp/hcl/LICENSE

       warranty of any kind, either expressed, implied, or statutory, including,
       without limitation, warranties that the Covered Software is free of defects,
       merchantable, fit for a particular purpose or non-infringing. The entire
       risk as to the quality and performance of the Covered Software is with You.
       Should any Covered Software prove defective in any respect, You (not any
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Oct 26 02:47:39 UTC 2019
    - 15.6K bytes
    - Viewed (0)
  2. ci/official/requirements_updater/numpy1_requirements/requirements_lock_3_9.txt

        --hash=sha256:c533091d8a3bbf7460a00cb6c1a71da93bffe148f172c7d03b1c31fbf8aa2a0b \
        --hash=sha256:cf4a99b05376513717ab5d82a0db832c56ccea4fd61a69dbb7bccf2dfb207dbe
        # via -r ci/official/requirements_updater/requirements.in
    lit==17.0.6 \
        --hash=sha256:dfa9af9b55fc4509a56be7bf2346f079d7f4a242d583b9f2e0b078fd0abae31b
        # via -r ci/official/requirements_updater/requirements.in
    markdown==3.6 \
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Mon Oct 28 14:33:43 UTC 2024
    - 47.6K bytes
    - Viewed (0)
  3. licenses/github.com/hashicorp/go-multierror/LICENSE

       warranty of any kind, either expressed, implied, or statutory, including,
       without limitation, warranties that the Covered Software is free of defects,
       merchantable, fit for a particular purpose or non-infringing. The entire
       risk as to the quality and performance of the Covered Software is with You.
       Should any Covered Software prove defective in any respect, You (not any
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Oct 26 02:47:39 UTC 2019
    - 15.6K bytes
    - Viewed (0)
  4. src/cmd/asm/internal/asm/asm.go

    					p.errorf("invalid addressing modes for third operand to %s instruction, must be register", op)
    					return
    				}
    				prog.RegTo2 = a[2].Reg
    			case arch.IsARM64TBL(op):
    				// one of its inputs does not fit into prog.Reg.
    				prog.From = a[0]
    				prog.AddRestSource(a[1])
    				prog.To = a[2]
    			case arch.IsARM64CASP(op):
    				prog.From = a[0]
    				prog.To = a[1]
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Oct 21 14:11:44 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/security/oauth2-jwt.md

    ---
    
    **FastAPI** doesn't make any compromise with any database, data model or tool.
    
    It gives you all the flexibility to choose the ones that fit your project the best.
    
    And you can use directly many well maintained and widely used packages like `passlib` and `PyJWT`, because **FastAPI** doesn't require any complex mechanisms to integrate external packages.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sat Oct 26 11:45:10 UTC 2024
    - 12.8K bytes
    - Viewed (0)
  6. docs/nl/docs/python-types.md

    Voor nu hoef je alleen te weten dat `Annotated` bestaat en dat het standaard Python is. 😎
    
    Later zul je zien hoe **krachtig** het kan zijn.
    
    /// tip
    
    Het feit dat dit **standaard Python** is, betekent dat je nog steeds de **best mogelijke ontwikkelaarservaring** krijgt in je editor, met de hulpmiddelen die je gebruikt om je code te analyseren en te refactoren, enz. ✨
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 18.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/ImmutableList.java

          E e1, E e2, E e3, E e4, E e5, E e6, E e7, E e8, E e9, E e10, E e11, E e12, E... others) {
        checkArgument(
            others.length <= Integer.MAX_VALUE - 12, "the total number of elements must fit in an int");
        Object[] array = new Object[12 + others.length];
        array[0] = e1;
        array[1] = e2;
        array[2] = e3;
        array[3] = e4;
        array[4] = e5;
        array[5] = e6;
        array[6] = e7;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 21:21:17 UTC 2024
    - 27.7K bytes
    - Viewed (0)
  8. guava/src/com/google/common/math/BigIntegerMath.java

          int tz = Long.numberOfTrailingZeros(num);
          long normalizedNum = num >> tz;
          shift += tz;
          // Adjust floor(log2(num)) + 1.
          int normalizedBits = bits - tz;
          // If it won't fit in a long, then we store off the intermediate product.
          if (normalizedBits + productBits >= Long.SIZE) {
            bignums.add(BigInteger.valueOf(product));
            product = 1;
            productBits = 0;
          }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/math/LongMath.java

      /**
       * Returns {@code n!}, that is, the product of the first {@code n} positive integers, {@code 1} if
       * {@code n == 0}, or {@link Long#MAX_VALUE} if the result does not fit in a {@code long}.
       *
       * @throws IllegalArgumentException if {@code n < 0}
       */
      @GwtIncompatible // TODO
      public static long factorial(int n) {
        checkNonNegative("n", n);
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/net/InternetDomainName.java

       * encoding of each part occupies at least two bytes (dot plus label externally, length byte plus
       * label internally). Thus, if all labels have the minimum size of one byte, 127 of them will fit.
       */
      private static final int MAX_PARTS = 127;
    
      /**
       * Maximum length of a full domain name, including separators, and leaving room for the root
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Feb 05 20:47:23 UTC 2024
    - 28K bytes
    - Viewed (0)
Back to top