This one works for both leaves and nodes, scalars and arrays.
Implements {@link Comparable} so that it can be sorted lexicographically. @author Kohsuke Kawaguchi (kk@kohsuke.org)
10081009101010111012101310141015101610171018
return null; ClassBeanInfoImpl cb = (ClassBeanInfoImpl) bi; for (Property p : cb.properties) { if (p instanceof AttributeProperty) { AttributeProperty ap = (AttributeProperty) p; if(ap.attName.equals(WellKnownNamespace.XML_MIME_URI,"contentType")) try { return (String)ap.xacc.print(o); } catch (AccessorException e) { return null;
10051006100710081009101010111012101310141015
10211022102310241025102610271028102910301031
961962963964965966967968969970971
93949596979899100101102103
switch(p.getKind()) { case ATTRIBUTE: if(attUnmarshallers==null) attUnmarshallers = new QNameMap<TransducedAccessor>(); AttributeProperty ap = (AttributeProperty) p; attUnmarshallers.put(ap.attName.toQName(),ap.xacc); break; case ELEMENT: case REFERENCE: case MAP:
882883884885886887888889890891892
129130131132133134135136137138139
971972973974975976977978979980981