Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 509 for loom (0.03 sec)

  1. guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

    `only, as it's asleep, I suppose it doesn't mind.'
    
      The table was a large one, but the three were all crowded
    together at one corner of it:  `No room!  No room!' they cried
    out when they saw Alice coming.  `There's PLENTY of room!' said
    Alice indignantly, and she sat down in a large arm-chair at one
    end of the table.
    
      `Have some wine,' the March Hare said in an encouraging tone.
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Oct 29 21:35:03 UTC 2012
    - 145.2K bytes
    - Viewed (0)
  2. src/cmd/asm/internal/lex/input.go

    		// Macro has arguments. Scan list of formals.
    		acceptArg := true
    		args = []string{} // Zero length but not nil.
    	Loop:
    		for {
    			tok = in.Stack.Next()
    			switch tok {
    			case ')':
    				tok = in.Stack.Next() // First token of macro definition.
    				break Loop
    			case ',':
    				if acceptArg {
    					in.Error("bad syntax in definition for macro:", name)
    				}
    				acceptArg = true
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  3. doc/next/6-stdlib/99-minor/testing/61515.md

    Benchmarks can use the new [B.Loop] method in `for b.Loop() { ... }` loops to determine if iteration should continue....
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 20 19:09:41 UTC 2024
    - 118 bytes
    - Viewed (0)
  4. docs/en/docs/advanced/openapi-callbacks.md

    This code won't be executed in your app, we only need it to *document* how that *external API* should look like.
    
    But, you already know how to easily create automatic documentation for an API with **FastAPI**.
    
    So we are going to use that same knowledge to document how the *external API* should look like... by creating the *path operation(s)* that the external API should implement (the ones your API will call).
    
    /// tip
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  5. internal/s3select/jstream/decoder_test.go

    	var (
    		counter int
    		mv      *MetaValue
    		body    = `{ "bio": "bada bing bada boom", "id": 1, "name": "Charles" }
    { "bio": "bada bing bada boom", "id": 2, "name": "Charles" }
    { "bio": "bada bing bada boom", "id": 3, "name": "Charles" }
    { "bio": "bada bing bada boom", "id": 4, "name": "Charles" }
    { "bio": "bada bing bada boom", "id": 5, "name": "Charles" }
    `
    	)
    
    	decoder := NewDecoder(mkReader(body), 0)
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Sep 23 19:35:41 UTC 2024
    - 6.6K bytes
    - Viewed (0)
  6. src/main/java/jcifs/netbios/NameServicePacket.java

            end = srcIndex + this.rDataLength;
            /*
             * Apparently readRDataWireFormat can return 0 if resultCode != 0 in
             * which case this will look indefinitely. Putting this else clause around
             * the loop might fix that. But I would need to see a capture to confirm.
             * if (resultCode != 0) {
             * srcIndex += rDataLength;
             * } else {
             */
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 12K bytes
    - Viewed (0)
  7. src/main/java/jcifs/smb1/netbios/NameServicePacket.java

            addrEntry = new NbtAddress[rDataLength / 6];
            end = srcIndex + rDataLength;
    /* Apparently readRDataWireFormat can return 0 if resultCode != 0 in
    which case this will look indefinitely. Putting this else clause around
    the loop might fix that. But I would need to see a capture to confirm.
    if (resultCode != 0) {
        srcIndex += rDataLength;
    } else {
    */
            for( addrIndex = 0; srcIndex < end; addrIndex++ ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 20:39:42 UTC 2019
    - 12.4K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/util/concurrent/AggregateFuture.java

          // Note that if all the futures on the list are done prior to completing this loop, the last
          // call to addListener() will callback to setOneValue(), transitively call our cleanup
          // listener, and set this.futures to null.
          // This is not actually a problem, since the foreach only needs this.futures to be non-null
          // at the beginning of the loop.
          int i = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 13:13:32 UTC 2024
    - 16.2K bytes
    - Viewed (0)
  9. okhttp/src/test/java/okhttp3/internal/connection/FastFallbackExchangeFinderTest.kt

        plan0.tcpConnectThrowable = IOException("boom 0!")
        val plan1 = routePlanner.addPlan()
        plan1.tcpConnectThrowable = IOException("boom 1!")
    
        taskRunner.newQueue().execute("connect") {
          assertFailsWith<IOException> {
            finder.find()
          }.also { expected ->
            assertThat(expected).hasMessage("boom 0!")
            assertThat(expected.suppressed.single()).hasMessage("boom 1!")
          }
        }
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Wed Apr 24 04:40:49 UTC 2024
    - 20.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/BloomFilter.java

      }
    
      /**
       * Combines this Bloom filter with another Bloom filter by performing a bitwise OR of the
       * underlying data. The mutations happen to <b>this</b> instance. Callers must ensure the Bloom
       * filters are appropriately sized to avoid saturating them.
       *
       * @param that The Bloom filter to combine this Bloom filter with. It is not mutated.
       * @throws IllegalArgumentException if {@code isCompatible(that) == false}
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 23 16:45:30 UTC 2024
    - 26.6K bytes
    - Viewed (0)
Back to top