given:
        comparer = ExhaustiveLinesSearcher.useUnifiedDiff()
        def expectedLines = ["cat", "bird", "dog"]
        def actualLines = ["kangaroo", "cat", "llama", "dog", "turtle", "cat", "moose", "dog"]

        when:
        comparer.assertLinesContainedIn(expectedLines, actualLines)

        then:
        PotentialMatchesExistComparisonFailure e = thrown(PotentialMatchesExistComparisonFailure)

			m("title", "This is ***fun***")},

		{`message/external-body; access-type=URL; ` +
			`URL*0="ftp://";` +
			`URL*1="cs.utk.edu/pub/moore/bulk-mailer/bulk-mailer.tar"`,
			"message/external-body",
			m("access-type", "URL",
				"url", "ftp://cs.utk.edu/pub/moore/bulk-mailer/bulk-mailer.tar")},

		{`application/x-stuff; ` +
			`title*0*=us-ascii'en'This%20is%20even%20more%20; ` +

-- input --
Loose lists.
  - A

    B
  - C
    D
  - E
  - F
-- gofmt --
Loose lists.

  - A

    B

  - C
    D

  - E

  - F
-- text --
Loose lists.

  - A

    B

  - C D

  - E

  - F
-- markdown --
Loose lists.

  - A

    B

  - C D

  - E

  - F
-- html --
<p>Loose lists.
<ul>
<li><p>A
<p>B

-- input --
Hello, world
 Code block here.
More text.
Tight list
 - one
 - two
 - three
Loose list
 - one

 - two

 - three

# Heading

More text.
-- gofmt --
Hello, world

	Code block here.

More text.
Tight list
  - one
  - two
  - three

Loose list

  - one

  - two

  - three

# Heading

More text.
-- text --

				b.loose = true
				break Loose
			}
		}
		for j, d := range c.Blocks {
			endLine := d.Pos().EndLine
			if j+1 < len(c.Blocks) {
				if c.Blocks[j+1].Pos().StartLine-endLine > 1 {
					b.loose = true
					break Loose
				}
			}
		}
	}

	if !b.loose {
		for _, c := range blocks {
			c := c.(*Item)
			for i, d := range c.Blocks {

 * ======================
 *
 * Given an unique existing element with id "viewport" (or when missing, the 
 * first g-element), including the the library into any SVG adds the following 
 * capabilities:
 *
 *  - Mouse panning
 *  - Mouse zooming (using the wheel)
 *  - Object dragging
 *
 * You can configure the behaviour of the pan/zoom/drag with the variables
 * listed in the CONFIGURATION section of this file.
 *

			line, md, _ = strings.Cut(md, "\n")
			if line != "" {
				out.WriteString("\t")
				out.WriteString(line)
			}
			out.WriteString("\n")
		}

	case *List:
		loose := x.BlankBetween()
		for i, item := range x.Items {
			if i > 0 && loose {
				out.WriteString("\n")
			}
			if n := item.Number; n != "" {
				out.WriteString(" ")
				out.WriteString(n)
				out.WriteString(". ")
			} else {

// license that can be found in the LICENSE file.

package strings

// stringFinder efficiently finds strings in a source text. It's implemented
// using the Boyer-Moore string search algorithm:
// https://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm
// https://www.cs.utexas.edu/~moore/publications/fstrpos.pdf (note: this aged
// document uses 1-based indexing)
type stringFinder struct {

}
/* Flame graph */
#stack-chart {
  width: 100%;
  position: relative; /* Allows absolute positioning of child boxes */
}
/* Shows details of frame that is under the mouse */
#current-details {
  position: absolute;
  top: 5px;
  right: 5px;
  z-index: 2;
  font-size: 12pt;
}
/* Background of a single flame-graph frame */
.boxbg {
  border-width: 0px;

	typName := toRType(typ).string()

	// The maximum number of bytes required to hold the encoded type.
	maxBytes := 1 + 5*traceBytesPerNumber + len(typName)

	// Estimate the size of this record. This
	// bound is pretty loose, but avoids counting
	// lots of varint sizes.
	//
	// Add 1 because we might also write a traceAllocFreeTypesBatch byte.
	var flushed bool
	w, flushed = w.ensure(1 + maxBytes)
	if flushed {