auto ty = mlir::dyn_cast<TensorType>(op.getType());
    if (!ty ||
        !mlir::isa<FloatType, IntegerType, ComplexType>(ty.getElementType()))
      return failure();

    Location loc = op.getLoc();
    Value result = rewriter.create<mhlo::ConstantOp>(loc, op.getValue());
    if (result.getType() != op.getType())
      result = rewriter.create<tensor::CastOp>(loc, op.getType(), result);
    rewriter.replaceOp(op, result);

	s.startBlock(bThen)
	s.vars[n] = s.zeroVal(lenType)
	s.endBlock()
	bThen.AddEdgeTo(bAfter)

	b.AddEdgeTo(bElse)
	s.startBlock(bElse)
	switch n.Op() {
	case ir.OLEN:
		// length is stored in the first word for map/chan
		s.vars[n] = s.load(lenType, x)
	case ir.OCAP:
		// capacity is stored in the second word for chan
		sw := s.newValue1I(ssa.OpOffPtr, lenType.PtrTo(), lenType.Size(), x)

private void ParameterSignature(Class, annotation.Annotation[]); public boolean canAcceptValue(Object); public boolean canAcceptType(Class); public boolean canPotentiallyAccept(Class); private boolean isAssignableViaTypeC(Class, Class); public Class getType(); public java.util.List getAnnotations(); public boolean hasAnnotation(Class); public annotation.Annotation findDeepAnnotation(Class); private annotation.Annotation findDeepAnnotation(annotation.Annotation[], Class, int); public annotation.Annotation...

	return nil
}

func (x *EgressGatewayConfig) GetServiceAnnotations() *structpb.Struct {
	if x != nil {
		return x.ServiceAnnotations
	}
	return nil
}

func (x *EgressGatewayConfig) GetType() string {
	if x != nil {
		return x.Type
	}
	return ""
}

func (x *EgressGatewayConfig) GetZvpn() *ZeroVPNConfig {
	if x != nil {
		return x.Zvpn
	}
	return nil
}

element type, indexed by a set of unique <i>keys</i> of another type,
called the key type.
The value of an uninitialized map is <code>nil</code>.
</p>

<pre class="ebnf">
MapType     = "map" "[" KeyType "]" ElementType .
KeyType     = Type .
</pre>

<p>
The <a href="#Comparison_operators">comparison operators</a>
<code>==</code> and <code>!=</code> must be fully defined