Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for g2 (0.22 sec)

  1. prepare_stmt.go

    	defer close(cacheStmt.prepared)
    
    	// Reason why cannot lock conn.PrepareContext
    	// suppose the maxopen is 1, g1 is creating record and g2 is querying record.
    	// 1. g1 begin tx, g1 is requeue because of waiting for the system call, now `db.ConnPool` db.numOpen == 1.
    	// 2. g2 select lock `conn.PrepareContext(ctx, query)`, now db.numOpen == db.maxOpen , wait for release.
    Go
    - Registered: Sun May 05 09:35:13 GMT 2024
    - Last Modified: Thu Mar 28 08:47:39 GMT 2024
    - 6.4K bytes
    - Viewed (0)
  2. okhttp/src/test/java/okhttp3/internal/cache/DiskLruCacheTest.kt

        val dir1 = cacheDir / "dir1"
        val dir2 = dir1 / "dir2"
        writeFile(getCleanFile("g1", 0), "A")
        writeFile(getCleanFile("g1", 1), "B")
        writeFile(getCleanFile("g2", 0), "C")
        writeFile(getCleanFile("g2", 1), "D")
        writeFile(getCleanFile("g2", 1), "D")
        writeFile(cacheDir / "otherFile0", "E")
        writeFile(dir2 / "otherFile1", "F")
      }
    
      private fun assertGarbageFilesAllDeleted() {
    Plain Text
    - Registered: Fri May 03 11:42:14 GMT 2024
    - Last Modified: Mon Apr 15 14:55:09 GMT 2024
    - 75.8K bytes
    - Viewed (0)
  3. cmd/site-replication.go

    		}
    	}
    	return nil
    }
    
    func isGroupDescEqual(g1, g2 madmin.GroupDesc) bool {
    	if g1.Name != g2.Name ||
    		g1.Status != g2.Status ||
    		g1.Policy != g2.Policy {
    		return false
    	}
    	if len(g1.Members) != len(g2.Members) {
    		return false
    	}
    	for _, v1 := range g1.Members {
    		var found bool
    		for _, v2 := range g2.Members {
    			if v1 == v2 {
    				found = true
    				break
    			}
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Wed May 01 01:09:56 GMT 2024
    - 184.2K bytes
    - Viewed (1)
  4. tensorflow/c/c_api_test.cc

      TF_Graph* g1 = TF_NewGraph();
      TF_Graph* g2 = TF_NewGraph();
    
      TF_Operation* feed = Placeholder(g1, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
      // Attempt to create node in g2 with input from g1
      Neg(feed, g2, s);
      EXPECT_EQ(TF_INVALID_ARGUMENT, TF_GetCode(s));
      EXPECT_STREQ("foo", TF_Message(s));
    
      TF_DeleteGraph(g1);
      TF_DeleteGraph(g2);
      TF_DeleteStatus(s);
    }
    */
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 96.9K bytes
    - Viewed (3)
Back to top