Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 421 - 429 of 429 for relocated (0.28 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat

    amazon
    
    // americanexpress : American Express Travel Related Services Company, Inc.
    // https://www.iana.org/domains/root/db/americanexpress.html
    americanexpress
    
    // americanfamily : AmFam, Inc.
    // https://www.iana.org/domains/root/db/americanfamily.html
    americanfamily
    
    // amex : American Express Travel Related Services Company, Inc.
    // https://www.iana.org/domains/root/db/amex.html
    amex
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 309.7K bytes
    - Click Count (1)
  2. CREDITS

    is an owner of Copyright and Related Rights in the Work, voluntarily
    elects to apply CC0 to the Work and publicly distribute the Work under its
    terms, with knowledge of his or her Copyright and Related Rights in the
    Work and the meaning and intended legal effect of CC0 on those rights.
    
    1. Copyright and Related Rights. A Work made available under CC0 may be
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Mar 13 05:29:51 GMT 2025
    - 1.8M bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/Maps.java

          // independent of the initial capacity, except that it won't be lower than the threshold
          // computed from that capacity. Because the internal table is only allocated on the first
          // write, we won't see copying because of the new threshold. So it is always OK to use the
          // calculation here.
          return (int) ceil(expectedSize / 0.75);
        }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 157.6K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/Maps.java

          // independent of the initial capacity, except that it won't be lower than the threshold
          // computed from that capacity. Because the internal table is only allocated on the first
          // write, we won't see copying because of the new threshold. So it is always OK to use the
          // calculation here.
          return (int) ceil(expectedSize / 0.75);
        }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 163.4K bytes
    - Click Count (0)
  5. src/main/webapp/js/jquery-3.7.1.min.map

    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 131.6K bytes
    - Click Count (0)
  6. src/main/webapp/js/admin/jquery-3.7.1.min.map

    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 131.6K bytes
    - Click Count (0)
  7. src/main/webapp/js/bootstrap.min.js.map

    {\n      this._setAttributeIfNotExists(outerElem, 'role', 'presentation')\n    }\n\n    if (!isActive) {\n      child.setAttribute('tabindex', '-1')\n    }\n\n    this._setAttributeIfNotExists(child, 'role', 'tab')\n\n    // set attributes to the related panel too\n    this._setInitialAttributesOnTargetPanel(child)\n  }\n\n  _setInitialAttributesOnTargetPanel(child) {\n    const target = SelectorEngine.getElementFromSelector(child)\n\n    if (!target) {\n      return\n    }\n\n    this._setAttrib...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 12 06:14:02 GMT 2025
    - 211.9K bytes
    - Click Count (0)
  8. lib/fips140/v1.26.0.zip

    the size of m and overwritten. // //go:norace func (x *Nat) montgomeryMul(a *Nat, b *Nat, m *Modulus) *Nat { n := len(m.nat.limbs) mLimbs := m.nat.limbs[:n] aLimbs := a.limbs[:n] bLimbs := b.limbs[:n] switch n { default: // Attempt to use a stack-allocated backing array. T := make([]uint, 0, preallocLimbs*2) if cap(T) < n*2 { T = make([]uint, 0, n*2) } T = T[:n*2] // This loop implements Word-by-Word Montgomery Multiplication, as // described in Algorithm 4 (Fig. 3) of "Efficient Software // Implementations...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  9. lib/fips140/v1.0.0-c2097c7c.zip

    the size of m and overwritten. // //go:norace func (x *Nat) montgomeryMul(a *Nat, b *Nat, m *Modulus) *Nat { n := len(m.nat.limbs) mLimbs := m.nat.limbs[:n] aLimbs := a.limbs[:n] bLimbs := b.limbs[:n] switch n { default: // Attempt to use a stack-allocated backing array. T := make([]uint, 0, preallocLimbs*2) if cap(T) < n*2 { T = make([]uint, 0, n*2) } T = T[:n*2] // This loop implements Word-by-Word Montgomery Multiplication, as // described in Algorithm 4 (Fig. 3) of "Efficient Software // Implementations...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top