Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 51 for indiana (0.09 sec)

  1. docs/pt/docs/tutorial/cors.md

    * `allow_credentials` - Indica que os cookies devem ser suportados para requisições de origem cruzada. O padrão é `False`. Além disso, `allow_origins` não pode ser definido como `['*']` para que as credenciais sejam permitidas, as origens devem ser especificadas.
    * `expose_headers` - Indica quaisquer cabeçalhos de resposta que devem ser disponibilizados ao navegador. O padrão é `[]`.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/hash/Hashing.java

      /**
       * Returns a hash function implementing the <a
       * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
       * algorithm, x86 variant</a> (little-endian variant), using the given seed value, <b>with a known
       * bug</b> as described in the deprecation text.
       *
       * <p>The C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A), which however does not
       * have the bug.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jul 19 16:02:36 UTC 2024
    - 29.3K bytes
    - Viewed (0)
  3. docs/nl/docs/index.md

    * <a href="https://jinja.palletsprojects.com" target="_blank"><code>jinja2</code></a> - Vereist als je de standaard templateconfiguratie wil gebruiken.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 20 19:20:23 UTC 2024
    - 21.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/hash/HashFunction.java

       * {@code int} value, interpreted in little-endian byte order. The implementation <i>might</i>
       * perform better than its longhand equivalent, but should not perform worse.
       *
       * @since 12.0
       */
      HashCode hashInt(int input);
    
      /**
       * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
       * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue May 25 18:22:59 UTC 2021
    - 10.9K bytes
    - Viewed (0)
  5. guava/src/com/google/common/hash/HashFunction.java

       * {@code int} value, interpreted in little-endian byte order. The implementation <i>might</i>
       * perform better than its longhand equivalent, but should not perform worse.
       *
       * @since 12.0
       */
      HashCode hashInt(int input);
    
      /**
       * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
       * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue May 25 18:22:59 UTC 2021
    - 10.9K bytes
    - Viewed (0)
  6. src/main/java/jcifs/internal/smb2/Smb3KeyDerivation.java

            System.arraycopy(label, 0, suffix, 0, label.length);
            // + 1 byte 0x00
            // + context
            System.arraycopy(context, 0, suffix, label.length + 1, context.length);
            // + 4 byte (== r bits) big endian encoding of L
            suffix[ suffix.length - 1 ] = (byte) 128;
    
            DerivationParameters param = new KDFCounterParameters(sessionKey, null /* prefix */, suffix /* suffix */, r /* r */);
            gen.init(param);
    
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 5.7K bytes
    - Viewed (0)
  7. misc/cgo/gmp/gmp.go

    // making zero values useful and gmp's decision not to.
    func (z *Int) doinit() {
    	if z.init {
    		return
    	}
    	z.init = true
    	C.mpz_init(&z.i[0])
    }
    
    // Bytes returns z's representation as a big-endian byte array.
    func (z *Int) Bytes() []byte {
    	b := make([]byte, (z.Len()+7)/8)
    	n := C.size_t(len(b))
    	C.mpz_export(unsafe.Pointer(&b[0]), &n, 1, 1, 1, 0, &z.i[0])
    	return b[0:n]
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Apr 11 16:34:30 UTC 2022
    - 9.5K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/primitives/Chars.java

        checkArgument(
            result == (int) result,
            "the total number of elements (%s) in the arrays must fit in an int",
            result);
        return (int) result;
      }
    
      /**
       * Returns a big-endian representation of {@code value} in a 2-element byte array; equivalent to
       * {@code ByteBuffer.allocate(2).putChar(value).array()}. For example, the input value {@code
       * '\\u5432'} would yield the byte array {@code {0x54, 0x32}}.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Aug 27 16:47:48 UTC 2024
    - 23.9K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/primitives/Shorts.java

        checkArgument(
            result == (int) result,
            "the total number of elements (%s) in the arrays must fit in an int",
            result);
        return (int) result;
      }
    
      /**
       * Returns a big-endian representation of {@code value} in a 2-element byte array; equivalent to
       * {@code ByteBuffer.allocate(2).putShort(value).array()}. For example, the input value {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Aug 27 16:47:48 UTC 2024
    - 25.5K bytes
    - Viewed (0)
  10. guava/src/com/google/common/primitives/Shorts.java

        checkArgument(
            result == (int) result,
            "the total number of elements (%s) in the arrays must fit in an int",
            result);
        return (int) result;
      }
    
      /**
       * Returns a big-endian representation of {@code value} in a 2-element byte array; equivalent to
       * {@code ByteBuffer.allocate(2).putShort(value).array()}. For example, the input value {@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Aug 27 16:47:48 UTC 2024
    - 25.5K bytes
    - Viewed (0)
Back to top