test insertfirst and insertlast

README.rst

@@ -249,7 +249,7 @@ Summary of the test coverage report::
     113   100%   node.parts.mapping
      31   100%   node.parts.nodespace
      70   100%   node.parts.nodify
-     65   100%   node.parts.order
+     79   100%   node.parts.order
      81   100%   node.parts.reference
      26   100%   node.parts.storage
       1   100%   node.testing.__init__
@@ -272,6 +272,13 @@ Contributors
 Changes
 =======
 
+0.9.5dev
+--------
+
+- add ``insertfirst`` and ``insertlast`` to ``node.parts.Order``.
+  [rnix, 2011-10-02]
+
+
 0.9.4
 -----
 

setup.py

@@ -1,7 +1,7 @@
 from setuptools import setup, find_packages
 import os
 
-version = '0.9.4'
+version = '0.9.5dev'
 shortdesc = "The node"
 longdesc = open(os.path.join(os.path.dirname(__file__), 'README.rst')).read()
 longdesc += open(os.path.join(os.path.dirname(__file__), 'LICENSE.rst')).read()

src/node/interfaces.py

@@ -403,6 +403,14 @@ class IOrder(Interface):
     """Plumbing part for ordering support.
     """
 
+    def insertfirst(newnode):
+        """Insert newnode as first node.
+        """
+
+    def insertlast(newnode):
+        """Insert newnode as last node.
+        """
+
     def insertbefore(newnode, refnode):
         """Insert newnode before refnode.
 

src/node/parts/order.rst

@@ -87,10 +87,50 @@ detached node or subtree to a complete different tree::
       <class 'OrderableNode'>: child2
       <class 'OrderableNode'>: child5
 
+There exist ``insertfirst`` and ``insertlast`` functions::
+
+    >>> new = OrderableNode(name='first')
+    >>> node.insertfirst(new)
+    >>> node.printtree()
+    <class 'OrderableNode'>: root
+      <class 'OrderableNode'>: first
+      <class 'OrderableNode'>: child4
+      <class 'OrderableNode'>: child1
+      <class 'OrderableNode'>: child3
+      <class 'OrderableNode'>: child2
+      <class 'OrderableNode'>: child5
+    
+    >>> new = OrderableNode(name='last')
+    >>> node.insertlast(new)
+    >>> node.printtree()
+    <class 'OrderableNode'>: root
+      <class 'OrderableNode'>: first
+      <class 'OrderableNode'>: child4
+      <class 'OrderableNode'>: child1
+      <class 'OrderableNode'>: child3
+      <class 'OrderableNode'>: child2
+      <class 'OrderableNode'>: child5
+      <class 'OrderableNode'>: last
+
+    >>> node.clear()
+    >>> new = OrderableNode(name='new')
+    >>> node.insertfirst(new)
+    >>> node.printtree()
+    <class 'OrderableNode'>: root
+      <class 'OrderableNode'>: new
+    
+    >>> node.clear()
+    >>> node.insertlast(new)
+    >>> node.printtree()
+    <class 'OrderableNode'>: root
+      <class 'OrderableNode'>: new
+
 
 Order with References
 ---------------------
 
+::
+
     >>> from node.parts import Reference
     
     >>> class OrderReferenceNode(object):