Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 53 for Ioperm (0.04 sec)

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

    	XXMRGLW VS1, VS2, VS3           // f0611190
    	XXSPLTW VS1, $1, VS2            // f0410a90
    	XXSPLTW VS33, $1, VS34          // f0410a93
    	XXSPLTW V1, $1, V2              // f0410a93
    	XXPERM VS1, VS2, VS3            // f06110d0
    	XXSLDWI VS1, VS2, $1, VS3       // f0611110
    	XXSLDWI V1, V2, $1, V3          // f0611117
    	XXSLDWI V1, $1, V2, V3          // f0611117
    	XXSLDWI VS33, VS34, $1, VS35    // f0611117
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Nov 21 18:27:17 UTC 2024
    - 51.7K bytes
    - Viewed (0)
  2. api/go1.22.txt

    pkg math/rand/v2, func NewPCG(uint64, uint64) *PCG #61716
    pkg math/rand/v2, func NewZipf(*Rand, float64, float64, uint64) *Zipf #61716
    pkg math/rand/v2, func NormFloat64() float64 #61716
    pkg math/rand/v2, func Perm(int) []int #61716
    pkg math/rand/v2, func Shuffle(int, func(int, int)) #61716
    pkg math/rand/v2, func Uint32() uint32 #61716
    pkg math/rand/v2, func Uint32N(uint32) uint32 #61716
    pkg math/rand/v2, func Uint64() uint64 #61716
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Wed Jan 24 20:54:27 UTC 2024
    - 7.7K bytes
    - Viewed (0)
  3. tensorflow/c/c_test_util.cc

      TF_DeleteBuffer(buffer);
      TF_DeleteStatus(s);
      return ret;
    }
    
    bool GetNodeDef(TF_Operation* oper, tensorflow::NodeDef* node_def) {
      TF_Status* s = TF_NewStatus();
      TF_Buffer* buffer = TF_NewBuffer();
      TF_OperationToNodeDef(oper, buffer, s);
      bool ret = TF_GetCode(s) == TF_OK;
      EXPECT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Sat Oct 04 05:55:32 UTC 2025
    - 17.8K bytes
    - Viewed (1)
  4. cmd/erasure.go

    	var wg sync.WaitGroup
    	disks := er.getDisks()
    	infos := make([]DiskInfo, len(disks))
    	r := rand.New(rand.NewSource(time.Now().UnixNano()))
    	for _, i := range r.Perm(len(disks)) {
    		wg.Add(1)
    		go func() {
    			defer wg.Done()
    
    			disk := disks[i]
    			if disk == nil {
    				infos[i].Error = errDiskNotFound.Error()
    				return
    			}
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 16.1K bytes
    - Viewed (0)
  5. tensorflow/c/c_test_util.h

    bool GetGraphDef(TF_Graph* graph, tensorflow::GraphDef* graph_def);
    
    bool GetNodeDef(TF_Operation* oper, tensorflow::NodeDef* node_def);
    
    bool GetFunctionDef(TF_Function* func, tensorflow::FunctionDef* func_def);
    
    bool GetAttrValue(TF_Operation* oper, const char* attr_name,
                      tensorflow::AttrValue* attr_value, TF_Status* s);
    
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Thu Aug 09 01:06:53 UTC 2018
    - 6K bytes
    - Viewed (0)
  6. internal/config/errors-utils.go

    	if errors.Is(err, syscall.EADDRINUSE) {
    		return ErrPortAlreadyInUse(err).Msg("Specified port is already in use")
    	} else if errors.Is(err, syscall.EACCES) || errors.Is(err, syscall.EPERM) {
    		if netErr, ok := err.(*net.OpError); ok {
    			return ErrPortAccess(netErr).Msg("Insufficient permissions to use specified port")
    		}
    	}
    
    	// Failed to identify what type of error this, return a simple UI error
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 3.8K bytes
    - Viewed (0)
  7. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        List<Integer> expected = createOrderedList(size);
        for (Collection<Integer> perm : Collections2.permutations(expected)) {
          for (int i = 0; i < perm.size(); i++) {
            MinMaxPriorityQueue<Integer> q = MinMaxPriorityQueue.create(perm);
            q.removeAt(i);
            assertIntactUsingStartedWith(perm, q);
          }
        }
      }
    
      /** Regression test for bug found. */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 16:03:47 UTC 2025
    - 36.1K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/Collections2.java

       * {@snippet :
       * for (List<String> perm : orderedPermutations(asList("b", "c", "a"))) {
       *   println(perm);
       * }
       * // -> ["a", "b", "c"]
       * // -> ["a", "c", "b"]
       * // -> ["b", "a", "c"]
       * // -> ["b", "c", "a"]
       * // -> ["c", "a", "b"]
       * // -> ["c", "b", "a"]
       *
       * for (List<Integer> perm : orderedPermutations(asList(1, 2, 2, 1))) {
       *   println(perm);
       * }
       * // -> [1, 1, 2, 2]
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 22.6K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/helper/ViewHelper.java

                }
                break;
            case OPERA:
                if (isLocalFile) {
                    url = url.replaceFirst("file:/+", systemProperties.getProperty("file.protocol.winlocal.opera", "file://"));
                } else {
                    url = url.replaceFirst("file:/+", systemProperties.getProperty("file.protocol.opera", "file://"));
                }
                break;
            default:
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Fri Nov 28 16:29:12 UTC 2025
    - 52.6K bytes
    - Viewed (0)
  10. cmd/xl-storage_unix_test.go

    	st, err := os.Stat(path.Join(tmpPath, testCase.volName))
    	if err != nil {
    		t.Fatalf("Stat failed with %s expected to pass.", err)
    	}
    
    	// Get umask of the bits stored.
    	currentUmask := 0o777 - uint32(st.Mode().Perm())
    
    	// Verify if umask is correct.
    	if int(currentUmask) != testCase.expectedUmask {
    		t.Fatalf("Umask check failed expected %d, got %d", testCase.expectedUmask, currentUmask)
    	}
    }
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Wed Apr 09 14:28:39 UTC 2025
    - 3.4K bytes
    - Viewed (0)
Back to top