Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for Noop (0.03 sec)

  1. src/cmd/asm/internal/asm/testdata/loong64enc1.s

    	NEGD	F4, F5			// 85181401
    	ABSD	F4, F5			// 85081401
    	TRUNCDW	F4, F5			// 85881a01
    	TRUNCFW	F4, F5			// 85841a01
    	SQRTF	F4, F5			// 85441401
    	SQRTD	F4, F5			// 85481401
    
    	DBAR	 			// 00007238
    	NOOP	 			// 00004003
    
    	CMPEQF	F4, F5, FCC0		// a010120c
    	CMPGTF	F4, F5, FCC1 		// a190110c
    	CMPGTD	F4, F5, FCC2 		// a290210c
    	CMPGEF	F4, F5, FCC3		// a390130c
    	CMPGED	F4, F5, FCC4		// a490230c
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Thu Sep 04 19:24:25 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  2. src/archive/tar/strconv_test.go

    		{
    			name: "LeadingError",
    			in:   "1.abc123",
    			want: time.Time{},
    			ok:   false,
    		},
    	}
    	for _, tt := range tests {
    		b.Run(tt.name, func(b *testing.B) {
    			b.ReportAllocs()
    			for b.Loop() {
    				ts, err := parsePAXTime(tt.in)
    				if (err == nil) != tt.ok {
    					if err != nil {
    						b.Fatal(err)
    					}
    					b.Fatal("expected error")
    				}
    				if !ts.Equal(tt.want) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Sep 08 17:08:20 UTC 2025
    - 15K bytes
    - Viewed (0)
  3. src/bytes/bytes.go

    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    						if s[i-k] != b[last-k] {
    							continue loop
    						}
    					}
    					return i - last
    				}
    			}
    		}
    		return -1
    	}
    }
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 35.5K bytes
    - Viewed (0)
  4. src/bufio/bufio.go

    			if n < 0 {
    				panic(errNegativeRead)
    			}
    			if n > 0 {
    				b.lastByte = int(p[n-1])
    				b.lastRuneSize = -1
    			}
    			return n, b.readErr()
    		}
    		// One read.
    		// Do not use b.fill, which will loop.
    		b.r = 0
    		b.w = 0
    		n, b.err = b.rd.Read(b.buf)
    		if n < 0 {
    			panic(errNegativeRead)
    		}
    		if n == 0 {
    			return 0, b.readErr()
    		}
    		b.w += n
    	}
    
    	// copy as much as we can
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  5. cmd/erasure-object.go

    		}
    
    		written, err := erasure.Decode(ctx, writer, readers, partOffset, partLength, partSize, prefer)
    		// Note: we should not be defer'ing the following closeBitrotReaders() call as
    		// we are inside a for loop i.e if we use defer, we would accumulate a lot of open files by the time
    		// we return from this function.
    		closeBitrotReaders(readers)
    		if err != nil {
    			// If we have successfully written all the content that was asked
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Sep 07 16:13:09 UTC 2025
    - 80.4K bytes
    - Viewed (0)
  6. docs/en/docs/release-notes.md

    ## 0.47.1
    
    * Fix model filtering in `response_model`, cloning sub-models. PR [#889](https://github.com/tiangolo/fastapi/pull/889).
    * Fix FastAPI serialization of Pydantic models using ORM mode blocking the event loop. PR [#888](https://github.com/tiangolo/fastapi/pull/888).
    
    ## 0.47.0
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 12:48:45 UTC 2025
    - 544.1K bytes
    - Viewed (0)
Back to top