"content_bn",
        "content_ca",
        "content_ckb-iq",
        "content_cs",
        "content_da",
        "content_de",
        "content_el",
        "content_en",
        "content_en-ie",
        "content_es",
        "content_et",
        "content_eu",
        "content_fa",
        "content_fi",
        "content_fr",
        "content_gl",
        "content_gu",

        "content_bn",
        "content_ca",
        "content_ckb-iq",
        "content_cs",
        "content_da",
        "content_de",
        "content_el",
        "content_en",
        "content_en-ie",
        "content_es",
        "content_et",
        "content_eu",
        "content_fa",
        "content_fi",
        "content_fr",
        "content_gl",
        "content_gu",

        "content_bn",
        "content_ca",
        "content_ckb-iq",
        "content_cs",
        "content_da",
        "content_de",
        "content_el",
        "content_en",
        "content_en-ie",
        "content_es",
        "content_et",
        "content_eu",
        "content_fa",
        "content_fi",
        "content_fr",
        "content_gl",
        "content_gu",

   *
   * In part because Cells are relatively large, we avoid creating
   * them until they are needed.  When there is no contention, all
   * updates are made to the base field.  Upon first contention (a
   * failed CAS on base update), the table is initialized to size 2.
   * The table size is doubled upon further contention until
   * reaching the nearest power of two greater than or equal to the

   *
   * In part because Cells are relatively large, we avoid creating
   * them until they are needed.  When there is no contention, all
   * updates are made to the base field.  Upon first contention (a
   * failed CAS on base update), the table is initialized to size 2.
   * The table size is doubled upon further contention until
   * reaching the nearest power of two greater than or equal to the

   *
   * In part because Cells are relatively large, we avoid creating
   * them until they are needed.  When there is no contention, all
   * updates are made to the base field.  Upon first contention (a
   * failed CAS on base update), the table is initialized to size 2.
   * The table size is doubled upon further contention until
   * reaching the nearest power of two greater than or equal to the

 * sum that is used for purposes such as collecting statistics, not for fine-grained synchronization
 * control. Under low update contention, the two classes have similar characteristics. But under
 * high contention, expected throughput of this class is significantly higher, at the expense of
 * higher space consumption.
 *
 * <p>This class extends {@link Number}, but does not define methods such as {@code

 * sum that is used for purposes such as collecting statistics, not for fine-grained synchronization
 * control. Under low update contention, the two classes have similar characteristics. But under
 * high contention, expected throughput of this class is significantly higher, at the expense of
 * higher space consumption.
 *
 * <p>This class extends {@link Number}, but does not define methods such as {@code

 * sum that is used for purposes such as collecting statistics, not for fine-grained synchronization
 * control. Under low update contention, the two classes have similar characteristics. But under
 * high contention, expected throughput of this class is significantly higher, at the expense of
 * higher space consumption.
 *
 * <p>This class extends {@link Number}, but does not define methods such as {@code

// For more refer http://docs.aws.amazon.com/AmazonS3/latest/API/sigv4-streaming.html
func trimAwsChunkedContentEncoding(contentEnc string) (trimmedContentEnc string) {
	if contentEnc == "" {
		return contentEnc
	}
	var newEncs []string
	for _, enc := range strings.Split(contentEnc, ",") {
		if enc != streamingContentEncoding {
			newEncs = append(newEncs, enc)
		}
	}
	return strings.Join(newEncs, ",")
}