labels.search_result_more=Mehr..
labels.search_result_cache=Cache
labels.search_result_similar=Ähnliche Ergebnisse ({0})
labels.facet_label_title=Label
labels.facet_timestamp_title=Zeit
labels.facet_timestamp_1day=Innerhalb von 24 Stunden
labels.facet_timestamp_1week=Innerhalb einer Woche
labels.facet_timestamp_1month=Innerhalb eines Monats
labels.facet_timestamp_1year=Innerhalb eines Jahres
labels.facet_timestamp_3month=Innerhalb von 3 Monaten

      mediaType.parsedCharset = this.parsedCharset;
    }
    // Return one of the constants if the media type is a known type.
    @SuppressWarnings("GetOrDefaultNotNull") // getOrDefault requires API Level 24
    MediaType result = firstNonNull(knownTypes.get(mediaType), mediaType);
    return result;
  }

  /**
   * Replaces all parameters with the given attribute with a single parameter with the

	default:
		return fmt.Errorf("poolMeta: unknown format: %d", binary.LittleEndian.Uint16(data[0:2]))
	}
	switch binary.LittleEndian.Uint16(data[2:4]) {
	case poolMetaVersion:
	default:
		return fmt.Errorf("poolMeta: unknown version: %d", binary.LittleEndian.Uint16(data[2:4]))
	}

	// OK, parse data.
	if _, err = p.UnmarshalMsg(data[4:]); err != nil {
		return err
	}

	switch p.Version {

	// will allow to detect the exact version later.
	xlVersionMinor = 1
)

func init() {
	binary.LittleEndian.PutUint16(xlVersionCurrent[0:2], xlVersionMajor)
	binary.LittleEndian.PutUint16(xlVersionCurrent[2:4], xlVersionMinor)
}

// checkXL2V1 will check if the metadata has correct header and is a known major version.
// The remaining payload and versions are returned.

 *       allocating garbage).
 * </ul>
 *
 * <p>Disadvantages compared to {@code long[]}:
 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
 *   <li><i>Some</i> construction use cases force the data to be copied (though several construction
 *       APIs are offered that don't).

 *       allocating garbage).
 * </ul>
 *
 * <p>Disadvantages compared to {@code int[]}:
 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
 *   <li><i>Some</i> construction use cases force the data to be copied (though several construction
 *       APIs are offered that don't).

	ANDSW $2863311530, R24, ZR                 // 1ff30172
	ANDSW $2863311530, R24, R23                // 17f30172
	ANDS $-140737488289793, R2, R5             // 458051f2
	ANDSW R26->24, R21, R15                    // af629a6a
	ANDS R30@>44, R3, R26                      // 7ab0deea
	ASRW R12, R27, R25                         // 792bcc1a
	ASR R14, R27, R7                           // 672bce9a

    static int computeForWord(int word) {
      return strideTable[3][word & 0xFF]
          ^ strideTable[2][(word >>> 8) & 0xFF]
          ^ strideTable[1][(word >>> 16) & 0xFF]
          ^ strideTable[0][word >>> 24];
    }

    static int combine(int csum, int crc) {
      csum ^= crc;
      for (int i = 0; i < 4; i++) {
        csum = (csum >>> 8) ^ byteTable[csum & 0xFF];
      }
      return csum;
    }

Solo el código anterior e incluyendo la declaración `yield` se ejecuta antes de crear un response:

{* ../../docs_src/dependencies/tutorial007.py hl[2:4] *}

El valor generado es lo que se inyecta en *path operations* y otras dependencias:

{* ../../docs_src/dependencies/tutorial007.py hl[4] *}

		// setting `prefix` to be "orange".
		// Will be used to list on bucketNames[1].
		{
			MaxUploads:  10,
			IsTruncated: false,
			Prefix:      "orange",
		},
		// listMultipartResults - 24.
		// Testing for listing of 3 uploadID's for a given object.
		// setting `prefix` to be "Asia".
		// Will be used to list on bucketNames[1].
		{
			MaxUploads:  10,
			IsTruncated: false,