Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for leftPos (0.05 seconds)

  1. src/main/webapp/js/admin/popper.min.js

    g(e){return le({},e,{right:e.left+e.width,bottom:e.top+e.height})}function u(e){var o={};try{if(r(10)){o=e.getBoundingClientRect();var n=l(e,'top'),i=l(e,'left');o.top+=n,o.left+=i,o.bottom+=n,o.right+=i}else o=e.getBoundingClientRect()}catch(t){}var p={left:o.left,top:o.top,width:o.right-o.left,height:o.bottom-o.top},s='HTML'===e.nodeName?c(e.ownerDocument):{},d=s.width||e.clientWidth||p.width,a=s.height||e.clientHeight||p.height,f=e.offsetWidth-d,h=e.offsetHeight-a;if(f||h){var u=t(e);f-=m(u,'x'),h-=...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 20.7K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/TopKSelector.java

       * k) worst case.
       */
      private void trim() {
        int left = 0;
        int right = 2 * k - 1;
    
        int minThresholdPosition = 0;
        // The leftmost position at which the greatest of the k lower elements
        // -- the new value of threshold -- might be found.
    
        int iterations = 0;
        int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 31 13:15:26 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/CertificatePinner.kt

     *    no pinning will be enforced if additional prefixes are present, or if no prefixes are present.
     *
     * Note that any other form is unsupported. You may not use asterisks in any position other than
     * the leftmost label.
     *
     * If multiple patterns match a hostname, any match is sufficient. For example, suppose pin A
     * applies to `*.publicobject.com` and pin B applies to `api.publicobject.com`. Handshakes for
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 14.2K bytes
    - Click Count (1)
  4. docs/pt/docs/advanced/advanced-dependencies.md

    O código de saída, o fechamento automático da `Session` em:
    
    {* ../../docs_src/dependencies/tutorial013_an_py310.py ln[19:21] *}
    
    ...seria executado depois que a resposta terminar de enviar os dados lentos:
    
    {* ../../docs_src/dependencies/tutorial013_an_py310.py ln[30:38] hl[31:33] *}
    
    Mas como `generate_stream()` não usa a sessão do banco de dados, não é realmente necessário manter a sessão aberta enquanto envia a resposta.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 9.9K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/collect/TopKSelector.java

       * k) worst case.
       */
      private void trim() {
        int left = 0;
        int right = 2 * k - 1;
    
        int minThresholdPosition = 0;
        // The leftmost position at which the greatest of the k lower elements
        // -- the new value of threshold -- might be found.
    
        int iterations = 0;
        int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 31 13:15:26 GMT 2025
    - 11.3K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/net/InternetDomainName.java

      public boolean hasParent() {
        return parts.size() > 1;
      }
    
      /**
       * Returns an {@code InternetDomainName} that is the immediate ancestor of this one; that is, the
       * current domain with the leftmost part removed. For example, the parent of {@code
       * www.google.com} is {@code google.com}.
       *
       * @throws IllegalStateException if the domain has no parent, as determined by {@link #hasParent}
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 03 21:21:59 GMT 2026
    - 26.2K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/net/InetAddresses.java

        }
        return "";
      }
    
      /**
       * Identify and mark the longest run of zeroes in an IPv6 address.
       *
       * <p>Only runs of two or more hextets are considered. In case of a tie, the leftmost run wins. If
       * a qualifying run is found, its hextets are replaced by the sentinel value -1.
       *
       * @param hextets {@code int[]} mutable array of eight 16-bit hextets
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 47.7K bytes
    - Click Count (0)
Back to Top