Search Options

Results per page
Sort
Preferred Languages
Advance

Results 121 - 130 of 306 for mpos (0.06 sec)

  1. subprojects/core/src/main/java/org/gradle/util/internal/DisconnectableInputStream.java

                                    writePos = 0;
                                }
                                pos = writePos;
                            } finally {
                                lock.unlock();
                            }
    
                            int nread = source.read(buffer, pos, buffer.length - pos);
    
                            lock.lock();
                            try {
                                if (nread > 0) {
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Wed Apr 07 08:18:46 UTC 2021
    - 6.5K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/ssagen/abi.go

    	}
    
    	// Q: is this needed?
    	savepos := base.Pos
    	savedcurfn := ir.CurFunc
    
    	pos := base.AutogeneratedPos
    	base.Pos = pos
    
    	// At the moment we don't support wrapping a method, we'd need machinery
    	// below to handle the receiver. Panic if we see this scenario.
    	ft := f.Nname.Type()
    	if ft.NumRecvs() != 0 {
    		base.ErrorfAt(f.Pos(), 0, "makeABIWrapper support for wrapping methods not implemented")
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 19:57:43 UTC 2024
    - 13.8K bytes
    - Viewed (0)
  3. docs/pt/docs/history-design-future.md

    Tudo de uma forma que oferecesse a melhor experiência de desenvolvimento para todos os desenvolvedores.
    
    ## Requisitos
    
    Após testar várias alternativas, eu decidi que usaria o <a href="https://docs.pydantic.dev/" class="external-link" target="_blank">**Pydantic**</a> por suas vantagens.
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Fri Mar 22 01:42:11 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  4. src/go/types/call.go

    		if i, err := check.verify(pos, tparams, targs, check.context()); err != nil {
    			// best position for error reporting
    			pos := pos
    			if i < len(xlist) {
    				pos = xlist[i].Pos()
    			}
    			check.softErrorf(atPos(pos), InvalidTypeArg, "%s", err)
    		} else {
    			check.mono.recordInstance(check.pkg, pos, tparams, targs, xlist)
    		}
    	}).describef(atPos(pos), "verify instantiation")
    
    	return inst
    }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 19:19:55 UTC 2024
    - 33.5K bytes
    - Viewed (0)
  5. tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.cc

      if (finish < offset + n) {
        finish += block_size_;
      }
      size_t total_bytes_transferred = 0;
      // Now iterate through the blocks, reading them one at a time.
      for (size_t pos = start; pos < finish; pos += block_size_) {
        Key key = std::make_pair(filename, pos);
        // Look up the block, fetching and inserting it if necessary, and update the
        // LRU iterator for the key and block.
        std::shared_ptr<Block> block = Lookup(key);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Jul 16 01:39:09 UTC 2020
    - 11.1K bytes
    - Viewed (0)
  6. src/cmd/vendor/golang.org/x/tools/go/analysis/passes/assign/assign.go

    			re := analysisutil.Format(pass.Fset, rhs)
    			if le == re {
    				pass.Report(analysis.Diagnostic{
    					Pos: stmt.Pos(), Message: fmt.Sprintf("self-assignment of %s to %s", re, le),
    					SuggestedFixes: []analysis.SuggestedFix{
    						{Message: "Remove", TextEdits: []analysis.TextEdit{
    							{Pos: stmt.Pos(), End: stmt.End(), NewText: []byte{}},
    						}},
    					},
    				})
    			}
    		}
    	})
    
    	return nil, nil
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:33 UTC 2023
    - 2.4K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/types2/resolver_test.go

    				if x, ok := s.X.(*syntax.Name); ok {
    					obj := uses[x]
    					if obj == nil {
    						t.Errorf("%s: unresolved qualified identifier %s", x.Pos(), x.Value)
    						return false
    					}
    					if _, ok := obj.(*PkgName); ok && uses[s.Sel] == nil {
    						t.Errorf("%s: unresolved selector %s", s.Sel.Pos(), s.Sel.Value)
    						return false
    					}
    					return false
    				}
    				return true
    			}
    			return true
    		})
    	}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 10 12:59:20 UTC 2023
    - 4.7K bytes
    - Viewed (0)
  8. tensorflow/cc/gradients/linalg_grad.cc

      std::vector<absl::string_view> splits = absl::StrSplit(subscripts, kEllipsis);
      auto index = splits[0].find(label);
      if (index != splits[0].npos) {
        return index;
      }
      if (splits.size() < 2) {
        return absl::nullopt;
      }
      index = splits[1].find(label);
      if (index != splits[1].npos) {
        return index - splits[1].length();
      }
      return absl::nullopt;
    }
    
    // Returns a tuple denoting the slice mapping to ellipsis.
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Mon Mar 07 23:11:54 UTC 2022
    - 20.4K bytes
    - Viewed (0)
  9. src/cmd/compile/internal/ssa/config.go

    	// some logging calls account for more than a few heap allocations.
    	Log() bool
    
    	// Fatalf reports a compiler error and exits.
    	Fatalf(pos src.XPos, msg string, args ...interface{})
    
    	// Warnl writes compiler messages in the form expected by "errorcheck" tests
    	Warnl(pos src.XPos, fmt_ string, args ...interface{})
    
    	// Forwards the Debug flags from gc
    	Debug_checknil() bool
    }
    
    type Frontend interface {
    	Logger
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:11:47 UTC 2024
    - 12.9K bytes
    - Viewed (0)
  10. staging/src/k8s.io/apimachinery/pkg/api/resource/quantity.go

    		// 	return
    		// }
    	}
    	value = str[0:pos]
    
    	// grab the elements of the suffix
    	suffixStart := pos
    	for i := pos; ; i++ {
    		if i >= end {
    			suffix = str[suffixStart:end]
    			return
    		}
    		if !strings.ContainsAny(str[i:i+1], "eEinumkKMGTP") {
    			pos = i
    			break
    		}
    	}
    	if pos < end {
    		switch str[pos] {
    		case '-', '+':
    			pos++
    		}
    	}
    Suffix:
    	for i := pos; ; i++ {
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed May 29 21:48:10 UTC 2024
    - 23.8K bytes
    - Viewed (0)
Back to top