<name>Apache License, Version 2.0</name>
      <url>http://www.apache.org/licenses/LICENSE-2.0.txt</url>
      <distribution>repo</distribution>
    </license>
  </licenses>
  <scm>
    <connection>scm:git:https://github.com/google/guava.git</connection>
    <developerConnection>scm:git:******@****.***:google/guava.git</developerConnection>
    <url>https://github.com/google/guava</url>
  </scm>
  <developers>
    <developer>

      <name>Apache License, Version 2.0</name>
      <url>http://www.apache.org/licenses/LICENSE-2.0.txt</url>
      <distribution>repo</distribution>
    </license>
  </licenses>
  <scm>
    <connection>scm:git:https://github.com/google/guava.git</connection>
    <developerConnection>scm:git:******@****.***:google/guava.git</developerConnection>
    <url>https://github.com/google/guava</url>
  </scm>
  <developers>
    <developer>

			<organizationUrl>https://codelibs.co</organizationUrl>
		</developer>
	</developers>
	<issueManagement>
		<url>https://github.com/codelibs/fess/issues</url>
	</issueManagement>
	<scm>
		<connection>scm:git:******@****.***:codelibs/fess.git</connection>
		<developerConnection>scm:git:******@****.***:codelibs/fess.git</developerConnection>
		<url>https://github.com/codelibs/fess</url>
	  <tag>HEAD</tag>
  </scm>
	<parent>

	type span struct {
		start int
		end   int
	}
	spans := make([]span, 0, 32)

	// Find the field start and end indices.
	// Doing this in a separate pass (rather than slicing the string s
	// and collecting the result substrings right away) is significantly
	// more efficient, possibly due to cache effects.
	start := -1 // valid span start if >= 0
	for i := 0; i < len(s); {
		r, size := utf8.DecodeRune(s[i:])
		if f(r) {

Additionally, a background task is normally an independent set of logic that should be handled separately, with its own resources (e.g. its own database connection).