sharding behavior, but `tf.train.experimental.MaxShardSizePolicy` can be
      used to shard the checkpoint with a maximum shard file size. Users with
      advanced use cases can also write their own custom
      `tf.train.experimental.ShardingCallback`s.

* `tf.train.CheckpointOptions`
    * Added `experimental_skip_slot_variables` (a boolean option) to skip

## 0.55.1

* Fix handling of enums with their own schema in path parameters. To support [pydantic/pydantic#1432](https://github.com/pydantic/pydantic/pull/1432) in FastAPI. PR [#1463](https://github.com/tiangolo/fastapi/pull/1463).

## 0.55.0

uint32) uint32 { return uint32(sbox0[w>>24])<<24 | uint32(sbox0[w>>16&0xff])<<16 | uint32(sbox0[w>>8&0xff])<<8 | uint32(sbox0[w&0xff]) } // Rotate func rotw(w uint32) uint32 { return w<<8 | w>>24 } // Key expansion algorithm. See FIPS-197, Figure 11. // Their rcon[i] is our powx[i-1] << 24. func expandKeyGeneric(c *blockExpanded, key []byte) { checkGenericIsExpect() // Encryption key setup. var i int nk := len(key) / 4 for i = 0; i < nk; i++ { c.enc[i] = byteorder.BEUint32(key[4*i:]) } for ; i < c.roundKeysSize();...

uint32) uint32 { return uint32(sbox0[w>>24])<<24 | uint32(sbox0[w>>16&0xff])<<16 | uint32(sbox0[w>>8&0xff])<<8 | uint32(sbox0[w&0xff]) } // Rotate func rotw(w uint32) uint32 { return w<<8 | w>>24 } // Key expansion algorithm. See FIPS-197, Figure 11. // Their rcon[i] is our powx[i-1] << 24. func expandKeyGeneric(c *blockExpanded, key []byte) { checkGenericIsExpect() // Encryption key setup. var i int nk := len(key) / 4 for i = 0; i < nk; i++ { c.enc[i] = byteorder.BEUint32(key[4*i:]) } for ; i < c.roundKeysSize();...