*/
    static int maxSize(Set<?> set) {
      return set instanceof SetView ? ((SetView<?>) set).maxSize() : set.size();
    }
  }

  /**
   * Returns an unmodifiable <b>view</b> of the union of two sets. The returned set contains all
   * elements that are contained in either backing set. Iterating over the returned set iterates

	list := make([]string, 0, n)
	for i := 0; i < n; i++ {
		emb := typ.EmbeddedType(i)
		switch emb := emb.(type) {
		case *types.Interface:
			list = append(list, w.sortedEmbeddeds(emb)...)
		case *types.Union:
			var buf bytes.Buffer
			nu := emb.Len()
			for i := 0; i < nu; i++ {
				if i > 0 {
					buf.WriteString(" | ")
				}
				term := emb.Term(i)
				if term.Tilde() {
					buf.WriteByte('~')

mentioned in the previous paragraph,
limited to the information that <i>W</i> directly observes.
</p>

<p>
The <i>happens before</i> relation is defined as the transitive closure of the
union of the sequenced before and synchronized before relations.
</p>

<p>
<b>Requirement 3</b>:
For an ordinary (non-synchronizing) data read <i>r</i> on a memory location <i>x</i>,

     */
    static int maxSize(Set<?> set) {
      return set instanceof SetView ? ((SetView<?>) set).maxSize() : set.size();
    }
  }

  /**
   * Returns an unmodifiable <b>view</b> of the union of two sets. The returned set contains all
   * elements that are contained in either backing set. Iterating over the returned set iterates

			if _, found := cache.iamPolicyDocsMap[p]; !found {
				err = errNoSuchPolicy
				return updatedAt, addedOrRemoved, effectivePolicies, err
			}
		}
		newPolicySet = existingPolicySet.Union(policiesToUpdate)
	} else {
		// policies to detach => inputPolicies ∩ existing (intersection)
		policiesToUpdate = policiesToUpdate.Intersection(existingPolicySet)

40.792472839355469 -74.005729675292969 40.745033264160156 1 6.46 23.5 0 0.5 0 0 24 2 1 75 68 green 0.04 0.0 0.0 62 37 5.37 1267 168 1 Manhattan 016800 1016800 E MN33 East Harlem South 3804 12 89 1 Manhattan 008900 1008900 I MN13 Hudson Yards-Chelsea-Flatiron-Union Square 3807 3389240 2 2014-03-10 18:19:09 2014-03-10 18:26:44 N 1 -73.950828552246094 40.791755676269531 -73.961746215820312 40.800731658935547 1 1.25 7 1 0.5 0 0 8.5 2 1 75 24 green 0.00 1.2 0.0 51 36 5.37 1267 168 1 Manhattan 016800 1016800 E MN33...

```Python
from typing import Union
from fastapi import Cookie, FastAPI, Header, Path, Query

app = FastAPI()


@app.get("/items/{item_id}")
def main(
    item_id: int = Path(gt=0),
    query: Union[str, None] = Query(default=None, max_length=10),
    session: Union[str, None] = Cookie(default=None, min_length=3),
    x_trace: Union[str, None] = Header(default=None, title="Tracing header"),

interface {
	~[]byte  // the underlying type of []byte is itself
	~MyInt   // illegal: the underlying type of MyInt is not MyInt
	~error   // illegal: error is an interface
}
</pre>

<p>
Union elements denote unions of type sets:
</p>

<pre>
// The Float interface represents all floating-point types
// (including any named types whose underlying types are
// either float32 or float64).

res.aero
research.aero
rotorcraft.aero
safety.aero
scientist.aero
services.aero
show.aero
skydiving.aero
software.aero
student.aero
taxi.aero
trader.aero
trading.aero
trainer.aero
union.aero
workinggroup.aero
works.aero

// af : https://www.nic.af/domain-price
af
com.af
edu.af
gov.af
net.af
org.af

// ag : http://www.nic.ag/prices.htm
ag
com.ag
org.ag

- Correct openapi schema union validation for the PodGroupPolicy struct in scheduling v1alpha1 ([#136424](https://github.com/kubernetes/kubernetes/pull/136424), [@JoelSpeed](https://github.com/JoelSpeed)) [SIG API Machinery and Scheduling]