SmbResourceLocatorImpl l1 = locator("smb://server/share/file");
        SmbResourceLocatorImpl l2 = locator("smb://SERVER/share/file");
        assertEquals(l1, l2);
        assertEquals(l1.hashCode(), l2.hashCode());

        // Different path -> not equal
        SmbResourceLocatorImpl l5 = locator("smb://server/share/other");
        assertNotEquals(l1, l5);

        int p1, p2, l1, l2;

        // if unsure return this method returns true

        p1 = path1.lastIndexOf('/');
        p2 = path2.lastIndexOf('/');
        l1 = path1.length() - p1;
        l2 = path2.length() - p2;

        // anything with dots voids comparison
        if ((l1 > 1 && path1.charAt(p1 + 1) == '.') || (l2 > 1 && path2.charAt(p2 + 1) == '.')) {
            return true;

	}
	l1 := Language{Code: "zz", Name: "ZZ"}
	l2 := Language{Code: "yy", Name: "YY"}
	DB.FirstOrCreate(&l1, "code = ?", l1.Code)
	DB.FirstOrCreate(&l2, "code = ?", l2.Code)
	if err := DB.Model(&u1).Association("Languages").Append(&l1, &l2); err != nil {
		t.Fatalf("append u1: %v", err)
	}
	if err := DB.Model(&u2).Association("Languages").Append(&l1, &l2); err != nil {
		t.Fatalf("append u2: %v", err)
	}

	if err := DB.AutoMigrate(new(Level1), new(Level2)); err != nil {
		t.Error(err)
	}

	lvl := Level1{
		Name: "l1",
		Level2s: []Level2{
			{Name: "l2-1"}, {Name: "l2-2"},
		},
	}
	DB.Save(&lvl)

	var called int64
	DB.Callback().Query().After("gorm:query").Register("TestPreloadManyToManyCallbacks", func(_ *gorm.DB) {
		atomic.AddInt64(&called, 1)
	})

*   [Go license example](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/go/operation.go#L1)
*   [Bash license example](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/tools/ci_build/ci_build.sh#L2)
*   [JavaScript/TypeScript license example](https://github.com/tensorflow/tensorboard/blob/master/tensorboard/components/tf_backend/backend.ts#L1)

Bazel BUILD files also need to include a license section, e.g.,

	// should therefore be always resident in the L1 cache - until we
	// have completed the construction of the result.
	// This yields significant speedups (up to +100%) in cases where
	// the result length is large (roughly, over L2 cache size).
	const chunkLimit = 8 * 1024
	chunkMax := n
	if chunkMax > chunkLimit {
		chunkMax = chunkLimit / len(b) * len(b)
		if chunkMax == 0 {
			chunkMax = len(b)
		}
	}

Shinsuke Sugaya <******@****.***> 1771833824 +0900

Shinsuke Sugaya <******@****.***> 1771833824 +0900

Guillaume Nodet <******@****.***> 1760595156 +0200

Shinsuke Sugaya <******@****.***> 1768009110 +0900