Outputs a tensor containing the reduction across all input tensors passed to ops
within the same `shared_name.

The graph should be constructed so if one op runs with shared_name value `c`,
then `num_devices` ops will run with shared_name value `c`.  Failure to do so
will cause the graph execution to fail to complete.

input: the input to the reduction
data: the value of the reduction across all `num_devices` devices.

    * `tf.data.Dataset.shuffle` now supports `tf.data.UNKNOWN_CARDINALITY` When doing a "full shuffle" using  `dataset = dataset.shuffle(dataset.cardinality())`. But remember, a "full shuffle" will load the full dataset into memory so that it can be shuffled, so make sure to only use this with small datasets or datasets of small objects (like filenames).

*   `tf.math`

## Changelog since v1.19.4

## Changes by Kind

### Feature

- Add a new flag to set priority for the kubelet on Windows nodes so that workloads cannot overwhelm the node there by disrupting kubelet process. ([#96157](https://github.com/kubernetes/kubernetes/pull/96157), [@ravisantoshgudimetla](https://github.com/ravisantoshgudimetla)) [SIG Node and Windows]

                    the GatewayClass. Almost always, in this hierarchy, the Gateway will be the most
                    useful object to place Policy status on, so we recommend that implementations
                    SHOULD use Gateway as the PolicyAncestorStatus object unless the designers
                    have a _very_ good reason otherwise.

          },
          "maxUnavailable": {
            "allOf": [
              {

0E87..0E88    ; valid                                  # 1.1  LAO LETTER NGO..LAO LETTER CO
0E89          ; valid                                  # 12.0 LAO LETTER PALI CHA
0E8A          ; valid                                  # 1.1  LAO LETTER SO TAM
0E8B          ; disallowed                             # NA   <reserved-0E8B>
0E8C          ; valid                                  # 12.0 LAO LETTER PALI JHA

\010\342\032\023\004\346?z&n-\306r\340?n\350\000\267\007\313\334?\344\223?N\352\031\307?+\004\207\216*\350\344?\304nG\317L\320\303? 1hq\024z\310?\310\203a\3013\211\353?\2654o\376\314\023\356?\223\031^}G\036\354?\227c\274\354\"\300\341?XnL\324L?\266?So\312\200\234\314\350?\000;{\271\2569\247?dl\020\025\247\367\355?9\340\236\222\326\301\347?\2345\246\261S\317\306?\360\346\260\034=o\336?\020k\303\n\343\000\355?ft=\217\3674\323?\340\362\204\025\023L\270?ae&\230\222\350\350?Hy\313\024\275\224\274?\27...

\"1536Mi\"\n\nNote that the quantity will NEVER be internally represented by a floating point number. That is the whole point of this exercise.\n\nNon-canonical values will still parse as long as they are well formed, but will be re-emitted in their canonical form. (So always use canonical form, or don't diff.)\n\nThis format is intended to make it difficult to use these numbers without writing some sort of special handling code in the hopes that that will cause implementors to also use a fixed point implementation.",...

			}
		}
	}
}

// This test is a little too top-to-bottom.  Ideally we would test each volume
// type on its own, but we want to also make sure that the logic works through
// the one-of wrapper, so we just do it all in one place.
func TestValidateVolumes(t *testing.T) {
	validInitiatorName := "iqn.2015-02.example.com:init"
	invalidInitiatorName := "2015-02.example.com:init"

	type verr struct {

		{"Sharada", Var, 1},
		{"Shavian", Var, 0},
		{"Siddham", Var, 4},
		{"SignWriting", Var, 5},
		{"SimpleFold", Func, 0},
		{"Sinhala", Var, 0},
		{"Sk", Var, 0},
		{"Sm", Var, 0},
		{"So", Var, 0},
		{"Soft_Dotted", Var, 0},
		{"Sogdian", Var, 13},
		{"Sora_Sompeng", Var, 1},
		{"Soyombo", Var, 10},
		{"Space", Var, 0},
		{"SpecialCase", Type, 0},
		{"Sundanese", Var, 0},