Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 191 - 200 of 260 for hard (0.04 seconds)

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

  1. fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml

      </mime-type>
      <mime-type type="application/x-ustar">
        <glob pattern="*.ustar"/>
      </mime-type>
    
      <mime-type type="application/x-vhd">
        <acronym>VHD</acronym>
        <_comment>Virtual PC Virtual Hard Disk</_comment>
        <tika:link>http://en.wikipedia.org/wiki/VHD_%28file_format%29</tika:link>
        <magic priority="50">
          <match value="conectix" type="string" offset="0"/>
        </magic>
      </mime-type>
    
    Created: Sat Dec 20 11:21:39 GMT 2025
    - Last Modified: Thu Oct 16 07:46:32 GMT 2025
    - 320.2K bytes
    - Click Count (5)
  2. docs/es/docs/tutorial/body.md

    {* ../../docs_src/body/tutorial001_py310.py hl[16] *}
    
    ...y declara su tipo como el modelo que creaste, `Item`.
    
    ## Resultados { #results }
    
    Con solo esa declaración de tipo en Python, **FastAPI** hará lo siguiente:
    
    * Leer el body del request como JSON.
    * Convertir los tipos correspondientes (si es necesario).
    * Validar los datos.
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 7.6K bytes
    - Click Count (0)
  3. docs/es/docs/tutorial/dependencies/dependencies-with-yield.md

    El código posterior a la declaración `yield` se ejecuta después del response:
    
    {* ../../docs_src/dependencies/tutorial007_py39.py hl[5:6] *}
    
    /// tip | Consejo
    
    Puedes usar funciones `async` o regulares.
    
    **FastAPI** hará lo correcto con cada una, igual que con dependencias normales.
    
    ///
    
    ## Una dependencia con `yield` y `try` { #a-dependency-with-yield-and-try }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 13.7K bytes
    - Click Count (0)
  4. docs/de/docs/advanced/security/http-basic-auth.md

    #### Ein „professioneller“ Angriff { #a-professional-attack }
    
    Natürlich würden die Angreifer das alles nicht von Hand versuchen, sondern ein Programm dafür schreiben, möglicherweise mit Tausenden oder Millionen Tests pro Sekunde. Und würden jeweils nur einen zusätzlichen richtigen Buchstaben erhalten.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Sep 20 15:10:09 GMT 2025
    - 6.2K bytes
    - Click Count (0)
  5. docs/en/docs/advanced/security/http-basic-auth.md

    And then they can try again knowing that it's probably something more similar to `stanleyjobsox` than to `johndoe`.
    
    #### A "professional" attack { #a-professional-attack }
    
    Of course, the attackers would not try all this by hand, they would write a program to do it, possibly with thousands or millions of tests per second. And they would get just one extra correct letter at a time.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:15:41 GMT 2025
    - 5K bytes
    - Click Count (0)
  6. docs/es/docs/tutorial/path-params-numeric-validations.md

    * tenerlos en un orden diferente
    * no usar `Annotated`
    
    ...Python tiene una sintaxis especial para eso.
    
    Pasa `*`, como el primer parámetro de la función.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 6.4K bytes
    - Click Count (0)
  7. okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat

    is-a-conservative.com
    is-a-cpa.com
    is-a-cubicle-slave.com
    is-a-democrat.com
    is-a-designer.com
    is-a-doctor.com
    is-a-financialadvisor.com
    is-a-geek.com
    is-a-green.com
    is-a-guru.com
    is-a-hard-worker.com
    is-a-hunter.com
    is-a-landscaper.com
    is-a-lawyer.com
    is-a-liberal.com
    is-a-libertarian.com
    is-a-llama.com
    is-a-musician.com
    is-a-nascarfan.com
    is-a-nurse.com
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 309.7K bytes
    - Click Count (1)
  8. cmd/bootstrap-peer-server.go

    				}
    				mu.Unlock()
    			}(clnt)
    		}
    		wg.Wait()
    
    		select {
    		case <-ctx.Done():
    			return ctx.Err()
    		default:
    			// Sleep and stagger to avoid blocked CPU and thundering
    			// herd upon start up sequence.
    			time.Sleep(25*time.Millisecond + time.Duration(rand.Int63n(int64(100*time.Millisecond))))
    			retries++
    			// after 20 retries start logging that servers are not reachable yet
    			if retries >= 20 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Oct 01 22:13:18 GMT 2024
    - 8.4K bytes
    - Click Count (0)
  9. compat/maven-compat/src/main/mdo/profiles.mdo

          <description><![CDATA[
            This is the file specification used to activate a profile. The missing value will be a the location
            of a file that needs to exist, and if it doesn't the profile must run.  On the other hand exists will test
            for the existence of the file and if it is there will run the profile.
          ]]></description>
          <fields>
            <field>
              <name>missing</name>
              <version>1.0.0</version>
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Wed Jan 22 11:03:29 GMT 2025
    - 13.8K bytes
    - Click Count (0)
  10. internal/dsync/dsync_test.go

    func BenchmarkMutexNoSpin(b *testing.B) {
    	b.ResetTimer()
    	b.ReportAllocs()
    
    	// This benchmark models a situation where spinning in the mutex should be
    	// non-profitable and allows to confirm that spinning does not do harm.
    	// To achieve this we create excess of goroutines most of which do local work.
    	// These goroutines yield during local work, so that switching from
    	// a blocked goroutine to other goroutines is profitable.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 10.8K bytes
    - Click Count (0)
Back to Top