Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 16 for g1 (0.01 seconds)

  1. android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

        MutableGraph<Integer> g1 = builder.build();
        MutableGraph<Integer> g2 = builder.build();
    
        // for g1, add 1->2 first, then 3->1
        g1.putEdge(N1, N2);
        g1.putEdge(N3, N1);
    
        // for g2, add 3->1 first, then 1->2
        g2.putEdge(N3, N1);
        g2.putEdge(N1, N2);
    
        assertThat(g1).isEqualTo(g2);
      }
    
      @Test
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.6K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

        MutableNetwork<Integer, String> g1 = builder.build();
        MutableNetwork<Integer, String> g2 = builder.build();
    
        // for ug1, add e12 first, then e12_a
        g1.addEdge(N1, N2, E12);
        g1.addEdge(N1, N2, E12_A);
    
        // for ug2, add e12_a first, then e12
        g2.addEdge(N1, N2, E12_A);
        g2.addEdge(N1, N2, E12);
    
        assertThat(g1).isEqualTo(g2);
      }
    
      @Test
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 5.9K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java

        MutableNetwork<Integer, String> g1 = builder.build();
        MutableNetwork<Integer, String> g2 = builder.build();
    
        // for ug1, add e12 first, then e12_a
        g1.addEdge(N1, N2, E12);
        g1.addEdge(N1, N2, E12_A);
    
        // for ug2, add e12_a first, then e12
        g2.addEdge(N1, N2, E12_A);
        g2.addEdge(N1, N2, E12);
    
        assertThat(g1).isEqualTo(g2);
      }
    
      @Test
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 5.9K bytes
    - Click Count (0)
  4. impl/maven-core/src/main/java/org/apache/maven/internal/impl/DefaultProjectManager.java

            }
            // Verify groupId and version, intentionally allow artifactId to differ as Maven project may be
            // multi-module with modular sources structure that provide module names used as artifactIds.
            String g1 = project.getGroupId();
            String a1 = project.getArtifactId();
            String v1 = project.getVersion();
            String g2 = artifact.getGroupId();
            String a2 = artifact.getArtifactId();
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Dec 17 16:17:01 GMT 2025
    - 10.9K bytes
    - Click Count (0)
  5. compat/maven-model-builder/src/test/java/org/apache/maven/model/interpolation/reflection/ReflectionValueExtractorTest.java

            project.setBuild(new Build());
    
            // Build up an artifactMap
            project.addArtifact(new Artifact("g0", "a0", "v0", "e0", "c0"));
            project.addArtifact(new Artifact("g1", "a1", "v1", "e1", "c1"));
            project.addArtifact(new Artifact("g2", "a2", "v2", "e2", "c2"));
        }
    
        /**
         * <p>testValueExtraction.</p>
         *
         * @throws Exception if any.
         */
        @Test
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jan 10 07:09:12 GMT 2025
    - 16.9K bytes
    - Click Count (0)
  6. tests/association_generics_test.go

    	}
    
    	// Check if companies were updated
    	var g1, g2 User
    	if err := DB.Preload("Company").First(&g1, u1.ID).Error; err != nil {
    		t.Fatalf("load u1: %v", err)
    	}
    	if err := DB.Preload("Company").First(&g2, u2.ID).Error; err != nil {
    		t.Fatalf("load u2: %v", err)
    	}
    
    	if (g1.Company.ID == 0 || g1.Company.Name != "Category-New") || (g2.Company.ID == 0 || g2.Company.Name != "Category-New") {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Fri Sep 12 05:42:26 GMT 2025
    - 37.9K bytes
    - Click Count (0)
  7. okhttp/src/jvmTest/kotlin/okhttp3/internal/cache/DiskLruCacheTest.kt

          writeUtf8(content)
        }
      }
    
      private fun generateSomeGarbageFiles() {
        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")
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Feb 03 22:17:59 GMT 2026
    - 59.4K bytes
    - Click Count (0)
  8. src/main/webapp/js/purify.min.js

    r","dur","edgemode","elevation","end","exponent","fill","fill-opacity","fill-rule","filter","filterunits","flood-color","flood-opacity","font-family","font-size","font-size-adjust","font-stretch","font-style","font-variant","font-weight","fx","fy","g1","g2","glyph-name","glyphref","gradientunits","gradienttransform","height","href","id","image-rendering","in","in2","intercept","k","k1","k2","k3","k4","kerning","keypoints","keysplines","keytimes","lang","lengthadjust","letter-spacing","kernelmatr...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 06:21:57 GMT 2026
    - 22.7K bytes
    - Click Count (0)
  9. 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
    		if slices.Contains(g2.Members, v1) {
    			found = true
    		}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 184.8K bytes
    - Click Count (1)
  10. tensorflow/c/c_api_test.cc

      TF_Status* s = TF_NewStatus();
      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);
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Wed Jan 07 04:56:09 GMT 2026
    - 97.3K bytes
    - Click Count (0)
Back to Top