public IEnumerable <OrderedNode> GetDecrement(OrderedNode upper = null, OrderedNode lower = null) => new Decrementor.Collection(this, upper, lower);
public OrderedNode InsertPrev(OrderedContainer <T> parent, OrderedNode origin = null) => CoreInsert(parent, InsertPosition.Preceding, origin);
public OrderedNode InsertNext(OrderedContainer <T> parent, OrderedNode origin = null) => CoreInsert(parent, InsertPosition.Following, origin);
protected override int CompareTo(ref OrderedNode origin, ref OrderedNode preceding, ref OrderedNode following) => Value.CompareTo(origin.Value);
public OrderedNode Attach(OrderedNode prev, OrderedNode next) => CoreAttach(prev, next);
public OrderedContainer <T> InsertNexts(OrderedNode origin, IEnumerable <OrderedNode> nodes) => CoreInsert(InsertPosition.Following, origin, nodes);
public OrderedContainer <T> Remove(OrderedNode node) => CoreRemove(node);
public OrderedContainer <T> InsertNexts(OrderedNode origin, params OrderedNode[] nodes) => CoreInsert(InsertPosition.Following, origin, nodes);
public OrderedContainer <T> InsertNext(OrderedNode node, OrderedNode origin = null) => CoreInsert(node, InsertPosition.Following, origin);
public OrderedContainer <T> InsertPrevs(OrderedNode origin, IEnumerable <OrderedNode> nodes) => CoreInsert(InsertPosition.Preceding, origin, nodes);
public OrderedContainer <T> InsertPrevs(OrderedNode origin, params OrderedNode[] nodes) => CoreInsert(InsertPosition.Preceding, origin, nodes);
public OrderedContainer <T> InsertPrev(OrderedNode node, OrderedNode origin = null) => CoreInsert(node, InsertPosition.Preceding, origin);