Model.Builder builder = prune(
                Model.newBuilder(model, true)
                        .preserveModelVersion(false)
                        .root(false)
                        .parent(null)
                        .build(null),
                model);
        builder.packaging(POM_PACKAGING);
        builder.profiles(prune(model.getProfiles()));

        model = builder.build();

        }
        return pruneNodeByTags(node, prunedTags);
    }

    /**
     * Prunes nodes based on the specified pruned tags.
     *
     * @param node the node to prune
     * @param prunedTags the array of pruned tag configurations
     * @return the pruned node
     */
    protected Node pruneNodeByTags(final Node node, final PrunedTag[] prunedTags) {

# XPath to extract canonical URL from HTML documents.
crawler.document.html.canonical.xpath=//LINK[@rel='canonical'][1]/@href
# HTML tags to prune (remove) during document processing.
crawler.document.html.pruned.tags=noscript,script,style,header,footer,aside,nav,a[rel=nofollow]
# Maximum length of digest extracted from HTML documents.
crawler.document.html.max.digest.length=120

     */
    String getCrawlerDocumentHtmlCanonicalXpath();

    /**
     * Get the value for the key 'crawler.document.html.pruned.tags'. <br>
     * The value is, e.g. noscript,script,style,header,footer,aside,nav,a[rel=nofollow] <br>
     * comment: HTML tags to prune (remove) during document processing.
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */

}

// ContainsRune reports whether the rune is contained in the UTF-8-encoded byte slice b.
func ContainsRune(b []byte, r rune) bool {
	return IndexRune(b, r) >= 0
}

// ContainsFunc reports whether any of the UTF-8-encoded code points r within b satisfy f(r).
// It stops as soon as a call to f returns true.
func ContainsFunc(b []byte, f func(rune) bool) bool {
	return IndexFunc(b, f) >= 0
}

	}
}

func bmIndexRuneUnicode(rt *unicode.RangeTable, needle rune) func(b *testing.B, n int) {
	var rs []rune
	for _, r16 := range rt.R16 {
		for r := rune(r16.Lo); r <= rune(r16.Hi); r += rune(r16.Stride) {
			if r != needle {
				rs = append(rs, r)
			}
		}
	}
	for _, r32 := range rt.R32 {
		for r := rune(r32.Lo); r <= rune(r32.Hi); r += rune(r32.Stride) {
			if r != needle {
				rs = append(rs, r)
			}

    /*
     * RuntimeExceptionThrowingFuture is provably not a ListenableFuture at compile time, so this
     * code may someday upset Error Prone. We want the test, though, in case that changes in the
     * future, so we will suppress any such future Error Prone reports.
     */
    assertWithMessage(
            "Can't test the main listenInPoolThread path "
                + "if the input is already a ListenableFuture")

	//
	//	R1
	//	offset
	//	$offset
	// Every piece is optional, so we scan left to right and what
	// we discover tells us where we are.

	// Prefix: $.
	var prefix rune
	switch tok := p.peek(); tok {
	case '$', '*':
		prefix = rune(tok)
		p.next()
	}

	// Symbol: sym±offset(SB)
	tok := p.next()
	name := tok.String()
	if tok.ScanToken == scanner.Ident && !p.atStartOfRegister(name) {

    /*
     * RuntimeExceptionThrowingFuture is provably not a ListenableFuture at compile time, so this
     * code may someday upset Error Prone. We want the test, though, in case that changes in the
     * future, so we will suppress any such future Error Prone reports.
     */
    assertWithMessage(
            "Can't test the main listenInPoolThread path "
                + "if the input is already a ListenableFuture")

        } catch (FessSystemException e) {
            assertTrue(e.getMessage().contains("Invalid pruned tag"));
        }

        try {
            PrunedTag.parse("[invalid]");
            fail("Should have thrown FessSystemException");
        } catch (FessSystemException e) {
            assertTrue(e.getMessage().contains("Invalid pruned tag"));
        }

        try {
            PrunedTag.parse(".css-only");