ef.StructField.Index = append([]int{fieldStruct.Index[0]}, ef.StructField.Index...)
				} else {
					ef.StructField.Index = append([]int{-fieldStruct.Index[0] - 1}, ef.StructField.Index...)
				}

				if prefix, ok := field.TagSettings["EMBEDDEDPREFIX"]; ok && ef.DBName != "" {
					ef.DBName = prefix + ef.DBName
				}

				if ef.PrimaryKey {

	}

	if len(ef.Name) > 0 && !wildcard.Match(ef.Name, obj.Name) {
		return false
	}
	if ef.OlderThan > 0 && now.Sub(obj.ModTime) <= ef.OlderThan.D() {
		return false
	}

	if ef.CreatedBefore != nil && !obj.ModTime.Before(*ef.CreatedBefore) {
		return false
	}

	if len(ef.Tags) > 0 && !obj.DeleteMarker {
		// Only parse object tags if tags filter is specified.
		var tagMap map[string]string

# URL spec forbids the following.
# https://www.w3.org/Bugs/Public/show_bug.cgi?id=24257
http://\uff05\uff14\uff11.com
http://%ef%bc%85%ef%bc%94%ef%bc%91.com

# ...%00 in fullwidth should fail (also as escaped UTF-8 input)
http://\uff05\uff10\uff10.com
http://%ef%bc%85%ef%bc%90%ef%bc%90.com

# Basic IDN support, UTF-8 and UTF-16 input should be converted to IDN
http://\u4f60\u597d\u4f60\u597d  s:http p:/ h:xn--6qqa088eba

¦EcDist” ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘Ñ äªPartASizes‘Ñ ä¤SizeÑ ä¥MTimeÓ ¹ôc â N§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬content-type¸application/octet-stream¤etagÙ 9fe7a344ef4227d3e537¡vÎeçnÐÄ$•Ä sÉöQð#Ef° ÌS Û|âÓ ¹ôb Îf­Ä ñ.È´ Å Mƒ¤Type ¥V2ObjÞ ¢IDÄ sÉöQð#Ef° ÌS Û|â¤DDirÄ #" ‘³sF"¥ URÄ,C ¦EcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDist” ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘Ñ äªPartASizes‘Ñ ä¤SizeÑ ä¥MTimeÓ ¹ôb Îf­§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬content...

        Mirror mirrorC = newMirror("c", "d,e", "http://de");
        Mirror mirrorC2 = newMirror("c", "*", "http://wildcard");
        Mirror mirrorC3 = newMirror("c", "e,f", "http://ef");

        List<Mirror> mirrors = Arrays.asList(mirrorA2, mirrorA, mirrorA3, mirrorB, mirrorC, mirrorC2, mirrorC3);

        assertSame(mirrorA, mirrorSelector.getMirror(getRepo("a", "http://a.a"), mirrors));

     */
    @Test
    public void testReplace() throws Exception {
        assertEquals("1", "1bc45", StringUtil.replace("12345", "23", "bc"));
        assertEquals("2", "1234ef", StringUtil.replace("12345", "5", "ef"));
        assertEquals("3", "ab2345", StringUtil.replace("12345", "1", "ab"));
        assertEquals("4", "a234a", StringUtil.replace("12341", "1", "a"));

  }

  public void testFixedLengthSplitEqualChunkLength() {
    String simple = "abcdef";
    Iterable<String> letters = Splitter.fixedLength(2).split(simple);
    assertThat(letters).containsExactly("ab", "cd", "ef").inOrder();
  }

  public void testFixedLengthSplitOnlyOneChunk() {
    String simple = "abc";
    Iterable<String> letters = Splitter.fixedLength(3).split(simple);

   *    /
   *   b   e <----> f
   *  / \ /
   * c   d
   * }</pre>
   */
  private static final SuccessorsFunction<Character> CYCLIC_GRAPH_CONTAINING_TREE =
      createDirectedGraph("ab", "bc", "bd", "ed", "ef", "fe");

  /**
   * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code
   * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node

   *    /
   *   b   e <----> f
   *  / \ /
   * c   d
   * }</pre>
   */
  private static final SuccessorsFunction<Character> CYCLIC_GRAPH_CONTAINING_TREE =
      createDirectedGraph("ab", "bc", "bd", "ed", "ef", "fe");

  /**
   * A graph that is not a tree (for example, {@code h} is reachable from {@code f} via both {@code
   * e} and {@code g}) but is a valid input to {@link Traverser#forTree} when starting e.g. at node