new LicenseMatcher(
            "MIT",
            true,
            false,
            Pattern.compile(
                ("\n"
                    + "Permission is hereby granted, free of charge, to any person obtaining a copy of\n"
                    + "this software and associated documentation files \\(the \"Software\"\\), to deal in\n"
                    + "the Software without restriction, including without limitation the rights to\n"

        Optional<Long> size = byteSource.sizeIfKnown();
        // if we know the size and it fits in an int
        if (size.isPresent() && size.get().longValue() == size.get().intValue()) {
          // otherwise try to presize a StringBuilder
          // it is kind of lame that we need to construct a decoder to access this value.
          // if this is a concern we could add special cases for some known charsets (like utf8)

        Optional<Long> size = byteSource.sizeIfKnown();
        // if we know the size and it fits in an int
        if (size.isPresent() && size.get().longValue() == size.get().intValue()) {
          // otherwise try to presize a StringBuilder
          // it is kind of lame that we need to construct a decoder to access this value.
          // if this is a concern we could add special cases for some known charsets (like utf8)

public class BaseParserTest {
    private final BaseParser subject = new BaseParser() {
        @Override
        protected Options parseCliOptions(LocalContext context) {
            try {
                return CommonsCliOptions.parse(
                        "test", context.parserRequest.args().toArray(new String[0]));
            } catch (ParseException e) {
                throw new IllegalArgumentException(e);
            }
        }
    };

}

type IndexOption struct {
	*Field
	Expression string
	Sort       string // DESC, ASC
	Collate    string
	Length     int
	Priority   int
}

// ParseIndexes parse schema indexes
func (schema *Schema) ParseIndexes() []*Index {
	indexesByName := map[string]*Index{}
	indexes := []*Index{}

	for _, field := range schema.Fields {

	flag.PrintDefaults()
	os.Exit(2)
}

var wflag = flag.Bool("w", false, "write build ID")

func main() {
	log.SetPrefix("buildid: ")
	log.SetFlags(0)
	counter.Open()
	flag.Usage = usage
	flag.Parse()
	counter.Inc("buildid/invocations")
	counter.CountFlags("buildid/flag:", *flag.CommandLine)
	if flag.NArg() != 1 {
		usage()
	}

	file := flag.Arg(0)
	id, err := buildid.ReadFile(file)
	if err != nil {

                val latest = fetchVersionsFromMavenMetadata(metadataUrl)
                    .maxByOrNull { VersionNumber.parse(it) }
                    ?: error("No version found for plugin $pluginId")

                TestedVersion(pluginId, latest)
            }

    private

        byte[] mic = new byte[] { 9, 9, 9 };
        NegTokenTarg original = new NegTokenTarg(NegTokenTarg.ACCEPT_COMPLETED, mech, tokenArray, mic);

        // Act – serialise and parse back
        byte[] bytes = original.toByteArray();
        NegTokenTarg roundTrip = new NegTokenTarg(bytes);

        // Assert – all getters match the original values

        final Map<String, ChangelogEntry> changelogs = this.changelogs.getFiles()
            .stream()
            .collect(Collectors.toMap(file -> rootDir.relativize(file.toURI()).toString(), ChangelogEntry::parse));

        // We don't try to find all such errors, because we expect them to be rare e.g. only
        // when a new file is added.
        changelogs.forEach((path, entry) -> {

///

### Lifespan-Funktion { #lifespan-function }

Das Erste, was auffällt, ist, dass wir eine asynchrone Funktion mit `yield` definieren. Das ist sehr ähnlich zu Abhängigkeiten mit `yield`.

{* ../../docs_src/events/tutorial003_py310.py hl[14:19] *}

Der erste Teil der Funktion, vor dem `yield`, wird ausgeführt **bevor** die Anwendung startet.