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) == '.')) {

        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);

*   [Python license example](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/python/ops/nn.py#L1)
*   [Java license example](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/java/src/main/java/org/tensorflow/Graph.java#L1)
*   [Go license example](https://github.com/tensorflow/tensorflow/blob/master/tensorflow/go/operation.go#L1)

-		      }							      \
-		    __result; }))
-
-# define __strcmp_cg(s1, s2, l1) \
-  (__extension__ ({ const unsigned char *__s2 =				      \
-		      (const unsigned char *) (const char *) (s2);	      \
-		    int __result =					      \
-		      (((const unsigned char *) (const char *) (s1))[0]	      \
-		       - __s2[0]);					      \
-		    if (l1 > 0 && __result == 0)			      \
-		      {							      \

        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) == '.')) {

		}
	)

	DB.Migrator().DropTable("level1_level2s", &Level2{}, &Level1{})

	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

l0×l2 + l1×l1 + l2×l0 + 19×(l3×l4 + l4×l3) = 2×l0×l2 + l1×l1 + 19×2×l3×l4 r2 := mul64(l0_2, l2) r2 = addMul64(r2, l1, l1) r2 = addMul64(r2, l3_38, l4) // r3 = l0×l3 + l1×l2 + l2×l1 + l3×l0 + 19×l4×l4 = 2×l0×l3 + 2×l1×l2 + 19×l4×l4 r3 := mul64(l0_2, l3) r3 = addMul64(r3, l1_2, l2) r3 = addMul64(r3, l4_19, l4) // r4 = l0×l4 + l1×l3 + l2×l2 + l3×l1 + l4×l0 = 2×l0×l4 + 2×l1×l3 + l2×l2 r4 := mul64(l0_2, l4) r4 = addMul64(r4, l1_2, l3) r4 = addMul64(r4, l2, l2) c0 := shiftRightBy51(r0) c1 := shiftRightBy51(r1)...

	// limit (8KB), we stop growing the source string once the limit
	// is reached and keep reusing the same source string - that
	// 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

      <match value="0xfff5" type="string" offset="0"/> <!-- V2, L2      -->
      <match value="0xfff6" type="string" offset="0"/> <!-- V2, L1, CRC -->
      <match value="0xfff7" type="string" offset="0"/> <!-- V2, L1      -->
      <match value="0xfffa" type="string" offset="0"/> <!-- V1, L3, CRC -->
      <match value="0xfffb" type="string" offset="0"/> <!-- V1, L3      -->

”í`‚ÒP%è¸ÖéXì uøoûv{ú\ÌÃÐ,7 Á3 è’6‰”…‹1o-L ÞâãÒº¢ jó ðý†Jçö ÿ` øåI=˜ê:W ï°‡ºT³ ¦€O8Kù ïÇÛ<Ð} 4ýÚøÚûÏ: J* ‹÷™í€€èƒ”Ávà #ã〠¢eìB\Ä t²û£¡Ð x® ?ß•sS=dHrèæ4p íŒ6” gþŒ°Ëí÷/8Êò ýÎzŽçÙ- ¬‹ © £ ôìü ¡ S&cé’¹v¼\-g=âàÝ 2Jëm ;¯0²Gñø×ôÈŒ_T Ȫ Þ r<‹@N›¡GÞ >ÐÛ ‘& tdo k '°l1;¼oãÓà’ƒœüè¤9*`zÈÍM‘ ù--"ÜP 2¾> È®·ª ëÓß H%‡f }PùÏ”r~¹¿mÙeF•ß4Ý`ƒR”yߌ,? $b•‚¯ˆÒSš˜brû…h^Ûmà6ì Ь€‰| ‹ á Á¦ z«ïúz¡<þ³ qbf‹_t¦N+ ž#Bpé¢3šy§“â ²KÄ¡)î6‡H)êŸ#C à‘‹—Õ-ú>Z©FMÉiÐ i4 Øß ž80”¸Ùe°ZDy] wÖY+Ïé¬ë a(`lm×0ãúµÞ¬ÂcY%l#¢ íb ñOÏD Áæ Å5 ¦ ? ¤ ýEë»[oõ´...