(d) If the Work includes a "NOTICE" text file as part of its
          distribution, then any Derivative Works that You distribute must
          include a readable copy of the attribution notices contained
          within such NOTICE file, excluding those notices that do not
          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed

          },
          "createdTime" : {
            "type" : "long"
          },
          "depth" : {
            "type" : "integer"
          },
          "description" : {
            "type" : "text"
          },
          "excludedDocUrls" : {
            "type" : "keyword"
          },
          "excludedUrls" : {
            "type" : "keyword"
          },
          "includedDocUrls" : {

      (d) If the Work includes a "NOTICE" text file as part of its
          distribution, then any Derivative Works that You distribute must
          include a readable copy of the attribution notices contained
          within such NOTICE file, excluding those notices that do not
          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed

#
# We'll prevent accidental CRLF line endings from entering the repo
# via the git-codereview gofmt checks and tests.
#
# See golang.org/issue/9281.

            ACE ace = mock(ACE.class);
            when(ace.getApplyToText()).thenReturn("This folder, subfolders and files");

            String text = ace.getApplyToText();
            assertEquals("This folder, subfolders and files", text);
            verify(ace).getApplyToText();
        }
    }

    @Nested
    @DisplayName("Windows Access Check Algorithm Tests")

<div style="text-align: right; margin-right: 10%;">Kabir Khan - <strong>Microsoft</strong> <a href="https://github.com/fastapi/fastapi/pull/26" target="_blank"><small>(ref)</small></a></div>

---

"_A gba àwọn ohun èlò ìwé afọwọkọ **FastAPI** tí kò yí padà láti ṣẹ̀dá olùpín **REST** tí a lè béèrè lọ́wọ́ rẹ̀ láti gba **àsọtẹ́lẹ̀**. [fún Ludwig]_"

          },
          "createdTime" : {
            "type" : "long"
          },
          "depth" : {
            "type" : "integer"
          },
          "description" : {
            "type" : "text"
          },
          "excludedDocPaths" : {
            "type" : "keyword"
          },
          "excludedPaths" : {
            "type" : "keyword"
          },
          "includedDocPaths" : {

      "createdTime": {
        "type": "long"
      },
      "updatedBy": {
        "type": "keyword"
      },
      "updatedTime": {
        "type": "long"
      },
      "description" : {
        "type": "text",
        "analyzer": "standard_analyzer"
      }
    }

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

#include "../../../../../runtime/textflag.h"
// TODO: cover more instruction

TEXT foo(SB),DUPOK|NOSPLIT,$0
	JAL	1(PC)	//CALL 1(PC)	//00040054
	JAL	(R4)	//CALL (R4)	//8100004c
	// relocation in play so the assembled offset should be 0

import org.codelibs.fess.dict.DictionaryItem;

/**
 * Represents a single character mapping rule that defines how input characters are mapped to output characters
 * for text analysis and search processing. This class is used in character mapping dictionaries to transform
 * text during indexing and search operations.
 *
 * <p>Each mapping item consists of one or more input character sequences that are mapped to a single output