1FFF          ; disallowed                             # NA   <reserved-1FFF>
2000..200A    ; disallowed_STD3_mapped ; 0020          # 1.1  EN QUAD..HAIR SPACE
200B          ; ignored                                # 1.1  ZERO WIDTH SPACE
200C..200D    ; deviation              ;               # 1.1  ZERO WIDTH NON-JOINER..ZERO WIDTH JOINER

* Add official Microsoft project generator for [serving spaCy with FastAPI and Azure Cognitive Skills](https://github.com/microsoft/cookiecutter-spacy-fastapi) to [Project Generators](https://fastapi.tiangolo.com/project-generation/). PR [#1390](https://github.com/tiangolo/fastapi/pull/1390) by [@kabirkhan](https://github.com/kabirkhan).

    *   Updates to "constrained_optimization" in tensorflow/contrib.
    *   boosted trees: adding pruning mode.
    *   tf.train.Checkpoint does not delete old checkpoints by default.
    *   tfdbg: Limit the total disk space occupied by dumped tensor data to 100
        GBytes. Add environment variable `TFDBG_DISK_BYTES_LIMIT` to allow
        adjustment of this upper limit.

## Thanks to our Contributors

### General ephemeral volumes

(out *Nat) Exp(x *Nat, e []byte, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for Exp must be odd") } // We use a 4 bit window. For our RSA workload, 4 bit windows are faster // than 2 bit windows, but use an extra 12 nats worth of scratch space. // Using bit sizes that don't divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(),...

(out *Nat) Exp(x *Nat, e []byte, m *Modulus) *Nat { if !m.odd { panic("bigmod: modulus for Exp must be odd") } // We use a 4 bit window. For our RSA workload, 4 bit windows are faster // than 2 bit windows, but use an extra 12 nats worth of scratch space. // Using bit sizes that don't divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(),...

pkg syscall (freebsd-arm64), type Stat_t struct, Rdev uint64
pkg syscall (freebsd-arm64), type Stat_t struct, Size int64
pkg syscall (freebsd-arm64), type Stat_t struct, Spare [10]uint64
pkg syscall (freebsd-arm64), type Stat_t struct, Uid uint32
pkg syscall (freebsd-arm64), type Statfs_t struct
pkg syscall (freebsd-arm64), type Statfs_t struct, Asyncreads uint64

pkg syscall (freebsd-riscv64), type Stat_t struct, Rdev uint64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Size int64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Spare [10]uint64 #53466
pkg syscall (freebsd-riscv64), type Stat_t struct, Uid uint32 #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct #53466
pkg syscall (freebsd-riscv64), type Statfs_t struct, Asyncreads uint64 #53466