/** * If not already created, a new <code>after</code> element with the given value will be created. * Otherwise, the existing <code>after</code> element will be returned. * @return a new or existing instance of <code>OrderingOrderingType<OrderingType<T>></code> */ public OrderingOrderingType<OrderingType<T>> getOrCreateAfter() { Node node = childNode.getOrCreate("after"); OrderingOrderingType<OrderingType<T>> after = new OrderingOrderingTypeImpl<OrderingType<T>>(this, "after", childNode, node); return after; }
/** * If not already created, a new <code>before</code> element with the given value will be created. * Otherwise, the existing <code>before</code> element will be returned. * @return a new or existing instance of <code>OrderingOrderingType<OrderingType<T>></code> */ public OrderingOrderingType<OrderingType<T>> getOrCreateBefore() { Node node = childNode.getOrCreate("before"); OrderingOrderingType<OrderingType<T>> before = new OrderingOrderingTypeImpl<OrderingType<T>>(this, "before", childNode, node); return before; }
/** * If not already created, a new <code>after</code> element with the given value will be created. * Otherwise, the existing <code>after</code> element will be returned. * @return a new or existing instance of <code>OrderingOrderingType<OrderingType<T>></code> */ public OrderingOrderingType<OrderingType<T>> getOrCreateAfter() { Node node = childNode.getOrCreate("after"); OrderingOrderingType<OrderingType<T>> after = new OrderingOrderingTypeImpl<OrderingType<T>>(this, "after", childNode, node); return after; }
/** * If not already created, a new <code>before</code> element with the given value will be created. * Otherwise, the existing <code>before</code> element will be returned. * @return a new or existing instance of <code>OrderingOrderingType<OrderingType<T>></code> */ public OrderingOrderingType<OrderingType<T>> getOrCreateBefore() { Node node = childNode.getOrCreate("before"); OrderingOrderingType<OrderingType<T>> before = new OrderingOrderingTypeImpl<OrderingType<T>>(this, "before", childNode, node); return before; }